Incompressible encodings

DOI10.1007/978-3-030-56784-2_17MaRDI QIDQ2096497zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

common random string modelrandom-oracle model

Mathematics Subject Classification ID

Cryptography (94A60) Source coding (94A29)

Recommendations

• Incompressible cryptography
• Encoding functions with constant online rate or how to compress garbled circuits keys
• Rate-1 incompressible encryption from standard assumptions
• Leakage-resilient storage
• On pseudorandom encodings

Cites work

• scientific article; zbMATH DE number 1618044 (Why is no real title available?)
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• A Pseudorandom Generator from any One-way Function
• Advances in Cryptology - CRYPTO 2003
• 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
• Approximate trapdoors for lattices and smaller hash-and-sign signatures
• Barriers in cryptography with weak, correlated and leaky sources
• Big-key symmetric encryption: resisting key exfiltration
• Careful with composition: limitations of the indifferentiability framework
• Classical hardness of learning with errors
• Compact Proofs of Retrievability
• Computational analogues of entropy
• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• Counterexamples to hardness amplification beyond negligible
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• How to build an ideal cipher: the indifferentiability of the Feistel construction
• Instantiability of RSA-OAEP under chosen-plaintext attack
• Intrusion-Resilient Key Exchange in the Bounded Retrieval Model
• Laconic oblivious transfer and its applications
• Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
• Learning with rounding, revisited. New reduction, properties and applications
• Lossy trapdoor functions and their applications
• Lossy trapdoor permutations with improved lossiness
• More constructions of lossy and correlation-secure trapdoor functions
• New techniques in replica encodings with client setup
• On lattices, learning with errors, random linear codes, and cryptography
• Parallel Repetition for Leakage Resilience Amplification Revisited
• Projection properties of theL₂optimal reduced order model
• Proofs of Retrievability via Hardness Amplification
• Proofs of replicated storage without timing assumptions
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Public-key cryptosystems from the worst-case shortest vector problem
• Public-key encryption in the bounded-retrieval model
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Straight lines on models of curved surfaces
• The Magic of ELFs
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography
• Tight proofs of space and replication
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Verifiable delay functions

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)