FRIttata: a FRI-based polynomial commitment scheme for distributed proof generation

DOI10.62056/AKJBY76BMMaRDI QIDQ7391809zbMATH OpenFDO

Authors Hua Xu, Mariana Gama, Emad Heydari Beni, Jiayi Kang

Publication date 2025

Published in IACR Communications in Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/AKJBY76BM

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A Fiat-Shamir transformation from duplex sponges
• Constant-Size Commitments to Polynomials and Their Applications
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
• Fast Reed-Solomon interactive oracle proofs of proximity
• Fiat-Shamir security of FRI and related SNARKs
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 5485477 (Why is no real title available?)
• scientific article; zbMATH DE number 1842491 (Why is no real title available?)
• HyperPlonk: Plonk with linear-time prover and high-degree custom gates
• Interactive oracle proofs
• On the size of pairing-based non-interactive arguments
• Proximity gaps for Reed-Solomon codes
• Succinct arguments in the quantum random oracle model
• Transparent SNARKs from DARK compilers

This page was built for publication: FRIttata: a FRI-based polynomial commitment scheme for distributed proof generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391809)