On the Composition of Zero-Knowledge Proof Systems

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments, Concurrent knowledge extraction in public-key models, On the round complexity of black-box secure MPC, Round-optimal fully black-box zero-knowledge arguments from one-way permutations, Round optimal black-box ``commit-and-prove, On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation, 3-Message Zero Knowledge Against Human Ignorance, Impossibility of Black-Box Simulation Against Leakage Attacks, Random oracles and non-uniformity, Unprovable security of perfect NIZK and non-interactive non-malleable commitments, Round-optimal zero-knowledge proofs of knowledge for NP, Round-optimal multi-party computation with identifiable abort, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, Long-term security and universal composability, A note on constant-round zero-knowledge proofs of knowledge, On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits, Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP, Optimal security for keyed hash functions: avoiding time-space tradeoffs for finding collisions, Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle?, Non-black-box simulation in the fully concurrent setting, revisited, Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract), Knowledge encryption and its applications to simulatable protocols with low round-complexity, Existence of 3-round zero-knowledge proof systems for NP, Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash, Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs, Parallel repetition of computationally sound protocols revisited, Which languages have 4-round zero-knowledge proofs?, Post-quantum insecurity from LWE, The hunting of the SNARK, Round-optimal black-box MPC in the plain model, Individual simulations, Public-coin parallel zero-knowledge for NP, Post-quantum resettably-sound zero knowledge, Concurrent composition of differential privacy, Unnamed Item, Possibility and impossibility results for selective decommitments, Cryptography and cryptographic protocols, The Knowledge Complexity of Interactive Proof Systems, What security can we achieve within 4 rounds?, Lower bounds for non-black-box zero knowledge, Parallel and Concurrent Security of the HB and HB + Protocols, Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?, Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?, An Equivalence Between Zero Knowledge and Commitments, The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization, Parallel and concurrent security of the HB and \(HB^{+}\) protocols, On the enumeration of minimal non-pairwise compatibility graphs, Constructing tree decompositions of graphs with bounded gonality, GNUC: a new universal composability framework, An efficient statistical zero-knowledge authentication protocol for smart cards, The Complexity of Zero Knowledge, Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening, Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?, Statistical Zaps and new oblivious transfer protocols, On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs, What Security Can We Achieve Within 4 Rounds?, On the Existence of Extractable One-Way Functions, Two-Message, Oblivious Evaluation of Cryptographic Functionalities, Composition of Zero-Knowledge Proofs with Efficient Provers, Private Coins versus Public Coins in Zero-Knowledge Proof Systems, Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments, Round-optimal black-box commit-and-prove with succinct communication, How to Simulate It – A Tutorial on the Simulation Proof Technique, Weak Zero-Knowledge beyond the Black-Box Barrier