Universal accumulators with efficient nonmembership proofs

Universal accumulators with efficient nonmembership proofs (2007)

Cached

Download Links

[www.cerias.purdue.edu]

by Jingtao Li , Ninghui Li , Rui Xue

Citations:

13 - 0 self

Versions

Version History

Metadata Version 2

User correction supplied by mph

Datum	Value	Source
TITLE	Universal accumulators with efficient nonmembership proofs	user correction
AUTHOR NAME	Jingtao Li	user correction
AUTHOR AFFIL	Center for Education and Research in; Information Assurance and Security,; Purdue University, West Lafayette	user correction
AUTHOR ADDR	IN 47907-2086 Universal Accumulators with Efficient Nonmembership	user correction
AUTHOR NAME	Ninghui Li	user correction
AUTHOR AFFIL	Center for Education and Research in; Information Assurance and Security,; Purdue University, West Lafayette	user correction
AUTHOR ADDR	IN 47907-2086 Universal Accumulators with Efficient Nonmembership	user correction
AUTHOR NAME	Rui Xue	user correction
AUTHOR AFFIL	Center for Education and Research in; Information Assurance and Security,; Purdue University, West Lafayette	user correction
AUTHOR ADDR	IN 47907-2086 Universal Accumulators with Efficient Nonmembership	user correction
ABSTRACT	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 committed value is not in the accumulator. Our dynamic universal accumulator construction enables efficient membership revocation in an anonymous fashion.	user correction
YEAR	2007	user correction
CITATIONS	22 found	ParsCit 1.0