Cryptology ePrint Archive: Report 2019/507
Simple Schemes in the Bounded Storage Model
Jiaxin Guan and Mark Zhandry
Abstract: 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.
Category / Keywords: cryptographic protocols / Bounded Storage Model, Commitment, Oblivious Transfer, Key Agreement
Original Publication (in the same form): IACR-EUROCRYPT-2019
DOI: 10.1007/978-3-030-17659-4_17
Date: received 15 May 2019, last revised 2 Aug 2019
Contact author: jiaxin at guan io, mzhandry at cs princeton edu
Available format(s): PDF | BibTeX Citation
Version: 20190802:173736 (All versions of this report)
Short URL: ia.cr/2019/507
[ Cryptology ePrint archive ]