Fiat-Shamir transformation of multi-round interactive proofs
From MaRDI portal
Publication:6169350
DOI10.1007/978-3-031-22318-1_5zbMath1519.94039OpenAlexW3205132379MaRDI QIDQ6169350
Thomas Attema, Serge Fehr, Michael Klooß
Publication date: 14 August 2023
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22318-1_5
Related Items (5)
Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems ⋮ Spartan and bulletproofs are simulation-extractable (for free!) ⋮ BLOOM: bimodal lattice one-out-of-many proofs and applications ⋮ Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head ⋮ Lattice-based timed cryptography
Cites Work
- 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
- Expected-time cryptography: generic techniques and applications to concrete soundness
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- A compressed \(\varSigma \)-protocol theory for lattices
- Tight state-restoration soundness in the algebraic group model
- Time- and space-efficient arguments from groups of unknown order
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- Succinct arguments in the quantum random oracle model
- Short discrete log proofs for FHE and ring-LWE ciphertexts
- Aurora: transparent succinct arguments for R1CS
- Security Proofs for Signature Schemes
- Interactive Oracle Proofs
- Strict polynomial-time in simulation and extraction
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Foundations of Cryptography
- Fiat-Shamir: from practice to theory
- 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
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
This page was built for publication: Fiat-Shamir transformation of multi-round interactive proofs
