Papers (43)

#Title
Citations
1.PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge Ariel Gabizon and Zachary J. Williamson and Oana Ciobotaru. 2019.
683
2.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.
524
3.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.
476
4.Spartan: Efficient and general-purpose zkSNARKs without trusted setup Setty, Srinath. 2019.
393
5.Transparent SNARKs from DARK Compilers Benedikt Bünz and Ben Fisch and Alan Szepieniec. 2019.
379
6.Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation Xie, Tiacheng and Zhang, Jiaheng and Zhang, Yupeng and Papamanthou, Charalampos and Song, Dawn. 2019.
294
7.Scalable Zero Knowledge with No Trusted Setup Ben-Sasson, Eli and Bentov, Iddo and Horesh, Yinon and Riabzev, Michael. 2019.
289
8.Recursive Proof Composition without aTrusted Setup Bowe, Sean Grigg, Jack Hopwood, Daira. 2019.
273
9.Fractal: Post-Quantum and Transparent Recursive Proofs from Holography Alessandro Chiesa and Dev Ojha and Nicholas Spooner. 2019.   
270
10.LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs Campanelli, Matteo and Fiore, Dario and Querol, Ana\"\is. 2019.
226
11.Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof Jiaheng Zhang and Tiancheng Xie and Yupeng Zhang and Dawn Song. 2019.
214
12.Subvector commitments with application to succinct arguments Lai, Russell WF and Malavolta, Giulio. 2019.
128
13.Proofs for Inner Pairing Products and Applications Benedikt Bünz and Mary Maller and Pratyush Mishra and Nirvan Tyagi and Psi Vesely. 2019.
122
14.Scaling Verifiable Computation Using Efficient Set Accumulators Alex Ozdemir and Riad S. Wahby and Dan Boneh. 2019.
106
15.DEEP-FRI: Sampling Outside the Box Improves Soundness Eli Ben-Sasson and Lior Goldberg and Swastik Kopparty and Shubhangi Saraf. 2019.
91
16.Fast and simple constant-time hashing to the BLS12-381 elliptic curve Wahby, Riad S and Boneh, Dan. 2019.
87
17.Succinct Arguments in the Quantum Random Oracle Model Alessandro Chiesa and Peter Manohar and Nicholas Spooner. 2019.
85
18.RedShift: Transparent SNARKs from List Polynomial Commitment IOPs Assimakis Kattis and Konstantin Panarin and Alexander Vlasov. 2019.
47
19.Simulation-Extractable SNARKs Revisited Lipmaa, Helger. 2019.
45
20.TEX - A Securely Scalable Trustless Exchange Rami Khalil and Arthur Gervais and Guillaume Felley. 2019.
43
21.On the security of the BCTV Pinocchio zk-SNARK variant Gabizon, Ariel. 2019.
37
22.zk-SNARKs: A Gentle Introduction Nitulescu, Anca. 2019.
37
23.Transparent Polynomial Commitment Scheme with Polylogarithmic Communication Complexity Alexander Vlasov and Konstantin Panarin. 2019.
34
24.On cycles of pairing-friendly elliptic curves Chiesa, Alessandro and Chua, Lynn and Weidner, Matthew. 2019.
34
25.UC-Secure CRS Generation for SNARKs Behzad Abdolmaleki and Karim Baghery and Helger Lipmaa and Janno Siim and Michal Zajac. 2019.
34
26.SAVER: Snark-friendly, Additively-homomorphic, and Verifiable Encryption and decryption with Rerandomization Jiwon Lee and Jaekyoung Choi and Jihye Kim and Hyunok Oh. 2019.
30
27.AuroraLight: Improved prover efficiency and SRS size in a Sonic-like system Gabizon, Ariel. 2019.
29
28.Simulation Extractability in Groth’s zk-SNARK Atapoor, Shahla and Baghery, Karim. 2019.
29
29.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.
26
30.On the efficiency of privacy-preserving smart contract systems Baghery, Karim. 2019.
26
31.Subversion-Resistant Simulation (Knowledge) Sound NIZKs Karim Baghery. 2019.
24
32.On the (In)security of Kilian-Based SNARGs James Bartusek and Liron Bronfman and Justin Holmgren and Fermi Ma and Ron Rothblum. 2019.
23
33.Lattice-Based Zero-Knowledge SNARGs for Arithmetic Circuits Nitulescu, Anca. 2019.
20
34.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.
18
35.Faster Subgroup Checks for BLS12-381 Bowe, Sean. 2019.
8
36.Mapping finite state machines to zk-SNARKS Using Category Theory Genovese, Fabrizio and Knispel, Andre and Fitzgerald, Joshua. 2019.
2
37.ZKProof Community Reference ZKProofStandards. 2019.
2
38.Practical Zero-Knowledge Arguments from Structured Reference Strings Maller, Mary. 2019.
1
39.OCEAN: A Built-In Replacement for Mining Pools Raymond Chee and Kartik Chitturi and Edouard Dufour-Sans and Kyle Soska. 2019.
0
40.Updatable CRS Simulation-Extractable zk-SNARKs with a Single Verification Kim, Jihye and Lee, Jiwon and Oh, Hyunok. 2019.
0
41.On Privacy Preserving Blockchains and zk-SNARKs Atapoor, Shahla. 2019.
0
42.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
43.Computation Verification for Noobs Riabzev, Michael and Ben-Sasson, Eli and Ishai, Yuval. 2019.
0

Videos

–

–