Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
From MaRDI portal
Publication:6155262
DOI10.1007/978-3-031-15802-5_15OpenAlexW4312715239MaRDI QIDQ6155262
Publication date: 12 June 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/32288
proofs of knowledgeparallel repetitionknowledge extractorknowledge soundnessspecial-soundnessthreshold parallel repetition
Related Items (7)
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 \(\varSigma \)-protocols ⋮ Lattice-based succinct arguments from vanishing polynomials (extended abstract) ⋮ LaBRADOR: compact proofs for R1CS from Module-SIS ⋮ Lattice-based timed cryptography
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient secure two-party protocols. Techniques and constructions
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Transparent SNARKs from DARK compilers
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
- A compressed \(\varSigma \)-protocol theory for lattices
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- Quantum Proofs of Knowledge
- An Efficient Parallel Repetition Theorem
- Parallel Repetition Theorems for Interactive Arguments
- Foundations of Cryptography
- The knowledge complexity of interactive proof-systems
- A Parallel Repetition Theorem for Any Interactive Argument
- Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-Divergence
- Predictable Arguments of Knowledge
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
This page was built for publication: Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
