You are looking at a specific version 20190802:173736 of this paper. See the latest version.

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 ModelCommitmentOblivious TransferKey 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
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.