Incompressible encodings
From MaRDI portal
Publication:2096497
DOI10.1007/978-3-030-56784-2_17zbMATH Open1503.94020OpenAlexW4247437710MaRDI QIDQ2096497FDOQ2096497
Authors: Tal Moran, Daniel Wichs 
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56784-2_17
Recommendations
Cites Work
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Public-key cryptosystems from the worst-case shortest vector problem
- On lattices, learning with errors, random linear codes, and cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- Title not available (Why is that?)
- A Pseudorandom Generator from any One-way Function
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- Title not available (Why is that?)
- Careful with composition: limitations of the indifferentiability framework
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Classical hardness of learning with errors
- Theory of Cryptography
- Computational analogues of entropy
- Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
- Advances in Cryptology - CRYPTO 2003
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Parallel Repetition for Leakage Resilience Amplification Revisited
- Public-key encryption in the bounded-retrieval model
- Intrusion-Resilient Key Exchange in the Bounded Retrieval Model
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Lossy trapdoor functions and their applications
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
- Compact Proofs of Retrievability
- Proofs of Retrievability via Hardness Amplification
- Advances in cryptology -- CRYPTO 2009. 29th annual international cryptology conference, Santa Barbara, CA, USA, August 16--20, 2009. Proceedings
- Laconic oblivious transfer and its applications
- Approximate trapdoors for lattices and smaller hash-and-sign signatures
- Proofs of replicated storage without timing assumptions
- Projection properties of theL2optimal reduced order model
- Verifiable delay functions
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Big-key symmetric encryption: resisting key exfiltration
- Learning with rounding, revisited. New reduction, properties and applications
- Counterexamples to hardness amplification beyond negligible
- The Magic of ELFs
- More constructions of lossy and correlation-secure trapdoor functions
- Barriers in cryptography with weak, correlated and leaky sources
- Instantiability of RSA-OAEP under chosen-plaintext attack
- Straight lines on models of curved surfaces
- New techniques in replica encodings with client setup
- Lossy trapdoor permutations with improved lossiness
- Tight proofs of space and replication
Cited In (6)
- Multi-instance randomness extraction and security against bounded-storage mass surveillance
- Targeted lossy functions and applications
- Incompressible cryptography
- IBE with incompressible master secret and small identity secrets
- Lossy cryptography from code-based assumptions
- Rate-1 incompressible encryption from standard assumptions
This page was built for publication: Incompressible encodings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096497)
