Instance compression, revisited

DOI10.1007/978-3-031-91134-7_9MaRDI QIDQ6891319zbMATH OpenFDO

Authors Gal Arnon, Shany Ben-David, Eylon Yogev

Publication date 2 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-91134-7_9

zbMATH Keywords

one-way functionsinteractive proofsinstance compressioncollision-resistant hash

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites work

• scientific article; zbMATH DE number 4057439 (Why is no real title available?)
• scientific article; zbMATH DE number 1303133 (Why is no real title available?)
• scientific article; zbMATH DE number 1031001 (Why is no real title available?)
• scientific article; zbMATH DE number 7829262 (Why is no real title available?)
• Adaptive security in SNARGs via iO and lossy functions
• Bit commitment using pseudorandomness
• Collision Resistance from Multi-collision Resistance
• Collision resistance from multi-collision resistance for all constant parameters
• Collision resistant hashing for paranoids: dealing with multiple collisions
• Collision resistant hashing from sub-exponential learning parity with noise
• Collision-free hashing from lattice problems
• Incompressible cryptography
• Infeasibility of instance compression and succinct PCPs for NP
• Limits on the power of indistinguishability obfuscation and functional encryption
• New limits to classical and quantum instance compression
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• On Forward-Secure Storage
• On distributional collision resistant hashing
• On problems without polynomial kernels
• On the compressibility of \(\mathcal{NP}\) instances and cryptographic applications
• On the randomness complexity of efficient sampling
• Probabilistically checkable arguments for all NP
• Public-key encryption with non-interactive opening: new constructions and stronger definitions
• Securing threshold cryptosystems against chosen ciphertext attack
• Theory of Cryptography
• White-box vs. black-box complexity of search problems: Ramsey and graph property testing

Cited in

(1)

• Incompressible encryption with everlasting security

This page was built for publication: Instance compression, revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891319)