Papers (317)

#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.   
3324
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.   
2722
3.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.   
1546
4.Pinocchio: Nearly practical verifiable computation Parno, Bryan and Howell, Jon and Gentry, Craig and Raykova, Mariana. 2013.
1530
5.On the size of pairing-based non-interactive arguments Groth, Jens. 2016.   
1460
6.Quadratic span programs and succinct NIZKs without PCPs Gennaro, Rosario and Gentry, Craig and Parno, Bryan and Raykova, Mariana. 2013.
1115
7.Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. Ben-Sasson, Eli and Chiesa, Alessandro and Tromer, Eran and Virza, Madars. 2014.
901
8.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.   
886
9.Scalable, transparent, and post-quantum secure computational integrity Eli Ben-Sasson and Iddo Bentov and Yinon Horesh and Michael Riabzev. 2018.   
772
10.Verifiable Delay Functions Dan Boneh, Joseph Bonneau, Benedikt Bünz, Ben Fisch. 2018.   
681
11.PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge Ariel Gabizon and Zachary J. Williamson and Oana Ciobotaru. 2019.   
662
12.Short pairing-based non-interactive zero-knowledge arguments Groth, Jens. 2010.
622
13.Separating succinct non-interactive arguments from all falsifiable assumptions Gentry, Craig and Wichs, Daniel. 2011.   
600
14.Marlin: Preprocessing zkSNARKs with Universal andUpdatable SRS (thesis) Alessandro Chiesa and Yuncong Hu and Mary Maller and Pratyush Mishra and Noah Vesely and Nicholas Ward. 2021.
505
15.Ligero: Lightweight sublinear arguments without a trusted setup Ames, Scott and Hazay, Carmit and Ishai, Yuval and Venkitasubramaniam, Muthuramakrishnan. 2017.   
504
16.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.   
500
17.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.
480
18.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.   
471
19.Succinct non-interactive arguments via linear interactive proofs Bitansky, Nir and Chiesa, Alessandro and Ishai, Yuval and Paneth, Omer and Ostrovsky, Rafail. 2013.
437
20.Zcash protocol specification Hopwood, Daira and Bowe, Sean and Hornby, Taylor and Wilcox, Nathan. 2016.
428
21.Recursive composition and bootstrapping for SNARKs and proof-carrying data Bitansky, Nir and Canetti, Ran and Chiesa, Alessandro and Tromer, Eran. 2013.
424
22.Scalable zero knowledge via cycles of elliptic curves Ben-Sasson, Eli and Chiesa, Alessandro and Tromer, Eran and Virza, Madars. 2017.   
403
23.The Algebraic Group Model and its Applications Georg Fuchsbauer and Eike Kiltz and Julian Loss. 2017.
391
24.Doubly-efficient zkSNARKs without trusted setup Riad S. Wahby and Ioanna Tzialla and abhi shelat and Justin Thaler and Michael Walfish. 2017.   
387
25.Interactive oracle proofs Ben-Sasson, Eli and Chiesa, Alessandro and Spooner, Nicholas. 2016.   
386
26.Spartan: Efficient and general-purpose zkSNARKs without trusted setup Setty, Srinath. 2019.  
373
27.ZKBoo: Faster Zero-Knowledge for Boolean Circuits. Giacomelli, Irene and Madsen, Jesper and Orlandi, Claudio. 2016.
351
28.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.   
323
29.Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments Lipmaa, Helger. 2012.
316
30.Scalable Zero Knowledge with No Trusted Setup Ben-Sasson, Eli and Bentov, Iddo and Horesh, Yinon and Riabzev, Michael. 2019.
289
31.Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation Xie, Tiacheng and Zhang, Jiaheng and Zhang, Yupeng and Papamanthou, Charalampos and Song, Dawn. 2019.   
282
32.Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs Jens Groth and Mary Maller. 2017.   
281
33.Zexe: Enabling decentralized private computation Bowe, S and Chiesa, A and Green, M and Miers, I and Mishra, P and Wu, H. 2018.   
273
34.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.
248
35.Secure Vickrey auctions without threshold trust Lipmaa, Helger and Asokan, N and Niemi, Valtteri. 2003.
239
36.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.
237
37.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.
231
38.On diophantine complexity and statistical zero-knowledge arguments Lipmaa, Helger. 2003.
220
39.LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs Campanelli, Matteo and Fiore, Dario and Querol, Ana\"\is. 2019.   
217
40.Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model Sean Bowe and Ariel Gabizon and Ian Miers. 2017.
214
41.Zero-Knowledge Contingent Payments Revisited: Attacks and Payments for Services Matteo Campanelli and Rosario Gennaro and Steven Goldfeder and Luca Nizzardo. 2017.
211
42.Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof Jiaheng Zhang and Tiancheng Xie and Yupeng Zhang and Dawn Song. 2019.
209
43.A multi-party protocol for constructing the public parameters of the Pinocchio zk-SNARK Bowe, Sean and Gabizon, Ariel and Green, Matthew D. 2018.
196
44.Mac n Cheese: Zero-Knowledge Proofs for Arithmetic Circuits with Nested Disjunctions Baum, Carsten and Malozemoff, Alex J and Rosen, Marc and Scholl, Peter. 2020.
188
45.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.   
183
46.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.
181
47.Nova: Recursive Zero-Knowledge Arguments from Folding Schemes Abhiram Kothapalli and Srinath Setty and Ioanna Tzialla. 2021.
179
48.DIZK: A Distributed Zero-Knowledge Proof System Wu, Howard and Zheng, Wenting and Chiesa, Alessandro and Popa, Raluca Ada and Stoica, Ion. 2018.   
172
49.Square span programs with applications to succinct NIZK arguments Danezis, George and Fournet, C\'edric and Groth, Jens and Kohlweiss, Markulf. 2014.   
169
50.HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates Binyi Chen and Benedikt Bünz and Dan Boneh and Zhenfei Zhang. 2022.
159
51.zkbridge: Trustless cross-chain bridges made practical Xie, Tiancheng and Zhang, Jiaheng and Cheng, Zerui and Zhang, Fan and Zhang, Yupeng and Jia, Yongzheng and Boneh, Dan and Song, Dawn. 2022.
156
52.Pinocchio coin Danezis, George and Fournet, Cedric and Kohlweiss, Markulf and Parno, Bryan. 2013.
154
53.Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes Lipmaa, Helger. 2013.   
146
54.xJsnark: a framework for efficient verifiable computation Kosba, Ahmed and Papamanthou, Charalampos and Shi, Elaine. 2018.   
145
55.Confidential assets Poelstra, Andrew and Back, Adam and Friedenbach, Mark and Maxwell, Gregory and Wuille, Pieter. 2018.
144
56.QuickSilver: Efficient and Affordable Zero-Knowledge Proofs for Circuits and Polynomials over Any Field Kang Yang and Pratik Sarkar and Chenkai Weng and Xiao Wang. 2021.
140
57.Mystique: Efficient Conversions for Zero-Knowledge Proofs with Applications to Machine Learning Chenkai Weng and Kang Yang and Xiang Xie and Jonathan Katz and Xiao Wang. 2021.
129
58.Subversion-zero-knowledge SNARKs Georg Fuchsbauer. 2017.
127
59.Subvector commitments with application to succinct arguments Lai, Russell WF and Malavolta, Giulio. 2019.   
126
60.Zendoo: a zk-SNARK Verifiable Cross-Chain Transfer Protocol Enabling Decoupled and Decentralized Sidechains Alberto Garoffolo and Dmytro Kaidalov and Roman Oliynykov. 2020.
124
61.Ouroboros Crypsinous: Privacy-Preserving Proof-of-Stake Kerber, Thomas and Kohlweiss, Markulf and Kiayias, Aggelos and Zikas, Vassilis. 2018.   
123
62.A survey on zero knowledge range proofs and applications Morais, Eduardo and Koens, Tommy and van Wijk, Cees and Koren, Aleksei. 2019.
123
63.Proofs for Inner Pairing Products and Applications Benedikt Bünz and Mary Maller and Pratyush Mishra and Nirvan Tyagi and Psi Vesely. 2019.   
122
64.On Subversion-Resistant SNARKs Behzad Abdolmaleki and Helger Lipmaa and Janno Siim and Michał Zając. 2020.
121
65.Dory: Efficient, Transparent arguments for Generalised Inner Products and Polynomial Commitments Jonathan Lee. 2020.
121
66.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.
120
67.Pointproofs: Aggregating Proofs for Multiple Vector Commitments Sergey Gorbunov and Leonid Reyzin and Hoeteck Wee and Zhenfei Zhang. 2020.
114
68.plookup: A simplified polynomial protocol for lookup tables Ariel Gabizon and Zachary J. Williamson. 2020.  
114
69.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.
113
70.Non-Interactive Zero-Knowledge Proofs for Composite Statements Shashank Agrawal and Chaya Ganesh and Payman Mohassel. 2018.   
109
71.Off-chaining models and approaches to off-chain computations Eberhardt, Jacob and Heiss, Jonathan. 2018.
107
72.Orion: Zero Knowledge Proof with Linear Prover Time Tiancheng Xie and Yupeng Zhang and Dawn Song. 2022.
103
73.Ligero++: A New Optimized Sublinear IOP Bhadauria, Rishabh and Fang, Zhiyong and Hazay, Carmit and Venkitasubramaniam, Muthuramakrishnan and Xie, Tiancheng and Zhang, Yupeng. 2020.
101
74.Coda: Decentralized Cryptocurrency at Scale Joseph Bonneau and Izaak Meckler and Vanishree Rao and Evan Shapiro. 2020.   
98
75.Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution. Bootle, Jonathan and Cerulli, Andrea and Groth, Jens and Jakobsen, Sune K and Maller, Mary. 2018.   
89
76.Succinct Arguments in the Quantum Random Oracle Model Alessandro Chiesa and Peter Manohar and Nicholas Spooner. 2019.
87
77.Lunar: a Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions Matteo Campanelli and Antonio Faonio and Dario Fiore and Anaïs Querol and Hadrián Rodríguez. 2020.
86
78.Linear-time zero-knowledge SNARKs for R1CS Jonathan Lee and Srinath Setty and Justin Thaler and Riad Wahby. 2021.
86
79.Lattice-based SNARGs and their application to more efficient obfuscation Boneh, Dan and Ishai, Yuval and Sahai, Amit and Wu, David J. 2017.   
84
80.Non-Interactive Zero-Knowledge for Blockchain: A Survey Partala, Juha and Nguyen, Tri Hong and Pirttikangas, Susanna. 2020.
84
81.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.
83
82.Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular Benarroch, Daniel and Campanelli, Matteo and Fiore, Dario and Gurkan, Kobi and Kolonelos, Dimitris. 2020.   
83
83.Lattice-Based zk-SNARKs from Square Span Programs Gennaro, Rosario and Minelli, Michele and Nitulescu, Anca and Orr\`u, Michele. 2018.   
79
84.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.
78
85.Time- and Space-Efficient Arguments from Groups of Unknown Order Alexander R. Block and Justin Holmgren and Alon Rosen and Ron D. Rothblum and Pratik Soni. 2021.
77
86.Raziel: private and verifiable smart contracts on blockchains S\'anchez, David Cerezo. 2018.
75
87.Non-interactive distributed key generation and key resharing Jens Groth. 2021.   
74
88.RandPiper--Reconfiguration-Friendly Random Beacons with Quadratic Communication Bhat, Adithya and Shrestha, Nibesh and Kate, Aniket and Nayak, Kartik. 2020.
73
89.Cairo – a Turing-complete STARK-friendly CPU architecture Lior Goldberg and Shahar Papini and Michael Riabzev. 2021.
72
90.Another look at extraction and randomization of Groth’s zk-SNARK Baghery, Karim and Kohlweiss, Markulf and Siim, Janno and Volkhov, Mikhail. 2020.
70
91.Quarks: Quadruple-efficient transparent zkSNARKs Srinath Setty and Jonathan Lee. 2020.
69
92.Succinct NP proofs from an extractability assumption Di Crescenzo, Giovanni and Lipmaa, Helger. 2008.
69
93.Caulk: Lookup Arguments in Sublinear Time Arantxa Zapico and Vitalik Buterin and Dmitry Khovratovich and Mary Maller and Anca Nitulescu and Mark Simkin. 2022.   
69
94.Linear-Time Arguments with Sublinear Verification from Tensor Codes Bootle, Jonathan and Chiesa, Alessandro and Groth, Jens. 2020.
68
95.Rinocchio: SNARKs for Ring Arithmetic Chaya Ganesh and Anca Nitulescu and Eduardo Soria-Vazquez. 2021.
65
96.Brakedown: Linear-time and post-quantum SNARKs for R1CS Alexander Golovnev and Jonathan Lee and Srinath Setty and Justin Thaler and Riad S. Wahby. 2021.
65
97.Experimenting with Collaborative $\{$zk-SNARKs$\}$:$\{$Zero-Knowledge$\}$ Proofs for Distributed Secrets Ozdemir, Alex and Boneh, Dan. 2022.
65
98.Doubly Efficient Interactive Proofs for General Arithmetic Circuits with Linear Prover Time Jiaheng Zhang and Weijie Wang and Yinuo Zhang and Yupeng Zhang. 2020.
64
99.Post-Quantum Succinct Arguments Chiesa, Alessandro and Ma, Fermi and Spooner, Nicholas and Zhandry, Mark. 2021.
63
100.Unlocking the lookup singularity with Lasso Srinath Setty and Justin Thaler and Riad Wahby. 2023.
63
101.A non-interactive range proof with constant communication Chaabouni, Rafik and Lipmaa, Helger and Zhang, Bingsheng. 2012.
60
102.Brakedown: Linear-Time and Field-Agnostic SNARKs for R1CS Golovnev, Alexander and Lee, Jonathan and Setty, Srinath and Thaler, Justin and Wahby, Riad S. 2023.
60
103.Interactive oracle proofs with constant rate and query complexity Ben-Sasson, Eli and Chiesa, Alessandro and Gabizon, Ariel and Riabzev, Michael and Spooner, Nicholas. 2017.
58
104.Additive combinatorics and discrete logarithm based range protocols Chaabouni, Rafik and Lipmaa, Helger and Shelat, Abhi. 2010.
58
105.SuperNova: Proving universal machine executions without universal circuits Abhiram Kothapalli and Srinath Setty. 2022.
56
106.Lift-and-Shift: Obtaining Simulation Extractable Subversion and Updatable SNARKs Generically Bezhad Abdolmaleki and Sebastian Ramacher and Daniel Slamanig. 2020.
55
107.Making Groth's zk-SNARK Simulation Extractable in the Random Oracle Model Sean Bowe and Ariel Gabizon. 2018.
54
108.Quasi-linear size zero knowledge from linear-algebraic PCPs Ben-Sasson, Eli and Chiesa, Alessandro and Gabizon, Ariel and Virza, Madars. 2016.
54
109.Bulletproofs+: Shorter Proofs for Privacy-Enhanced Distributed Ledger Heewon Chung and Kyoohyung Han and Chanyang Ju and Myungsun Kim and Jae Hong Seo. 2020.
53
110.Efficient zero-knowledge arguments in the discrete log setting, revisited Max Hoffmann and Michael Klooß and Andy Rupp. 2019.
52
111.MIRAGE: Succinct Arguments for Randomized Algorithms with Applications to Universal zk-SNARKs Ahmed Kosba and Dimitrios Papadopoulos and Charalampos Papamanthou and Dawn Song. 2020.
52
112.Compressing Proofs of $k$-Out-Of-$n$ Partial Knowledge Thomas Attema and Ronald Cramer and Serge Fehr. 2020.
52
113.A Review of zk-SNARKs Chen, Thomas and Lu, Hui and Kunpittaya, Teeramet and Luo, Alan. 2022.
52
114.Powers-of-Tau to the People: Decentralizing Setup Ceremonies Nikolaenko, Valeria and Ragsdale, Sam and Bonneau, Joseph and Boneh, Dan. 2022.
52
115.Efficient Range Proofs with Transparent Setup from Bounded Integer Commitments Couteau, Geoffroy and Kloo\ss, Michael and Lin, Huang and Reichle, Michael. 2021.
51
116.cq: Cached quotients for fast lookups Liam Eagen and Dario Fiore and Ariel Gabizon. 2022.
51
117.SNARKpack: Practical SNARK Aggregation Nicolas Gailly and Mary Maller and Anca Nitulescu. 2021.
50
118.A survey of elliptic curves for proof systems Aranha, Diego F and El Housni, Youssef and Guillevic, Aurore. 2022.
50
119.Prover-efficient commit-and-prove zero-knowledge SNARKs Lipmaa, Helger. 2016.
49
120.Jolt: SNARKs for Virtual Machines via Lookups Arasu Arun and Srinath Setty and Justin Thaler. 2023.
49
121.Halo Infinite: Recursive zk-SNARKs from any Additive Polynomial Commitment Scheme Dan Boneh and Justin Drake and Ben Fisch and Ariel Gabizon. 2020.
48
122.Replicated state machines without replicated execution Lee, Jonathan and Nikitin, Kirill and Setty, Srinath. 2020.
47
123.Multivariate lookups based on logarithmic derivatives Ulrich Haböck. 2022.
47
124.An efficient pairing-based shuffle argument Fauzi, Prastudy and Lipmaa, Helger and Siim, Janno and Zaj\kac, Micha\l. 2017.
47
125.RedShift: Transparent SNARKs from List Polynomial Commitment IOPs Assimakis Kattis and Konstantin Panarin and Alexander Vlasov. 2019.
46
126.Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition Youssef El Housni and Aurore Guillevic. 2020.   
46
127.Verifiable Fully Homomorphic Encryption Viand, Alexander and Knabenhans, Christian and Hithnawi, Anwar. 2023.
46
128.The Aztec Protocol Zachary J., Williamson. 2018.   
45
129.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.
44
130.Simulation-Extractable SNARKs Revisited Lipmaa, Helger. 2019.
44
131.Shorter and Faster Post-Quantum Designated-Verifier zkSNARKs from Lattices Yuval Ishai and Hang Su and David J. Wu. 2021.
44
132.TEX - A Securely Scalable Trustless Exchange Rami Khalil and Arthur Gervais and Guillaume Felley. 2019.
43
133.WI Is Not Enough: Zero-Knowledge Contingent (Service) Payments Revisited Georg Fuchsbauer. 2019.
43
134.ZETH: On Integrating Zerocash on Ethereum Rondelet, Antoine and Zajac, Michal. 2019.
43
135.smartFHE: Privacy-Preserving Smart Contracts from Fully Homomorphic Encryption Ravital Solomon and Ghada Almashaqbeh. 2021.
43
136.$$\backslash$mathsf $\{$PEReDi$\}$ $: Privacy-Enhanced, Regulated and Distributed Central Bank Digital Currencies Kiayias, Aggelos and Kohlweiss, Markulf and Sarencheh, Amirreza. 2022.
42
137.A more efficient computationally sound non-interactive zero-knowledge shuffle argument Lipmaa, Helger and Zhang, Bingsheng. 2013.
41
138.Updateable Inner Product Argument with Logarithmic Verifier and Applications Daza, Vanesa and R\`afols, Carla and Zacharakis, Alexandros. 2020.
39
139.Public Accountability vs. Secret Laws: Can They Coexist?: A Cryptographic Proposal Goldwasser, Shafi and Park, Sunoo. 2017.   
38
140.Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy Boschini, Cecilia and Camenisch, Jan and Ovsiankin, Max and Spooner, Nicholas. 2020.  
38
141.Baloo: Nearly Optimal Lookup Arguments Zapico, Arantxa and Gabizon, Ariel and Khovratovich, Dmitry and Maller, Mary and R\`afols, Carla. 2022.
38
142.On the security of the BCTV Pinocchio zk-SNARK variant Gabizon, Ariel. 2019.
37
143.Simulation Extractable Versions of Groth’s zk-SNARK Revisited Karim Baghery and Zaira Pindado and Carla Ràfols. 2020.
37
144.An Algebraic Framework for Universal and Updatable SNARKs Carla Ràfols and Arantxa Zapico. 2021.  
37
145.Families of SNARK-friendly 2-chains of elliptic curves El Housni, Youssef and Guillevic, Aurore. 2021.
37
146.zk-SNARKs: A Gentle Introduction Nitulescu, Anca. 2019.
36
147.Succinct Zero-Knowledge Batch Proofs for Set Accumulators Matteo Campanelli and Dario Fiore and Semin Han and Jihye Kim and Dimitris Kolonelos and Hyunok Oh. 2021.
36
148.Proof of Necessary Work: Succinct State Verification with Fairness Guarantees Assimakis Kattis and Joseph Bonneau. 2020.
35
149.UC-Secure CRS Generation for SNARKs Behzad Abdolmaleki and Karim Baghery and Helger Lipmaa and Janno Siim and Michal Zajac. 2019.
34
150.LEO: A Programming Language for Formally Verified,Zero-Knowledge Applications Collin Chin and Howard Wu and Raymond Chu and Alessandro Coglio and Eric McCarthy and Eric Smith. 2021.
33
151.FairTraDEX: A Decentralised Exchange Preventing Value Extraction McMenamin, Conor and Daza, Vanesa and Fitzi, Matthias. 2022.
33
152.A shuffle argument secure in the generic model Fauzi, Prastudy and Lipmaa, Helger and Zaj\kac, Micha\l. 2016.
33
153.On cycles of pairing-friendly elliptic curves Chiesa, Alessandro and Chua, Lynn and Weidner, Matthew. 2019.
32
154.On QA-NIZK in the BPK model Abdolmaleki, Behzad and Lipmaa, Helger and Siim, Janno and Zaj\kac, Micha\l. 2020.
32
155.Caulk+: Table-independent lookup arguments Jim Posen and Assimakis A. Kattis. 2022.
32
156.zkHawk: Practical Private Smart Contracts from MPC-based Hawk Aritra Banerjee and Michael Clear and Hitesh Tewari. 2021.
31
157.Efficient culpably sound NIZK shuffle argument without random oracles Fauzi, Prastudy and Lipmaa, Helger. 2016.
31
158.Lattice-based succinct arguments from vanishing polynomials Cini, Valerio and Lai, Russell WF and Malavolta, Giulio. 2023.
31
159.SAVER: Snark-friendly, Additively-homomorphic, and Verifiable Encryption and decryption with Rerandomization Jiwon Lee and Jaekyoung Choi and Jihye Kim and Hyunok Oh. 2019.
30
160.Simulation Extractability in Groth’s zk-SNARK Atapoor, Shahla and Baghery, Karim. 2019.
30
161.Batching, Aggregation, and Zero-Knowledge Proofs in Bilinear Accumulators Srinivasan, Shravan and Karantaidou, Ioanna and Baldimtsi, Foteini and Papamanthou, Charalampos. 2022.
30
162.BeeGees: stayin' alive in chained BFT Abraham, Ittai and Crooks, Natacha and Giridharan, Neil and Howard, Heidi and Suri-Payer, Florian. 2023.
30
163.SPARKs: Succinct Parallelizable Arguments of Knowledge Naomi Ephraim and Cody Freitag and Ilan Komargodski and Rafael Pass. 2020.
29
164.Eagle: Efficient Privacy Preserving Smart Contracts Carsten Baum and James Hsin-yu Chiang and Bernardo David and Tore Kasper Frederiksen. 2022.
29
165.$\mathsf{zkSaaS}$: Zero-Knowledge SNARKs as a Service Sanjam Garg and Aarushi Goel and Abhishek Jain and Guru-Vamsi Policharla and Sruthi Sekar. 2023.
29
166.Plonkup: Reconciling plonk with plookup Pearson, Luke and Fitzgerald, Joshua and Masip, H\'ector and Bell\'es-Mu\~noz, Marta and Mu\~noz-Tapia, Jose Luis. 2022.
29
167.Verifiable computing applications in blockchain \vSimuni\'c, Silvio and Bernaca, Dalen and Lenac, Kristijan. 2021.
28
168.Triptych: logarithmic-sized linkable ring signatures with applications Sarang Noether and Brandon Goodell. 2020.
27
169.On the efficiency of privacy-preserving smart contract systems Baghery, Karim. 2019.
27
170.Spartan and Bulletproofs are simulation-extractable (for free!) Quang Dao and Paul Grubbs. 2023.
26
171.Weak Fiat-Shamir Attacks on Modern Proof Systems Quang Dao and Jim Miller and Opal Wright and Paul Grubbs. 2023.
26
172.Founding Secure Computation on Blockchains Choudhuri, Arka Rai and Goyal, Vipul and Jain, Abhishek. 2019.
25
173.Subversion-Resistant Simulation (Knowledge) Sound NIZKs Karim Baghery. 2019.
24
174.Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK Helger Lipmaa and Janno Siim and Michal Zajac. 2022.
24
175.flookup: Fractional decomposition-based lookups in quasi-linear time independent of table size Ariel Gabizon and Dmitry Khovratovich. 2022.
24
176.On the (In)security of Kilian-Based SNARGs James Bartusek and Liron Bronfman and Justin Holmgren and Fermi Ma and Ron Rothblum. 2019.
22
177.Linear-map Vector Commitments and their Practical Applications Matteo Campanelli and Anca Nitulescu and Carla Ràfols and Alexandros Zacharakis and Arantxa Zapico. 2022.
22
178.A Gas-Efficient Superlight Bitcoin Client in Solidity Stelios Daveas and Kostis Karantias and Aggelos Kiayias and Dionysis Zindros. 2020.  
21
179.A Direct Construction for Asymptotically Optimal zkSNARKs Abhiram Kothapalli and Elisaweta Masserova and Bryan Parno. 2020.
21
180.Succinct functional commitment for a large class of arithmetic circuits Lipmaa, Helger and Pavlyk, Kateryna. 2020.
21
181.Short-lived zero-knowledge proofs and signatures Arasu Arun and Joseph Bonneau and Jeremy Clark. 2022.
21
182.Revisiting the Nova Proof System on a Cycle of Curves Wilson Nguyen and Dan Boneh and Srinath Setty. 2023.
21
183.A Note on the Unsoundness of vnTinyRAM's SNARK. Parno, Bryan. 2015.
20
184.Lattice-Based Zero-Knowledge SNARGs for Arithmetic Circuits Nitulescu, Anca. 2019.
20
185.Plumo: An Ultralight Blockchain Client Psi Vesely and Kobi Gurkan and Michael Straka and Ariel Gabizon and Philipp Jovanovic and Georgios Konstantopoulos and Asa Oines and Marek Olszewski and and Eran Tromer. 2021.
20
186.Efficient modular NIZK arguments from shift and product Fauzi, Prastudy and Lipmaa, Helger and Zhang, Bingsheng. 2013.
20
187.zk-Bench: A Toolset for Comparative Evaluation and Performance Benchmarking of SNARKs Jens Ernstberger and Stefanos Chaliasos and George Kadianakis and Sebastian Steinhorst and Philipp Jovanovic and Arthur Gervais and Benjamin Livshits and Michele Orrù. 2023.
20
188.Zero-Knowledge Succinct Arguments with a Linear-Time Prover Jonathan Bootle and Alessandro Chiesa and Siqi Liu. 2020.
19
189.ZPiE: Zero-knowledge Proofs in Embedded systems Xavier Salleras and Vanesa Daza. 2021.
19
190.Curve Trees: Practical and Transparent Zero-Knowledge Accumulators Matteo Campanelli and Mathias Hall-Andersen and Simon Holmgaard Kamp. 2022.
19
191.Dew: Transparent Constant-sized {zkSNARKs} Arasu Arun and Chaya Ganesh and Satya Lokam and Tushar Mopuri and Sriram Sridhar. 2022.
19
192.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.
18
193.Mining for Privacy: How to Bootstrap a Snarky Blockchain Thomas Kerber and Aggelos Kiayias and Markulf Kohlweiss. 2020.
18
194.Polynomial IOPs for Linear Algebra Relations Alan Szepieniec. 2020.
18
195.WI is Almost Enough: Contingent Payment All Over Again Nguyen, Ky and Ambrona, Miguel and Abe, Masayuki. 2020.
18
196.Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions Aarushi Goel and Mathias Hall-Andersen and Gabriel Kaptchuk and Nicholas Spooner. 2022.
18
197.Zeromorph: Zero-Knowledge Multilinear-Evaluation Proofs from Homomorphic Univariate Commitments Tohru Kohrita and Patrick Towa. 2023.
18
198.An airdrop that preserves recipient privacy⋆ Wahby, Riad S and Boneh, Dan and Jeffrey, Christopher and Poon, Joseph. 2020.  
17
199.MProve: A Proof of Reserves Protocol for Monero Exchanges Dutta, Arijit and Vijayakumaran, Saravanan. 2019.
16
200.Adaptively Secure Single Secret Leader Election from DDH Dario Catalano and Dario Fiore and Emanuele Giunta. 2022.
16
201.PAPR: Publicly Auditable Privacy Revocation for Anonymous Credentials Joakim Brorsson and Bernardo David and Lorenzo Gentile and Elena Pagnin and Paul Stankovski Wagner. 2023.
16
202.Sublonk: Sublinear prover plonk Choudhuri, Arka Rai and Garg, Sanjam and Goel, Aarushi and Sekar, Sruthi and Sinha, Rohit. 2024.
16
203.{aPlonK} : Aggregated {PlonK} from Multi-Polynomial Commitment Schemes Miguel Ambrona and Marc Beunardeau and Anne-Laure Schmitt and Raphaël R. Toledo. 2022.
16
204.SAMPL: Scalable Auditability of Monitoring Processes using Public Ledgers Panwar, Gaurav and Vishwanathan, Roopa and Misra, Satyajayant and Bos, Austin. 2019.
15
205.Timed Signatures and Zero-Knowledge Proofs -Timestamping in the Blockchain Era- Aydin Abadi and Michele Ciampi and Aggelos Kiayias and Vassilis Zikas. 2019.
15
206.On Succinct Non-Interactive Arguments in Relativized Worlds Chen, Megan and Chiesa, Alessandro and Spooner, Nicholas. 2022.
15
207.Succinct Zero Knowledge for Floating Point Computations Garg, Sanjam and Jain, Abhishek and Jin, Zhengzhong and Zhang, Yinuo. 2022.
15
208.Testudo: Linear Time Prover SNARKs with Constant Size Proofs and Square Root Size Universal Setup Matteo Campanelli and Nicolas Gailly and Rosario Gennaro and Philipp Jovanovic and Mara Mihali and Justin Thaler. 2023.
15
209.SublonK: Sublinear Prover PlonK Arka Rai Choudhuri and Sanjam Garg and Aarushi Goel and Sruthi Sekar and Rohit Sinha. 2023.
15
210.Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees Matteo Campanelli and Antonio Faonio and Dario Fiore and Tianyu Li and Helger Lipmaa. 2023.
15
211.Composition with Knowledge Assumptions Thomas Kerber and Aggelos Kiayias and Markulf Kohlweiss. 2021.
14
212.Efficient NIZK arguments via parallel verification of benes networks Lipmaa, Helger. 2014.
14
213.Improving logarithmic derivative lookups using GKR Shahar Papini and Ulrich Haböck. 2023.
14
214.Contingent payments on a public ledger: models and reductions for automated verification. Bursuc, Sergiu and Kremer, Steve. 2019.
13
215.Complete Knowledge: Preventing Encumbrance of Cryptographic Secrets Kelkar, Mahimna and Babel, Kushal and Daian, Philip and Austgen, James and Buterin, Vitalik and Juels, Ari. 2023.
13
216.Algebraic Group Model with Oblivious Sampling Helger Lipmaa and Roberto Parisella and Janno Siim. 2023.
13
217.Efficient Isogeny Proofs Using Generic Techniques Kelong Cong and Yi-Fu Lai and Shai Levin. 2023.
12
218.Universally Composable NIZKs: Circuit-Succinct, Non-Malleable and CRS-Updatable Behzad Abdolmaleki and Noemi Glaeser and Sebastian Ramacher and Daniel Slamanig. 2023.
12
219.Revisiting cycles of pairing-friendly elliptic curves Marta Bellés-Muñoz and Jorge Jiménez Urroz and Javier Silva. 2022.
11
220.Bulletproofs++: Next Generation Confidential Transactionsvia Reciprocal Set Membership Arguments Liam Eagen. 2022.
11
221.Derecho: Privacy Pools with Proof-Carrying Disclosures Josh Beal and Ben Fisch. 2023.
11
222.VSS from Distributed ZK Proofs and Applications Shahla Atapoor and Karim Baghery and Daniele Cozzo and Robi Pedersen. 2023.
11
223.Dispute-free Scalable Open Vote Network using zk-SNARKs ElSheikh, Muhammad and Youssef, Amr M. 2022.
10
224.Proofs of discrete logarithm equality across groups Melissa Chase and Michele Orrù and Trevor Perrin and Greg Zaverucha. 2022.
10
225.Fiat-Shamir Bulletproofs are Non-Malleable (in the Random Oracle Model) Chaya Ganesh and Claudio Orlandi and Mahak Pancholi and Akira Takahashi and Daniel Tschudi. 2023.
10
226.TurboIKOS: Improved Non-interactive Zero Knowledge and Post-Quantum Signatures Yaron Gvili and Julie Ha and Sarah Scheffler and Mayank Varia and Ziling Yang and Xinyuan Zhang. 2021.
9
227.More Efficient Zero-Knowledge Protocols over $\mathbb{Z}_{2^k}$ via Galois Rings Fuchun Lin and Chaoping Xing and Yizhou Yao. 2023.
9
228.Barriers for Succinct Arguments in the Random Oracle Model Alessandro Chiesa and Eylon Yogev. 2020.
8
229.Manta: a Plug and Play Private DeFi Stack Shumo Chu and Yu Xia and Zhenfei Zhang. 2021.
8
230.Zero Knowledge Proofs and Applications to Financial Regulation Gowravaram, Nihal R. 2018.
8
231.PESCA: A Privacy-Enhancing Smart-Contract Architecture Wei Dai. 2022.
8
232.LURK: Lambda, the Ultimate Recursive Knowledge Amin, Nada and Burnham, John and Garillot, Fran\ccois and Gennaro, Rosario and Rogozin, Daniel and Wong, Cameron and others. 2023.
8
233.MUXProofs: Succinct Arguments for Machine Computation from Tuple Lookups Zijing Di and Lucas Xia and Wilson Nguyen and Nirvan Tyagi. 2023.
8
234.FastSwap: Concretely Efficient Contingent Payments for Complex Predicates Mathias Hall-Andersen. 2019.
7
235.Verifiable state machines: Proofs that untrusted services operate correctly Srinath Setty and Sebastian Angel and Jonathan Lee. 2020.
7
236.fflonk: a Fast-Fourier inspired verifier efficient version of PlonK Ariel Gabizon and Zachary J. Williamson. 2021.
7
237.Folding Schemes with Selective Verification Carla Ràfols and Alexandros Zacharakis. 2022.
7
238.cqlin: Efficient linear operations on {KZG} commitments with cached quotients Liam Eagen and Ariel Gabizon. 2023.
7
239.SoK: Lifting Transformations for Simulation Extractable Subversion and Updatable SNARKs⋆ Abdolmaleki, Behzad and Ramacher, Sebastian and Slamanig, Daniel. 2020.
6
240.Balancing Privacy and Accountability in Blockchain Transactions Damgard, Ivan and Ganesh, Chaya and Khoshakhlagh, Hamidreza and Orlandi, Claudio and Siniscalchi, Luisa. 2020.
6
241.Towards Accountability in CRS Generation Ananth, Prabhanjan and Asharov, Gilad and Dahari, Hila and Goyal, Vipul. 2021.
6
242.Towards Accountability in CRS Generation Prabhanjan Ananth and Gilad Asharov and Hila Dahari and Vipul Goyal. 2021.
6
243.CycloneNTT: An NTT/FFT Architecture Using Quasi-Streaming of Large Datasets on DDR- and HBM-based FPGA Platforms Kaveh Aasaraai and Emanuele Cesena and Rahul Maganti and Nicolas Stalder and Javier Varela and Kevin Bowers. 2022.
6
244.Beyond the Blockchain Address: Zero-Knowledge Address Abstraction Sanghyeon Park and Jeong Hyuk Lee and Seunghwa Lee and Jung Hyun Chun and Hyeonmyeong Cho and MinGi Kim and Hyun Ki Cho and Soo-Mook Moon. 2023.
6
245.VOProof: Efficient zkSNARKs from Vector Oracle Compilers Yuncong Zhang and Alan Szepieniec and Ren Zhang and Shi-Feng Sun and Geng Wang and Dawu Gu. 2021.
6
246.Compositional Formal Verification of Zero-Knowledge Circuits Alessandro Coglio and Eric McCarthy and Eric Smith and Collin Chin and Pranav Gaddamadugu and Michel Dellepere. 2023.
6
247.Proof-Carrying Data from Multi-folding Schemes Zibo Zhou and Zongyang Zhang and Jin Dong. 2023.
6
248.Baby SNARK (do do dodo dodo) Andrew Miller and Ye Zhang and Sanket Kanjalkar. 2020.  
5
249.Zecale: Reconciling Privacy and Scalability on Ethereum Rondelet, Antoine. 2020.
5
250.Publicly Verifiable Zero Knowledge from (Collapsing) Blockchains Scafuro, Alessandra and Siniscalchi, Luisa and Visconti, Ivan. 2020.
5
251.Unifying Compilers for SNARKs, SMT, and More Alex Ozdemir and Fraser Brown and Riad S. Wahby. 2020.
5
252.Formalizing Soundness Proofs of SNARKs Bolton Bailey and Andrew Miller. 2023.
5
253.On Soundness Notions for Interactive Oracle Proofs Alexander R. Block and Albert Garreta and Pratyush Ranjan Tiwari and Michał Zając. 2023.
5
254.Batching-Efficient {RAM} using Updatable Lookup Arguments Moumita Dutta and Chaya Ganesh and Sikhar Patranabis and Shubh Prakash and Nitin Singh. 2024.
5
255.Community Proposal: A Benchmarking Framework for (Zero-Knowledge) Proof Systems Benarroch, Daniel and Nicolas, Aur\'elien and Thaler, Justin and Tromer, Eran. 2020.
4
256.Unbounded Simulation-Sound Subversion Resistant Quasi-Adaptive NIZK Proofs and Applications to Modular zk-SNARKs Behzad Abdolmaleki and Daniel Slamanig. 2020.
4
257.ZK-SecreC: a Domain-Specific Language for Zero Knowledge Proofs Bogdanov, Dan and J\"a\"ager, Joosep and Laud, Peeter and Nestra, H\"armel and Pettai, Martin and Randmets, Jaak and Sokk, Ville and Tali, Kert and Valdma, Sandhra-Mirella. 2022.
4
258.Vortex : Building a Lattice-based SNARK scheme with Transparent Setup Alexandre Belling and Azam Soleimanian. 2022.
4
259.Zero-Knowledge Mechanisms Canetti, Ran and Fiat, Amos and Gonczarowski, Yannai A.. 2023.
4
260.UniPlonk: Plonk with Universal Verifier Shumo Chu and Brandon H. Gomes and Francisco Hernandez Iglesias and Todd Norton and Duncan Tebbs. 2023.
4
261.On the Impossibility of Algebraic NIZK In Pairing-Free Groups Emanuele Giunta. 2023.
4
262.Succinct Proofs and Linear Algebra Alex Evans and Guillermo Angeris. 2023.
4
263.zkInterface, a standard tool for zero-knowledge interoperability Daniel Benarroch and Kobi Gurkan and Ron Kahat and Aurélien Nicolas 1 and Eran Tromer. 2020.   
3
264.Succinct Diophantine-Satisfiability Arguments Patrick Towa and Damien Vergnaud. 2020.
3
265.Succinct Publicly Verifiable Computation Alonso González and Alexandros Zacharakis. 2021.
3
266.Filling the Tax Gap via Programmable Money Karakostas, Dimitris and Kiayias, Aggelos. 2021.
3
267.Less is more: refinement proofs for probabilistic proofs Jiang, Kunming and Chait-Roth, Devora and DeStefano, Zachary and Walfish, Michael and Wies, Thomas. 2022.
3
268.$\mu$Cash: Transparent Anonymous Transactions Liam Eagen. 2022.
3
269.Scaling Zero-Knowledge to Verifiable Databases Derei, Tal and Aulenbach, Benjamin and Carolino, Victor and Geren, Caleb and Kaufman, Michael and Klein, Jonathan and Islam Shanto, Rishad and Korth, Henry F. 2023.
3
270.The Arithmetic of Pairing-Based Proof Systems El Housni, Youssef. 2022.
3
271.Simulation-Extractable {KZG} Polynomial Commitments and Applications to {HyperPlonk} Benoit Libert. 2024.
3
272.Accelerating the PlonK zkSNARK Proving System using GPU Architectures Derei, Tal. 2023.
3
273.RapidUp: Multi-domain permutation protocol for lookup tables Ardevol, H\'ector Masip and Mel\'e, Jordi Baylina and Lubarov, Daniel and Mu\~noz-Tapia, Jos\'e L. 2022.
3
274.State of the Art in Verifiable Computation Khovratovich, Dmitry. 2018.
2
275.ZKProof Community Reference ZKProofStandards. 2019.
2
276.Zero-Knowledge Arguments for Subverted RSA Groups Dimitris Kolonelos and Mary Maller and Mikhail Volkhov. 2023.
2
277.State of the Art Report: Verified Computation Woodcock, Jim and Andersen, Mikkel Schimdt and Aranha, Diego F and Hallerstede, Stefan and Hansen, Simon Thrane and Jakobsen, Nikolaj Kuhne and Kulik, Tomas and Larsen, Peter Gorm and Macedo, Hugo Daniel and Martin, Carlos Ignacio Isasa and others. 2023.
2
278.Field-Agnostic {SNARKs} from Expand-Accumulate Codes Alexander R. Block and Zhiyong Fang and Jonathan Katz and Justin Thaler and Hendrik Waldner and Yupeng Zhang. 2024.
2
279.How (not) to simulate PLONK Sefranek, Marek. 2024.
2
280.Practical Zero-Knowledge Arguments from Structured Reference Strings Maller, Mary. 2019.
1
281.Performance Trade-offs in Design of MimbleWimble Proofs of Reserves Suyash Bagad and Saravanan Vijayakumaran. 2020.
1
282.Plonkup scheme with multiple queries Alexandr Bulkin and Tim Dokchitser. 2023.
1
283.TENET : Sublogarithmic Proof, Sublinear Verifier Inner Product Argument without a Trusted Setup Hyeonbum Lee and Jae Hong Seo. 2023.
1
284.A Subversion-Resistant SNARK Behzad Abdolmaleki and Karim Baghery and Helger Lipmaa and Michal Zajac. 2017.   
0
285.ZeroLedge: Proving Solvency with Privacy Doerner, Jack and Shelat, Abhi and Evans, David. 2018.
0
286.ON DEPLOYING SUCCINCT ZERO-KNOWLEDGE PROOFS Madars Virza. 2017.
0
287.ZoKrates - Scalable Privacy-Preserving Off-Chain Computations Jacob Eberhardt and Stefan Tai. 2018.   
0
288.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.
0
289.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.
0
290.Updatable CRS Simulation-Extractable zk-SNARKs with a Single Verification Kim, Jihye and Lee, Jiwon and Oh, Hyunok. 2019.
0
291.On Privacy Preserving Blockchains and zk-SNARKs Atapoor, Shahla. 2019.
0
292."Many-out-of-Many" Proofs with Applications to Anonymous Zether Benjamin E. Diamond. 2020.
0
293.zkRelay: Facilitating Sidechains using zkSNARK-based Chain-Relays Martin Westerkamp and Jacob Eberhardt. 2020.
0
294.Fast, Private, Flexible Blockchain Contracts ZkVM Oleg Andreev and Bob Glickstein and Vicki Niu and Tess Rinearson and Debnil Sur and Cathie Yun. 2019.   
0
295.Smart Contract With Secret Parameters Thiercelin, Marin and Cheng, Chen-Mou and Miyaji, Atsuko and Vaudenay, Serge. 2020.
0
296.TinyRAM Architecture Specification v2. 000 Chiesa, Eli Ben-Sasson Alessandro and Genkin, Daniel and Tromer, Eran and Virza, Madars. 2020.
0
297.Groth16 SNARKs are Randomizable and (Weakly) Simulation Extractable Mikhail Volkhov and Markulf Kohlweiss. 2020.
0
298.PayPlace: A Scalable Sidechain Protocol for Flexible Payment Mechanisms in Blockchain-based Marketplaces Harishankar, Madhumitha and Iyer, Sriram V and Laszka, Aron and Joe-Wong, Carlee and Tague, Patrick. 2020.
0
299.DEEP-FRI: Sampling Outside the Box Improves Soundness Eli Ben-Sasson and Lior Goldberg and Swastik Kopparty and Shubhangi Saraf. 2019.  
0
300.Computation Verification for Noobs Riabzev, Michael and Ben-Sasson, Eli and Ishai, Yuval. 2019.
0
301.Succinct Non-Interactive Arguments for Arithmetic Circuits Spooner, Nicholas. 2020.
0
302.On Succinct Non-InteractiveZero-Knowledge Protocols UnderWeaker Trust Assumptions Behzad Abdolmaleki. 2020.
0
303.Zero-Knowledge Proofs applied to finance S\'anchez Ortiz, Elvira. 2020.
0
304.Halo 0.9: A Halo Protocol with Fully-Succinctness Lira Wang. 2020.
0
305.Privacy-Enhancing Cryptography in Distributed Ledgers Angelo De Caro and Michele Ciampi and Berry Schoenmakers and Toon Segers and Mikhail Volkhov and Markulf Kohlweiss and Ahto Truu and Henri Lakk. 2020.
0
306.On (Weak) Simulation-Extractability of Universal zkSNARKs Markulf Kohlweiss and Michał Zając. 2021.
0
307.PriBank: Confidential Blockchain Scaling Using Short Commit-and-Proof NIZK Argument Gj\osteen, Kristian and Raikwar, Mayank and Wu, Shuang. 2022.
0
308.Spats: user-defined confidential assets for the Spark transaction protocol Feickert, Aaron and Jivanyan, Aram. 2022.
0
309.EdMSM: Multi-Scalar-Multiplication for recursive SNARKs and more Youssef EL Housni and Gautam Botrel. 2022.
0
310.A zk-evm specification B\'egassat, Olivier and Belling, Alexandre and Chapuis-Chkaiban, Th\'eodore and Delehelle, Franklin and Kolad, Blazej and Liochon, Nicolas. 2022.
0
311.CRS-Updatable Asymmetric Quasi-Adaptive NIZK Arguments Behzad Abdolmaleki and Daniel Slamanig. 2022.
0
312.A Universally Composable Non-interactive Aggregate Cash System Jia, Yanxue and Sun, Shi-Feng and Zhou, Hong-Sheng and Gu, Dawu. 2023.
0
313.Improved SNARK Frontend for Highly Repetitive Computations Sriram Sridhar and Yinuo Zhang. 2023.
0
314.SoK: Understanding zk-SNARKs: The Gap Between Research and Practice Liang, Junkai and Hu, Daqi and Wu, Pengfei and Yang, Yunbo and Shen, Qingni and Wu, Zhonghai. 2025.
0
315.An optimization of the addition gate count in Plonkish circuits Thakur, Steve. 2023.
0
316.On PlonK SNARK Ben\vc\'\ik, Benjam\'\in. 2024.
0
317.Public inputs in PlonK’s permutation argument Gabizon, Ariel and Williamson, Zachary J. 2021.
0

Videos