Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
From MaRDI portal
Publication:6134420
DOI10.1007/s00145-023-09478-yzbMath1519.94040OpenAlexW4385659358MaRDI QIDQ6134420
Thomas Attema, Serge Fehr, Michael Klooß
Publication date: 22 August 2023
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-023-09478-y
Related Items (2)
Fiat-Shamir transformation of multi-round interactive proofs (Extended version) ⋮ What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
Cites Work
- Unnamed Item
- Unnamed Item
- 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 of the Fiat-Shamir transformation in the quantum random-oracle model
- Post-quantum security of Fiat-Shamir
- Security Proofs for Signature Schemes
- Interactive Oracle Proofs
- Strict polynomial-time in simulation and extraction
- Sequential random sampling
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- 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
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- 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 (Extended version)
