We show how to construct an existentially unforgeable secure signature scheme from any scheme satisfies only a weak notion of security in the standard model. This construction method combines a weakly secure signature and a one-time signature. However, key generation of the resulted fully secure signature is the same as the key generation of weak signature. Therefore the length of the public key in our fully secure signature is independent of that of the one-time signature. Our conversion from a weakly secure signature scheme to an existentially unforgeable secure signature scheme is simple, efficient and provably secure in the standard model (that is, security of the resulting scheme does not rely on the random oracle model). Our results yield a new construction of existentially unforgeable secure signature in the standard model. Furthermore, we show two efficient instantiations without random oracles converted from two previous weakly secure signature schemes. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Li, J., Chan, Y. Y., & Wang, Y. (2006). A generic construction of secure signatures without random oracles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3982 LNCS, pp. 309–317). Springer Verlag. https://doi.org/10.1007/11751595_34
Mendeley helps you to discover research relevant for your work.