Parallel repetition of (k₁, ,k_ ) -special-sound multi-round interactive proofs
From MaRDI portal
Publication:6155262
Recommendations
- A parallel repetition theorem for constant-round Arthur-Merlin proofs
- Parallel repetition of two-prover one-round games: an exposition
- A Parallel Repetition Theorem for Any Interactive Argument
- A parallel repetition theorem for any interactive argument
- Parallel repetition theorems for interactive arguments
- Doubly efficient interactive proofs over infinite and non-commutative rings
- Proving properties of interactive proofs by a generalized counting technique
- Towards the parallel repetition conjecture
- scientific article; zbMATH DE number 512981
Cites work
- A compressed \(\varSigma \)-protocol theory for lattices
- A non-PCP approach to succinct quantum-safe zero-knowledge
- A Parallel Repetition Theorem for Any Interactive Argument
- An efficient parallel repetition theorem
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- Efficient secure two-party protocols. Techniques and constructions
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Foundations of Cryptography
- scientific article; zbMATH DE number 5485477 (Why is no real title available?)
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- Parallel repetition theorems for interactive arguments
- Predictable arguments of knowledge
- Quantum proofs of knowledge
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- The knowledge complexity of interactive proof-systems
- Tight parallel repetition theorems for public-coin arguments using KL-divergence
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
- Transparent SNARKs from DARK compilers
Cited in
(22)- A tight parallel repetition theorem for partially simulatable interactive arguments via smooth KL-divergence
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Quantum rewinding for many-round protocols
- Fiat-Shamir transformation of multi-round interactive proofs
- Vector commitments over rings and compressed -protocols
- Lattice-based succinct arguments from vanishing polynomials (extended abstract)
- LaBRADOR: compact proofs for R1CS from Module-SIS
- Lattice-based timed cryptography
- Generalized special-sound interactive proofs and their knowledge soundness
- PERK: compact signature scheme based on a new variant of the permuted kernel problem
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
- CDS composition of multi-round protocols
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
- Greyhound: fast polynomial commitments from lattices
- Multi-splitting forking based modular security of signatures in multivariate quadratic setting
- Security of fixed-weight repetitions of special-sound multi-round interactive proofs
- A revision of CROSS security: proofs and attacks for multi-round Fiat-Shamir signatures
- Untangling the security of Kilian's protocol: upper and lower bounds
- The Fiat-Shamir transformation of (_1,,_ )-special-sound interactive proofs
- \textsf{LatticeFold}: a lattice-based folding scheme and its applications to succinct proof systems
- Critical rounds in multi-round proofs: proof of partial knowledge and trapdoor commitments
This page was built for publication: Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155262)
