Team for Research in
Ubiquitous Secure Technology

Citation
"• Strongly Unforgeable Signatures Based on Computational Diffie-Hellman". D. Boneh, E. Shen, and B. Waters (eds.), PKC, 2006.

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.

Electronic downloads

• http://crypto.stanford.edu/~dabo/papers/strongsigs.pdf

• HTML

   <a
  href="http://www.truststc.org/pubs/600.html"
  ><i>•	Strongly Unforgeable Signatures
  Based on Computational Diffie-Hellman</i></a>,
  D. Boneh, E. Shen, and B. Waters (eds.), PKC, 2006.

• Plain text

   "•	Strongly Unforgeable Signatures Based
  on Computational Diffie-Hellman". D. Boneh, E. Shen,
  and B. Waters (eds.), PKC, 2006.

• BibTeX

  @proceedings{BonehShenWaters06_StronglyUnforgeableSignaturesBasedOnComputational,
      title = {•	Strongly Unforgeable Signatures Based on
                Computational Diffie-Hellman},
      editor = {D. Boneh, E. Shen, and B. Waters},
      organization = {PKC},
      year = {2006},
      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. },
      URL = {http://www.truststc.org/pubs/600.html}
  }
  

Posted by Jessica Gamble on 16 Mar 2009.
For additional information, see the Publications FAQ or contact webmaster at www truststc org.