An efficient parallel repetition theorem
From MaRDI portal
Recommendations
Cites work
- A Parallel Repetition Theorem
- A Parallel Repetition Theorem for Any Interactive Argument
- An efficient parallel repetition theorem
- Chernoff-Type Direct Product Theorems
- scientific article; zbMATH DE number 5485476 (Why is no real title available?)
- scientific article; zbMATH DE number 5485477 (Why is no real title available?)
- Minimum disclosure proofs of knowledge
- On the Composition of Public-Coin Zero-Knowledge Protocols
- Parallel Repetition of Computationally Sound Protocols Revisited
- Parallel repetition theorems for interactive arguments
- The Knowledge Complexity of Interactive Proof Systems
- Theory of Cryptography
Cited in
(29)- Fiat-Shamir for highly sound protocols is instantiable
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- 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
- A compressed \(\varSigma \)-protocol theory for lattices
- Tight state-restoration soundness in the algebraic group model
- Channels of small log-ratio leakage and characterization of two-party differentially private computation
- Concurrent knowledge extraction in public-key models
- Interactive Coding for Interactive Proofs
- A parallel repetition theorem for constant-round Arthur-Merlin proofs
- Simultaneous secrecy and reliability amplification for a general channel model
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- An efficient parallel repetition theorem
- Parallel repetition theorems for interactive arguments
- Parallel Repetition of Computationally Sound Protocols Revisited
- Parallel repetition of computationally sound protocols revisited
- scientific article; zbMATH DE number 1263221 (Why is no real title available?)
- A Parallel Repetition Theorem
- REMARKS ON A QUERY-BASED VARIANT OF THE PARALLEL REPETITION THEOREM
- Tight parallel repetition theorems for public-coin arguments using KL-divergence
- A parallel repetition theorem for any interactive argument
- Predictable arguments of knowledge
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
- An Attack on Some Signature Schemes Constructed from Five-Pass Identification Schemes
- On witness encryption and laconic zero-knowledge arguments
- Almost-total puzzles and their applications
- A tight lower bound on adaptively secure full-information coin flip
- Perfect parallel repetition theorem for quantum XOR proof systems
This page was built for publication: An efficient parallel repetition theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3408184)
