Authentication in the bounded storage model

DOI10.1007/978-3-031-07082-2_26MaRDI QIDQ2170109zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

streaming algorithmunconditionally secure cryptographic schemes

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(5)

• Theory of Cryptography
• Memory-sample lower bounds for learning with classical-quantum hybrid memory
• Multi-instance randomness extraction and security against bounded-storage mass surveillance
• Speak much, remember little: cryptography in the bounded storage model, revisited
• The complexity of online memory checking

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)