The bounded storage model promises unconditional security proofs against computationally unbounded adversaries, so long as the adversary’s space is bounded. In this work, we develop simple new constructions of two-party key agreement, bit commitment, and oblivious transfer in this model. In addition to simplicity, our constructions have several advantages over prior work, including an improved number of rounds and enhanced correctness. Our schemes are based on Raz’s lower bound for learning parities.
Mendeley helps you to discover research relevant for your work.
CITATION STYLE
Guan, J., & Zhandary, M. (2019). Simple schemes in the bounded storage model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11478 LNCS, pp. 500–524). Springer Verlag. https://doi.org/10.1007/978-3-030-17659-4_17