Scalable, transparent, and post-quantum secure computational integrity

By Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev. 2018

708 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Bulletproofs: Short Proofs for Confidential Transactions and More (2018, background): “One could avoid trusted setup by using a STARK [6], but the resulting range proofs while asymptotically efficient are practically larger than even the currently proposed solutions.”
Towards Post-Quantum Blockchain: A Review on Blockchain Cryptography Resistant to Quantum Computing Attacks (2020, background): “tems or to take advantage of new post-quantum schemes like zk-STARKs [247].”
Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (2017, background): “In a concurrent and independent work [5], BenSasson et al.”
Aurora: Transparent Succinct Arguments for R1CS (2019, methodology): “– Stark [13] is a non-interactive argument for bounded halting problems on a random access machine.”
Spartan: Efficient and general-purpose zkSNARKs without trusted setup (2020, background): “, uniform circuits); although any circuit can be converted to this form [16, 18], such a transformation incurs 10–1000× blowup in circuit size (which translates to a similar factor increase in the prover’s costs) when compared to equivalent but non-uniform circuits [90]; (4) The verifier in Aurora [”
Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs (2019, methodology): “[21] show how to compile such proofs into SNARGs in the random-oracle model and recent hash-based SNARGs, including Ligero [2], STARK [15], and Aurora [20] are built using this technique.”
Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains (2019, methodology): “For STARKs, a recent benchmark indicates that the Merkle paths make up over 400 KB of the 600 KB proof for a circuit of 2 52 gates [BBHR18].”
Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation (2019, methodology): “• libSTARK: After communications with the authors of [9], we obtain numbers for proving the same number of hashes in the 3rd benchmark below from the authors.”
Privacy-Preserving Solutions for Blockchain: Review and Challenges (2019, background): “A. MAIN PRIVACY-PRESERVING APPROACHES IN BLOCKCHAIN This section introduces the main technologies and crypto-solutions that can be used as baseline to enable privacy preservation in blockchain, including Securemulti-party computation (SMPC), Zero-Knowledge Proofs (ZKP), Commitment schemes, zkSNARK, ”