Generalized special-sound interactive proofs and their knowledge soundness

DOI10.1007/978-3-031-48621-0_15MaRDI QIDQ6582226

Nicolas Resch, Serge Fehr, Thomas Attema

Publication date: 2 August 2024

Mathematics Subject Classification ID

Cryptography (94A60) Theory of data (68Pxx)

Related Items (2)

CDS composition of multi-round protocols ⋮ Hybrid zero-knowledge from garbled circuits and circuit-based composition of \(\Sigma \)-protocols

Cites Work

• A compressed \(\varSigma \)-protocol theory for lattices
• Online-extractability in the quantum random-oracle model
• Interactive Oracle Proofs
• Computationally Sound Proofs
• Fast Reed-Solomon Interactive Oracle Proofs of Proximity
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
• Efficient NIZKs and signatures from commit-and-open protocols in the QROM
• Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
• Fiat-Shamir transformation of multi-round interactive proofs

This page was built for publication: Generalized special-sound interactive proofs and their knowledge soundness