eSTARK: extending STARKs with arguments

DOI10.1007/S10623-024-01457-ZMaRDI QIDQ6632059zbMATH OpenFDO

Authors Héctor Masip-Ardevol, Jordi Baylina-Melé, Marc Guzmán-Albiol, Jose Luis Muñoz-Tapia

Publication date 4 November 2024

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10623-024-01457-Z

zbMATH Keywords

AIReAIReStarkFRIlookupStark

Mathematics Subject Classification ID

Cryptography (94A60) Error probability in coding theory (94B70)

Recommendations

• Scalable zero knowledge with no trusted setup
• Aurora: transparent succinct arguments for R1CS
• Spartan: efficient and general-purpose zkSNARKs without trusted setup
• Transparent SNARKs from DARK compilers
• Efficient transparent polynomial commitments for zk-SNARKs

Cites work

• Constant-Size Commitments to Polynomials and Their Applications
• Fast Reed-Solomon interactive oracle proofs of proximity
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 1256635 (Why is no real title available?)
• Quadratic span programs and succinct NIZKs without PCPs
• Scalable zero knowledge with no trusted setup
• The knowledge complexity of interactive proof-systems

This page was built for publication: eSTARK: extending STARKs with arguments

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