Papers (189)

#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
1531
2.Pinocchio: Nearly practical verifiable computation Parno, Bryan and Howell, Jon and Gentry, Craig and Raykova, Mariana. 2013
879
3.Quadratic span programs and succinct NIZKs without PCPs Gennaro, Rosario and Gentry, Craig and Parno, Bryan and Raykova, Mariana. 2013
641
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
556
5.Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. Ben-Sasson, Eli and Chiesa, Alessandro and Tromer, Eran and Virza, Madars. 2014
460
6.Separating succinct non-interactive arguments from all falsifiable assumptions Gentry, Craig and Wichs, Daniel. 2011
395
7.On the size of pairing-based non-interactive arguments Groth, Jens. 2016
376
8.Succinct non-interactive arguments via linear interactive proofs Bitansky, Nir and Chiesa, Alessandro and Ishai, Yuval and Paneth, Omer and Ostrovsky, Rafail. 2013
273
9.Scalable, transparent, and post-quantum secure computational integrity Eli Ben-Sasson and Iddo Bentov and Yinon Horesh and Michael Riabzev. 2018
256
10.Recursive composition and bootstrapping for SNARKs and proof-carrying data Bitansky, Nir and Canetti, Ran and Chiesa, Alessandro and Tromer, Eran. 2013
247
11.Verifiable Delay Functions Dan Boneh, Joseph Bonneau, Benedikt Bünz, Ben Fisch. 2018
241
12.Scalable zero knowledge via cycles of elliptic curves Ben-Sasson, Eli and Chiesa, Alessandro and Tromer, Eran and Virza, Madars. 2017
217
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
209
14.Ligero: Lightweight sublinear arguments without a trusted setup Ames, Scott and Hazay, Carmit and Ishai, Yuval and Venkitasubramaniam, Muthuramakrishnan. 2017
201
15.Zcash protocol specification Hopwood, Daira and Bowe, Sean and Hornby, Taylor and Wilcox, Nathan. 2016
185
16.ZKBoo: Faster Zero-Knowledge for Boolean Circuits. Giacomelli, Irene and Madsen, Jesper and Orlandi, Claudio. 2016
172
17.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
165
18.Interactive oracle proofs Ben-Sasson, Eli and Chiesa, Alessandro and Spooner, Nicholas. 2016
153
19.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
149
20.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
143
21.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
141
22.Doubly-efficient zkSNARKs without trusted setup Riad S. Wahby and Ioanna Tzialla and abhi shelat and Justin Thaler and Michael Walfish. 2017
139
23.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
130
24.Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs Jens Groth and Mary Maller. 2017
117
25.Pinocchio coin Danezis, George and Fournet, Cedric and Kohlweiss, Markulf and Parno, Bryan. 2013
115
26.Square span programs with applications to succinct NIZK arguments Danezis, George and Fournet, C\'edric and Groth, Jens and Kohlweiss, Markulf. 2014
115
27.Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains Boneh, Dan and B\"unz, Benedikt and Fisch, Benjamin. 2018
109
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
108
29.Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes Lipmaa, Helger. 2013
104
30.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
103
31.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
103
32.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
103
33.The Algebraic Group Model and its Applications Georg Fuchsbauer and Eike Kiltz and Julian Loss. 2017
102
34.PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge Ariel Gabizon and Zachary J. Williamson and Oana Ciobotaru. 2019
96
35.Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation Xie, Tiacheng and Zhang, Jiaheng and Zhang, Yupeng and Papamanthou, Charalampos and Song, Dawn. 2019
91
36.ZoKrates - Scalable Privacy-Preserving Off-Chain Computations Jacob Eberhardt and Stefan Tai. 2018
90
37.Transparent SNARKs from DARK Compilers Benedikt Bünz and Ben Fisch and Alan Szepieniec. 2019
88
38.Accountable privacy for decentralized anonymous payments Garman, Christina and Green, Matthew and Miers, Ian. 2016
82
39.Subversion-zero-knowledge SNARKs Georg Fuchsbauer. 2017
74
40.Zexe: Enabling decentralized private computation Bowe, S and Chiesa, A and Green, M and Miers, I and Mishra, P and Wu, H. 2018
74
41.A Subversion-Resistant SNARK Behzad Abdolmaleki and Karim Baghery and Helger Lipmaa and Michal Zajac. 2017
70
42.Spartan: Efficient and general-purpose zkSNARKs without trusted setup Setty, Srinath. 2019
59
43.LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs Campanelli, Matteo and Fiore, Dario and Querol, Ana\"\is. 2019
51
44.Lattice-based SNARGs and their application to more efficient obfuscation Boneh, Dan and Ishai, Yuval and Sahai, Amit and Wu, David J. 2017
51
45.Recursive Proof Composition without aTrusted Setup Bowe, Sean Grigg, Jack Hopwood, Daira. 2019
48
46.Non-Interactive Zero-Knowledge Proofs for Composite Statements Shashank Agrawal and Chaya Ganesh and Payman Mohassel. 2018
47
47.Ouroboros Crypsinous: Privacy-Preserving Proof-of-Stake Kerber, Thomas and Kohlweiss, Markulf and Kiayias, Aggelos and Zikas, Vassilis. 2018
47
48.DIZK: A Distributed Zero-Knowledge Proof System Wu, Howard and Zheng, Wenting and Chiesa, Alessandro and Popa, Raluca Ada and Stoica, Ion. 2018
42
49.Quasi-linear size zero knowledge from linear-algebraic PCPs Ben-Sasson, Eli and Chiesa, Alessandro and Gabizon, Ariel and Virza, Madars. 2016
40
50.Off-chaining models and approaches to off-chain computations Eberhardt, Jacob and Heiss, Jonathan. 2018
39
51.xJsnark: a framework for efficient verifiable computation Kosba, Ahmed and Papamanthou, Charalampos and Shi, Elaine. 2018
38
52.Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof Jiaheng Zhang and Tiancheng Xie and Yupeng Zhang and Dawn Song. 2019
33
53.Fast and simple constant-time hashing to the BLS12-381 elliptic curve Wahby, Riad S and Boneh, Dan. 2019
33
54.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
32
55.Lattice-Based zk-SNARKs from Square Span Programs Gennaro, Rosario and Minelli, Michele and Nitulescu, Anca and Orr\`u, Michele. 2018
31
56.Succinct Arguments in the Quantum Random Oracle Model Alessandro Chiesa and Peter Manohar and Nicholas Spooner. 2019
31
57.Subvector commitments with application to succinct arguments Lai, Russell WF and Malavolta, Giulio. 2019
31
58.Decentralized reputation Tassos Dimitriou. 2020
30
59.Making Groth's zk-SNARK Simulation Extractable in the Random Oracle Model Sean Bowe and Ariel Gabizon. 2018
26
60.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
26
61.Simulation-Extractable SNARKs Revisited Lipmaa, Helger. 2019
24
62.Scaling Verifiable Computation Using Efficient Set Accumulators Alex Ozdemir and Riad S. Wahby and Dan Boneh. 2019
24
63.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
24
64.On the (in) security of SNARKs in the presence of oracles Fiore, Dario and Nitulescu, Anca. 2016
23
65.Pointproofs: Aggregating Proofs for Multiple Vector Commitments Sergey Gorbunov and Leonid Reyzin and Hoeteck Wee and Zhenfei Zhang. 2020
21
66.AuroraLight: Improved prover efficiency and SRS size in a Sonic-like system Gabizon, Ariel. 2019
19
67.Zendoo: a zk-SNARK Verifiable Cross-Chain Transfer Protocol Enabling Decoupled and Decentralized Sidechains Alberto Garoffolo and Dmytro Kaidalov and Roman Oliynykov. 2020
19
68.Coda: Decentralized Cryptocurrency at Scale Joseph Bonneau and Izaak Meckler and Vanishree Rao and Evan Shapiro. 2020
19
69.UC-Secure CRS Generation for SNARKs Behzad Abdolmaleki and Karim Baghery and Helger Lipmaa and Janno Siim and Michal Zajac. 2019
19
70.On cycles of pairing-friendly elliptic curves Chiesa, Alessandro and Chua, Lynn and Weidner, Matthew. 2019
18
71.On the security of the BCTV Pinocchio zk-SNARK variant Gabizon, Ariel. 2019
17
72.DEEP-FRI: Sampling Outside the Box Improves Soundness Eli Ben-Sasson and Lior Goldberg and Swastik Kopparty and Shubhangi Saraf. 2019
16
73.RedShift: Transparent SNARKs from List Polynomial Commitment IOPs Assimakis Kattis and Konstantin Panarin and Alexander Vlasov. 2019
14
74.Simulation Extractability in Groth’s zk-SNARK Atapoor, Shahla and Baghery, Karim. 2019
14
75.Lift-and-Shift: Obtaining Simulation Extractable Subversion and Updatable SNARKs Generically Bezhad Abdolmaleki and Sebastian Ramacher and Daniel Slamanig. 2020
14
76.Halo Infinite: Recursive zk-SNARKs from any Additive Polynomial Commitment Scheme Dan Boneh and Justin Drake and Ben Fisch and Ariel Gabizon. 2020
14
77.Public Accountability vs. Secret Laws: Can They Coexist?: A Cryptographic Proposal Goldwasser, Shafi and Park, Sunoo. 2017
13
78.TEX - A Securely Scalable Trustless Exchange Rami Khalil and Arthur Gervais and Guillaume Felley. 2019
13
79.On the efficiency of privacy-preserving smart contract systems Baghery, Karim. 2019
13
80.Proof-Carrying Data from Accumulation Schemes Benedikt Bünz and Alessandro Chiesa and Pratyush Mishra and Nicholas Spooner. 2020
13
81.A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge Jonathan Bootle and Vadim Lyubashevsky and Ngoc Khanh Nguyen and Gregor Seiler. 2020
13
82.Quarks: Quadruple-efficient transparent zkSNARKs Srinath Setty and Jonathan Lee. 2020
11
83.Dory: Efficient, Transparent arguments for Generalised Inner Products and Polynomial Commitments Jonathan Lee. 2020
11
84.Subversion-Resistant Simulation (Knowledge) Sound NIZKs Karim Baghery. 2019
10
85.Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition Youssef El Housni and Aurore Guillevic. 2020
10
86.Another look at extraction and randomization of Groth’s zk-SNARK Baghery, Karim and Kohlweiss, Markulf and Siim, Janno and Volkhov, Mikhail. 2020
10
87.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
9
88.On the (In)security of Kilian-Based SNARGs James Bartusek and Liron Bronfman and Justin Holmgren and Fermi Ma and Ron Rothblum. 2019
8
89.A Note on the Unsoundness of vnTinyRAM's SNARK. Parno, Bryan. 2015
8
90.Efficient polynomial commitment schemes for multiple points and polynomials Dan Boneh and Justin Drake and Ben Fisch and Ariel Gabizon. 2020
8
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
8
92.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
8
93.Proof of Necessary Work: Succinct State Verification with Fairness Guarantees Assimakis Kattis and Joseph Bonneau. 2020
7
94.MIRAGE: Succinct Arguments for Randomized Algorithms with Applications to Universal zk-SNARKs Ahmed Kosba and Dimitrios Papadopoulos and Charalampos Papamanthou and Dawn Song. 2020
7
95.zkRelay: Facilitating Sidechains using zkSNARK-based Chain-Relays Martin Westerkamp and Jacob Eberhardt. 2020
7
96.Mining for Privacy: How to Bootstrap a Snarky Blockchain Thomas Kerber and Aggelos Kiayias and Markulf Kohlweiss. 2020
7
97.plookup: A simplified polynomial protocol for lookup tables Ariel Gabizon and Zachary J. Williamson. 2020
7
98.Transparent Polynomial Commitment Scheme with Polylogarithmic Communication Complexity Alexander Vlasov and Konstantin Panarin. 2019
6
99.Updateable Inner Product Argument with Logarithmic Verifier and Applications Daza, Vanesa and R\`afols, Carla and Zacharakis, Alexandros. 2020
6
100.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
6
101.SPARKs: Succinct Parallelizable Arguments of Knowledge Naomi Ephraim and Cody Freitag and Ilan Komargodski and Rafael Pass. 2020
6
102.Linear-Time Arguments with Sublinear Verification from Tensor Codes Bootle, Jonathan and Chiesa, Alessandro and Groth, Jens. 2020
6
103.Non-Interactive Zero-Knowledge for Blockchain: A Survey Partala, Juha and Nguyen, Tri Hong and Pirttikangas, Susanna. 2020
6
104.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
5
105.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
5
106.Bulletproofs+: Shorter Proofs for Privacy-Enhanced Distributed Ledger Heewon Chung and Kyoohyung Han and Chanyang Ju and Myungsun Kim and Jae Hong Seo. 2020
5
107.Polynomial IOPs for Linear Algebra Relations Alan Szepieniec. 2020
5
108.Reducing Participation Costs via Incremental Verification for Ledger Systems Weikeng Chen and Alessandro Chiesa and Emma Dauterman and Nicholas P. Ward. 2020
5
109.ON DEPLOYING SUCCINCT ZERO-KNOWLEDGE PROOFS Madars Virza. 2017
4
110.Lattice-Based Zero-Knowledge SNARGs for Arithmetic Circuits Nitulescu, Anca. 2019
4
111.SoK: Lifting Transformations for Simulation Extractable Subversion and Updatable SNARKs⋆ Abdolmaleki, Behzad and Ramacher, Sebastian and Slamanig, Daniel. 2020
4
112.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
4
113.Verifiable state machines: Proofs that untrusted services operate correctly Srinath Setty and Sebastian Angel and Jonathan Lee. 2020
4
114.Doubly Efficient Interactive Proofs for General Arithmetic Circuits with Linear Prover Time Jiaheng Zhang and Weijie Wang and Yinuo Zhang and Yupeng Zhang. 2020
4
115.Composition with Knowledge Assumptions Thomas Kerber and Aggelos Kiayias and Markulf Kohlweiss. 2021
4
116.Unbounded Simulation-Sound Subversion Resistant Quasi-Adaptive NIZK Proofs and Applications to Modular zk-SNARKs Behzad Abdolmaleki and Daniel Slamanig. 2020
3
117.Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular Benarroch, Daniel and Campanelli, Matteo and Fiore, Dario and Gurkan, Kobi and Kolonelos, Dimitris. 2020
3
118.Zero-Knowledge Succinct Arguments with a Linear-Time Prover Jonathan Bootle and Alessandro Chiesa and Siqi Liu. 2020
3
119.Nova: Recursive Zero-Knowledge Arguments from Folding Schemes Abhiram Kothapalli and Srinath Setty and Ioanna Tzialla. 2021
3
120.Faster Subgroup Checks for BLS12-381 Bowe, Sean. 2019
2
121.On Subversion-Resistant SNARKs Behzad Abdolmaleki and Helger Lipmaa and Janno Siim and Michał Zając. 2020
2
122.Barriers for Succinct Arguments in the Random Oracle Model Alessandro Chiesa and Eylon Yogev. 2020
2
123.Publicly Verifiable Zero Knowledge from (Collapsing) Blockchains Scafuro, Alessandra and Siniscalchi, Luisa and Visconti, Ivan. 2020
2
124.Succinct functional commitment for a large class of arithmetic circuits Lipmaa, Helger and Pavlyk, Kateryna. 2020
2
125.Post-Quantum Succinct Arguments Chiesa, Alessandro and Ma, Fermi and Spooner, Nicholas and Zhandry, Mark. 2021
2
126.Mapping finite state machines to zk-SNARKS Using Category Theory Genovese, Fabrizio and Knispel, Andre and Fitzgerald, Joshua. 2019
1
127.Tiramisu: Black-Box Simulation Extractable NIZKs in the Updatable CRS Model Karim Baghery and Mahdi Sedaghat. 2020
1
128.Smart Contract With Secret Parameters Thiercelin, Marin and Cheng, Chen-Mou and Miyaji, Atsuko and Vaudenay, Serge. 2020
1
129.BooLigero: Improved Sublinear Zero Knowledge Proofs for Boolean Circuits Yaron Gvili and Sarah Scheffler and Mayank Varia. 2021
1
130.Rinocchio: SNARKs for Ring Arithmetic Chaya Ganesh and Anca Nitulescu and Eduardo Soria-Vazquez. 2021
1
131.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
1
132.Latus Incentive Scheme: Enabling Decentralization in Blockchains based on Recursive SNARKs Alberto Garoffolo and Dmytro Kaidalov and Roman Oliynykov. 2021
1
133.SNARKpack: Practical SNARK Aggregation Nicolas Gailly and Mary Maller and Anca Nitulescu. 2021
1
134.Manta: a Plug and Play Private DeFi Stack Shumo Chu and Yu Xia and Zhenfei Zhang. 2021
1
135.Cairo – a Turing-complete STARK-friendly CPU architecture Lior Goldberg and Shahar Papini and Michael Riabzev. 2021
1
136.Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model Sean Bowe and Ariel Gabizon and Ian Miers. 2017
0
137.Practical Zero-Knowledge Arguments from Structured Reference Strings Maller, Mary. 2019
0
138.Scalable Zero Knowledge with No Trusted Setup Ben-Sasson, Eli and Bentov, Iddo and Horesh, Yinon and Riabzev, Michael. 2019
0
139.Fractal: Post-Quantum and Transparent Recursive Proofs from Holography Alessandro Chiesa and Dev Ojha and Nicholas Spooner. 2019
0
140.State of the Art in Verifiable Computation Khovratovich, Dmitry. 2018
0
141.OCEAN: A Built-In Replacement for Mining Pools Raymond Chee and Kartik Chitturi and Edouard Dufour-Sans and Kyle Soska. 2019
0
142.Updatable CRS Simulation-Extractable zk-SNARKs with a Single Verification Kim, Jihye and Lee, Jiwon and Oh, Hyunok. 2019
0
143.SAVER: Snark-friendly, Additively-homomorphic, and Verifiable Encryption and decryption with Rerandomization Jiwon Lee and Jaekyoung Choi and Jihye Kim and Hyunok Oh. 2019
0
144.On Privacy Preserving Blockchains and zk-SNARKs Atapoor, Shahla. 2019
0
145.Baby SNARK (do do dodo dodo) Andrew Miller and Ye Zhang and Sanket Kanjalkar. 2020
0
146.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
147.Proposal: The Turbo-PLONK program syntax for specifying SNARK programs Ariel Gabizon and Zachary J. Williamson. 2020
0
148.Community Proposal: A Benchmarking Framework for (Zero-Knowledge) Proof Systems Benarroch, Daniel and Nicolas, Aur\'elien and Thaler, Justin and Tromer, Eran. 2020
0
149.Distributed Auditing Proofs of Liabilities Konstantinos Chalkias and Kevin Lewi and Payman Mohassel and Valeria Nikolaenko. 2020
0
150.ZKProof Community Reference ZKProofStandards. 2019
0
151.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
152.TinyRAM Architecture Specification v2. 000 Chiesa, Eli Ben-Sasson Alessandro and Genkin, Daniel and Tromer, Eran and Virza, Madars. 2020
0
153.Succinct Diophantine-Satisfiability Arguments Patrick Towa and Damien Vergnaud. 2020
0
154.A Simple Range Proof From Polynomial Commitments Dan Boneh and Ben Fisch and Ariel Gabizon and Zac Williamson. 2020
0
155.Groth16 SNARKs are Randomizable and (Weakly) Simulation Extractable Mikhail Volkhov and Markulf Kohlweiss. 2020
0
156.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
157.Computation Verification for Noobs Riabzev, Michael and Ben-Sasson, Eli and Ishai, Yuval. 2019
0
158.zk-SNARKs Analysis and Implementation on Ethereum Ballesteros Rodr\'\iguez, Alberto. 2020
0
159.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
160.Simulation Extractable Versions of Groth’s zk-SNARK Revisited Karim Baghery and Zaira Pindado and Carla Ràfols. 2020
0
161.Succinct Non-Interactive Arguments for Arithmetic Circuits Spooner, Nicholas. 2020
0
162.A Direct Construction for Asymptotically Optimal zkSNARKs Abhiram Kothapalli and Elisaweta Masserova and Bryan Parno. 2020
0
163.On Succinct Non-InteractiveZero-Knowledge Protocols UnderWeaker Trust Assumptions Behzad Abdolmaleki. 2020
0
164.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
165.zk-SNARKs: A Gentle Introduction Nitulescu, Anca. 2019
0
166.Unifying Compilers for SNARKs, SMT, and More Alex Ozdemir and Fraser Brown and Riad S. Wahby. 2020
0
167.Halo 0.9: A Halo Protocol with Fully-Succinctness Lira Wang. 2020
0
168.Linear-time zero-knowledge SNARKs for R1CS Jonathan Lee and Srinath Setty and Justin Thaler and Riad Wahby. 2021
0
169.Succinct Publicly Verifiable Computation Alonso González and Alexandros Zacharakis. 2021
0
170.Formal security analysis of MPC-in-the-head zero-knowledge protocols Nikolaj Sidorenco and Sabine Oechsner and Bas Spitters. 2021
0
171.Practical Witness-Key-Agreement for Blockchain-based Dark Pools Financial Trading Ngo, Chan Nam and Massacci, Fabio and Kerschbaum, Florian and Williams, Julian. 2021
0
172.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
0
173.On (Weak) Simulation-Extractability of Universal zkSNARKs Markulf Kohlweiss and Michał Zając. 2021
0
174.An Algebraic Framework for Universal and Updatable SNARKs Carla Ràfols and Arantxa Zapico. 2021
0
175.ZK Contingent Payments for Trained Neural Networks Zhelei Zhou and Xinlei Cao and Jian Liu and Bingsheng Zhang and Kui Ren. 2021
0
176.VCProof: Constructing Shorter and Faster-to-Verify zkSNARKs with Vector Oracles Yuncong Zhang and Ren Zhang and Geng Wang and Dawu Gu. 2021
0
177.Scalable and privacy-preserving off-chain computations Eberhardt, Jacob. 2021
0
178.Towards Accountability in CRS Generation Ananth, Prabhanjan and Asharov, Gilad and Dahari, Hila and Goyal, Vipul. 2021
0
179.Shorter and Faster Post-Quantum Designated-Verifier zkSNARKs from Lattices Yuval Ishai and Hang Su and David J. Wu. 2021
0
180.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
0
181.Sn{\aa}rkl: Somewhat Practical, Pretty Much Declarative Verifiable Computing in Haskell Stewart, Gordon and Merten, Samuel and Leland, Logan. 2018
0
182.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
0
183.Aggregating hash-based signatures using STARKs Irakliy Khaburzaniya and Konstantinos Chalkias and Kevin Lewi and Harjasleen Malvai. 2021
0
184.fflonk: a Fast-Fourier inspired verifier efficient version of PlonK Ariel Gabizon and Zachary J. Williamson. 2021
0
185.Bandersnatch: a fast elliptic curve built over the BLS12-381 scalar field Simon Masson and Antonio Sanso and Zhenfei Zhang. 2021
0
186.Efficient Functional Commitments: How to Commit to Private Functions Dan Boneh and Wilson Nguyen and Alex Ozdemir. 2021
0
187.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
0
188.Families of SNARK-friendly 2-chains of elliptic curves El Housni, Youssef and Guillevic, Aurore. 2021
0
189.ZPiE: Zero-knowledge Proofs in Embedded systems Xavier Salleras and Vanesa Daza. 2021
0

Videos