Fetching the paper…
Reading the bibliography…
Despite the existence of multiple great resources on zk-SNARK construction, from original papers to explainers, due to the sheer number of moving parts the subject remains a black box for many.
“The Knowledge Complexity of Interactive Proof-systems”
S Goldwasser, S Micali and C Rackoff · 1985
Earlier work this paper cites.
“Non-interactive Zero-knowledge and Its Applications”
Manuel Blum, Paul Feldman and Silvio Micali · 1988
Earlier work this paper cites.
“Towards practical public key systems secure against chosen ciphertext attacks”
Ivan Damgård · 1991
Earlier work this paper cites.
“Designated verifier proofs and their applications”
Markus Jakobsson, Kazue Sako and Russell Impagliazzo · 1996
Earlier work this paper cites.
“Pairing-Based Cryptographic Protocols: A Survey” https://eprint.iacr.org/2004/064 , Cryptology ePrint Archive, Report 2004/064, 2004
Ratna Dutta, Rana Barua and Palash Sarkar · 2004
Earlier work this paper cites.
“Short pairing-based non-interactive zero-knowledge arguments”
Jens Groth · 2010
Earlier work this paper cites.
“From Extractable Collision Resistance to Succinct Non-Interactive Arguments of Knowledge, and Back Again” https://eprint.iacr.org/2011/443 , Cryptology ePrint Archive, Report 2011/443, 2011
Nir Bitansky, Ran Canetti, Alessandro Chiesa and Eran Tromer · 2011
Earlier work this paper cites.
“Quadratic Span Programs and Succinct NIZKs without PCPs” https://eprint.iacr.org/2012/215 , Cryptology ePrint Archive, Report 2012/215, 2012
Rosario Gennaro, Craig Gentry, Bryan Parno and Mariana Raykova · 2012
Earlier work this paper cites.
“Pinocchio: Nearly Practical Verifiable Computation” https://eprint.iacr.org/2013/279 , Cryptology ePrint Archive, Report 2013/279, 2013
Bryan Parno, Craig Gentry, Jon Howell and Mariana Raykova · 2013
Earlier work this paper cites.
“Evaluating Polynomial Functions”, 2013
Scott Pike · 2013
Cited alongside, same era.
“Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture” https://eprint.iacr.org/2013/879 , Cryptology ePrint Archive, Report 2013/879, 2013
Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer and Madars Virza · 2013
Cited alongside, same era.
“Zerocash: Decentralized Anonymous Payments from Bitcoin” https://eprint.iacr.org/2014/349 , Cryptology ePrint Archive, Report 2014/349, 2014
Eli Ben-Sasson, Alessandro Chiesa, Christina Garman, Matthew Green, Ian Miers, Eran Tromer and Madars Virza · 2014
Cited alongside, same era.
“Dividing by a Polynomial” http://www.mesacc.edu/~scotz47781/mat120/notes/divide_poly/long_division/long_division.html , 2014
Scott Pike · 2014
Cited alongside, same era.
“zkSNARKs in a Nutshell”, 2016
Christian Reitwiessner · 2016
Cited alongside, same era.
“Explaining SNARKs” https://z.cash/blog/snark-explain/ , 2017
Ariel Gabizon · 2017
Later among the works it cites.
“Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs” https://eprint.iacr.org/2017/540 , Cryptology ePrint Archive, Report 2017/540, 2017
Jens Groth and Mary Maller · 2017
Later among the works it cites.
“Bulletproofs: Short Proofs for Confidential Transactions and More” https://eprint.iacr.org/2017/1066 , Cryptology ePrint Archive, Report 2017/1066, 2017
Benedikt Bünz, Jonathan Bootle, Dan Boneh, Andrew Poelstra, Pieter Wuille and Greg Maxwell · 2017
Later among the works it cites.
“Proofs of Ignorance and Applications to 2-Message Witness Hiding” https://eprint.iacr.org/2018/896 , Cryptology ePrint Archive, Report 2018/896, 2018
Apoorvaa Deshpande and Yael Kalai · 2018
Later among the works it cites.
“Constraint satisfaction”, Wikipedia, The Free Encyclopedia, 2018
Wikipedia contributors · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Quadratic Arithmetic Programs: from Zero to Hero” https://medium.com/@VitalikButerin/quadratic-arithmetic-programs-from-zero-to-hero-f6d558cea649 , 2016
Vitalik Buterin · 2016
Cited alongside, same era.
“The Design of the Ceremony”, 2016
Zooko Wilcox · 2016
Cited alongside, same era.
“On the Size of Pairing-based Non-interactive Arguments” https://eprint.iacr.org/2016/260 , Cryptology ePrint Archive, Report 2016/260, 2016
Jens Groth · 2016
Cited alongside, same era.
“zk-SNARKs: Under the Hood”, 2017
Vitalik Buterin · 2017
Cited alongside, same era.
Later among the works it cites.
“Updatable and Universal Common Reference Strings with Applications to zk-SNARKs” https://eprint.iacr.org/2018/280 , Cryptology ePrint Archive, Report 2018/280, 2018
Jens Groth, Markulf Kohlweiss, Mary Maller, Sarah Meiklejohn and Ian Miers · 2018
Later among the works it cites.
“Scalable, transparent, and post-quantum secure computational integrity” https://eprint.iacr.org/2018/046 , Cryptology ePrint Archive, Report 2018/046, 2018
Eli Ben-Sasson, Iddo Bentov, Yinon Horesh and Michael Riabzev · 2018
Later among the works it cites.
Mary Maller, Sean Bowe, Markulf Kohlweiss and Sarah Meiklejohn · 2019
Closest in time.