Scalable Zero Knowledge with No Trusted Setup

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

252 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Privacy & Security

How researchers see this paper

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

In Artificial Intelligence

In Computational Theory and Mathematics

In Privacy & Security

Citations in the corpus

Advances and Open Problems in Federated Learning (2019, background): “If we relax the requirements for succinctness or non-interactiveness for the construction, there is a large body of constructions that achieve a wide range of efficiency trade-offs, avoid the trusted setup requirement and use more standard cryptographic assumptions [84, 397, 23, 58].”
Poseidon: A New Hash Function for Zero-Knowledge Proof Systems (2021, methodology): “ZK-STARKs [9] is a proof system for the computational integrity, which is not vulnerable to quantum computers and does not use a trusted setup.”
The Energy Consumption of Blockchain Technology: Beyond Myth (2020, background): “In particular, SNARKS, STARKS, and other (Zero-Knowledge-)Proofs of computational integrity which require much less veriﬁcation and communication overhead on-chain seem very promising (Ben-Sasson et al. 2019).”
Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (2017, methodology): “It is also unclear how the FFT algorithms compare for characteristic 2 and prime ﬁelds, though fast implementations for the characteristic 2 case are known [31, 50] and used in designing ZKSNARKs based on IOPs [10].”
Transparent SNARKs from DARK Compilers (2020, methodology): “We present PLONK [30] here and discuss several other proof systems [43,22,4,48,31] in the full version [19] Theorem 6 provides the main theoretical result of this work, tying together the new DARK polynomial commitment scheme (Theorem 1), the compilation”