Parallel repetition of computationally sound protocols revisited
From MaRDI portal
Publication:421032
DOI10.1007/s00145-010-9090-xzbMath1272.94057MaRDI QIDQ421032
Douglas Wikström, Krzysztof Pietrzak
Publication date: 23 May 2012
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-010-9090-x
Related Items
On the Connection between Leakage Tolerance and Adaptive Security, Predictable Arguments of Knowledge, A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence, Constant-round blind classical verification of quantum sampling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum disclosure proofs of knowledge
- Error reduction by parallel repetition - a negative result
- Complexity of a determinate algorithm for the discrete logarithm
- An Efficient Parallel Repetition Theorem
- Parallel Repetition Theorems for Interactive Arguments
- Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
- Adaptive One-Way Functions and Applications
- Chernoff-Type Direct Product Theorems
- Universal Arguments and their Applications
- The Knowledge Complexity of Interactive Proof Systems
- A Parallel Repetition Theorem
- Computationally Sound Proofs
- On the Composition of Zero-Knowledge Proof Systems
- A Parallel Repetition Theorem for Any Interactive Argument
- Theory of Cryptography
