# Strongly Unforgeable Signatures Based on Computational Diffie-Hellman

**Authors:**

*D. Boneh, E. Shen, and B. Waters*

** Abstract: **

A signature system is said to be strongly unforgeable if the
signature is existentially unforgeable and, given signatures on some
message M, the adversary cannot produce a new signature on M.
Strongly unforgeable signatures are used for constructing
chosen-ciphertext secure systems and group signatures. Current
efficient constructions in the standard model (i.e. without random
oracles) depend on relatively strong assumptions such as Strong-RSA
or Strong-Diffie-Hellman. We construct an efficient strongly
unforgeable signature system based on the standard Computational
Diffie-Hellman problem in bilinear groups.

** Reference:**

In proceedings of PKC '06, LNCS 3958, pp. 229-240, 2006

**Full paper:**
pdf
[first posted
3/2006 ]