Simple Schemes in the Bounded Storage Model
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.