An Efficient Parallel Repetition Theorem
From MaRDI portal
Publication:3408184
DOI10.1007/978-3-642-11799-2_1zbMath1274.94075OpenAlexW2160900264WikidataQ56958852 ScholiaQ56958852MaRDI QIDQ3408184
Krzysztof Pietrzak, Rafael Pass, Douglas Wikström, Johan T. Håstad
Publication date: 24 February 2010
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11799-2_1
Related Items (17)
Concurrent knowledge extraction in public-key models ⋮ A compressed \(\varSigma \)-protocol theory for lattices ⋮ Tight state-restoration soundness in the algebraic group model ⋮ Fiat-Shamir for highly sound protocols is instantiable ⋮ Simultaneous Secrecy and Reliability Amplification for a General Channel Model ⋮ Unprovable security of perfect NIZK and non-interactive non-malleable commitments ⋮ Channels of small log-ratio leakage and characterization of two-party differentially private computation ⋮ Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs ⋮ Parallel repetition of computationally sound protocols revisited ⋮ Predictable Arguments of Knowledge ⋮ Interactive Coding for Interactive Proofs ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ An Efficient Parallel Repetition Theorem ⋮ Parallel Repetition Theorems for Interactive Arguments ⋮ Amplifying the security of functional encryption, unconditionally ⋮ A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence ⋮ Interactive proofs for social graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Minimum disclosure proofs of knowledge
- An Efficient Parallel Repetition Theorem
- Parallel Repetition Theorems for Interactive Arguments
- Parallel Repetition of Computationally Sound Protocols Revisited
- Chernoff-Type Direct Product Theorems
- The Knowledge Complexity of Interactive Proof Systems
- A Parallel Repetition Theorem
- A Parallel Repetition Theorem for Any Interactive Argument
- Theory of Cryptography
- On the Composition of Public-Coin Zero-Knowledge Protocols
This page was built for publication: An Efficient Parallel Repetition Theorem
