Optimal randomizer efficiency in the bounded-storage model

DOI10.1007/S00145-003-0309-YMaRDI QIDQ1879466zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Stefan Dziembowski, Ueli M. Maurer

Publication date 22 September 2004

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL http://doc.rero.ch/record/312715/files/145_2003_Article_309.pdf

zbMATH Keywords

information theorymin-entropyunconditional securityone-time padbounded-storage model

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Measures of information, entropy (94A17) Cryptography (94A60)

Recommendations

• The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
• Advances in Cryptology - EUROCRYPT 2004
• Encryption against storage-bounded adversaries from on-line strong extractors
• The Bounded-Storage Model in the Presence of a Quantum Adversary
• scientific article; zbMATH DE number 1942425

Cited in

(9)

• SECURITY OF QUANTUM KEY DISTRIBUTION
• Long term confidentiality: a survey
• scientific article; zbMATH DE number 7650368 (Why is no real title available?)
• Structure of minimum-error quantum state discrimination
• The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
• Separating adaptive streaming from oblivious streaming using the bounded storage model
• Big-key symmetric encryption: resisting key exfiltration
• Simple extractors via constructions of cryptographic pseudo-random generators
• Certified security proofs of cryptographic protocols in the computational model: an application to intrusion resilience

This page was built for publication: Optimal randomizer efficiency in the bounded-storage model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1879466)