A curated list of papers ordered by number of citations. Last updated 2020-01-21

#Title
Citations
1.Hawk: The blockchain model of cryptography and privacy-preserving smart contracts Kosba, Ahmed and Miller, Andrew and Shi, Elaine and Wen, Zikai and Papamanthou, Charalampos. 2016
1007
2.Zerocash: Decentralized anonymous payments from bitcoin Ben-Sasson, Eli and Chiesa, Alessandro and Garman, Christina and Green, Matthew and Miers, Ian and Tromer, Eran and Virza, Madars. 2014
852
3.Pinocchio: Nearly practical verifiable computation Parno, Bryan and Howell, Jon and Gentry, Craig and Raykova, Mariana. 2013
567
4.Quadratic span programs and succinct NIZKs without PCPs Gennaro, Rosario and Gentry, Craig and Parno, Bryan and Raykova, Mariana. 2013
405
5.SNARKs for C: Verifying program executions succinctly and in zero knowledge Ben-Sasson, Eli and Chiesa, Alessandro and Genkin, Daniel and Tromer, Eran and Virza, Madars. 2013
351
6.Separating succinct non-interactive arguments from all falsifiable assumptions Gentry, Craig and Wichs, Daniel. 2011
295
7.Short pairing-based non-interactive zero-knowledge arguments Groth, Jens. 2010
279
8.Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. Ben-Sasson, Eli and Chiesa, Alessandro and Tromer, Eran and Virza, Madars. 2014
257
9.Recursive composition and bootstrapping for SNARKs and proof-carrying data Bitansky, Nir and Canetti, Ran and Chiesa, Alessandro and Tromer, Eran. 2013
182
10.Succinct non-interactive arguments via linear interactive proofs Bitansky, Nir and Chiesa, Alessandro and Ishai, Yuval and Paneth, Omer and Ostrovsky, Rafail. 2013
180
11.Bulletproofs: Short proofs for confidential transactions and more B\"unz, Benedikt and Bootle, Jonathan and Boneh, Dan and Poelstra, Andrew and Wuille, Pieter and Maxwell, Greg. 2018
141
12.Geppetto: Versatile verifiable computation Costello, Craig and Fournet, C\'edric and Howell, Jon and Kohlweiss, Markulf and Kreuter, Benjamin and Naehrig, Michael and Parno, Bryan and Zahur, Samee. 2015
136
13.On the size of pairing-based non-interactive arguments Groth, Jens. 2016
133
14.Scalable zero knowledge via cycles of elliptic curves Ben-Sasson, Eli and Chiesa, Alessandro and Tromer, Eran and Virza, Madars. 2017
129
15.Scalable, transparent, and post-quantum secure computational integrity Eli Ben-Sasson and Iddo Bentov and Yinon Horesh and Michael Riabzev. 2018
103
16.Efficient RAM and control flow in verifiable outsourced computation. Wahby, Riad S and Setty, Srinath TV and Ren, Zuocheng and Blumberg, Andrew J and Walfish, Michael. 2015
102
17.Resolving the conflict between generality and plausibility in verified computation Setty, Srinath and Braun, Benjamin and Vu, Victor and Blumberg, Andrew J and Parno, Bryan and Walfish, Michael. 2013
101
18.Pinocchio coin Danezis, George and Fournet, Cedric and Kohlweiss, Markulf and Parno, Bryan. 2013
92
19.Secure sampling of public parameters for succinct zero knowledge proofs Ben-Sasson, Eli and Chiesa, Alessandro and Green, Matthew and Tromer, Eran and Virza, Madars. 2015
91
20.ZKBoo: Faster Zero-Knowledge for Boolean Circuits. Giacomelli, Irene and Madsen, Jesper and Orlandi, Claudio. 2016
89
21.Zcash protocol specification Hopwood, Daira and Bowe, Sean and Hornby, Taylor and Wilcox, Nathan. 2016
81
22.Ligero: Lightweight sublinear arguments without a trusted setup Ames, Scott and Hazay, Carmit and Ishai, Yuval and Venkitasubramaniam, Muthuramakrishnan. 2017
79
23.Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes Lipmaa, Helger. 2013
71
24.Verifiable Delay Functions Dan Boneh, Joseph Bonneau, Benedikt Bünz, Ben Fisch. 2018
68
25.Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting Bootle, Jonathan and Cerulli, Andrea and Chaidos, Pyrros and Groth, Jens and Petit, Christophe. 2016
64
26.Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs Jens Groth and Mary Maller. 2017
46
27.A multi-party protocol for constructing the public parameters of the Pinocchio zk-SNARK Bowe, Sean and Gabizon, Ariel and Green, Matthew D. 2018
46
28.Zero-Knowledge Contingent Payments Revisited: Attacks and Payments for Services Matteo Campanelli and Rosario Gennaro and Steven Goldfeder and Luca Nizzardo. 2017
43
29.Doubly-efficient zkSNARKs without trusted setup Riad S. Wahby and Ioanna Tzialla and abhi shelat and Justin Thaler and Michael Walfish. 2017
40
30.Subversion-zero-knowledge SNARKs Georg Fuchsbauer. 2017
38
31.A Subversion-Resistant SNARK Behzad Abdolmaleki and Karim Baghery and Helger Lipmaa and Michal Zajac. 2017
37
32.Aurora: Transparent Succinct Arguments for R1CS Ben-Sasson, Eli and Chiesa, Alessandro and Riabzev, Michael and Spooner, Nicholas and Virza, Madars and Ward, Nicholas P. 2018
36
33.Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model Sean Bowe and Ariel Gabizon and Ian Miers. 2017
33
34.Bulletproofs: Efficient range proofs for confidential transactions B\"unz, Benedikt and Bootle, Jonathan and Boneh, Dan and Poelstra, Andrew and Wuille, Pieter and Maxwell, Greg. 2017
31
35.Quasi-linear size zero knowledge from linear-algebraic PCPs Ben-Sasson, Eli and Chiesa, Alessandro and Gabizon, Ariel and Virza, Madars. 2016
26
36.Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings Maller, Mary and Bowe, Sean and Kohlweiss, Markulf and Meiklejohn, Sarah. 2019
24
37.Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits Baum, Carsten and Bootle, Jonathan and Cerulli, Andrea and Del Pino, Rafa\"el and Groth, Jens and Lyubashevsky, Vadim. 2018
22
38.Updatable and Universal Common Reference Strings with Applications to zk-SNARKs Jens Groth and Markulf Kohlweiss and Mary Maller and Sarah Meiklejohn and Ian Miers. 2018
21
39.Raziel: private and verifiable smart contracts on blockchains S\'anchez, David Cerezo. 2018
19
40.Calypso: Auditable sharing of private data over blockchains Kokoris-Kogias, Eleftherios and Alp, Enis Ceyhun and Siby, Sandra Deepthy and Gailly, Nicolas and Gasser, Linus and Jovanovic, Philipp and Syta, Ewa and Ford, Bryan. 2018
19
41.Confidential assets Poelstra, Andrew and Back, Adam and Friedenbach, Mark and Maxwell, Gregory and Wuille, Pieter. 2018
18
42.C$\emptyset$C$\emptyset$: A Framework for Building Composable Zero-Knowledge Proofs Ahmed Kosba and Zhichao Zhao and Andrew Miller and Yi Qian and Hubert Chan and Charalampos Papamanthou and Rafael Pass and abhi shelat and Elaine Shi. 2015
16
43.Non-Interactive Zero-Knowledge Proofs for Composite Statements Shashank Agrawal and Chaya Ganesh and Payman Mohassel. 2018
15
44.How to Use SNARKs in Universally Composable Protocols. Kosba, Ahmed E and Zhao, Zhichao and Miller, Andrew and Qian, Yi and Chan, T-H Hubert and Papamanthou, Charalampos and Pass, Rafael and Shelat, Abhi and Shi, Elaine. 2015
15
45.ZoKrates - Scalable Privacy-Preserving Off-Chain Computations Jacob Eberhardt and Stefan Tai. 2018
14
46.Zexe: Enabling decentralized private computation Bowe, S and Chiesa, A and Green, M and Miers, I and Mishra, P and Wu, H. 2018
13
47.Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation Xie, Tiacheng and Zhang, Jiaheng and Zhang, Yupeng and Papamanthou, Charalampos and Song, Dawn. 2019
13
48.The Aztec Protocol Zachary J., Williamson. 2018
12
49.Making Groth's zk-SNARK Simulation Extractable in the Random Oracle Model Sean Bowe and Ariel Gabizon. 2018
11
50.Lattice-Based zk-SNARKs from Square Span Programs Gennaro, Rosario and Minelli, Michele and Nitulescu, Anca and Orr\`u, Michele. 2018
9
51.Scalable Zero Knowledge with No Trusted Setup Ben-Sasson, Eli and Bentov, Iddo and Horesh, Yinon and Riabzev, Michael. 2019
9
52.DIZK: A Distributed Zero-Knowledge Proof System Wu, Howard and Zheng, Wenting and Chiesa, Alessandro and Popa, Raluca Ada and Stoica, Ion. 2018
8
53.Ouroboros Crypsinous: Privacy-Preserving Proof-of-Stake Kerber, Thomas and Kohlweiss, Markulf and Kiayias, Aggelos and Zikas, Vassilis. 2018
8
54.xJsnark: a framework for efficient verifiable computation Kosba, Ahmed and Papamanthou, Charalampos and Shi, Elaine. 2018
8
55.Off-chaining models and approaches to off-chain computations Eberhardt, Jacob and Heiss, Jonathan. 2018
8
56.A Note on the Unsoundness of vnTinyRAM's SNARK. Parno, Bryan. 2015
7
57.Public Accountability vs. Secret Laws: Can They Coexist?: A Cryptographic Proposal Goldwasser, Shafi and Park, Sunoo. 2017
6
58.On the security of the BCTV Pinocchio zk-SNARK variant Gabizon, Ariel. 2019
6
59.Spartan: Efficient and general-purpose zkSNARKs without trusted setup Setty, Srinath. 2019
5
60.Simulation-Extractable SNARKs Revisited Lipmaa, Helger. 2019
5
61.On the efficiency of privacy-preserving smart contract systems Baghery, Karim. 2019
5
62.LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs Campanelli, Matteo and Fiore, Dario and Querol, Ana\"\is. 2019
3
63.Succinct Arguments in the Quantum Random Oracle Model Alessandro Chiesa and Peter Manohar and Nicholas Spooner. 2019
3
64.PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge Ariel Gabizon and Zachary J. Williamson and Oana Ciobotaru. 2019
3
65.Omniring: Scaling Up Private Payments Without Trusted Setup Lai, Russell WF and Ronge, Viktoria and Ruffing, Tim and Schr\"oder, Dominique and Thyagarajan, Sri Aravinda Krishnan and Wang, Jiafan. 2019
3
66.Founding Secure Computation on Blockchains Choudhuri, Arka Rai and Goyal, Vipul and Jain, Abhishek. 2019
2
67.TEX - A Securely Scalable Trustless Exchange Rami Khalil and Arthur Gervais and Guillaume Felley. 2019
2
68.MProve: A Proof of Reserves Protocol for Monero Exchanges Dutta, Arijit and Vijayakumaran, Saravanan. 2019
2
69.A survey on zero knowledge range proofs and applications Morais, Eduardo and Koens, Tommy and van Wijk, Cees and Koren, Aleksei. 2019
2
70.Simulation Extractability in Groth’s zk-SNARK Atapoor, Shahla and Baghery, Karim. 2019
2
71.Simulation Extractability in Groth’s zk-SNARK Atapoor, Shahla and Baghery, Karim. 2019
2
72.Efficient zero-knowledge arguments in the discrete log setting, revisited Max Hoffmann and Michael Klooß and Andy Rupp. 2019
1
73.On the (In)security of Kilian-Based SNARGs James Bartusek and Liron Bronfman and Justin Holmgren and Fermi Ma and Ron Rothblum. 2019
1
74.zkay: Specifying and Enforcing Data Privacy in Smart Contracts Steffen, Samuel and Bichsel, Benjamin and Gersbach, Mario and Melchior, Noa and Tsankov, Petar and Vechev, Martin. 2019
1
75.Towards a formally verified implementation of the MimbleWimble cryptocurrency protocol Betarte, Gustavo and Cristi\'a, Maximiliano and Luna, Carlos and Silveira, Adri\'an and Zanarini, Dante. 2019
1
76.ZeroLedge: Proving Solvency with Privacy Doerner, Jack and Shelat, Abhi and Evans, David. 2018
0
77.ON DEPLOYING SUCCINCT ZERO-KNOWLEDGE PROOFS Madars Virza. 2017
0
78.Practical Zero-Knowledge Arguments from Structured Reference Strings Maller, Mary. 2019
0
79.Contingent payments on a public ledger: models and reductions for automated verification. Bursuc, Sergiu and Kremer, Steve. 2019
0
80.WI Is Not Enough: Zero-Knowledge Contingent (Service) Payments Revisited Georg Fuchsbauer. 2019
0
81.State of the Art in Verifiable Computation Khovratovich, Dmitry. 2018
0
82.DECO: Liberating Web Data Using Decentralized Oracles for TLS Zhang, Fan and Maram, Sai Krishna Deepak and Malvai, Harjasleen and Goldfeder, Steven and Juels, Ari. 2019
0
83.Subversion-Resistant Simulation (Knowledge) Sound NIZKs Karim Baghery. 2019
0
84.ZETH: On Integrating Zerocash on Ethereum Rondelet, Antoine and Zajac, Michal. 2019
0
85.Lattice-Based Zero-Knowledge SNARGs for Arithmetic Circuits Nitulescu, Anca. 2019
0
86.Updatable CRS Simulation-Extractable zk-SNARKs with a Single Verification Kim, Jihye and Lee, Jiwon and Oh, Hyunok. 2019
0
87.SAVER: Snark-friendly, Additively-homomorphic, and Verifiable Encryption and decryption with Rerandomization Jiwon Lee and Jaekyoung Choi and Jihye Kim and Hyunok Oh. 2019
0
88.FastSwap: Concretely Efficient Contingent Payments for Complex Predicates Mathias Hall-Andersen. 2019
0
89.On Privacy Preserving Blockchains and zk-SNARKs Atapoor, Shahla. 2019
0
90.RedShift: Transparent SNARKs from List Polynomial Commitment IOPs Assimakis Kattis and Konstantin Panarin and Alexander Vlasov. 2019
0
91.SAMPL: Scalable Auditability of Monitoring Processes using Public Ledgers Panwar, Gaurav and Vishwanathan, Roopa and Misra, Satyajayant and Bos, Austin. 2019
0
92.Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof Jiaheng Zhang and Tiancheng Xie and Yupeng Zhang and Dawn Song. 2019
0
93.Triptych: logarithmic-sized linkable ring signatures with applications Sarang Noether and Brandon Goodell. 2020
0