Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Accumulators and U-Prove Revocation

Tolga Acar, Sherman S. M. Chow, and Lan Nguyen

Abstract

This work introduces the most efficient universal accumula- tor known today. For the first time, we have an accumulator which does not depend on hidden order groups, does not require any exponentia- tions in the target group associated with the pairing function, and only requires two pairings to verify a proof-of-knowledge of a witness. We present implementations of our accumulator and another recent pro- posal utilizing Groth-Sahai proofs, with performance results. Our im- plementations are designed with cryptography agility in mind. We then build a library for revoking anonymous credentials using any accumula- tors, and integrated it with Microsoft U-Prove, which has a significant contribution to an European Union’s privacy standardization effort. Our work enables U-Prove revocation without compromising untraceability.

Details

Publication typeInproceedings
Published inFinancial Cryptography'13
Pages189-196
Volume7859
SeriesLNCS
PublisherSpringer Verlag
> Publications > Accumulators and U-Prove Revocation