A Lower Bound on the Key Length of Information-Theoretic Forward-Secure Storage Schemes

DOI10.1007/978-3-642-14496-7_2zbMath1282.94043OpenAlexW1508090538MaRDI QIDQ4931664

Stefan Dziembowski

Publication date: 29 September 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14496-7_2

zbMATH Keywords

almost optimal lower boundlength of secret keyminimizing the length of the secret key in IT-secure FSS

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Conditionally-perfect secrecy and a provably-secure randomized cipher
• Encryption against storage-bounded adversaries from on-line strong extractors
• Constructing locally computable extractors and cryptosystems in the bounded-storage model
• Theory of cryptography. Third theory of cryptography conference, TCC 2006, New York, NY, USA, March 4--7, 2006. Proceedings.
• Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
• Intrusion-Resilient Key Exchange in the Bounded Retrieval Model
• Simultaneous Hardcore Bits and Cryptography against Memory Attacks
• Signature Schemes with Bounded Leakage Resilience
• Advances in Cryptology - EUROCRYPT 2004
• On Forward-Secure Storage
• Theory of Cryptography
• Theory of Cryptography

This page was built for publication: A Lower Bound on the Key Length of Information-Theoretic Forward-Secure Storage Schemes