authenticated-data-structures
Papers (45)
# | Title | |
1. | Constant-size commitments to polynomials and their applications Kate, Aniket and Zaverucha, Gregory M and Goldberg, Ian. 2010. | |
2. | Vector commitments and their applications Catalano, Dario and Fiore, Dario. 2013. | |
3. | RingCT 2.0: A Compact Accumulator-Based (Linkable Ring Signature) Protocol for Blockchain Cryptocurrency Monero Sun, Shi-Feng and Au, Man Ho and Liu, Joseph K and Yuen, Tsz Hon. 2017. | |
4. | Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains Boneh, Dan and B\"unz, Benedikt and Fisch, Benjamin. 2018. | |
5. | Subvector commitments with application to succinct arguments Lai, Russell WF and Malavolta, Giulio. 2019. | |
6. | Aggregatable Subvector Commitments for Stateless Cryptocurrencies Alin Tomescu and Ittai Abraham and Vitalik Buterin and Justin Drake and Dankrad Feist and Dmitry Khovratovich. 2020. | |
7. | Pointproofs: Aggregating Proofs for Multiple Vector Commitments Sergey Gorbunov and Leonid Reyzin and Hoeteck Wee and Zhenfei Zhang. 2020. | |
8. | Scaling Verifiable Computation Using Efficient Set Accumulators Alex Ozdemir and Riad S. Wahby and Dan Boneh. 2019. | |
9. | EDRAX: A Cryptocurrency with Stateless Transaction Validation Chepurnoy, Alexander and Papamanthou, Charalampos and Zhang, Yupeng. 2018. | |
10. | Coded merkle tree: Solving data availability attacks in blockchains Yu, Mingchao and Sahraei, Saeid and Li, Songze and Avestimehr, Salman and Kannan, Sreeram and Viswanath, Pramod. 2020. | |
11. | Transparency Logs via Append-Only Authenticated Dictionaries Tomescu, Alin and Bhupatiraju, Vivek and Papadopoulos, Dimitrios and Papamanthou, Charalampos and Triandopoulos, Nikos and Devadas, Srinivas. 2019. | |
12. | Improving Authenticated Dynamic Dictionaries, with Applications to Cryptocurrencies Reyzin, Leonid and Meshkov, Dmitry and Chepurnoy, Alexander and Ivanov, Sasha. 2016. | |
13. | Utreexo: A dynamic hash-based accumulator optimized for the Bitcoin UTXO set Dryja, Thaddeus. 2019. | |
14. | Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular Benarroch, Daniel and Campanelli, Matteo and Fiore, Dario and Gurkan, Kobi and Kolonelos, Dimitris. 2020. | |
15. | Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage Campanelli, Matteo and Fiore, Dario and Greco, Nicola and Kolonelos, Dimitris and Nizzardo, Luca. 2020. | |
16. | KVaC: Key-Value Commitments for Blockchains and Beyond Shashank Agrawal and Srinivasan Raghuraman. 2020. | |
17. | Trustless Groups of Unknown Order with Hyperelliptic Curves Samuel Dobson and Steven D. Galbraith. 2020. | |
18. | Caulk: Lookup Arguments in Sublinear Time Arantxa Zapico and Vitalik Buterin and Dmitry Khovratovich and Mary Maller and Anca Nitulescu and Mark Simkin. 2022. | |
19. | Authenticated Dictionaries with Cross-Incremental Proof (Dis)aggregation Alin Tomescu and Yu Xia and Zachary Newman. 2020. | |
20. | Hyperproofs: Aggregating and Maintaining Proofs in Vector Commitments Shravan Srinivasan and Alex Chepurnoy and Charalampos Papamanthou and Alin Tomescu and Yupeng Zhang. 2021. | |
21. | Verkle trees Kuszmaul, John. 2019. | |
22. | Caulk+: Table-independent lookup arguments Jim Posen and Assimakis A. Kattis. 2022. | |
23. | Distributed Auditing Proofs of Liabilities Konstantinos Chalkias and Kevin Lewi and Payman Mohassel and Valeria Nikolaenko. 2020. | |
24. | Baloo: Nearly Optimal Lookup Arguments Zapico, Arantxa and Gabizon, Ariel and Khovratovich, Dmitry and Maller, Mary and R\`afols, Carla. 2022. | |
25. | Dynamic Universal Accumulator with Batch Update over Bilinear Groups Giuseppe Vitto and Alex Biryukov. 2020. | |
26. | Succinct Vector, Polynomial, and Functional Commitments from Lattices Hoeteck Wee and David J. Wu. 2022. | |
27. | 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. | |
28. | Vector Commitment Techniques and Applications to Verifiable Decentralized Storage Matteo Campanelli and Dario Fiore and Nicola Greco and Dimitris Kolonelos and Luca Nizzardo. 2020. | |
29. | Aardvark: A Concurrent Authenticated Dictionary with Short Proofs Derek Leung and Yossi Gilad and Sergey Gorbunov and Leonid Reyzin and Nickolai Zeldovich. 2020. | |
30. | VeRSA: Verifiable Registries with Efficient Client Audits from RSA Authenticated Dictionaries Tyagi, Nirvan and Fisch, Ben and Zitek, Andrew and Bonneau, Joseph and Tessaro, Stefano. 2022. | |
31. | Efficient Functional Commitments: How to Commit to Private Functions Dan Boneh and Wilson Nguyen and Alex Ozdemir. 2021. | |
32. | Merkle Trees Optimized for Stateless Clients in Bitcoin Bailey, Bolton and Sankagiri, Suryanarayana. 2021. | |
33. | Batching, Aggregation, and Zero-Knowledge Proofs in Bilinear Accumulators Srinivasan, Shravan and Karantaidou, Ioanna and Baldimtsi, Foteini and Papamanthou, Charalampos. 2022. | |
34. | Accumulators in (and Beyond) Generic Groups: Non-Trivial Batch Verification Requires Interaction Schul-Ganz, Gili and Segev, Gil. 2020. | |
35. | Curve Trees: Practical and Transparent Zero-Knowledge Accumulators Matteo Campanelli and Mathias Hall-Andersen and Simon Holmgaard Kamp. 2022. | |
36. | How to compute all Pointproofs Alin Tomescu. 2020. | |
37. | Verification of a Merkle Patricia Tree Library Using F Sato, Sota and Banno, Ryotaro and Furuse, Jun and Suenaga, Kohei and Igarashi, Atsushi. 2021. | |
38. | Linear-map Vector Commitments and their Practical Applications Matteo Campanelli and Anca Nitulescu and Carla Ràfols and Alexandros Zacharakis and Arantxa Zapico. 2022. | |
39. | BalanceProofs: Maintainable Vector Commitments with Fast Aggregation Weijie Wang and Annie Ulichney and Charalampos Papamanthou. 2022. | |
40. | SoK: Vector Commitments Nitulescu, Anca. 2021. | |
41. | Efficient Dynamic Proof of Retrievability for Cold Storage Tung Le and Pengzhi Huang and Attila A. Yavuz and Elaine Shi and Thang Hoang. 2022. | |
42. | Fast amortized KZG proofs Dankrad Feist and Dmitry Khovratovich. 2023. | |
43. | How to Keep a Secret and Share a Public Key (Using Polynomial Commitments) Nicolescu, Ioan Alin Tomescu. 2020. | |
44. | Mutator Sets and their Application to Scalable Privacy Alan Szepieniec and Thorkil Værge. 2023. | |
45. | SLAP: Succinct Lattice-Based Polynomial Commitments from Standard Assumptions Martin R. Albrecht and Giacomo Fenzi and Oleksandra Lapiha and Ngoc Khanh Nguyen. 2023. |
Videos
Links
- Verkle trees by Vitalik Buterin