RSA-Based Dynamic Accumulator without Hashing into Primes
Victor Youdom Kemmoe, Anna Lysyanskaya
2024Year
4Citations
Abstract
A cryptographic accumulator is a compact data structure for representing a set of elements coming from some domain. It allows for a compact proof of membership and, in the case of a universal accumulator, non-membership of an element x in the data structure. A dynamic accumulator, furthermore, allows elements to be added to and deleted from the accumulator.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get c648b9dc-d973-45b9-af74-35bd944c335aRelated papers
- Succinct Zero-Knowledge Batch Proofs for Set AccumulatorsMatteo Campanelli, Dario Fiore, Semin Han, Jihye Kim et al.CCS 2022 · 22 citations
- Batching, Aggregation, and Zero-Knowledge Proofs in Bilinear AccumulatorsShravan Srinivasan, Ioanna Karantaidou, Foteini Baldimtsi, Charalampos PapamanthouCCS 2022 · 21 citations
- Merkle Mountain Ranges are Optimal: On Witness Update Frequency for Cryptographic AccumulatorsJoseph Bonneau, Jessica Chen, Miranda Christ, Ioanna KarantaidouCRYPTO 2025 · 3 citations
- Curve Trees: Practical and Transparent Zero-Knowledge AccumulatorsMatteo Campanelli, Mathias Hall-Andersen, Simon Holmgaard KampUSENIX Security 2023
- Batching-Efficient RAM using Updatable Lookup ArgumentsMoumita Dutta, Chaya Ganesh, Sikhar Patranabis, Shubh Prakash et al.CCS 2024 · 5 citations
