Abstract
In this paper, we propose two new signature schemes and a novel short signature scheme from two hard problems. The proposed schemes have two prominent advantages. Firstly, they are developed from some signature schemes where the security and efficiency have been proven. Therefore, they inherit these properties from the previous schemes. Secondly, the security of the proposed schemes is based on two hard problems. Therefore, they are still safe even when cryptanalysis has an effective algorithm to solve one of these problems, but not both. Moreover, we also propose a method for reducing signatures and this is the first attempt to reduce signatures based on two hard problems. Therefore, our proposed schemes are suitable for the applications requiring long-term security in resource limited systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Menezes AJ, van Oorschot PC, Vanstone SA (1996) Handbook of applied cryptography. CRC Press, Boca Raton
Pieprzyk J, Hardjono T, Seberry J (2003) Fundamentals of computer security. Springer, New York
Harn L (1994) Public-key cryptosystem design based on factoring and discrete logarithms. IEEE Proc Comput Digit Tech 141(3):193–195
Tzeng SF, Yang CY, Hwang MS (2004) A new digital signature scheme based on factoring and discrete logarithms. Int J Comput Math 81(1):9–14
Ismail ES, Tahat NMF (2011) A new signature scheme based on multiple hard number theoretic problems. ISRN Commun Netw
Li J, Xiao G (1998) Remarks on new signature scheme based on two hard problems. Electron Lett 34(25):2401–2402
Chen T-H, Lee W-B, Horng G (2005) Remarks on some signature schemes based on factoring and discrete logarithms. Appl Math Comput 169:1070–1075
Buchmann J, May A, Vollmer U (2006) Perspectives for cryptographic long term security. Commun ACM 49(9):50–55
Boneh D, Lynn B, Shacham H (2001) Short signatures from the Weil pairing. In: ASIACRYPT ‘01, vol 2248. LNCS, pp 514–532
Moldovyan NA (2009) Short signatures from difficulty of factorization problem. Int J Netw Secur 8(1):90–95
Dernova ES (2009) Information authentication protocols based on two hard problems. PhD Dissertation, St.Petersburg State Electrotechnical University. St. Petersburg, Russia
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media Dordrecht(Outside the USA)
About this paper
Cite this paper
Do, B.V., Nguyen, M.H., Moldovyan, N.A. (2013). Digital Signature Schemes from Two Hard Problems. In: Park, J., Ng, JY., Jeong, HY., Waluyo, B. (eds) Multimedia and Ubiquitous Engineering. Lecture Notes in Electrical Engineering, vol 240. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-6738-6_100
Download citation
DOI: https://doi.org/10.1007/978-94-007-6738-6_100
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-6737-9
Online ISBN: 978-94-007-6738-6
eBook Packages: EngineeringEngineering (R0)