Home > Resources > papers > CL04-Bilinear-Sigs

Signature Schemes and Anonymous Credentials from Bilinear Maps (Camenisch, Lysyanskaya 2004)

Last modified: 2026-10-27

DOI: 10.1007/978-3-540-28628-8_4 · URL: https://cs.brown.edu/people/alysyans/papers/cl04.pdf

Summary

Introduces the CL-LRSW signature scheme in bilinear groups and efficient protocols to obtain a signature on a committed message and to prove knowledge of a signature in zero knowledge (CRYPTO 2004). This blueprint — signatures with efficient protocols plus sigma proofs — underlies anonymous credential systems, DAA, and the BBS/BBS+ line of work; the paper also describes BBS as a standalone signature.

Related resources

• A Signature Scheme with Efficient Protocols (Camenisch, Lysyanskaya 2002) (paper, 2002)
• Revisiting BBS Signatures (Tessaro, Zhu 2023) (paper, 2023)
• Short Group Signatures (Boneh, Boyen, Shacham 2004) (paper, 2004)
• Short Randomizable Signatures (Pointcheval, Sanders 2016) (paper, 2016)