Signature Schemes and Anonymous Credentials from Bilinear Maps

Abstract. We propose a new and efficient signature scheme that is provably secure in the plain model. The security of our scheme is based on a discrete-logarithm-based assumption put forth by Lysyanskaya, Rivest, Sahai, and Wolf (LRSW) who also showed that it holds for generic groups and is independent of the decisional Diffie-Hellman assumption. We prove security of our scheme under the LRSW assumption for groups with bilinear maps. We then show how our scheme can be used to construct efficient anonymous credential systems as well as group signature and identity escrow schemes. To this end, we provide efficient protocols that allow one to prove in zero-knowledge the knowledge of a signature on a committed (or encrypted) message and to obtain a signature on a committed message.

• Type: Conference
• Year: 2004
• Where: CRYPTO
• Authors: Jan Camenisch, Anna Lysyanskaya
• Keywords: CRYPTO 2004, Decisional Diffie-hellman Assumption, Efficient Signature Scheme, Signature