Papers (132)

#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  
1244
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  
1010
3.Pinocchio: Nearly practical verifiable computation Parno, Bryan and Howell, Jon and Gentry, Craig and Raykova, Mariana. 2013
634
4.Quadratic span programs and succinct NIZKs without PCPs Gennaro, Rosario and Gentry, Craig and Parno, Bryan and Raykova, Mariana. 2013
461
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  
402
6.Separating succinct non-interactive arguments from all falsifiable assumptions Gentry, Craig and Wichs, Daniel. 2011  
323
7.Short pairing-based non-interactive zero-knowledge arguments Groth, Jens. 2010
307
8.Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. Ben-Sasson, Eli and Chiesa, Alessandro and Tromer, Eran and Virza, Madars. 2014
302
9.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  
216
10.Succinct non-interactive arguments via linear interactive proofs Bitansky, Nir and Chiesa, Alessandro and Ishai, Yuval and Paneth, Omer and Ostrovsky, Rafail. 2013
199
11.Recursive composition and bootstrapping for SNARKs and proof-carrying data Bitansky, Nir and Canetti, Ran and Chiesa, Alessandro and Tromer, Eran. 2013
199
12.On the size of pairing-based non-interactive arguments Groth, Jens. 2016  
187
13.Scalable zero knowledge via cycles of elliptic curves Ben-Sasson, Eli and Chiesa, Alessandro and Tromer, Eran and Virza, Madars. 2017  
157
14.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  
153
15.Scalable, transparent, and post-quantum secure computational integrity Eli Ben-Sasson and Iddo Bentov and Yinon Horesh and Michael Riabzev. 2018   
139
16.Verifiable Delay Functions Dan Boneh, Joseph Bonneau, Benedikt Bünz, Ben Fisch. 2018  
115
17.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
111
18.ZKBoo: Faster Zero-Knowledge for Boolean Circuits. Giacomelli, Irene and Madsen, Jesper and Orlandi, Claudio. 2016
109
19.Zcash protocol specification Hopwood, Daira and Bowe, Sean and Hornby, Taylor and Wilcox, Nathan. 2016
109
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
109
21.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
106
22.Ligero: Lightweight sublinear arguments without a trusted setup Ames, Scott and Hazay, Carmit and Ishai, Yuval and Venkitasubramaniam, Muthuramakrishnan. 2017  
105
23.Pinocchio coin Danezis, George and Fournet, Cedric and Kohlweiss, Markulf and Parno, Bryan. 2013
99
24.Interactive oracle proofs Ben-Sasson, Eli and Chiesa, Alessandro and Spooner, Nicholas. 2016   
94
25.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
90
26.Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes Lipmaa, Helger. 2013  
79
27.Square span programs with applications to succinct NIZK arguments Danezis, George and Fournet, C\'edric and Groth, Jens and Kohlweiss, Markulf. 2014  
79
28.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  
65
29.Doubly-efficient zkSNARKs without trusted setup Riad S. Wahby and Ioanna Tzialla and abhi shelat and Justin Thaler and Michael Walfish. 2017  
63
30.A multi-party protocol for constructing the public parameters of the Pinocchio zk-SNARK Bowe, Sean and Gabizon, Ariel and Green, Matthew D. 2018
63
31.Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs Jens Groth and Mary Maller. 2017  
61
32.Zero-Knowledge Contingent Payments Revisited: Attacks and Payments for Services Matteo Campanelli and Rosario Gennaro and Steven Goldfeder and Luca Nizzardo. 2017
56
33.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   
55
34.Subversion-zero-knowledge SNARKs Georg Fuchsbauer. 2017
49
35.A Subversion-Resistant SNARK Behzad Abdolmaleki and Karim Baghery and Helger Lipmaa and Michal Zajac. 2017  
47
36.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
47
37.Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model Sean Bowe and Ariel Gabizon and Ian Miers. 2017
46
38.Lattice-based SNARGs and their application to more efficient obfuscation Boneh, Dan and Ishai, Yuval and Sahai, Amit and Wu, David J. 2017  
36
39.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
34
40.ZoKrates - Scalable Privacy-Preserving Off-Chain Computations Jacob Eberhardt and Stefan Tai. 2018   
33
41.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
32
42.Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation Xie, Tiacheng and Zhang, Jiaheng and Zhang, Yupeng and Papamanthou, Charalampos and Song, Dawn. 2019   
30
43.Zexe: Enabling decentralized private computation Bowe, S and Chiesa, A and Green, M and Miers, I and Mishra, P and Wu, H. 2018   
29
44.Quasi-linear size zero knowledge from linear-algebraic PCPs Ben-Sasson, Eli and Chiesa, Alessandro and Gabizon, Ariel and Virza, Madars. 2016
28
45.Scalable Zero Knowledge with No Trusted Setup Ben-Sasson, Eli and Bentov, Iddo and Horesh, Yinon and Riabzev, Michael. 2019
26
46.Raziel: private and verifiable smart contracts on blockchains S\'anchez, David Cerezo. 2018
25
47.Confidential assets Poelstra, Andrew and Back, Adam and Friedenbach, Mark and Maxwell, Gregory and Wuille, Pieter. 2018
25
48.PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge Ariel Gabizon and Zachary J. Williamson and Oana Ciobotaru. 2019   
25
49.Non-Interactive Zero-Knowledge Proofs for Composite Statements Shashank Agrawal and Chaya Ganesh and Payman Mohassel. 2018  
23
50.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
23
51.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
20
52.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
20
53.Ouroboros Crypsinous: Privacy-Preserving Proof-of-Stake Kerber, Thomas and Kohlweiss, Markulf and Kiayias, Aggelos and Zikas, Vassilis. 2018  
19
54.Making Groth's zk-SNARK Simulation Extractable in the Random Oracle Model Sean Bowe and Ariel Gabizon. 2018
18
55.Lattice-Based zk-SNARKs from Square Span Programs Gennaro, Rosario and Minelli, Michele and Nitulescu, Anca and Orr\`u, Michele. 2018  
17
56.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
16
57.Off-chaining models and approaches to off-chain computations Eberhardt, Jacob and Heiss, Jonathan. 2018
16
58.DIZK: A Distributed Zero-Knowledge Proof System Wu, Howard and Zheng, Wenting and Chiesa, Alessandro and Popa, Raluca Ada and Stoica, Ion. 2018  
15
59.LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs Campanelli, Matteo and Fiore, Dario and Querol, Ana\"\is. 2019  
15
60.Simulation-Extractable SNARKs Revisited Lipmaa, Helger. 2019
15
61.xJsnark: a framework for efficient verifiable computation Kosba, Ahmed and Papamanthou, Charalampos and Shi, Elaine. 2018   
13
62.Spartan: Efficient and general-purpose zkSNARKs without trusted setup Setty, Srinath. 2019
12
63.On cycles of pairing-friendly elliptic curves Chiesa, Alessandro and Chua, Lynn and Weidner, Matthew. 2019
11
64.Succinct Arguments in the Quantum Random Oracle Model Alessandro Chiesa and Peter Manohar and Nicholas Spooner. 2019
10
65.Coda: Decentralized Cryptocurrency at Scale Joseph Bonneau and Izaak Meckler and Vanishree Rao and Evan Shapiro. 2020  
9
66.Subvector commitments with application to succinct arguments Lai, Russell WF and Malavolta, Giulio. 2019  
9
67.On the security of the BCTV Pinocchio zk-SNARK variant Gabizon, Ariel. 2019
8
68.Public Accountability vs. Secret Laws: Can They Coexist?: A Cryptographic Proposal Goldwasser, Shafi and Park, Sunoo. 2017  
7
69.State of the Art in Verifiable Computation Khovratovich, Dmitry. 2018
7
70.A Note on the Unsoundness of vnTinyRAM's SNARK. Parno, Bryan. 2015
7
71.Simulation Extractability in Groth’s zk-SNARK Atapoor, Shahla and Baghery, Karim. 2019
7
72.UC-Secure CRS Generation for SNARKs Behzad Abdolmaleki and Karim Baghery and Helger Lipmaa and Janno Siim and Michal Zajac. 2019
7
73.TEX - A Securely Scalable Trustless Exchange Rami Khalil and Arthur Gervais and Guillaume Felley. 2019
6
74.The Aztec Protocol Zachary J., Williamson. 2018   
6
75.Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof Jiaheng Zhang and Tiancheng Xie and Yupeng Zhang and Dawn Song. 2019
6
76.On the efficiency of privacy-preserving smart contract systems Baghery, Karim. 2019
6
77.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
6
78.A survey on zero knowledge range proofs and applications Morais, Eduardo and Koens, Tommy and van Wijk, Cees and Koren, Aleksei. 2019
5
79.WI Is Not Enough: Zero-Knowledge Contingent (Service) Payments Revisited Georg Fuchsbauer. 2019
5
80.Efficient zero-knowledge arguments in the discrete log setting, revisited Max Hoffmann and Michael Klooß and Andy Rupp. 2019
5
81.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
5
82.Subversion-Resistant Simulation (Knowledge) Sound NIZKs Karim Baghery. 2019
5
83.Lift-and-Shift: Obtaining Simulation Extractable Subversion and Updatable SNARKs Generically Bezhad Abdolmaleki and Sebastian Ramacher and Daniel Slamanig. 2020
5
84.DEEP-FRI: Sampling Outside the Box Improves Soundness Eli Ben-Sasson and Lior Goldberg and Swastik Kopparty and Shubhangi Saraf. 2019  
5
85.Founding Secure Computation on Blockchains Choudhuri, Arka Rai and Goyal, Vipul and Jain, Abhishek. 2019
4
86.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
4
87.Updatable CRS Simulation-Extractable zk-SNARKs with a Single Verification Kim, Jihye and Lee, Jiwon and Oh, Hyunok. 2019
3
88.ON DEPLOYING SUCCINCT ZERO-KNOWLEDGE PROOFS Madars Virza. 2017
2
89.MProve: A Proof of Reserves Protocol for Monero Exchanges Dutta, Arijit and Vijayakumaran, Saravanan. 2019
2
90.On the (In)security of Kilian-Based SNARGs James Bartusek and Liron Bronfman and Justin Holmgren and Fermi Ma and Ron Rothblum. 2019
2
91.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
2
92.RedShift: Transparent SNARKs from List Polynomial Commitment IOPs Assimakis Kattis and Konstantin Panarin and Alexander Vlasov. 2019
2
93.Triptych: logarithmic-sized linkable ring signatures with applications Sarang Noether and Brandon Goodell. 2020
2
94.Proof of Necessary Work: Succinct State Verification with Fairness Guarantees Assimakis Kattis and Joseph Bonneau. 2020
2
95.Zendoo: a zk-SNARK Verifiable Cross-Chain Transfer Protocol Enabling Decoupled and Decentralized Sidechains Alberto Garoffolo and Dmytro Kaidalov and Roman Oliynykov. 2020
2
96.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
97.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
98.Contingent payments on a public ledger: models and reductions for automated verification. Bursuc, Sergiu and Kremer, Steve. 2019
1
99.ZETH: On Integrating Zerocash on Ethereum Rondelet, Antoine and Zajac, Michal. 2019
1
100.Lattice-Based Zero-Knowledge SNARGs for Arithmetic Circuits Nitulescu, Anca. 2019
1
101.FastSwap: Concretely Efficient Contingent Payments for Complex Predicates Mathias Hall-Andersen. 2019
1
102."Many-out-of-Many" Proofs with Applications to Anonymous Zether Benjamin E. Diamond. 2020
1
103.zkRelay: Facilitating Sidechains using zkSNARK-based Chain-Relays Martin Westerkamp and Jacob Eberhardt. 2020
1
104.Pointproofs: Aggregating Proofs for Multiple Vector Commitments Sergey Gorbunov and Leonid Reyzin and Hoeteck Wee and Zhenfei Zhang. 2020
1
105.Mining for Privacy: How to Bootstrap a Snarky Blockchain Thomas Kerber and Aggelos Kiayias and Markulf Kohlweiss. 2020
1
106.SoK: Lifting Transformations for Simulation Extractable Subversion and Updatable SNARKs⋆ Abdolmaleki, Behzad and Ramacher, Sebastian and Slamanig, Daniel. 2020
1
107.plookup: A simplified polynomial protocol for lookup tables Ariel Gabizon and Zachary J. Williamson. 2020
1
108.ZeroLedge: Proving Solvency with Privacy Doerner, Jack and Shelat, Abhi and Evans, David. 2018
0
109.Practical Zero-Knowledge Arguments from Structured Reference Strings Maller, Mary. 2019
0
110.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
111.On Privacy Preserving Blockchains and zk-SNARKs Atapoor, Shahla. 2019
0
112.SAMPL: Scalable Auditability of Monitoring Processes using Public Ledgers Panwar, Gaurav and Vishwanathan, Roopa and Misra, Satyajayant and Bos, Austin. 2019
0
113.Baby SNARK (do do dodo dodo) Andrew Miller and Ye Zhang and Sanket Kanjalkar. 2020
0
114.An airdrop that preserves recipient privacy⋆ Wahby, Riad S and Boneh, Dan and Jeffrey, Christopher and Poon, Joseph. 2020  
0
115.MIRAGE: Succinct Arguments for Randomized Algorithms with Applications to Universal zk-SNARKs Ahmed Kosba and Dimitrios Papadopoulos and Charalampos Papamanthou and Dawn Song. 2020
0
116.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
117.Updateable Inner Product Argument with Logarithmic Verifier and Applications Daza, Vanesa and R\`afols, Carla and Zacharakis, Alexandros. 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.Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition Youssef El Housni and Aurore Guillevic. 2020  
0
120.Unbounded Simulation-Sound Subversion Resistant Quasi-Adaptive NIZK Proofs and Applications to Modular zk-SNARKs Behzad Abdolmaleki and Daniel Slamanig. 2020
0
121.ZKProof Community Reference ZKProofStandards. 2019
0
122.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
123.On Subversion-Resistant SNARKs Behzad Abdolmaleki and Helger Lipmaa and Janno Siim and Michał Zając. 2020
0
124.Smart Contract With Secret Parameters Thiercelin, Marin and Cheng, Chen-Mou and Miyaji, Atsuko and Vaudenay, Serge. 2020
0
125.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
126.TinyRAM Architecture Specification v2. 000 Chiesa, Eli Ben-Sasson Alessandro and Genkin, Daniel and Tromer, Eran and Virza, Madars. 2020
0
127.Succinct Diophantine-Satisfiability Arguments Patrick Towa and Damien Vergnaud. 2020
0
128.Compressing Proofs of $k$-Out-Of-$n$ Partial Knowledge Thomas Attema and Ronald Cramer and Serge Fehr. 2020
0
129.Verifiable state machines: Proofs that untrusted services operate correctly Srinath Setty and Sebastian Angel and Jonathan Lee. 2020
0
130.Groth16 SNARKs are Randomizable and (Weakly) Simulation Extractable Mikhail Volkhov and Markulf Kohlweiss. 2020
0
131.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
132.Computation Verification for Noobs Riabzev, Michael and Ben-Sasson, Eli and Ishai, Yuval. 2019
0

Videos