Multi-instance randomness extraction and security against bounded-storage mass surveillance

DOI10.1007/978-3-031-48621-0_4MaRDI QIDQ6582212zbMATH OpenFDO

Authors Jiaxin Guan, Daniel Wichs, Mark Zhandry

Publication date 2 August 2024

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

zbMATH Keywords

Hadamard codesincompressible cryptographyReed-Müller codes

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05)

Recommendations

• Multi-instance secure public-key encryption
• scientific article; zbMATH DE number 1942425
• Encryption against storage-bounded adversaries from on-line strong extractors
• Constructing locally computable extractors and cryptosystems in the bounded-storage model
• Advances in Cryptology - CRYPTO 2003

Cites work

• A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
• Advances in Cryptology - EUROCRYPT 2004
• Authentication in the bounded storage model
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• How to extract useful randomness from unreliable sources
• scientific article; zbMATH DE number 1618044 (Why is no real title available?)
• scientific article; zbMATH DE number 2086698 (Why is no real title available?)
• Incompressible cryptography
• Incompressible encodings
• List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
• Multi-instance randomness extraction and security against bounded-storage mass surveillance
• On differential privacy and adaptive data analysis with bounded space
• On Forward-Secure Storage
• On lattices, learning with errors, random linear codes, and cryptography
• Pseudorandomness
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Quasi chain rule for min-entropy
• Rate-1 incompressible encryption from standard assumptions
• Smooth Projective Hashing and Two-Message Oblivious Transfer

Cited in

(6)

• Multi-instance secure public-key encryption
• Multi-instance randomness extraction and security against bounded-storage mass surveillance
• Non-committing identity based encryption: constructions and applications
• Incompressible encryption with everlasting security
• HELP: everlasting privacy through server-aided randomness
• Incompressible encryption beyond CPA/CCA security

This page was built for publication: Multi-instance randomness extraction and security against bounded-storage mass surveillance

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