Scalable, Transparent, and Post-Quantum Secure Zero-Knowledge Proofs (STARKs)
Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev
Abstract
This paper introduces STARKs (Scalable, Transparent Arguments of Knowledge), a form of zero-knowledge proof that addresses the limitations of previous iterations, such as the requirement for a trusted setup and vulnerability to quantum computing attacks. STARKs offer significant improvements in computational speed and verification time, making them a preferred solution for scaling blockchain networks (specifically via ZK-Rollups). The paper describes the mathematical foundation using hash-based cryptography, which removes the need for trusted initialization and enhances transparency. This work is critical for the evolution of Layer 2 solutions, enabling high-throughput transactions with strong security guarantees in a post-quantum environment, marking a key milestone in blockchain scalability research.
Key Findings
- 1Introduced STARKs as a transparent, post-quantum secure ZK-proof method.
- 2Eliminated the need for a 'trusted setup' required by earlier SNARKs.
- 3Demonstrated high scalability for proof generation and verification.
- 4Established a hash-based cryptographic alternative to elliptic curve-based proofs.
Topics
Citation
BibTeX
@misc{scalabletransparent2018,
title = {Scalable, Transparent, and Post-Quantum Secure Zero-Knowledge Proofs (STARKs)},
author = {Eli Ben-Sasson and Iddo Bentov and Yinon Horesh and Michael Riabzev},
year = {2018},
howpublished = {\url{https://eprint.iacr.org/2018/046}},
}Knowledge Explorer
Explore Related Concepts
See how Scalable, Transparent, and Post-Quantum Secure Zero-Knowledge Proofs (STARKs) connects to glossary terms, books, and other research in the Knowledge Graph.