Score:0

Is there a strictly Additive Dynamic Universal Cryptographic Accumulator?

in flag

Started reading up on Cryptographic Accumulators recently to incorporate them in a project. Using this survey to understand what features the accumulator needs to offer it seems I am looking for a Dynamic Universal Strong Accumulator that only supports addition. This paper lists reference [23] as having the above characteristics in Table 1, but reading the paper it turns out those accumulators also support deletion. So far I have not come across something that meets the necessary criteria.

To summarise, is there a kind of cryptographic accumulator that is:

Universal, ergo can support both membership and non-membership witness

Strong, does not require a trusted third party

Dynamic, member set can change but only supports addition and NOT deletion of members

Thanks a lot for any help.

yacovm avatar
us flag
a Merkle tree with sorted leaves supports both membership (path from root to leaf) and non-membership proofs (two paths from two consecutive leaves), and it has no trusted party and supports addition.
mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.