## CryptoDB

### Paper: Simple Schemes in the Bounded Storage Model

Authors: Jiaxin Guan Mark Zhandry DOI: 10.1007/978-3-030-17659-4_17 Search ePrint Search Google 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.
##### BibTeX
@article{eurocrypt-2019-29395,
title={Simple Schemes in the Bounded Storage Model},
booktitle={Advances in Cryptology – EUROCRYPT 2019},
series={Advances in Cryptology – EUROCRYPT 2019},
publisher={Springer},
volume={11478},
pages={500-524},
doi={10.1007/978-3-030-17659-4_17},
author={Jiaxin Guan and Mark Zhandry},
year=2019
}