Paper 2007/384

Non-Interactive Anonymous Credentials

Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, and Anna Lysyanskaya


In this paper, we introduce P-signatures. A P-signature scheme consists of a signature scheme, a commitment scheme, and (1) an interactive protocol for obtaining a signature on a committed value; (2) a non-interactive proof system for proving that the contents of a commitment has been signed; (3) a non-interactive proof system for proving that a pair of commitments are commitments to the same value. We give a definition of security for P-signatures and show how they can be realized under appropriate assumptions about groups with bilinear map. Namely, we make extensive use of the powerful suite of non-interactive proof techniques due to Groth and Sahai. Our P-signatures enable, for the first time, the design of a practical non-interactive anonymous credential system whose security does not rely on the random oracle model. In addition, they may serve as a useful building block for other privacy-preserving authentication mechanisms.

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. Manuscript
zero knowledgeanonymous credentialsCL-signatures
Contact author(s)
markulf kohlweiss @ esat kuleuven be
2007-10-06: revised
2007-10-04: received
See all versions
Short URL
Creative Commons Attribution


      author = {Mira Belenkiy and Melissa Chase and Markulf Kohlweiss and Anna Lysyanskaya},
      title = {Non-Interactive Anonymous Credentials},
      howpublished = {Cryptology ePrint Archive, Paper 2007/384},
      year = {2007},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.