Incompressible encodings
type: Item
instance of: scholarly article
title: Incompressible encodings
zbMATH Open document ID: 1503.94020
DOI: 10.1007/978-3-030-56784-2_17
author: Tal Moran
author: Daniel Wichs
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 94A29
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7614549
zbMATH Keywords: common random string model
zbMATH Keywords: random-oracle model
MaRDI profile type: Publication
full work available at URL: 978-3-030-56784-2 17
OpenAlex ID: W4247437710
cites work: Q4228459
cites work: Public-Key Encryption in the Bounded-Retrieval Model
cites work: Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
cites work: Learning with Rounding, Revisited
cites work: Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
cites work: Lossy trapdoor permutations with improved lossiness
cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
cites work: Big-Key Symmetric Encryption: Resisting Key Exfiltration
cites work: Verifiable delay functions
cites work: Classical hardness of learning with errors
cites work: Anonymous IBE, leakage resilience and circular security from new assumptions
cites work: Intrusion-Resilient Key Exchange in the Bounded Retrieval Model
cites work: Approximate trapdoors for lattices and smaller hash-and-sign signatures
cites work: Laconic oblivious transfer and its applications
cites work: How to build an ideal cipher: the indifferentiability of the Feistel construction
cites work: Proofs of replicated storage without timing assumptions
cites work: Q2724587
cites work: Theory of Cryptography
cites work: Counterexamples to Hardness Amplification beyond Negligible
cites work: Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
cites work: Proofs of Retrievability via Hardness Amplification
cites work: Tight proofs of space and replication
cites work: More constructions of lossy and correlation-secure trapdoor functions
cites work: New techniques in replica encodings with client setup
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: Separating succinct non-interactive arguments from all falsifiable assumptions
cites work: Advances in cryptology -- CRYPTO 2009. 29th annual international cryptology conference, Santa Barbara, CA, USA, August 16--20, 2009. Proceedings
cites work: Projection properties of theL2optimal reduced order model
cites work: A Pseudorandom Generator from any One-way Function
cites work: Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
cites work: Parallel Repetition for Leakage Resilience Amplification Revisited
cites work: Instantiability of RSA-OAEP under Chosen-Plaintext Attack
cites work: Straight lines on models of curved surfaces
cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
cites work: Public-key cryptosystems from the worst-case shortest vector problem
cites work: Lossy trapdoor functions and their applications
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Careful with Composition: Limitations of the Indifferentiability Framework
cites work: Compact Proofs of Retrievability
cites work: Barriers in cryptography with weak, correlated and leaky sources
cites work: The Magic of ELFs
description: scientific article; zbMATH DE number 7614549