Constructing locally computable extractors and cryptosystems in the bounded-storage model
From MaRDI portal
Publication:1879468
DOI10.1007/s00145-003-0237-xzbMath1071.94016OpenAlexW2104965768MaRDI QIDQ1879468
Publication date: 22 September 2004
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-003-0237-x
Expander graphsUnconditional securityExtractorsAveraging samplersBounded-storage modelEverlasting securitymin-entropy ratesSpace-bounded adversaries
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Measures of information, entropy (94A17)
Related Items (28)
How to re-use a one-time pad safely and almost optimally even if \(\mathrm P=\mathrm{NP}\) ⋮ Separating adaptive streaming from oblivious streaming using the bounded storage model ⋮ Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries ⋮ Bitwise Quantum Min-Entropy Sampling and New Lower Bounds for Random Access Codes ⋮ Secure Computation from Leaky Correlated Randomness ⋮ Random oracles and non-uniformity ⋮ Authentication in the bounded storage model ⋮ Infeasibility of instance compression and succinct PCPs for NP ⋮ Efficient and Provable White-Box Primitives ⋮ Speak much, remember little: cryptography in the bounded storage model, revisited ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ Bounded-Retrieval Model with Keys Derived from Private Data ⋮ Long term confidentiality: a survey ⋮ Innovative approaches for security of small artefacts ⋮ Deterministic extractors for small-space sources ⋮ Efficient Error-Correcting Codes for Sliding Windows ⋮ Incremental deterministic public-key encryption ⋮ Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs ⋮ A Lower Bound on the Key Length of Information-Theoretic Forward-Secure Storage Schemes ⋮ Simple extractors via constructions of cryptographic pseudo-random generators ⋮ Unnamed Item ⋮ Explicit list-decodable codes with optimal rate for computationally bounded channels ⋮ Extractors and Lower Bounds for Locally Samplable Sources ⋮ A Leakage-Resilient Mode of Operation ⋮ Non-interactive timestamping in the bounded-storage model ⋮ Fine-Grained Cryptography ⋮ Big-Key Symmetric Encryption: Resisting Key Exfiltration ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition
This page was built for publication: Constructing locally computable extractors and cryptosystems in the bounded-storage model
