On the Fiat-Shamir security of succinct arguments from functional commitments
From MaRDI portal
Cites work
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- \textsf{Dew}: a transparent constant-sized polynomial commitment scheme
- A Fiat-Shamir transformation from duplex sponges
- Barriers for succinct arguments in the random oracle model
- Computationally Sound Proofs
- Constant-Size Commitments to Polynomials and Their Applications
- Constant-size zk-SNARKs in ROM from falsifiable assumptions
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- How to prove false statements: practical attacks on Fiat-Shamir
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Interactive oracle proofs
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- On knowledge-soundness of Plonk in ROM from falsifiable assumptions
- On the (In)security of Kilian-based SNARGs
- On the (in)security of the Fiat-Shamir paradigm
- Proofs for inner pairing products and applications
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Subquadratic SNARGs in the random oracle model
- Subvector commitments with application to succinct arguments
- The random oracle methodology, revisited.
- Tight security bounds for Micali's SNARGs
- Towards a white-box secure Fiat-Shamir transformation
- Transparent SNARKs from DARK compilers
- Universal Arguments and their Applications
- Untangling the security of Kilian's protocol: upper and lower bounds
This page was built for publication: On the Fiat-Shamir security of succinct arguments from functional commitments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443625)