Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
By Helger Lipmaa. 2013
116 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
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
- Eli Ben-Sasson
- Eran Tromer
- Sarah Meiklejohn
- Madars Virza
- Srinath T. V. Setty
- Alessandro Chiesa
- Markulf Kohlweiss
- Dan Boneh
In Computational Theory and Mathematics
- Eli Ben-Sasson
- Madars Virza
- Eran Tromer
- Alessandro Chiesa
- Markulf Kohlweiss
- Sarah Meiklejohn
- Mary Maller
- Sean Bowe
Citations in the corpus
- Zerocash: Decentralized Anonymous Payments from Bitcoin (2014, methodology): “uses zero-knowledge Succinct Non-interactive ARguments of Knowledge (zk-SNARKs) [9, 10, 11, 12, 13, 14, 15, 16].”
- On the Size of Pairing-Based Non-interactive Arguments (2016, methodology): “Lip-maa [Lip13] suggested more efficient quadratic span programs using error correcting codes, and Danezis, Fournet, Groth and Kohlweiss [DFGK14] refined quadratic span programs to square span programs that give NIZK arguments consisting of 4 group elements for boolean circuit satisfiability.”
- Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings (2019, background): “Using knowledge assumptions, it is possible to build zk-SNARKs [15, 18, 35, 45, 47, 54, 59].”
- Scalable Zero Knowledge Via Cycles of Elliptic Curves (2014, methodology): “There are many preprocessing zk-SNARK constructions in the literature [9,14,17, 52,55,67,68,82].”
- Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture (2014, background): “Many works have obtained zk-SNARK constructions [45, 51, 38, 22, 56, 16, 52, 27].”