Fiat-Shamir transformation of multi-round interactive proofs
From MaRDI portal
Recommendations
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- 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
- Why ``Fiat-Shamir for proofs lacks a proof
Cites work
- A compressed \(\varSigma \)-protocol theory for lattices
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Aurora: transparent succinct arguments for R1CS
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Expected-time cryptography: generic techniques and applications to concrete soundness
- Fiat-Shamir: from practice to theory
- Foundations of Cryptography
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Interactive oracle proofs
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- Security proofs for signature schemes
- Short discrete log proofs for FHE and ring-LWE ciphertexts
- Strict polynomial-time in simulation and extraction
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- Succinct arguments in the quantum random oracle model
- Tight state-restoration soundness in the algebraic group model
- Time- and space-efficient arguments from groups of unknown order
- Transparent SNARKs from DARK compilers
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
Cited in
(42)- Fiat-Shamir for highly sound protocols is instantiable
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- 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
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
- Lattice-based timed cryptography
- Fiat-Shamir security of FRI and related SNARKs
- Protostar: generic efficient accumulation/folding for special-sound protocols
- Anonymous counting tokens
- Practical round-optimal blind signatures in the ROM from standard assumptions
- A generic construction of an anonymous reputation system and instantiations from lattices
- Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments
- Generalized special-sound interactive proofs and their knowledge soundness
- PERK: compact signature scheme based on a new variant of the permuted kernel problem
- Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
- Aggregating Falcon signatures with LaBRADOR
- Pairing-free blind signatures from standard assumptions in the ROM
- On soundness notions for interactive oracle proofs
- Polymath: Groth16 is not the limit
- Greyhound: fast polynomial commitments from lattices
- Mangrove: a scalable framework for folding-based SNARKs
- On the concrete security of non-interactive FRI
- On knowledge-soundness of Plonk in ROM from falsifiable assumptions
- Straight-line knowledge extraction for multi-round protocols
- Security of fixed-weight repetitions of special-sound multi-round interactive proofs
- A revision of CROSS security: proofs and attacks for multi-round Fiat-Shamir signatures
- Verifiable secret sharing from symmetric key cryptography with improved optimistic complexity
- Proofs for deep thought: accumulation for large memories and deterministic computations
- Tiresias: large scale, UC-secure threshold Paillier
- Improved quantum lifting by coherent measure-and-reprogram
- CDLS: proving knowledge of committed discrete logarithms with soundness
- The Fiat-Shamir transformation of (_1,,_ )-special-sound interactive proofs
- Everlasting anonymous rate-limited tokens
- A Fiat-Shamir transformation from duplex sponges
- Plonk is simulation extractable in ROM under falsifiable assumptions
- Special soundness and binding properties: a framework for tightly secure zk-SNARKs
- Special soundness in the random oracle model
- Goldreich-Krawczyk revisited: a note on the zero knowledge of proofs of knowledge
- The art of linearization: from a KZG's trick to a general commitment framework
This page was built for publication: Fiat-Shamir transformation of multi-round interactive proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169350)
