Speak much, remember little: cryptography in the bounded storage model, revisited

DOI10.1007/978-3-031-30545-0_4MaRDI QIDQ6138080zbMATHOpenAlexFDO

Authors Yevgeniy Dodis, Willy Quach, Daniel Wichs

Publication date 16 January 2024

Published in Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-30545-0_4

zbMATH Keywords

oblivious transfer protocolsimulation-based notion of security

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Authentication in the bounded storage model
• 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 708806 (Why is no real title available?)
• scientific article; zbMATH DE number 1024047 (Why is no real title available?)
• 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 2086371 (Why is no real title available?)
• scientific article; zbMATH DE number 1842490 (Why is no real title available?)
• Advances in Cryptology - EUROCRYPT 2004
• Big-key symmetric encryption: resisting key exfiltration
• 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
• Deterministic extractors for small-space sources
• Disappearing cryptography in the bounded storage model
• Efficient Oblivious Transfer in the Bounded-Storage Model
• Everlasting security in the bounded storage model
• Extractor-based time-space lower bounds for learning
• Founding Cryptography on Oblivious Transfer – Efficiently
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• New directions in cryptography
• Non-interactive timestamping in the bounded-storage model
• One-message statistical Zero-Knowledge Proofs and space-bounded verifier
• Quasi chain rule for min-entropy
• Randomness is linear in space
• Secure multiparty computation in the bounded storage model
• Simple schemes in the bounded storage model
• The Knowledge Complexity of Interactive Proof Systems
• Tight security proofs for the bounded-storage model
• Time-space hardness of learning sparse parities

Cited in

(1)

• Fine-grained non-interactive key-exchange without idealized assumptions

This page was built for publication: Speak much, remember little: cryptography in the bounded storage model, revisited

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