Paper 2017/043

Accumulators with Applications to Anonymity-Preserving Revocation

Foteini Baldimtsi, Jan Camenisch, Maria Dubovitskaya, Anna Lysyanskaya, Leonid Reyzin, Kai Samelin, and Sophia Yakoubov

Abstract

Membership revocation is essential for cryptographic applications, from traditional PKIs to group signatures and anonymous credentials. Of the various solutions for the revocation problem that have been explored, dynamic accumulators are one of the most promising. We propose Braavos, a new, RSA-based, dynamic accumulator. It has optimal communication complexity and, when combined with efficient zero-knowledge proofs, provides an ideal solution for anonymous revocation. For the construction of Braavos we use a modular approach: we show how to build an accumulator with better functionality and security from accumulators with fewer features and weaker security guarantees. We then describe an anonymous revocation component (ARC) that can be instantiated using any dynamic accumulator. ARC can be added to any anonymous system, such as anonymous credentials or group signatures, in order to equip it with a revocation functionality. Finally, we implement ARC with Braavos and plug it into Idemix, the leading implementation of anonymous credentials. This work resolves, for the first time, the problem of practical revocation for anonymous credential systems.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Minor revision. IEEE European Symposium on Security and Privacy 2017
Keywords
accumulatorsanonymous credentialsrevocation
Contact author(s)
sophia yakoubov @ gmail com
History
2017-01-24: revised
2017-01-19: received
See all versions
Short URL
https://ia.cr/2017/043
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2017/043,
      author = {Foteini Baldimtsi and Jan Camenisch and Maria Dubovitskaya and Anna Lysyanskaya and Leonid Reyzin and Kai Samelin and Sophia Yakoubov},
      title = {Accumulators with Applications to Anonymity-Preserving Revocation},
      howpublished = {Cryptology ePrint Archive, Paper 2017/043},
      year = {2017},
      note = {\url{https://eprint.iacr.org/2017/043}},
      url = {https://eprint.iacr.org/2017/043}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.