Papers (60)

#Title
Citations
1.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.
192
2.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.
139
3.Zendoo: a zk-SNARK Verifiable Cross-Chain Transfer Protocol Enabling Decoupled and Decentralized Sidechains Alberto Garoffolo and Dmytro Kaidalov and Roman Oliynykov. 2020.
126
4.Dory: Efficient, Transparent arguments for Generalised Inner Products and Polynomial Commitments Jonathan Lee. 2020.
123
5.plookup: A simplified polynomial protocol for lookup tables Ariel Gabizon and Zachary J. Williamson. 2020.
121
6.Pointproofs: Aggregating Proofs for Multiple Vector Commitments Sergey Gorbunov and Leonid Reyzin and Hoeteck Wee and Zhenfei Zhang. 2020.
117
7.Coda: Decentralized Cryptocurrency at Scale Joseph Bonneau and Izaak Meckler and Vanishree Rao and Evan Shapiro. 2020.
104
8.Ligero++: A New Optimized Sublinear IOP Bhadauria, Rishabh and Fang, Zhiyong and Hazay, Carmit and Venkitasubramaniam, Muthuramakrishnan and Xie, Tiancheng and Zhang, Yupeng. 2020.
102
9.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.
91
10.Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular Benarroch, Daniel and Campanelli, Matteo and Fiore, Dario and Gurkan, Kobi and Kolonelos, Dimitris. 2020.
84
11.Non-Interactive Zero-Knowledge for Blockchain: A Survey Partala, Juha and Nguyen, Tri Hong and Pirttikangas, Susanna. 2020.
83
12.A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge Jonathan Bootle and Vadim Lyubashevsky and Ngoc Khanh Nguyen and Gregor Seiler. 2020.
77
13.Quarks: Quadruple-efficient transparent zkSNARKs Srinath Setty and Jonathan Lee. 2020.
74
14.Linear-Time Arguments with Sublinear Verification from Tensor Codes Bootle, Jonathan and Chiesa, Alessandro and Groth, Jens. 2020.
74
15.Efficient polynomial commitment schemes for multiple points and polynomials Dan Boneh and Justin Drake and Ben Fisch and Ariel Gabizon. 2020.
72
16.Doubly Efficient Interactive Proofs for General Arithmetic Circuits with Linear Prover Time Jiaheng Zhang and Weijie Wang and Yinuo Zhang and Yupeng Zhang. 2020.
67
17.Another look at extraction and randomization of Groth’s zk-SNARK Baghery, Karim and Kohlweiss, Markulf and Siim, Janno and Volkhov, Mikhail. 2020.
67
18.Proof-Carrying Data from Accumulation Schemes Benedikt Bünz and Alessandro Chiesa and Pratyush Mishra and Nicholas Spooner. 2020.
66
19.zkRelay: Facilitating Sidechains using zkSNARK-based Chain-Relays Martin Westerkamp and Jacob Eberhardt. 2020.
64
20.Lift-and-Shift: Obtaining Simulation Extractable Subversion and Updatable SNARKs Generically Bezhad Abdolmaleki and Sebastian Ramacher and Daniel Slamanig. 2020.
56
21.MIRAGE: Succinct Arguments for Randomized Algorithms with Applications to Universal zk-SNARKs Ahmed Kosba and Dimitrios Papadopoulos and Charalampos Papamanthou and Dawn Song. 2020.
53
22.Halo Infinite: Recursive zk-SNARKs from any Additive Polynomial Commitment Scheme Dan Boneh and Justin Drake and Ben Fisch and Ariel Gabizon. 2020.
49
23.Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition Youssef El Housni and Aurore Guillevic. 2020.
44
24.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.
41
25.Reducing Participation Costs via Incremental Verification for Ledger Systems Weikeng Chen and Alessandro Chiesa and Emma Dauterman and Nicholas P. Ward. 2020.
41
26.Updateable Inner Product Argument with Logarithmic Verifier and Applications Daza, Vanesa and R\`afols, Carla and Zacharakis, Alexandros. 2020.
39
27.Proof of Necessary Work: Succinct State Verification with Fairness Guarantees Assimakis Kattis and Joseph Bonneau. 2020.
35
28.Simulation Extractable Versions of Groth’s zk-SNARK Revisited Karim Baghery and Zaira Pindado and Carla Ràfols. 2020.
35
29.SPARKs: Succinct Parallelizable Arguments of Knowledge Naomi Ephraim and Cody Freitag and Ilan Komargodski and Rafael Pass. 2020.
28
30.On Subversion-Resistant SNARKs Behzad Abdolmaleki and Helger Lipmaa and Janno Siim and Michał Zając. 2020.
23
31.Distributed Auditing Proofs of Liabilities Konstantinos Chalkias and Kevin Lewi and Payman Mohassel and Valeria Nikolaenko. 2020.
22
32.Succinct functional commitment for a large class of arithmetic circuits Lipmaa, Helger and Pavlyk, Kateryna. 2020.
22
33.A Direct Construction for Asymptotically Optimal zkSNARKs Abhiram Kothapalli and Elisaweta Masserova and Bryan Parno. 2020.
21
34.Tiramisu: Black-Box Simulation Extractable NIZKs in the Updatable CRS Model Karim Baghery and Mahdi Sedaghat. 2020.
20
35.Zero-Knowledge Succinct Arguments with a Linear-Time Prover Jonathan Bootle and Alessandro Chiesa and Siqi Liu. 2020.
20
36.Polynomial IOPs for Linear Algebra Relations Alan Szepieniec. 2020.
19
37.Mining for Privacy: How to Bootstrap a Snarky Blockchain Thomas Kerber and Aggelos Kiayias and Markulf Kohlweiss. 2020.
18
38.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.
18
39.Decentralized reputation Tassos Dimitriou. 2020.
16
40.Proposal: The Turbo-PLONK program syntax for specifying SNARK programs Ariel Gabizon and Zachary J. Williamson. 2020.
11
41.Barriers for Succinct Arguments in the Random Oracle Model Alessandro Chiesa and Eylon Yogev. 2020.
8
42.SoK: Lifting Transformations for Simulation Extractable Subversion and Updatable SNARKs⋆ Abdolmaleki, Behzad and Ramacher, Sebastian and Slamanig, Daniel. 2020.
6
43.Verifiable state machines: Proofs that untrusted services operate correctly Srinath Setty and Sebastian Angel and Jonathan Lee. 2020.
6
44.Baby SNARK (do do dodo dodo) Andrew Miller and Ye Zhang and Sanket Kanjalkar. 2020.
5
45.Publicly Verifiable Zero Knowledge from (Collapsing) Blockchains Scafuro, Alessandra and Siniscalchi, Luisa and Visconti, Ivan. 2020.
5
46.Unifying Compilers for SNARKs, SMT, and More Alex Ozdemir and Fraser Brown and Riad S. Wahby. 2020.
5
47.Community Proposal: A Benchmarking Framework for (Zero-Knowledge) Proof Systems Benarroch, Daniel and Nicolas, Aur\'elien and Thaler, Justin and Tromer, Eran. 2020.
4
48.Unbounded Simulation-Sound Subversion Resistant Quasi-Adaptive NIZK Proofs and Applications to Modular zk-SNARKs Behzad Abdolmaleki and Daniel Slamanig. 2020.
4
49.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
50.Succinct Diophantine-Satisfiability Arguments Patrick Towa and Damien Vergnaud. 2020.
3
51.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.
2
52.Multi-Shard Private Transactions for Permissioned Blockchains Androulaki, Elli and De Caro, Angelo and Elkhiyaoui, Kaoutar and Gorenflo, Christian and Sorniotti, Alessandro and Vukolic, Marko. 2020.
1
53.Smart Contract With Secret Parameters Thiercelin, Marin and Cheng, Chen-Mou and Miyaji, Atsuko and Vaudenay, Serge. 2020.
0
54.TinyRAM Architecture Specification v2. 000 Chiesa, Eli Ben-Sasson Alessandro and Genkin, Daniel and Tromer, Eran and Virza, Madars. 2020.
0
55.A Simple Range Proof From Polynomial Commitments Dan Boneh and Ben Fisch and Ariel Gabizon and Zac Williamson. 2020.
0
56.Groth16 SNARKs are Randomizable and (Weakly) Simulation Extractable Mikhail Volkhov and Markulf Kohlweiss. 2020.
0
57.zk-SNARKs Analysis and Implementation on Ethereum Ballesteros Rodr\'\iguez, Alberto. 2020.
0
58.Succinct Non-Interactive Arguments for Arithmetic Circuits Spooner, Nicholas. 2020.
0
59.On Succinct Non-InteractiveZero-Knowledge Protocols UnderWeaker Trust Assumptions Behzad Abdolmaleki. 2020.
0
60.Halo 0.9: A Halo Protocol with Fully-Succinctness Lira Wang. 2020.
0

Videos

–

–