Incompressible encryption with everlasting security

DOI10.1007/978-3-032-12293-3_3MaRDI QIDQ7233189zbMATH OpenFDO

Authors Shany Ben-David, Eylon Yogev

Publication date 24 April 2026

Full work available at URL https://doi.org/10.1007/978-3-032-12293-3_3

zbMATH Keywords

everlasting securityforward securityincompressible encryptionpublic-key encryption

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Cryptography (94A60)

Cites work

• Disappearing cryptography in the bounded storage model
• Incompressible cryptography
• Incompressible encodings
• Instance compression, revisited
• Leakage-resilient incompressible cryptography: constructions and barriers
• Multi-instance randomness extraction and security against bounded-storage mass surveillance
• New techniques in replica encodings with client setup
• On Forward-Secure Storage
• On the compressibility of \(\mathcal{NP}\) instances and cryptographic applications
• Proofs of replicated storage without timing assumptions
• Rate-1 incompressible encryption from standard assumptions

This page was built for publication: Incompressible encryption with everlasting security

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