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

DOI10.1007/978-3-031-30545-0_4zbMath1530.94026OpenAlexW3207853463MaRDI QIDQ6138080

Yevgeniy Dodis, Daniel Wichs, Willy Quach

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constant-round oblivious transfer in the bounded storage model
• Non-interactive timestamping in the bounded-storage model
• Conditionally-perfect secrecy and a provably-secure randomized cipher
• Quasi chain rule for min-entropy
• Constructing locally computable extractors and cryptosystems in the bounded-storage model
• Randomness is linear in space
• Secure multiparty computation in the bounded storage model
• Simple schemes in the bounded storage model
• Disappearing cryptography in the bounded storage model
• Big-Key Symmetric Encryption: Resisting Key Exfiltration
• Tight security proofs for the bounded-storage model
• Founding Cryptography on Oblivious Transfer – Efficiently
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• The Knowledge Complexity of Interactive Proof Systems
• New directions in cryptography
• Efficient Oblivious Transfer in the Bounded-Storage Model
• Everlasting security in the bounded storage model
• Time-space hardness of learning sparse parities
• One-message statistical Zero-Knowledge Proofs and space-bounded verifier
• Extractor-based time-space lower bounds for learning
• Advances in Cryptology - EUROCRYPT 2004
• Deterministic extractors for small-space sources

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