How to strengthen any weakly unforgeable signature into a strongly unforgeable signature

Steinfeld, Ron, Pieprzyk, Josef, & Wang, Huaxiong (2006) How to strengthen any weakly unforgeable signature into a strongly unforgeable signature. Lecture Notes in Computer Science : Topics in Cryptology – CT-RSA 2007, 4377, pp. 357-371.

View at publisher

Abstract

Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most signature schemes are randomised and allow many possible signatures for a single message. In this case, it may be possible to produce a new signature on a previously signed message. Some applications require that this type of forgery also be prevented – this requirement is called strong unforgeability.

At PKC2006, Boneh Shen and Waters presented an efficient transform based on any randomised trapdoor hash function which converts a weakly unforgeable signature into a strongly unforgeable signature and applied it to construct a strongly unforgeable signature based on the CDH problem. However, the transform of Boneh et al only applies to a class of so-called partitioned signatures. Although many schemes fall in this class, some do not, for example the DSA signature. Hence it is natural to ask whether one can obtain a truly generic efficient transform based on any randomised trapdoor hash function which converts any weakly unforgeable signature into a strongly unforgeable one. We answer this question in the positive by presenting a simple modification of the Boneh-Shen-Waters transform. Our modified transform uses two randomised trapdoor hash functions.

Impact and interest:

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

ID Code: 73481
Item Type: Journal Article
Refereed: Yes
Additional Information: Paper presented in The Cryptographers’ Track at the RSA Conference 2007, San Francisco, CA, USA, February 5-9, 2007. Print ISBN
978-3-540-69327-7
DOI: 10.1007/11967668_23
ISBN: 978-3-540-69328-4
ISSN: 1611-3349
Divisions: Current > QUT Faculties and Divisions > Science & Engineering Faculty
Deposited On: 08 Jul 2014 01:00
Last Modified: 15 Jul 2014 03:37

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page