Papers (258)

#Title
Citations
1.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.   
2280
2.Pinocchio: Nearly practical verifiable computation Parno, Bryan and Howell, Jon and Gentry, Craig and Raykova, Mariana. 2013.
1239
3.On the size of pairing-based non-interactive arguments Groth, Jens. 2016.   
912
4.Quadratic span programs and succinct NIZKs without PCPs Gennaro, Rosario and Gentry, Craig and Parno, Bryan and Raykova, Mariana. 2013.
894
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.   
742
6.Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. Ben-Sasson, Eli and Chiesa, Alessandro and Tromer, Eran and Virza, Madars. 2014.
694
7.Scalable, transparent, and post-quantum secure computational integrity Eli Ben-Sasson and Iddo Bentov and Yinon Horesh and Michael Riabzev. 2018.   
516
8.Separating succinct non-interactive arguments from all falsifiable assumptions Gentry, Craig and Wichs, Daniel. 2011.   
501
9.Verifiable Delay Functions Dan Boneh, Joseph Bonneau, Benedikt Bünz, Ben Fisch. 2018.   
472
10.Succinct non-interactive arguments via linear interactive proofs Bitansky, Nir and Chiesa, Alessandro and Ishai, Yuval and Paneth, Omer and Ostrovsky, Rafail. 2013.
374
11.Ligero: Lightweight sublinear arguments without a trusted setup Ames, Scott and Hazay, Carmit and Ishai, Yuval and Venkitasubramaniam, Muthuramakrishnan. 2017.   
360
12.PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge Ariel Gabizon and Zachary J. Williamson and Oana Ciobotaru. 2019.   
342
13.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.   
332
14.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.   
329
15.Recursive composition and bootstrapping for SNARKs and proof-carrying data Bitansky, Nir and Canetti, Ran and Chiesa, Alessandro and Tromer, Eran. 2013.
328
16.Zcash protocol specification Hopwood, Daira and Bowe, Sean and Hornby, Taylor and Wilcox, Nathan. 2016.
324
17.Scalable zero knowledge via cycles of elliptic curves Ben-Sasson, Eli and Chiesa, Alessandro and Tromer, Eran and Virza, Madars. 2017.   
306
18.Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS Alessandro Chiesa and Yuncong Hu and Mary Maller and Pratyush Mishra and Noah Vesely and Nicholas Ward. 2019.   
305
19.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.
305
20.ZKBoo: Faster Zero-Knowledge for Boolean Circuits. Giacomelli, Irene and Madsen, Jesper and Orlandi, Claudio. 2016.
276
21.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.   
276
22.Doubly-efficient zkSNARKs without trusted setup Riad S. Wahby and Ioanna Tzialla and abhi shelat and Justin Thaler and Michael Walfish. 2017.   
273
23.Interactive oracle proofs Ben-Sasson, Eli and Chiesa, Alessandro and Spooner, Nicholas. 2016.   
271
24.Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains Boneh, Dan and B\"unz, Benedikt and Fisch, Benjamin. 2018.   
262
25.The Algebraic Group Model and its Applications Georg Fuchsbauer and Eike Kiltz and Julian Loss. 2017.
246
26.Transparent SNARKs from DARK Compilers Benedikt Bünz and Ben Fisch and Alan Szepieniec. 2019.   
232
27.Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs Jens Groth and Mary Maller. 2017.   
213
28.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.
199
29.Spartan: Efficient and general-purpose zkSNARKs without trusted setup Setty, Srinath. 2019.  
199
30.ZoKrates - Scalable Privacy-Preserving Off-Chain Computations Jacob Eberhardt and Stefan Tai. 2018.   
196
31.Scalable Zero Knowledge with No Trusted Setup Ben-Sasson, Eli and Bentov, Iddo and Horesh, Yinon and Riabzev, Michael. 2019.
193
32.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.
189
33.Zexe: Enabling decentralized private computation Bowe, S and Chiesa, A and Green, M and Miers, I and Mishra, P and Wu, H. 2018.   
188
34.Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation Xie, Tiacheng and Zhang, Jiaheng and Zhang, Yupeng and Papamanthou, Charalampos and Song, Dawn. 2019.   
182
35.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.
179
36.Fractal: Post-Quantum and Transparent Recursive Proofs from Holography Alessandro Chiesa and Dev Ojha and Nicholas Spooner. 2019.   
168
37.A multi-party protocol for constructing the public parameters of the Pinocchio zk-SNARK Bowe, Sean and Gabizon, Ariel and Green, Matthew D. 2018.
166
38.Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model Sean Bowe and Ariel Gabizon and Ian Miers. 2017.
164
39.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.
156
40.Square span programs with applications to succinct NIZK arguments Danezis, George and Fournet, C\'edric and Groth, Jens and Kohlweiss, Markulf. 2014.   
146
41.Recursive Proof Composition without aTrusted Setup Bowe, Sean Grigg, Jack Hopwood, Daira. 2019.   
140
42.Pinocchio coin Danezis, George and Fournet, Cedric and Kohlweiss, Markulf and Parno, Bryan. 2013.
136
43.Accountable privacy for decentralized anonymous payments Garman, Christina and Green, Matthew and Miers, Ian. 2016.
135
44.LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs Campanelli, Matteo and Fiore, Dario and Querol, Ana\"\is. 2019.   
131
45.Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes Lipmaa, Helger. 2013.   
123
46.Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof Jiaheng Zhang and Tiancheng Xie and Yupeng Zhang and Dawn Song. 2019.
119
47.DIZK: A Distributed Zero-Knowledge Proof System Wu, Howard and Zheng, Wenting and Chiesa, Alessandro and Popa, Raluca Ada and Stoica, Ion. 2018.   
117
48.Subversion-zero-knowledge SNARKs Georg Fuchsbauer. 2017.
106
49.On Subversion-Resistant SNARKs Behzad Abdolmaleki and Helger Lipmaa and Janno Siim and Michał Zając. 2020.
103
50.Ouroboros Crypsinous: Privacy-Preserving Proof-of-Stake Kerber, Thomas and Kohlweiss, Markulf and Kiayias, Aggelos and Zikas, Vassilis. 2018.   
97
51.xJsnark: a framework for efficient verifiable computation Kosba, Ahmed and Papamanthou, Charalampos and Shi, Elaine. 2018.   
97
52.Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits Chenkai Weng and Kang Yang and Jonathan Katz and Xiao Wang. 2020.
97
53.Subvector commitments with application to succinct arguments Lai, Russell WF and Malavolta, Giulio. 2019.   
91
54.Non-Interactive Zero-Knowledge Proofs for Composite Statements Shashank Agrawal and Chaya Ganesh and Payman Mohassel. 2018.   
83
55.A Comprehensive Survey on Smart Contract Construction and Execution: Paradigms, Tools and Systems Hu, Bin and Zhang, Zongyang and Liu, Jianwei and Liu, Yizhong and Yin, Jiayuan and Lu, Rongxing and Lin, Xiaodong. 2020.
82
56.Zendoo: a zk-SNARK Verifiable Cross-Chain Transfer Protocol Enabling Decoupled and Decentralized Sidechains Alberto Garoffolo and Dmytro Kaidalov and Roman Oliynykov. 2020.
76
57.Pointproofs: Aggregating Proofs for Multiple Vector Commitments Sergey Gorbunov and Leonid Reyzin and Hoeteck Wee and Zhenfei Zhang. 2020.
69
58.Scaling Verifiable Computation Using Efficient Set Accumulators Alex Ozdemir and Riad S. Wahby and Dan Boneh. 2019.  
68
59.Proofs for Inner Pairing Products and Applications Benedikt Bünz and Mary Maller and Pratyush Mishra and Nirvan Tyagi and Psi Vesely. 2019.   
68
60.Fast and simple constant-time hashing to the BLS12-381 elliptic curve Wahby, Riad S and Boneh, Dan. 2019.   
66
61.Lattice-based SNARGs and their application to more efficient obfuscation Boneh, Dan and Ishai, Yuval and Sahai, Amit and Wu, David J. 2017.   
66
62.Coda: Decentralized Cryptocurrency at Scale Joseph Bonneau and Izaak Meckler and Vanishree Rao and Evan Shapiro. 2020.   
65
63.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.
65
64.Dory: Efficient, Transparent arguments for Generalised Inner Products and Polynomial Commitments Jonathan Lee. 2020.
62
65.Succinct Arguments in the Quantum Random Oracle Model Alessandro Chiesa and Peter Manohar and Nicholas Spooner. 2019.
60
66.Ligero++: A New Optimized Sublinear IOP Bhadauria, Rishabh and Fang, Zhiyong and Hazay, Carmit and Venkitasubramaniam, Muthuramakrishnan and Xie, Tiancheng and Zhang, Yupeng. 2020.
59
67.Lattice-Based zk-SNARKs from Square Span Programs Gennaro, Rosario and Minelli, Michele and Nitulescu, Anca and Orr\`u, Michele. 2018.   
55
68.DEEP-FRI: Sampling Outside the Box Improves Soundness Eli Ben-Sasson and Lior Goldberg and Swastik Kopparty and Shubhangi Saraf. 2019.  
54
69.Nova: Recursive Zero-Knowledge Arguments from Folding Schemes Abhiram Kothapalli and Srinath Setty and Ioanna Tzialla. 2021.
53
70.plookup: A simplified polynomial protocol for lookup tables Ariel Gabizon and Zachary J. Williamson. 2020.  
51
71.Non-Interactive Zero-Knowledge for Blockchain: A Survey Partala, Juha and Nguyen, Tri Hong and Pirttikangas, Susanna. 2020.
50
72.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.
49
73.Quasi-linear size zero knowledge from linear-algebraic PCPs Ben-Sasson, Eli and Chiesa, Alessandro and Gabizon, Ariel and Virza, Madars. 2016.
48
74.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.
48
75.A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge Jonathan Bootle and Vadim Lyubashevsky and Ngoc Khanh Nguyen and Gregor Seiler. 2020.
47
76.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.
46
77.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.
45
78.HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates Binyi Chen and Benedikt Bünz and Dan Boneh and Zhenfei Zhang. 2022.
44
79.Efficient polynomial commitment schemes for multiple points and polynomials Dan Boneh and Justin Drake and Ben Fisch and Ariel Gabizon. 2020.
43
80.Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular Benarroch, Daniel and Campanelli, Matteo and Fiore, Dario and Gurkan, Kobi and Kolonelos, Dimitris. 2020.   
43
81.Post-Quantum Succinct Arguments Chiesa, Alessandro and Ma, Fermi and Spooner, Nicholas and Zhandry, Mark. 2021.
43
82.Making Groth's zk-SNARK Simulation Extractable in the Random Oracle Model Sean Bowe and Ariel Gabizon. 2018.
41
83.Prover-efficient commit-and-prove zero-knowledge SNARKs Lipmaa, Helger. 2016.
40
84.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.
39
85.Proof-Carrying Data from Accumulation Schemes Benedikt Bünz and Alessandro Chiesa and Pratyush Mishra and Nicholas Spooner. 2020.  
38
86.Linear-Time Arguments with Sublinear Verification from Tensor Codes Bootle, Jonathan and Chiesa, Alessandro and Groth, Jens. 2020.
38
87.Another look at extraction and randomization of Groth’s zk-SNARK Baghery, Karim and Kohlweiss, Markulf and Siim, Janno and Volkhov, Mikhail. 2020.
37
88.RedShift: Transparent SNARKs from List Polynomial Commitment IOPs Assimakis Kattis and Konstantin Panarin and Alexander Vlasov. 2019.
36
89.Simulation-Extractable SNARKs Revisited Lipmaa, Helger. 2019.
36
90.Quarks: Quadruple-efficient transparent zkSNARKs Srinath Setty and Jonathan Lee. 2020.
36
91.Halo Infinite: Recursive zk-SNARKs from any Additive Polynomial Commitment Scheme Dan Boneh and Justin Drake and Ben Fisch and Ariel Gabizon. 2020.
36
92.Doubly Efficient Interactive Proofs for General Arithmetic Circuits with Linear Prover Time Jiaheng Zhang and Weijie Wang and Yinuo Zhang and Yupeng Zhang. 2020.
35
93.Lift-and-Shift: Obtaining Simulation Extractable Subversion and Updatable SNARKs Generically Bezhad Abdolmaleki and Sebastian Ramacher and Daniel Slamanig. 2020.
33
94.zkRelay: Facilitating Sidechains using zkSNARK-based Chain-Relays Martin Westerkamp and Jacob Eberhardt. 2020.
33
95.On the (in) security of SNARKs in the presence of oracles Fiore, Dario and Nitulescu, Anca. 2016.
33
96.Cairo – a Turing-complete STARK-friendly CPU architecture Lior Goldberg and Shahar Papini and Michael Riabzev. 2021.
32
97.Public Accountability vs. Secret Laws: Can They Coexist?: A Cryptographic Proposal Goldwasser, Shafi and Park, Sunoo. 2017.   
30
98.MIRAGE: Succinct Arguments for Randomized Algorithms with Applications to Universal zk-SNARKs Ahmed Kosba and Dimitrios Papadopoulos and Charalampos Papamanthou and Dawn Song. 2020.
30
99.Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition Youssef El Housni and Aurore Guillevic. 2020.   
30
100.UC-Secure CRS Generation for SNARKs Behzad Abdolmaleki and Karim Baghery and Helger Lipmaa and Janno Siim and Michal Zajac. 2019.
30
101.TEX - A Securely Scalable Trustless Exchange Rami Khalil and Arthur Gervais and Guillaume Felley. 2019.
28
102.On the security of the BCTV Pinocchio zk-SNARK variant Gabizon, Ariel. 2019.
27
103.Proof of Necessary Work: Succinct State Verification with Fairness Guarantees Assimakis Kattis and Joseph Bonneau. 2020.
27
104.Caulk: Lookup Arguments in Sublinear Time Arantxa Zapico and Vitalik Buterin and Dmitry Khovratovich and Mary Maller and Anca Nitulescu and Mark Simkin. 2022.   
27
105.AuroraLight: Improved prover efficiency and SRS size in a Sonic-like system Gabizon, Ariel. 2019.
26
106.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.  
26
107.Reducing Participation Costs via Incremental Verification for Ledger Systems Weikeng Chen and Alessandro Chiesa and Emma Dauterman and Nicholas P. Ward. 2020.
26
108.Rinocchio: SNARKs for Ring Arithmetic Chaya Ganesh and Anca Nitulescu and Eduardo Soria-Vazquez. 2021.
26
109.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.
26
110.On the efficiency of privacy-preserving smart contract systems Baghery, Karim. 2019.
25
111.Transparent Polynomial Commitment Scheme with Polylogarithmic Communication Complexity Alexander Vlasov and Konstantin Panarin. 2019.
23
112.On cycles of pairing-friendly elliptic curves Chiesa, Alessandro and Chua, Lynn and Weidner, Matthew. 2019.
23
113.SNARKpack: Practical SNARK Aggregation Nicolas Gailly and Mary Maller and Anca Nitulescu. 2021.
22
114.An Algebraic Framework for Universal and Updatable SNARKs Carla Ràfols and Arantxa Zapico. 2021.  
22
115.Simulation Extractability in Groth’s zk-SNARK Atapoor, Shahla and Baghery, Karim. 2019.
21
116.Updateable Inner Product Argument with Logarithmic Verifier and Applications Daza, Vanesa and R\`afols, Carla and Zacharakis, Alexandros. 2020.
21
117.SPARKs: Succinct Parallelizable Arguments of Knowledge Naomi Ephraim and Cody Freitag and Ilan Komargodski and Rafael Pass. 2020.
21
118.VERI-ZEXE: Decentralized private computation with universal setup Xiong, Alex Luoyuan and Chen, Binyi and Zhang, Zhenfei and B\"unz, Benedikt and Fisch, Ben and Krell, Fernando and Camacho, Philippe. 2022.
20
119.Experimenting with Collaborative $\{$zk-SNARKs$\}$:$\{$Zero-Knowledge$\}$ Proofs for Distributed Secrets Ozdemir, Alex and Boneh, Dan. 2022.
20
120.A survey of elliptic curves for proof systems Aranha, Diego F and El Housni, Youssef and Guillevic, Aurore. 2022.
20
121.A Subversion-Resistant SNARK Behzad Abdolmaleki and Karim Baghery and Helger Lipmaa and Michal Zajac. 2017.   
19
122.Subversion-Resistant Simulation (Knowledge) Sound NIZKs Karim Baghery. 2019.
19
123.Shorter and Faster Post-Quantum Designated-Verifier zkSNARKs from Lattices Yuval Ishai and Hang Su and David J. Wu. 2021.
19
124.SAVER: Snark-friendly, Additively-homomorphic, and Verifiable Encryption and decryption with Rerandomization Jiwon Lee and Jaekyoung Choi and Jihye Kim and Hyunok Oh. 2019.
18
125.Simulation Extractable Versions of Groth’s zk-SNARK Revisited Karim Baghery and Zaira Pindado and Carla Ràfols. 2020.
18
126.Families of SNARK-friendly 2-chains of elliptic curves El Housni, Youssef and Guillevic, Aurore. 2021.
18
127.cq: Cached quotients for fast lookups Liam Eagen and Dario Fiore and Ariel Gabizon. 2022.
18
128.On the (In)security of Kilian-Based SNARGs James Bartusek and Liron Bronfman and Justin Holmgren and Fermi Ma and Ron Rothblum. 2019.
17
129.Plumo: Towards Scalable Interoperable Blockchains Using Ultra Light Validation Systems Gabizon, Ariel and Gurkan, Kobi and Jovanovic, Philipp and Konstantopoulos, Georgios and Oines, Asa and Olszewski, Marek and Straka, Michael and Tromer, Eran. 2020.   
17
130.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.
17
131.SIMS : Self Sovereign Identity Management System with Preserving Privacy in Blockchain Jeonghyuk Lee and Jungyeon Hwang and Jaekyung Choi and Hyunok Oh and Jihye Kim. 2019.
16
132.Efficient Non-Interactive Zero-Knowledge Proofs in Cross-Domains Without Trusted Setup Backes, Michael and Hanzlik, Lucjan and Herzberg, Amir and Kate, Aniket and Pryvalov, Ivan. 2019.
15
133.Practical Witness-Key-Agreement for Blockchain-based Dark Pools Financial Trading Ngo, Chan Nam and Massacci, Fabio and Kerschbaum, Florian and Williams, Julian. 2021.
15
134.Caulk+: Table-independent lookup arguments Jim Posen and Assimakis A. Kattis. 2022.
15
135.A Note on the Unsoundness of vnTinyRAM's SNARK. Parno, Bryan. 2015.
14
136.Lattice-Based Zero-Knowledge SNARGs for Arithmetic Circuits Nitulescu, Anca. 2019.
14
137.Formal security analysis of MPC-in-the-head zero-knowledge protocols Nikolaj Sidorenco and Sabine Oechsner and Bas Spitters. 2021.
14
138.Distributed Auditing Proofs of Liabilities Konstantinos Chalkias and Kevin Lewi and Payman Mohassel and Valeria Nikolaenko. 2020.
13
139.Baloo: Nearly Optimal Lookup Arguments Zapico, Arantxa and Gabizon, Ariel and Khovratovich, Dmitry and Maller, Mary and R\`afols, Carla. 2022.
13
140.Verifiable computing applications in blockchain \vSimuni\'c, Silvio and Bernaca, Dalen and Lenac, Kristijan. 2021.
13
141.A Direct Construction for Asymptotically Optimal zkSNARKs Abhiram Kothapalli and Elisaweta Masserova and Bryan Parno. 2020.
12
142.Counting Vampires: From Univariate Sumcheck to Updatable ZK-SNARK Helger Lipmaa and Janno Siim and Michal Zajac. 2022.
12
143.SuperNova: Proving universal machine executions without universal circuits Abhiram Kothapalli and Srinath Setty. 2022.
12
144.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.
12
145.zk-SNARKs: A Gentle Introduction Nitulescu, Anca. 2019.
11
146.Linear-time zero-knowledge SNARKs for R1CS Jonathan Lee and Srinath Setty and Justin Thaler and Riad Wahby. 2021.
11
147.Reinforced Concrete: Fast Hash Function for Zero Knowledge Proofs and Verifiable Computation Barbara, Mario and Grassi, Lorenzo and Khovratovich, Dmitry and L\"uftenegger, Reinhard and Rechberger, Christian and Schofnegger, Markus and Walch, Roman. 2021.
11
148.Multivariate lookups based on logarithmic derivatives Ulrich Haböck. 2022.
11
149.Mining for Privacy: How to Bootstrap a Snarky Blockchain Thomas Kerber and Aggelos Kiayias and Markulf Kohlweiss. 2020.
10
150.Succinct functional commitment for a large class of arithmetic circuits Lipmaa, Helger and Pavlyk, Kateryna. 2020.
10
151.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.
10
152.Powers-of-Tau to the People: Decentralizing Setup Ceremonies Nikolaenko, Valeria and Ragsdale, Sam and Bonneau, Joseph and Boneh, Dan. 2022.
10
153.Tiramisu: Black-Box Simulation Extractable NIZKs in the Updatable CRS Model Karim Baghery and Mahdi Sedaghat. 2020.
9
154.BooLigero: Improved Sublinear Zero Knowledge Proofs for Boolean Circuits Yaron Gvili and Sarah Scheffler and Mayank Varia. 2021.  
9
155.Bandersnatch: a fast elliptic curve built over the BLS12-381 scalar field Simon Masson and Antonio Sanso and Zhenfei Zhang. 2021.
9
156.flookup: Fractional decomposition-based lookups in quasi-linear time independent of table size Ariel Gabizon and Dmitry Khovratovich. 2022.
9
157.Composition with Knowledge Assumptions Thomas Kerber and Aggelos Kiayias and Markulf Kohlweiss. 2021.
8
158.Scalable and privacy-preserving off-chain computations Eberhardt, Jacob. 2021.
8
159.Efficient Functional Commitments: How to Commit to Private Functions Dan Boneh and Wilson Nguyen and Alex Ozdemir. 2021.
8
160.ZPiE: Zero-knowledge Proofs in Embedded systems Xavier Salleras and Vanesa Daza. 2021.
8
161.A Review of zk-SNARKs Chen, Thomas and Lu, Hui and Kunpittaya, Teeramet and Luo, Alan. 2022.
8
162.Verifiable Fully Homomorphic Encryption Viand, Alexander and Knabenhans, Christian and Hithnawi, Anwar. 2023.
8
163.Faster Subgroup Checks for BLS12-381 Bowe, Sean. 2019.
7
164.Polynomial IOPs for Linear Algebra Relations Alan Szepieniec. 2020.
7
165.Manta: a Plug and Play Private DeFi Stack Shumo Chu and Yu Xia and Zhenfei Zhang. 2021.
7
166.Short-lived zero-knowledge proofs and signatures Arasu Arun and Joseph Bonneau and Jeremy Clark. 2022.
7
167.Witness-Succinct Universally-Composable SNARKs Ganesh, Chaya and Kondi, Yashvanth and Orlandi, Claudio and Pancholi, Mahak and Takahashi, Akira and Tschudi, Daniel. 2022.
7
168.Spartan and Bulletproofs are simulation-extractable (for free!) Quang Dao and Paul Grubbs. 2023.
7
169.ON DEPLOYING SUCCINCT ZERO-KNOWLEDGE PROOFS Madars Virza. 2017.
6
170.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.   
6
171.Verifiable state machines: Proofs that untrusted services operate correctly Srinath Setty and Sebastian Angel and Jonathan Lee. 2020.
6
172.Efficient Isogeny Proofs Using Generic Techniques Kelong Cong and Yi-Fu Lai and Shai Levin. 2023.
6
173.SoK: Lifting Transformations for Simulation Extractable Subversion and Updatable SNARKs⋆ Abdolmaleki, Behzad and Ramacher, Sebastian and Slamanig, Daniel. 2020.
5
174.Proposal: The Turbo-PLONK program syntax for specifying SNARK programs Ariel Gabizon and Zachary J. Williamson. 2020.   
5
175.Barriers for Succinct Arguments in the Random Oracle Model Alessandro Chiesa and Eylon Yogev. 2020.
5
176.Unbounded Simulation-Sound Subversion Resistant Quasi-Adaptive NIZK Proofs and Applications to Modular zk-SNARKs Behzad Abdolmaleki and Daniel Slamanig. 2020.
4
177.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.
4
178.Dispute-free Scalable Open Vote Network using zk-SNARKs ElSheikh, Muhammad and Youssef, Amr M. 2022.
4
179.On Succinct Non-Interactive Arguments in Relativized Worlds Chen, Megan and Chiesa, Alessandro and Spooner, Nicholas. 2022.
4
180.Succinct Zero Knowledge for Floating Point Computations Garg, Sanjam and Jain, Abhishek and Jin, Zhengzhong and Zhang, Yinuo. 2022.
4
181.Curve Trees: Practical and Transparent Zero-Knowledge Accumulators Matteo Campanelli and Mathias Hall-Andersen and Simon Holmgaard Kamp. 2022.
4
182.Vortex : Building a Lattice-based SNARK scheme with Transparent Setup Alexandre Belling and Azam Soleimanian. 2022.
4
183.Weak Fiat-Shamir Attacks on Modern Proof Systems Quang Dao and Jim Miller and Opal Wright and Paul Grubbs. 2023.
4
184.Publicly Verifiable Zero Knowledge from (Collapsing) Blockchains Scafuro, Alessandra and Siniscalchi, Luisa and Visconti, Ivan. 2020.
3
185.fflonk: a Fast-Fourier inspired verifier efficient version of PlonK Ariel Gabizon and Zachary J. Williamson. 2021.
3
186.Proofs of discrete logarithm equality across groups Melissa Chase and Michele Orrù and Trevor Perrin and Greg Zaverucha. 2022.
3
187.$\mu$Cash: Transparent Anonymous Transactions Liam Eagen. 2022.
3
188.Linear-map Vector Commitments and their Practical Applications Matteo Campanelli and Anca Nitulescu and Carla Ràfols and Alexandros Zacharakis and Arantxa Zapico. 2022.
3
189.Lattice-based succinct arguments from vanishing polynomials Cini, Valerio and Lai, Russell WF and Malavolta, Giulio. 2023.
3
190.Succinct Diophantine-Satisfiability Arguments Patrick Towa and Damien Vergnaud. 2020.
2
191.Towards Accountability in CRS Generation Ananth, Prabhanjan and Asharov, Gilad and Dahari, Hila and Goyal, Vipul. 2021.
2
192.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.
2
193.Revisiting the Nova Proof System on a Cycle of Curves Wilson Nguyen and Dan Boneh and Srinath Setty. 2023.
2
194.$\mathsf{zkSaaS}$: Zero-Knowledge SNARKs as a Service Sanjam Garg and Aarushi Goel and Abhishek Jain and Guru-Vamsi Policharla and Sruthi Sekar. 2023.
2
195.The Arithmetic of Pairing-Based Proof Systems El Housni, Youssef. 2022.
2
196.Mapping finite state machines to zk-SNARKS Using Category Theory Genovese, Fabrizio and Knispel, Andre and Fitzgerald, Joshua. 2019.
1
197.Baby SNARK (do do dodo dodo) Andrew Miller and Ye Zhang and Sanket Kanjalkar. 2020.  
1
198.Community Proposal: A Benchmarking Framework for (Zero-Knowledge) Proof Systems Benarroch, Daniel and Nicolas, Aur\'elien and Thaler, Justin and Tromer, Eran. 2020.
1
199.ZKProof Community Reference ZKProofStandards. 2019.
1
200.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.   
1
201.Folding Schemes with Selective Verification Carla Ràfols and Alexandros Zacharakis. 2022.
1
202.Revisiting cycles of pairing-friendly elliptic curves Marta Bellés-Muñoz and Jorge Jiménez Urroz and Javier Silva. 2022.
1
203.Plonkup scheme with multiple queries Alexandr Bulkin and Tim Dokchitser. 2023.
1
204.Universally Composable NIZKs: Circuit-Succinct, Non-Malleable and CRS-Updatable Behzad Abdolmaleki and Noemi Glaeser and Sebastian Ramacher and Daniel Slamanig. 2023.
1
205.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.
1
206.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.
1
207.Formalizing Soundness Proofs of SNARKs Bolton Bailey and Andrew Miller. 2023.
1
208.Zeromorph: Zero-Knowledge Multilinear-Evaluation Proofs from Homomorphic Univariate Commitments Tohru Kohrita and Patrick Towa. 2023.
1
209.MUXProofs: Succinct Arguments for Machine Computation from Tuple Lookups Zijing Di and Lucas Xia and Wilson Nguyen and Nirvan Tyagi. 2023.
1
210.Jolt: SNARKs for Virtual Machines via Lookups Arasu Arun and Srinath Setty and Justin Thaler. 2023.
1
211.Unlocking the lookup singularity with Lasso Srinath Setty and Justin Thaler and Riad Wahby. 2023.
1
212.Practical Zero-Knowledge Arguments from Structured Reference Strings Maller, Mary. 2019.
0
213.State of the Art in Verifiable Computation Khovratovich, Dmitry. 2018.
0
214.Off-chaining models and approaches to off-chain computations Eberhardt, Jacob and Heiss, Jonathan. 2018.
0
215.OCEAN: A Built-In Replacement for Mining Pools Raymond Chee and Kartik Chitturi and Edouard Dufour-Sans and Kyle Soska. 2019.
0
216.Updatable CRS Simulation-Extractable zk-SNARKs with a Single Verification Kim, Jihye and Lee, Jiwon and Oh, Hyunok. 2019.
0
217.On Privacy Preserving Blockchains and zk-SNARKs Atapoor, Shahla. 2019.
0
218.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
219.Smart Contract With Secret Parameters Thiercelin, Marin and Cheng, Chen-Mou and Miyaji, Atsuko and Vaudenay, Serge. 2020.
0
220.TinyRAM Architecture Specification v2. 000 Chiesa, Eli Ben-Sasson Alessandro and Genkin, Daniel and Tromer, Eran and Virza, Madars. 2020.
0
221.A Simple Range Proof From Polynomial Commitments Dan Boneh and Ben Fisch and Ariel Gabizon and Zac Williamson. 2020.  
0
222.Decentralized reputation Tassos Dimitriou. 2020.
0
223.Groth16 SNARKs are Randomizable and (Weakly) Simulation Extractable Mikhail Volkhov and Markulf Kohlweiss. 2020.
0
224.Computation Verification for Noobs Riabzev, Michael and Ben-Sasson, Eli and Ishai, Yuval. 2019.
0
225.zk-SNARKs Analysis and Implementation on Ethereum Ballesteros Rodr\'\iguez, Alberto. 2020.
0
226.Succinct Non-Interactive Arguments for Arithmetic Circuits Spooner, Nicholas. 2020.
0
227.On Succinct Non-InteractiveZero-Knowledge Protocols UnderWeaker Trust Assumptions Behzad Abdolmaleki. 2020.
0
228.Zero-Knowledge Succinct Arguments with a Linear-Time Prover Jonathan Bootle and Alessandro Chiesa and Siqi Liu. 2020.
0
229.Unifying Compilers for SNARKs, SMT, and More Alex Ozdemir and Fraser Brown and Riad S. Wahby. 2020.
0
230.Halo 0.9: A Halo Protocol with Fully-Succinctness Lira Wang. 2020.
0
231.Succinct Publicly Verifiable Computation Alonso González and Alexandros Zacharakis. 2021.
0
232.Latus Incentive Scheme: Enabling Decentralization in Blockchains based on Recursive SNARKs Alberto Garoffolo and Dmytro Kaidalov and Roman Oliynykov. 2021.
0
233.On (Weak) Simulation-Extractability of Universal zkSNARKs Markulf Kohlweiss and Michał Zając. 2021.
0
234.ZK Contingent Payments for Trained Neural Networks Zhelei Zhou and Xinlei Cao and Jian Liu and Bingsheng Zhang and Kui Ren. 2021.
0
235.Sn{\aa}rkl: Somewhat Practical, Pretty Much Declarative Verifiable Computing in Haskell Stewart, Gordon and Merten, Samuel and Leland, Logan. 2018.
0
236.Aggregating hash-based signatures using STARKs Irakliy Khaburzaniya and Konstantinos Chalkias and Kevin Lewi and Harjasleen Malvai. 2021.
0
237.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.
0
238.Less is more: refinement proofs for probabilistic proofs Jiang, Kunming and Chait-Roth, Devora and DeStefano, Zachary and Walfish, Michael and Wies, Thomas. 2022.
0
239.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.
0
240.EdMSM: Multi-Scalar-Multiplication for recursive SNARKs and more Youssef EL Housni and Gautam Botrel. 2022.
0
241.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
242.CRS-Updatable Asymmetric Quasi-Adaptive NIZK Arguments Behzad Abdolmaleki and Daniel Slamanig. 2022.
0
243.BeeGees: stayin' alive in chained BFT Abraham, Ittai and Crooks, Natacha and Giridharan, Neil and Howard, Heidi and Suri-Payer, Florian. 2023.
0
244.Derecho: Privacy Pools with Proof-Carrying Disclosures Josh Beal and Ben Fisch. 2023.
0
245.UniPlonk: Plonk with Universal Verifier Shumo Chu and Brandon H. Gomes and Francisco Hernandez Iglesias and Todd Norton and Duncan Tebbs. 2023.
0
246.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.
0
247.SublonK: Sublinear Prover PlonK Arka Rai Choudhuri and Sanjam Garg and Aarushi Goel and Sruthi Sekar and Rohit Sinha. 2023.
0
248.On Soundness Notions for Interactive Oracle Proofs Alexander R. Block and Albert Garreta and Pratyush Ranjan Tiwari and Michał Zając. 2023.
0
249.Improved SNARK Frontend for Highly Repetitive Computations Sriram Sridhar and Yinuo Zhang. 2023.
0
250.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.
0
251.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.
0
252.Proof-Carrying Data from Multi-folding Schemes Zibo Zhou and Zongyang Zhang and Jin Dong. 2023.
0
253.Improving logarithmic derivative lookups using GKR Shahar Papini and Ulrich Haböck. 2023.
0
254.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.
0
255.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.
0
256.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.
0
257.Algebraic Group Model with Oblivious Sampling Helger Lipmaa and Roberto Parisella and Janno Siim. 2023.
0
258.Succinct Proofs and Linear Algebra Alex Evans and Guillermo Angeris. 2023.
0

Videos