Authentication in the bounded storage model

DOI10.1007/978-3-031-07082-2_26zbMath1496.94077OpenAlexW4285183207MaRDI QIDQ2170109

Daniel Wichs, Willy Quach, Yevgeniy Dodis

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)

Cites Work

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

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