Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions

Recommendations

scientific article; zbMATH DE number 4191124
Limits of Constructive Security Proofs
Impossibility and Feasibility Results for Zero Knowledge with Public Keys
Zero knowledge with efficient provers
scientific article; zbMATH DE number 1107670
scientific article; zbMATH DE number 94166
Zero-Knowledge Proofs
Zero‐Knowledge Proofs
Efficient zero-knowledge proofs. (Abstract)
On the communication complexity of zero-knowledge proofs

Cited in

(23)

Limits on the power of indistinguishability obfuscation and functional encryption
How (not) to build quantum PKE in Minicrypt
Limits on the power of garbling techniques for public-key encryption
On constructing one-way permutations from indistinguishability obfuscation
Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
On the impossibility of key agreements from quantum random oracles
Perfect zero knowledge: new upperbounds and relativized separations
Communication lower bounds of key-agreement protocols via density increment arguments
Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
On black-box extension of a non-interactive zero-knowledge proof system for secret equality
Towards a unified approach to black-box constructions of zero-knowledge proofs
On constructing one-way permutations from indistinguishability obfuscation
Towards non-black-box separations of public key encryption and one way function
Structure versus hardness through the obfuscation lens
Proofs of Work from worst-case assumptions
On the complexity of collision resistant hash functions: new and old black-box separations
Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
Toward fine-grained blackbox separations between semantic and circular-security notions
On the complexity of compressing obfuscation
Limits of Constructive Security Proofs
Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
A coin-free oracle-based augmented black box framework

This page was built for publication: Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions

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