Revocation for Delegatable Anonymous Credentials

  • Tolga Acar
  • Lan Nguyen
Conference paper

DOI: 10.1007/978-3-642-19379-8_26

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6571)
Cite this paper as:
Acar T., Nguyen L. (2011) Revocation for Delegatable Anonymous Credentials. In: Catalano D., Fazio N., Gennaro R., Nicolosi A. (eds) Public Key Cryptography – PKC 2011. PKC 2011. Lecture Notes in Computer Science, vol 6571. Springer, Berlin, Heidelberg


This paper introduces and formalizes homomorphic proofs that allow ‘adding’ proofs and proof statements to get a new proof of the ‘sum’ statement. Additionally, we introduce a construction of homomorphic proofs, and show an accumulator scheme with delegatable non-membership proofs (ADNMP) as one of its applications with provable security. Finally, the proposed accumulator method extends the BCCKLS scheme [1] to create a new provably secure revocable delegatable anonymous credential (RDAC) system. Intuitively, the new accumulator’s delegatable non-membership (NM) proofs enable user A, without revealing her identity, to delegate to user B the ability to prove that A’s identity is not included in a blacklist that can later be updated. The delegation is redelegatable, unlinkable, and verifiable.

Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Tolga Acar
    • 1
  • Lan Nguyen
    • 1
  1. 1.Microsoft ResearchRedmondUSA

Personalised recommendations