On the Composition of Zero-Knowledge Proof Systems

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

Cited In (72)

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

Recommendations

This page was built for publication: On the Composition of Zero-Knowledge Proof Systems

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