Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
From MaRDI portal
Publication:6134420
DOI10.1007/S00145-023-09478-YzbMATH Open1519.94040OpenAlexW4385659358MaRDI QIDQ6134420FDOQ6134420
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
Recommendations
- Fiat-Shamir transformation of multi-round interactive proofs
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Fiat-Shamir for highly sound protocols is instantiable
- Fiat-Shamir for highly sound protocols is instantiable
Cites Work
- Title not available (Why is that?)
- Security Proofs for Signature Schemes
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Title not available (Why is that?)
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Aurora: transparent succinct arguments for R1CS
- Strict polynomial-time in simulation and extraction
- Post-quantum security of Fiat-Shamir
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Interactive Oracle Proofs
- Transparent SNARKs from DARK compilers
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Succinct arguments in the quantum random oracle model
- Short discrete log proofs for FHE and ring-LWE ciphertexts
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Fiat-Shamir: from practice to theory
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
- Expected-time cryptography: generic techniques and applications to concrete soundness
- Time- and space-efficient arguments from groups of unknown order
- 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
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- Sequential random sampling
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
Cited In (7)
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Fiat-Shamir transformation of multi-round interactive proofs
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- Fiat-Shamir for highly sound protocols is instantiable
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- Generic error SDP and generic error CVE
This page was built for publication: Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134420)
