Simple Schemes in the Bounded Storage Model

Jiaxin Guan; Mark Zhandry

Paper 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.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Published by the IACR in EUROCRYPT 2019
DOI: 10.1007/978-3-030-17659-4_17
Keywords: Bounded Storage Model Commitment Oblivious Transfer Key Agreement
Contact author(s): jiaxin @ guan io
mzhandry @ cs princeton edu
History: 2019-08-02: revised; 2019-05-20: received; See all versions
Short URL: https://ia.cr/2019/507
License: CC BY

BibTeX

@misc{cryptoeprint:2019/507,
      author = {Jiaxin Guan and Mark Zhandry},
      title = {Simple Schemes in the Bounded Storage Model},
      howpublished = {Cryptology ePrint Archive, Paper 2019/507},
      year = {2019},
      doi = {10.1007/978-3-030-17659-4_17},
      note = {\url{https://eprint.iacr.org/2019/507}},
      url = {https://eprint.iacr.org/2019/507}
}