Tight security proofs for the bounded-storage model

  title={Tight security proofs for the bounded-storage model},
  author={Stefan Dziembowski and Ueli Maurer},
(MATH) In the bounded-storage model for information-theoretically secure encryption and key-agreement one can prove the security of a cipher based on the sole assumption that the adversary's storage capacity is bounded, say by <i>s</i> bits, even if her computational power is unlimited. Assume that a random <i>t</i>-bit string <i>R</i> is either publicly available (e.g. the signal of a deep space radio source) or broadcast by one of the legitimate parties. If <i>s</i>$xi;<i>t</i>, the adversary… CONTINUE READING


Publications citing this paper.
Showing 1-10 of 28 extracted citations

Advances in Cryptology – EUROCRYPT 2018

Lecture Notes in Computer Science • 2018
View 9 Excerpts
Highly Influenced

Long Term Confidentiality: a Survey

IACR Cryptology ePrint Archive • 2012
View 13 Excerpts
Highly Influenced

Encryption against Storage-Bounded Adversaries from On-Line Strong Extractors

Journal of Cryptology • 2003
View 8 Excerpts
Highly Influenced

Deterministic Blind Rendezvous in Cognitive Radio Networks

2014 IEEE 34th International Conference on Distributed Computing Systems • 2014
View 1 Excerpt

Hyper-Encryption: Eternal Secrecy Using the Bounded Storage and Limited Access Models

Information Security Journal: A Global Perspective • 2013
View 1 Excerpt


Publications referenced by this paper.
Showing 1-4 of 4 references

Everlasting security in the bounded storage model

IEEE Trans. Information Theory • 2002
View 8 Excerpts
Highly Influenced

Hyper-Encryption and Everlasting Security

View 7 Excerpts
Highly Influenced

Provably Everlasting Security in the Bounded Storage Model

Y. Z. Ding
PhD thesis, Harvard University, • 2001
View 9 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…