Papers (13)

#Title
Citations
1.Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains Boneh, Dan and B\"unz, Benedikt and Fisch, Benjamin. 2018.
369
2.Subvector commitments with application to succinct arguments Lai, Russell WF and Malavolta, Giulio. 2019.
128
3.Pointproofs: Aggregating Proofs for Multiple Vector Commitments Sergey Gorbunov and Leonid Reyzin and Hoeteck Wee and Zhenfei Zhang. 2020.
117
4.Scaling Verifiable Computation Using Efficient Set Accumulators Alex Ozdemir and Riad S. Wahby and Dan Boneh. 2019.
106
5.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
6.Caulk: Lookup Arguments in Sublinear Time Arantxa Zapico and Vitalik Buterin and Dmitry Khovratovich and Mary Maller and Anca Nitulescu and Mark Simkin. 2022.
73
7.Baloo: Nearly Optimal Lookup Arguments Zapico, Arantxa and Gabizon, Ariel and Khovratovich, Dmitry and Maller, Mary and R\`afols, Carla. 2022.
41
8.Succinct Zero-Knowledge Batch Proofs for Set Accumulators Matteo Campanelli and Dario Fiore and Semin Han and Jihye Kim and Dimitris Kolonelos and Hyunok Oh. 2021.
37
9.Caulk+: Table-independent lookup arguments Jim Posen and Assimakis A. Kattis. 2022.
33
10.Linear-map Vector Commitments and their Practical Applications Matteo Campanelli and Anca Nitulescu and Carla Ràfols and Alexandros Zacharakis and Arantxa Zapico. 2022.
24
11.Distributed Auditing Proofs of Liabilities Konstantinos Chalkias and Kevin Lewi and Payman Mohassel and Valeria Nikolaenko. 2020.
22
12.Curve Trees: Practical and Transparent Zero-Knowledge Accumulators Matteo Campanelli and Mathias Hall-Andersen and Simon Holmgaard Kamp. 2022.
22
13.Efficient Functional Commitments: How to Commit to Private Functions Dan Boneh and Wilson Nguyen and Alex Ozdemir. 2021.
14

Videos