Incompressible cryptography
From MaRDI portal
Publication:2170026
DOI10.1007/978-3-031-06944-4_24zbMath1505.94071OpenAlexW4285244033MaRDI QIDQ2170026
Mark Zhandry, Jiaxin Guan, Daniel Wichs
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06944-4_24
Related Items (3)
On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ Rate-1 incompressible encryption from standard assumptions ⋮ Adaptive multiparty NIKE
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conditionally-perfect secrecy and a provably-secure randomized cipher
- Candidate iO from homomorphic encryption schemes
- Candidate obfuscation via oblivious LWE sampling
- Incompressible encodings
- Simple schemes in the bounded storage model
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Big-Key Symmetric Encryption: Resisting Key Exfiltration
- Constrained Pseudorandom Functions and Their Applications
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- On Virtual Grey Box Obfuscation for General Circuits
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Barriers in cryptography with weak, correlated and leaky sources
- Lower and Upper Bounds for Deniable Public-Key Encryption
- Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
- Public-Key Encryption in the Bounded-Retrieval Model
- Intrusion-Resilient Key Exchange in the Bounded Retrieval Model
- All-or-nothing encryption and the package transform
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Functional Signatures and Pseudorandom Functions
- Advances in Cryptology - CRYPTO 2003
- On Extractability Obfuscation
- On Forward-Secure Storage
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation from circular security
This page was built for publication: Incompressible cryptography
