P-signatures and Noninteractive Anonymous Credentials

Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

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 noninteractive 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 a bilinear map. 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.
Original languageEnglish
Title of host publicationTheory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008.
Number of pages19
ISBN (Electronic)978-3-540-78524-8
ISBN (Print)978-3-540-78523-1
Publication statusPublished - 2008
EventFifth IACR Theory of Cryptography Conference - Courant Institute of Mathematical Sciences, New York University, New York, United States
Duration: 19 Mar 200821 Mar 2008


ConferenceFifth IACR Theory of Cryptography Conference
Abbreviated titleTCC 2008
Country/TerritoryUnited States
CityNew York
Internet address


Dive into the research topics of 'P-signatures and Noninteractive Anonymous Credentials'. Together they form a unique fingerprint.

Cite this