Papers (143)

#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  
1134
2.Pinocchio: Nearly practical verifiable computation Parno, Bryan and Howell, Jon and Gentry, Craig and Raykova, Mariana. 2013
688
3.Quadratic span programs and succinct NIZKs without PCPs Gennaro, Rosario and Gentry, Craig and Parno, Bryan and Raykova, Mariana. 2013
501
4.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  
441
5.Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. Ben-Sasson, Eli and Chiesa, Alessandro and Tromer, Eran and Virza, Madars. 2014
343
6.Separating succinct non-interactive arguments from all falsifiable assumptions Gentry, Craig and Wichs, Daniel. 2011  
339
7.Short pairing-based non-interactive zero-knowledge arguments Groth, Jens. 2010
331
8.On the size of pairing-based non-interactive arguments Groth, Jens. 2016  
224
9.Succinct non-interactive arguments via linear interactive proofs Bitansky, Nir and Chiesa, Alessandro and Ishai, Yuval and Paneth, Omer and Ostrovsky, Rafail. 2013
218
10.Recursive composition and bootstrapping for SNARKs and proof-carrying data Bitansky, Nir and Canetti, Ran and Chiesa, Alessandro and Tromer, Eran. 2013
210
11.Scalable zero knowledge via cycles of elliptic curves Ben-Sasson, Eli and Chiesa, Alessandro and Tromer, Eran and Virza, Madars. 2017  
174
12.Scalable, transparent, and post-quantum secure computational integrity Eli Ben-Sasson and Iddo Bentov and Yinon Horesh and Michael Riabzev. 2018   
169
13.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  
165
14.Verifiable Delay Functions Dan Boneh, Joseph Bonneau, Benedikt Bünz, Ben Fisch. 2018  
142
15.Zcash protocol specification Hopwood, Daira and Bowe, Sean and Hornby, Taylor and Wilcox, Nathan. 2016
129
16.Ligero: Lightweight sublinear arguments without a trusted setup Ames, Scott and Hazay, Carmit and Ishai, Yuval and Venkitasubramaniam, Muthuramakrishnan. 2017  
127
17.ZKBoo: Faster Zero-Knowledge for Boolean Circuits. Giacomelli, Irene and Madsen, Jesper and Orlandi, Claudio. 2016
122
18.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
117
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
114
20.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
113
21.Interactive oracle proofs Ben-Sasson, Eli and Chiesa, Alessandro and Spooner, Nicholas. 2016   
108
22.Pinocchio coin Danezis, George and Fournet, Cedric and Kohlweiss, Markulf and Parno, Bryan. 2013
104
23.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  
91
24.Square span programs with applications to succinct NIZK arguments Danezis, George and Fournet, C\'edric and Groth, Jens and Kohlweiss, Markulf. 2014  
88
25.Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes Lipmaa, Helger. 2013  
82
26.Doubly-efficient zkSNARKs without trusted setup Riad S. Wahby and Ioanna Tzialla and abhi shelat and Justin Thaler and Michael Walfish. 2017  
81
27.Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs Jens Groth and Mary Maller. 2017  
77
28.A multi-party protocol for constructing the public parameters of the Pinocchio zk-SNARK Bowe, Sean and Gabizon, Ariel and Green, Matthew D. 2018
75
29.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   
70
30.Accountable privacy for decentralized anonymous payments Garman, Christina and Green, Matthew and Miers, Ian. 2016
67
31.Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains Boneh, Dan and B\"unz, Benedikt and Fisch, Benjamin. 2018   
58
32.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
57
33.Subversion-zero-knowledge SNARKs Georg Fuchsbauer. 2017
56
34.A Subversion-Resistant SNARK Behzad Abdolmaleki and Karim Baghery and Helger Lipmaa and Michal Zajac. 2017  
53
35.Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model Sean Bowe and Ariel Gabizon and Ian Miers. 2017
51
36.Scalable Zero Knowledge with No Trusted Setup Ben-Sasson, Eli and Bentov, Iddo and Horesh, Yinon and Riabzev, Michael. 2019
46
37.ZoKrates - Scalable Privacy-Preserving Off-Chain Computations Jacob Eberhardt and Stefan Tai. 2018   
44
38.Zexe: Enabling decentralized private computation Bowe, S and Chiesa, A and Green, M and Miers, I and Mishra, P and Wu, H. 2018   
43
39.Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation Xie, Tiacheng and Zhang, Jiaheng and Zhang, Yupeng and Papamanthou, Charalampos and Song, Dawn. 2019   
42
40.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  
42
41.Lattice-based SNARGs and their application to more efficient obfuscation Boneh, Dan and Ishai, Yuval and Sahai, Amit and Wu, David J. 2017  
42
42.PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge Ariel Gabizon and Zachary J. Williamson and Oana Ciobotaru. 2019   
38
43.Transparent SNARKs from DARK Compilers Benedikt Bünz and Ben Fisch and Alan Szepieniec. 2019  
35
44.Quasi-linear size zero knowledge from linear-algebraic PCPs Ben-Sasson, Eli and Chiesa, Alessandro and Gabizon, Ariel and Virza, Madars. 2016
32
45.Non-Interactive Zero-Knowledge Proofs for Composite Statements Shashank Agrawal and Chaya Ganesh and Payman Mohassel. 2018  
26
46.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
25
47.LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs Campanelli, Matteo and Fiore, Dario and Querol, Ana\"\is. 2019  
24
48.Making Groth's zk-SNARK Simulation Extractable in the Random Oracle Model Sean Bowe and Ariel Gabizon. 2018
22
49.Lattice-Based zk-SNARKs from Square Span Programs Gennaro, Rosario and Minelli, Michele and Nitulescu, Anca and Orr\`u, Michele. 2018  
22
50.Ouroboros Crypsinous: Privacy-Preserving Proof-of-Stake Kerber, Thomas and Kohlweiss, Markulf and Kiayias, Aggelos and Zikas, Vassilis. 2018  
22
51.Fractal: Post-Quantum and Transparent Recursive Proofs from Holography Alessandro Chiesa and Dev Ojha and Nicholas Spooner. 2019   
22
52.DIZK: A Distributed Zero-Knowledge Proof System Wu, Howard and Zheng, Wenting and Chiesa, Alessandro and Popa, Raluca Ada and Stoica, Ion. 2018  
21
53.Off-chaining models and approaches to off-chain computations Eberhardt, Jacob and Heiss, Jonathan. 2018
21
54.Decentralized reputation Tassos Dimitriou. 2020
21
55.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
18
56.Spartan: Efficient and general-purpose zkSNARKs without trusted setup Setty, Srinath. 2019  
18
57.Simulation-Extractable SNARKs Revisited Lipmaa, Helger. 2019
18
58.On the (in) security of SNARKs in the presence of oracles Fiore, Dario and Nitulescu, Anca. 2016
18
59.xJsnark: a framework for efficient verifiable computation Kosba, Ahmed and Papamanthou, Charalampos and Shi, Elaine. 2018   
17
60.Halo: Recursive Proof Composition without aTrusted Setup Bowe, Sean Grigg, Jack Hopwood, Daira. 2019  
16
61.Subvector commitments with application to succinct arguments Lai, Russell WF and Malavolta, Giulio. 2019  
15
62.Succinct Arguments in the Quantum Random Oracle Model Alessandro Chiesa and Peter Manohar and Nicholas Spooner. 2019
14
63.On cycles of pairing-friendly elliptic curves Chiesa, Alessandro and Chua, Lynn and Weidner, Matthew. 2019
14
64.Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof Jiaheng Zhang and Tiancheng Xie and Yupeng Zhang and Dawn Song. 2019
13
65.Fast and simple constant-time hashing to the BLS12-381 elliptic curve Wahby, Riad S and Boneh, Dan. 2019  
13
66.UC-Secure CRS Generation for SNARKs Behzad Abdolmaleki and Karim Baghery and Helger Lipmaa and Janno Siim and Michal Zajac. 2019
11
67.On the security of the BCTV Pinocchio zk-SNARK variant Gabizon, Ariel. 2019
10
68.Coda: Decentralized Cryptocurrency at Scale Joseph Bonneau and Izaak Meckler and Vanishree Rao and Evan Shapiro. 2020  
10
69.Public Accountability vs. Secret Laws: Can They Coexist?: A Cryptographic Proposal Goldwasser, Shafi and Park, Sunoo. 2017  
9
70.On the efficiency of privacy-preserving smart contract systems Baghery, Karim. 2019
9
71.Subversion-Resistant Simulation (Knowledge) Sound NIZKs Karim Baghery. 2019
8
72.A Note on the Unsoundness of vnTinyRAM's SNARK. Parno, Bryan. 2015
8
73.Simulation Extractability in Groth’s zk-SNARK Atapoor, Shahla and Baghery, Karim. 2019
8
74.Scaling Verifiable Computation Using Efficient Set Accumulators Alex Ozdemir and Riad S. Wahby and Dan Boneh. 2019  
8
75.AuroraLight: Improved prover efficiency and SRS size in a Sonic-like system Gabizon, Ariel. 2019
7
76.Lift-and-Shift: Obtaining Simulation Extractable Subversion and Updatable SNARKs Generically Bezhad Abdolmaleki and Sebastian Ramacher and Daniel Slamanig. 2020
7
77.DEEP-FRI: Sampling Outside the Box Improves Soundness Eli Ben-Sasson and Lior Goldberg and Swastik Kopparty and Shubhangi Saraf. 2019  
7
78.TEX - A Securely Scalable Trustless Exchange Rami Khalil and Arthur Gervais and Guillaume Felley. 2019
6
79.On the (In)security of Kilian-Based SNARGs James Bartusek and Liron Bronfman and Justin Holmgren and Fermi Ma and Ron Rothblum. 2019
4
80.Updatable CRS Simulation-Extractable zk-SNARKs with a Single Verification Kim, Jihye and Lee, Jiwon and Oh, Hyunok. 2019
4
81.RedShift: Transparent SNARKs from List Polynomial Commitment IOPs Assimakis Kattis and Konstantin Panarin and Alexander Vlasov. 2019
4
82.ON DEPLOYING SUCCINCT ZERO-KNOWLEDGE PROOFS Madars Virza. 2017
3
83.MIRAGE: Succinct Arguments for Randomized Algorithms with Applications to Universal zk-SNARKs Ahmed Kosba and Dimitrios Papadopoulos and Charalampos Papamanthou and Dawn Song. 2020
3
84.Pointproofs: Aggregating Proofs for Multiple Vector Commitments Sergey Gorbunov and Leonid Reyzin and Hoeteck Wee and Zhenfei Zhang. 2020
3
85.Proof-Carrying Data from Accumulation Schemes Benedikt Bünz and Alessandro Chiesa and Pratyush Mishra and Nicholas Spooner. 2020  
3
86.Transparent Polynomial Commitment Scheme with Polylogarithmic Communication Complexity Alexander Vlasov and Konstantin Panarin. 2019
2
87.Lattice-Based Zero-Knowledge SNARGs for Arithmetic Circuits Nitulescu, Anca. 2019
2
88.SAVER: Snark-friendly, Additively-homomorphic, and Verifiable Encryption and decryption with Rerandomization Jiwon Lee and Jaekyoung Choi and Jihye Kim and Hyunok Oh. 2019
2
89.Proof of Necessary Work: Succinct State Verification with Fairness Guarantees Assimakis Kattis and Joseph Bonneau. 2020
2
90.Zendoo: a zk-SNARK Verifiable Cross-Chain Transfer Protocol Enabling Decoupled and Decentralized Sidechains Alberto Garoffolo and Dmytro Kaidalov and Roman Oliynykov. 2020
2
91.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  
2
92.SoK: Lifting Transformations for Simulation Extractable Subversion and Updatable SNARKs⋆ Abdolmaleki, Behzad and Ramacher, Sebastian and Slamanig, Daniel. 2020
2
93.Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition Youssef El Housni and Aurore Guillevic. 2020  
2
94.plookup: A simplified polynomial protocol for lookup tables Ariel Gabizon and Zachary J. Williamson. 2020
2
95.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   
2
96.A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge Jonathan Bootle and Vadim Lyubashevsky and Ngoc Khanh Nguyen and Gregor Seiler. 2020
2
97.Verifiable state machines: Proofs that untrusted services operate correctly Srinath Setty and Sebastian Angel and Jonathan Lee. 2020
2
98.Faster Subgroup Checks for BLS12-381 Bowe, Sean. 2019
1
99.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
1
100.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
1
101.Efficient polynomial commitment schemes for multiple points and polynomials Dan Boneh and Justin Drake and Ben Fisch and Ariel Gabizon. 2020
1
102.zkRelay: Facilitating Sidechains using zkSNARK-based Chain-Relays Martin Westerkamp and Jacob Eberhardt. 2020
1
103.Mining for Privacy: How to Bootstrap a Snarky Blockchain Thomas Kerber and Aggelos Kiayias and Markulf Kohlweiss. 2020
1
104.Updateable Inner Product Argument with Logarithmic Verifier and Applications Daza, Vanesa and R\`afols, Carla and Zacharakis, Alexandros. 2020
1
105.Unbounded Simulation-Sound Subversion Resistant Quasi-Adaptive NIZK Proofs and Applications to Modular zk-SNARKs Behzad Abdolmaleki and Daniel Slamanig. 2020
1
106.SPARKs: Succinct Parallelizable Arguments of Knowledge Naomi Ephraim and Cody Freitag and Ilan Komargodski and Rafael Pass. 2020
1
107.Dory: Efficient, Transparent arguments for Generalised Inner Products and Polynomial Commitments Jonathan Lee. 2020
1
108.Practical Zero-Knowledge Arguments from Structured Reference Strings Maller, Mary. 2019
0
109.State of the Art in Verifiable Computation Khovratovich, Dmitry. 2018
0
110.OCEAN: A Built-In Replacement for Mining Pools Raymond Chee and Kartik Chitturi and Edouard Dufour-Sans and Kyle Soska. 2019
0
111.Mapping finite state machines to zk-SNARKS Using Category Theory Genovese, Fabrizio and Knispel, Andre and Fitzgerald, Joshua. 2019
0
112.On Privacy Preserving Blockchains and zk-SNARKs Atapoor, Shahla. 2019
0
113.Baby SNARK (do do dodo dodo) Andrew Miller and Ye Zhang and Sanket Kanjalkar. 2020  
0
114.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
115.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  
0
116.Tiramisu: Black-Box Simulation Extractable NIZKs in the Updatable CRS Model Karim Baghery and Mahdi Sedaghat. 2020
0
117.Proposal: The Turbo-PLONK program syntaxfor specifying SNARK programs Ariel Gabizon and Zachary J. Williamson. 2020  
0
118.Community Proposal: A Benchmarking Framework for (Zero-Knowledge) Proof Systems Benarroch, Daniel and Nicolas, Aur\'elien and Thaler, Justin and Tromer, Eran. 2020
0
119.Distributed Auditing Proofs of Liabilities Konstantinos Chalkias and Kevin Lewi and Payman Mohassel and Valeria Nikolaenko. 2020
0
120.ZKProof Community Reference ZKProofStandards. 2019
0
121.Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular Benarroch, Daniel and Campanelli, Matteo and Fiore, Dario and Gurkan, Kobi and Kolonelos, Dimitris. 2020  
0
122.On Subversion-Resistant SNARKs Behzad Abdolmaleki and Helger Lipmaa and Janno Siim and Michał Zając. 2020
0
123.Smart Contract With Secret Parameters Thiercelin, Marin and Cheng, Chen-Mou and Miyaji, Atsuko and Vaudenay, Serge. 2020
0
124.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   
0
125.TinyRAM Architecture Specification v2. 000 Chiesa, Eli Ben-Sasson Alessandro and Genkin, Daniel and Tromer, Eran and Virza, Madars. 2020
0
126.Succinct Diophantine-Satisfiability Arguments Patrick Towa and Damien Vergnaud. 2020
0
127.Bulletproofs+: Shorter Proofs for Privacy-Enhanced Distributed Ledger Heewon Chung and Kyoohyung Han and Chanyang Ju and Myungsun Kim and Jae Hong Seo. 2020
0
128.A Simple Range Proof From Polynomial Commitments Dan Boneh and Ben Fisch and Ariel Gabizon and Zac Williamson. 2020  
0
129.Groth16 SNARKs are Randomizable and (Weakly) Simulation Extractable Mikhail Volkhov and Markulf Kohlweiss. 2020
0
130.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
131.Computation Verification for Noobs Riabzev, Michael and Ben-Sasson, Eli and Ishai, Yuval. 2019
0
132.zk-SNARKs Analysis and Implementation on Ethereum Ballesteros Rodr\'\iguez, Alberto. 2020
0
133.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
0
134.Polynomial IOPs for Linear Algebra Relations Alan Szepieniec. 2020
0
135.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
0
136.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
0
137.Quarks: Quadruple-efficient transparent zkSNARKs Srinath Setty and Jonathan Lee. 2020
0
138.Simulation Extractable Versions of Groth’s zk-SNARK Revisited Karim Baghery and Zaira Pindado and Carla Ràfols. 2020
0
139.Succinct Non-Interactive Arguments for Arithmetic Circuits Spooner, Nicholas. 2020
0
140.Doubly Efficient Interactive Proofs for General Arithmetic Circuits with Linear Prover Time Jiaheng Zhang and Weijie Wang and Yinuo Zhang and Yupeng Zhang. 2020
0
141.A Direct Construction for Asymptotically Optimal zkSNARKs Abhiram Kothapalli and Elisaweta Masserova and Bryan Parno. 2020
0
142.On Succinct Non-InteractiveZero-Knowledge Protocols UnderWeaker Trust Assumptions Behzad Abdolmaleki. 2020
0
143.Ligero++: A New Optimized Sublinear IOP Bhadauria, Rishabh and Fang, Zhiyong and Hazay, Carmit and Venkitasubramaniam, Muthuramakrishnan and Xie, Tiancheng and Zhang, Yupeng. 2020
0

Videos