Abstract
D. L. Vo and K. Kim proposed a forward secure signature scheme from bilinear pairings in annual International Conference on Information Security and Cryptology 2005. They claimed that their scheme satisfies several merits including requiring the general security parameters only independent to the total number of time periods and performing key evolving for unlimited time periods while maintaining sizes of keys and signature fixed. They also claimed this scheme is forward secure under the assumption of computational Diffie-Hellman problem. In this paper, we analyze the security of this scheme and point out this scheme doesn’t satisfy the forward security.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Anderson, R.: Two remarks on public key cryptology. Invited Lecture. In: The 4th ACM Conference on Computer and Communications Security (1997)
Bellare, M., Miner, S.: A forward-secure digital signature scheme. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 431–448. Springer, Heidelberg (1999)
Abdalla, M., Reyzin, L.: A new forward-secure digital signature scheme. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 116–129. Springer, Heidelberg (2000)
Itkis, G., Reyzin, L.: Forward-secure signatures with optimal signing and verifying. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 499–514. Springer, Heidelberg (2001)
Kozlov, A., Reyzin, L.: Forward-secure signatures with fast key update. In: Cimato, S., Galdi, C., Persiano, G. (eds.) SCN 2002. LNCS, vol. 2576, pp. 247–262. Springer, Heidelberg (2003)
Kang, B.G., Park, J.H., Halm, S.G.: A new forward secure signature scheme. Cryptology ePrint Archive, Report 2004/183 (2004)
Camenisch, J., Koprowski, M.: Fine-grained forward-secure signature schemes without ran-dom oracles. Discrete Applied Mathematics 154(2), 175–188 (2006)
Ong, H., Schnorr, C.P.: Fast signature generation with a fiat Shamir-like scheme. In: Damgård, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 432–440. Springer, Heidelberg (1991)
Guillou, L.C., Quisquatr, J.J.: A paradoxical identity-based signature scheme resulting from zero-knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 216–231. Springer, Heidelberg (1990)
Krawczyk, H.: Simple forward-secure signatures for any signature scheme. In: the 7th ACM conference on Computer and Communications Security, pp. 108–115. ACM Press, New York (2000)
Maklin, T., Micciancio, D., Miner, S.: Efficient generic forward-secure signatures with an unbounded number of time periods. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 400–417. Springer, Heidelberg (2002)
Boyen, X., Shacham, H., Shen, E., Waters, B.: Forward Secure Signatures with Untrusted Update. In: The 13th ACM conference on Computer and communications security, pp. 191–200. ACM Press, New York (2006)
Libert, B., Jacques, J., Yung, M.: Forward-Secure Signatures in Untrusted Update Envi-ronments: Efficient and Generic Constructions. In: The 14th ACM conference on Computer and communications security, pp. 266–275. ACM Press, New York (2007)
Vo, D.L., Kim, K.: Yet another forward secure signature from bilinear pairings. In: Won, D.H., Kim, S. (eds.) ICISC 2005. LNCS, vol. 3935, pp. 441–455. Springer, Heidelberg (2006)
Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing effi-cient protocols. In: The First ACM Conference on Computer and Communications Secu-rity, pp. 62–73. ACM Press, New York (1993)
Itkis, G.: Forward Security: Adaptive Cryptography-Time Evolution. Invited chapter for the Handbook of Information Security (2005), http://www.cs.bu.edu/faculty/itkis/pap/forward-secure-survey.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, J., Kong, F., Cheng, X., Hao, R., Li, G. (2008). Cryptanalysis of Vo-Kim Forward Secure Signature in ICISC 2005. In: Baek, J., Bao, F., Chen, K., Lai, X. (eds) Provable Security. ProvSec 2008. Lecture Notes in Computer Science, vol 5324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88733-1_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-88733-1_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88732-4
Online ISBN: 978-3-540-88733-1
eBook Packages: Computer ScienceComputer Science (R0)