Encryption against storage-bounded adversaries from on-line strong extractors

DOI10.1007/s00145-003-0217-1zbMath1071.94014OpenAlexW2022068408MaRDI QIDQ1879467

Chi-Jen Lu

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-0217-1

zbMATH Keywords

expander graphsrandomness extractorsbounded-storage modeleverlasting securityList-decodable codes

Mathematics Subject Classification ID

Applications of graph theory (05C90) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (8)

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 ⋮ Long term confidentiality: a survey ⋮ Innovative approaches for security of small artefacts ⋮ A Lower Bound on the Key Length of Information-Theoretic Forward-Secure Storage Schemes ⋮ Simple extractors via constructions of cryptographic pseudo-random generators ⋮ A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition

This page was built for publication: Encryption against storage-bounded adversaries from on-line strong extractors