Simple schemes in the bounded storage model

9Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

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.

References Powered by Scopus

Algorithms for quantum computation: Discrete logarithms and factoring

6296Citations
N/AReaders
Get full text

A fast quantum mechanical algorithm for database search

5742Citations
N/AReaders
Get full text

Pseudo-random generation from one-way functions

524Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Memory-sample lower bounds for learning parity with noise

8Citations
N/AReaders
Get full text

Speak Much, Remember Little: Cryptography in the Bounded Storage Model, Revisited

4Citations
N/AReaders
Get full text

Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory

3Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Guan, J., & Zhandary, M. (2019). Simple schemes in the bounded storage model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11478 LNCS, pp. 500–524). Springer Verlag. https://doi.org/10.1007/978-3-030-17659-4_17

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 7

64%

Researcher 3

27%

Lecturer / Post doc 1

9%

Readers' Discipline

Tooltip

Computer Science 10

83%

Physics and Astronomy 1

8%

Engineering 1

8%

Save time finding and organizing research with Mendeley

Sign up for free