Welcome to the resource topic for 2019/507
Title:
Simple Schemes in the Bounded Storage Model
Authors: Jiaxin Guan, 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.
ePrint: https://eprint.iacr.org/2019/507
Talk: https://www.youtube.com/watch?v=4ZV1SLE7088
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .