Study of arithmetization methods for STARKs

DOI10.1007/S00145-025-09567-0MaRDI QIDQ6847552zbMATH OpenFDO

Authors Tiago F. M. C. Martins, João Farinha

Publication date 9 March 2026

Published in Journal of Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00145-025-09567-0

zbMATH Keywords

degree boundarithmetizationRPTAIRpreprocessed AIRselector columnsSTARKs

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites work

• scientific article; zbMATH DE number 1318047 (Why is no real title available?)
• Algebraic methods for interactive proof systems
• Arithmetization: A new method in structural complexity theory
• Fast Reed-Solomon interactive oracle proofs of proximity
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Interactive oracle proofs
• Proximity gaps for Reed-Solomon codes
• Scalable zero knowledge with no trusted setup
• Short PCPs with Polylog Query Complexity

This page was built for publication: Study of arithmetization methods for STARKs

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