RSA-Based Dynamic Accumulator without Hashing into Primes
Victor Youdom Kemmoe, Anna Lysyanskaya
2024年份
4被引次数
摘要
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.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
相关 Paper
- Succinct Zero-Knowledge Batch Proofs for Set AccumulatorsMatteo Campanelli, Dario Fiore, Semin Han, Jihye Kim 等CCS 2022 · 被引用 22 次
- Batching, Aggregation, and Zero-Knowledge Proofs in Bilinear AccumulatorsShravan Srinivasan, Ioanna Karantaidou, Foteini Baldimtsi, Charalampos PapamanthouCCS 2022 · 被引用 21 次
- Merkle Mountain Ranges are Optimal: On Witness Update Frequency for Cryptographic AccumulatorsJoseph Bonneau, Jessica Chen, Miranda Christ, Ioanna KarantaidouCRYPTO 2025 · 被引用 3 次
- 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 等CCS 2024 · 被引用 5 次
