Incompressible encodings
From MaRDI portal
Publication:2096497
DOI10.1007/978-3-030-56784-2_17zbMath1503.94020OpenAlexW4247437710MaRDI QIDQ2096497
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56784-2_17
Related Items (4)
Targeted lossy functions and applications ⋮ Incompressible cryptography ⋮ IBE with incompressible master secret and small identity secrets ⋮ Rate-1 incompressible encryption from standard assumptions
Cites Work
- Unnamed Item
- Unnamed Item
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- Advances in cryptology -- CRYPTO 2009. 29th annual international cryptology conference, Santa Barbara, CA, USA, August 16--20, 2009. Proceedings
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Verifiable delay functions
- Laconic oblivious transfer and its applications
- More constructions of lossy and correlation-secure trapdoor functions
- New techniques in replica encodings with client setup
- Approximate trapdoors for lattices and smaller hash-and-sign signatures
- Proofs of replicated storage without timing assumptions
- Lossy trapdoor permutations with improved lossiness
- Tight proofs of space and replication
- Straight lines on models of curved surfaces
- Big-Key Symmetric Encryption: Resisting Key Exfiltration
- The Magic of ELFs
- Learning with Rounding, Revisited
- Counterexamples to Hardness Amplification beyond Negligible
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Barriers in cryptography with weak, correlated and leaky sources
- Parallel Repetition for Leakage Resilience Amplification Revisited
- Careful with Composition: Limitations of the Indifferentiability Framework
- Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Projection properties of theL2optimal reduced order model
- Lossy trapdoor functions and their applications
- Trapdoors for hard lattices and new cryptographic constructions
- Public-Key Encryption in the Bounded-Retrieval Model
- Instantiability of RSA-OAEP under Chosen-Plaintext Attack
- Intrusion-Resilient Key Exchange in the Bounded Retrieval Model
- Compact Proofs of Retrievability
- Proofs of Retrievability via Hardness Amplification
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- A Pseudorandom Generator from any One-way Function
- Public-key cryptosystems from the worst-case shortest vector problem
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Advances in Cryptology - CRYPTO 2003
- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
- Classical hardness of learning with errors
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- On lattices, learning with errors, random linear codes, and cryptography
- Theory of Cryptography
This page was built for publication: Incompressible encodings
