Rate-1 incompressible encryption from standard assumptions
From MaRDI portal
Publication:6114264
DOI10.1007/978-3-031-22365-5_2zbMath1519.94065MaRDI QIDQ6114264
Pedro Branco, Jesko Dujmovic, Nico Döttling
Publication date: 14 August 2023
Published in: Theory of Cryptography (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conditionally-perfect secrecy and a provably-secure randomized cipher
- On perfect correctness in (lockable) obfuscation
- Incompressible encodings
- New techniques in replica encodings with client setup
- Incompressible cryptography
- Proofs of replicated storage without timing assumptions
- Simple schemes in the bounded storage model
- Cryptographic group actions and applications
- Disappearing cryptography in the bounded storage model
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Big-Key Symmetric Encryption: Resisting Key Exfiltration
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Disjunctions for Hash Proof Systems: New Constructions and Applications
- The random oracle methodology, revisited
- Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
- Public-Key Encryption in the Bounded-Retrieval Model
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
- Optimal Randomness Extraction from a Diffie-Hellman Element
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- A Pseudorandom Generator from any One-way Function
- Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Leakage-Resilient Cryptography from Minimal Assumptions
- Random-Oracle Uninstantiability from Indistinguishability Obfuscation
- Advances in Cryptology - EUROCRYPT 2004
- Smooth Projective Hashing and Two-Message Oblivious Transfer
- Advances in Cryptology - CRYPTO 2003
- On Forward-Secure Storage
- Theory of Cryptography
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- Theory of Cryptography
- Indistinguishability obfuscation from well-founded assumptions
- Rate-1 incompressible encryption from standard assumptions
This page was built for publication: Rate-1 incompressible encryption from standard assumptions
