Strongly Unforgeable Signature Scheme without One-Time Key
Watcharee Tantikittipisut, Nol Premasathian · 2009
This paper introduces a strongly unforgeable signature scheme that combines two secure primitives. In regard to the strong computational problem, the strong unforgeability of the scheme does not rely on any one-time key. The construction makes use of collision-resistant hash function to improve the security against adaptive chosen-message attack by means of the correlation of hashed message.