Improving security of existentially unforgeable signature schemes

Mariusz Jurkiewicz


In this paper we present a family of transforms that map existentially unforgeable signature schemes to signature schemes being strongly unforgeable. In spite of rising security, the transforms let us make a signature on a union of messages at once. The number of elements in this union depends on the signing algorithm of a scheme being transformed. In addition to that we define an existentially unforgeable signature scheme based on pairings, which satisfies all assumptions of the first part and is able to be subjected to transformation.

Full Text:



J. An, Y. Dodis, and T. Rabin, ''On the security of joint signature and encryption''

S. D. Galbraith, K. G. Paterson, and N. P. Smart, ''Pairings for cryptographers''

S. Goldwasser, S. Micali, and R. L. Rivest, "A digital signature scheme secure against adaptive chosen-message attacks"

B. Waters, ''Efficient identity-based encryption without random oracles''

D. Boneh and M. K. Franklin, ''Identity-based encryption from the weil pairing''


  • There are currently no refbacks.

International Journal of Electronics and Telecommunications
is a periodical of Electronics and Telecommunications Committee
of Polish Academy of Sciences

eISSN: 2300-1933