Fiat-Shamir security of FRI and related SNARKs
From MaRDI portal
Publication:6562558
DOI10.1007/978-981-99-8724-5_1zbMATH Open1543.94706MaRDI QIDQ6562558
Justin Thaler, Pratyush Ranjan Tiwari, Michal Zajac, Jonathan I. Katz, Alexander R. Block, Albert Garreta
Publication date: 26 June 2024
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Malleability of the blockchain's entropy
- Checking the correctness of memories
- Transaction protection by beacons
- Arya: nearly linear-time zero-knowledge proofs for correct program execution
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- From obfuscation to the security of Fiat-Shamir for proofs
- Transparent SNARKs from DARK compilers
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Tight state-restoration soundness in the algebraic group model
- Succinct arguments in the quantum random oracle model
- Aurora: transparent succinct arguments for R1CS
- Practical verified computation with streaming interactive proofs
- Time-Optimal Interactive Proofs for Circuit Evaluation
- Security Proofs for Signature Schemes
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- Constant-Size Commitments to Polynomials and Their Applications
- The random oracle methodology, revisited
- Interactive Oracle Proofs
- Polynomial Codes Over Certain Finite Fields
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Algebraic methods for interactive proof systems
- Computationally Sound Proofs
- Why “Fiat-Shamir for Proofs” Lacks a Proof
- How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Fiat-Shamir: from practice to theory
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)
- Fiat-Shamir transformation of multi-round interactive proofs
Related Items (2)
STIR: Reed-Solomon proximity testing with fewer queries ⋮ On the concrete security of non-interactive FRI
This page was built for publication: Fiat-Shamir security of FRI and related SNARKs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562558)
