Skip to main content
placeholder image

How to prove security of a signature with a tighter security reduction

Chapter


Abstract


  • It is a challenging task to construct a signature that it can be tightly reduced to a weak security assumption in the standard model. In this paper, we introduce a simple chameleon-hash-based transformation and show that it can tighten a security reduction of a signature scheme that suffers from a loose security reduction. Taking the Waters' signature from Eurocrypt 2005 as an example, we demonstrate an improvement of the security reduction that the probability of success in the security reduction can be made as a constant and independent of the signature queries from an adversary. Our reduction methodology has never been considered in the literature and is applicable to many signature schemes such as identity-based signature schemes, online/offline signatures, and signatures with strong unforeability. © Springer-Verlag 2009.

Publication Date


  • 2009

Citation


  • Guo, F., Mu, Y., & Susilo, W. (2009). How to prove security of a signature with a tighter security reduction. In Unknown Book (Vol. 5848 LNCS, pp. 90-103). doi:10.1007/978-3-642-04642-1_9

International Standard Book Number (isbn) 13


  • 9783642046414

Scopus Eid


  • 2-s2.0-77952722030

Book Title


  • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Start Page


  • 90

End Page


  • 103

Abstract


  • It is a challenging task to construct a signature that it can be tightly reduced to a weak security assumption in the standard model. In this paper, we introduce a simple chameleon-hash-based transformation and show that it can tighten a security reduction of a signature scheme that suffers from a loose security reduction. Taking the Waters' signature from Eurocrypt 2005 as an example, we demonstrate an improvement of the security reduction that the probability of success in the security reduction can be made as a constant and independent of the signature queries from an adversary. Our reduction methodology has never been considered in the literature and is applicable to many signature schemes such as identity-based signature schemes, online/offline signatures, and signatures with strong unforeability. © Springer-Verlag 2009.

Publication Date


  • 2009

Citation


  • Guo, F., Mu, Y., & Susilo, W. (2009). How to prove security of a signature with a tighter security reduction. In Unknown Book (Vol. 5848 LNCS, pp. 90-103). doi:10.1007/978-3-642-04642-1_9

International Standard Book Number (isbn) 13


  • 9783642046414

Scopus Eid


  • 2-s2.0-77952722030

Book Title


  • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Start Page


  • 90

End Page


  • 103