Authentication in the bounded storage model

DOI10.1007/978-3-031-07082-2_26zbMATH Open1496.94077OpenAlexW4285183207MaRDI QIDQ2170109FDOQ2170109

Authors: Yevgeniy Dodis, Willy Quach, Daniel Wichs 

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-07082-2_26

Recommendations

• scientific article; zbMATH DE number 2086371
• Simple schemes in the bounded storage model
• The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
• Everlasting security in the bounded storage model
• Advances in Cryptology - EUROCRYPT 2004

zbMATH Keywords

streaming algorithmunconditionally secure cryptographic schemes

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Probability Inequalities for Sums of Bounded Random Variables
• Constructing locally computable extractors and cryptosystems in the bounded-storage model
• Efficient Authentication from Hard Learning Problems
• Title not available (Why is that?)
• Advances in Cryptology - EUROCRYPT 2004
• Authenticating Pervasive Devices with Human Protocols
• Conditionally-perfect secrecy and a provably-secure randomized cipher
• Title not available (Why is that?)
• Randomness is linear in space
• Message authentication, revisited
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• On the Cryptographic Applications of Random Functions (Extended Abstract)
• Title not available (Why is that?)
• Tight security proofs for the bounded-storage model
• Everlasting security in the bounded storage model
• Constant-round oblivious transfer in the bounded storage model
• Title not available (Why is that?)
• Title not available (Why is that?)
• Extractor-based time-space lower bounds for learning
• Simple schemes in the bounded storage model
• Time-space hardness of learning sparse parities
• Efficient Oblivious Transfer in the Bounded-Storage Model

Cited In (4)

• Multi-instance randomness extraction and security against bounded-storage mass surveillance
• The complexity of online memory checking
• Theory of Cryptography
• Memory-sample lower bounds for learning with classical-quantum hybrid memory

This page was built for publication: Authentication in the bounded storage model

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