Universal Accumulators with Efficient Nonmembership Proofs

Based on the notion of accumulators, we propose a new cryptographic scheme called universal accumulators. This scheme enables one to commit to a set of values using a short accumulator and to efficiently compute a membership witness of any value that has been accumulated. Unlike traditional accumulators, this scheme also enables one to efficiently compute a nonmembership witness of any value that has not been accumulated. We give a construction for universal accumulators and prove its security based on the strong RSA assumption. We further present a construction for dynamic universal accumulators; this construction allows one to dynamically add and delete inputs with constant computational cost. Our construction directly builds upon Camenisch and Lysyanskaya's dynamic accumulator scheme. Universal accumulators can be seen as an extension to dynamic accumulators with support of nonmembership witness. We also give an efficient zero-knowledge proof protocol for proving that a committ...

• Type: Conference
• Year: 2007
• Where: ACNS
• Authors: Jiangtao Li, Ninghui Li, Rui Xue
• Keywords: ACNS 2007, Cryptology, Dynamic Accumulators, Dynamic Universal Accumulator, Universal Accumulator