×

zbMATH — the first resource for mathematics

An identity-based cryptographic model for discrete logarithm and integer factoring based cryptosystem. (English) Zbl 1358.94071
Summary: In [Lect. Notes Comput. Sci. 196, 47–53 (1985; Zbl 1359.94626)], A. Shamir proposed the concept of the identity-based (ID-based) cryptosystem. Instead of generating and publishing a public key for each user, the ID-based scheme permits each user to choose his name or network address as his public key. This is advantageous to public-key cryptosystems because the public-key verification is so easy and direct. In such a way, a large publickey file is not required. Since new cryptographic schemes always face security challenges and many discrete logarithm and integer factorization problem-based cryptographic systems have been deployed, therefore, the purpose of this paper is to design a transformation process that can transfer all the discrete logarithm and integer factorization based cryptosystems into the ID-based systems rather than re-invent a new system. In addition, no modification of the original discrete logarithm and integer factorization based cryptosystems is necessary.
See also [the authors, Inf. Process. Lett. 113, No. 10-11, 375–380 (2013; Zbl 1358.94071)] for the journal version.

MSC:
94A60 Cryptography
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Shamir, A., Identity-based cryptosystems and signature schemes, (Proc. of CRYPTOʼ84, Lecture Notes in Comput. Sci., vol. 196, (1984), Springer-Verlag), 47-53 · Zbl 1359.94626
[2] Tsujii, S.; Itoh, T., An ID-based cryptosystem based on the discrete logarithm problem, IEEE J. Sel. Areas Commun., 7, 467-473, (1989)
[3] ElGmal, T., A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Inform. Theory, 31, 469-472, (1995)
[4] Diffie, W.; Hellman, M. E., New direction in cryptography, IEEE Trans. Inform. Theory, 22, 644-654, (1976) · Zbl 0435.94018
[5] Kohnfelder, L. M., A method for certification, (May 1978), Lab. Comput. Sci. Mass. Inst. Technol. Cambridge, MA
[6] Okamoto, E.; Tanaka, K., Key distribution system based on identification information, IEEE J. Sel. Areas Commun., 7, 481-485, (1989)
[7] Blom, R., An optimal class of symmetric key generation systems, (Proc. Eurocrypt ʼ84, (1984), Pans France), 335-338
[8] Lee, W. B.; Liao, K. C., Constructing identity-based cryptosystems for discrete logarithm based cryptosystems, J. Network Comput. Appl., 22, 191-199, (2004)
[9] Hwang, M. S.; Lo, J. W.; Lin, S. C., An efficient user identification scheme based on ID-based cryptosystem, J. Network Comput. Appl., 26, 565-569, (2004)
[10] Ohta, K., Efficient identification and signature schemes, Electron. Lett., 24, 2, 115-116, (1988) · Zbl 0681.94011
[11] Bellare, M.; Namprempre, C.; Neven, G., Security proofs for identity-based identification and signature schemes, J. Cryptology, 22, 1-61, (2009) · Zbl 1166.94008
[12] M. Bellare, D. Pointcheval, P. Rogaway, Relations among notions of security for public-key encryption schemes, in: Advances in Cryptography - Cryptoʼ98, 1998, pp. 26-45. · Zbl 0931.94014
[13] R. Canetti, S. Halevi, J. Katz, A forward-secure public-key encryption scheme, in: Advances in Cryptology - Eurocrypt 2003, vol. 2656, 2003, pp. 255-271. · Zbl 1037.68532
[14] Gordon, J., Strong RSA keys, Electron. Lett., 20, 12, 514-516, (1984)
[15] Boneh, D.; Canetti, R.; Halevi, S.; Katz, J., Chosen-ciphertext security from identity-based encryption, SIAM J. Comput., 36, 5, 1301-1328, (2007) · Zbl 1138.94010
[16] Kiltz, E.; Vahlis, Y., CCA2 secure IBE: standard model efficiency through authenticated symmetric encryption, (CT-RSA, Lecture Notes in Comput. Sci., vol. 4964, (2008), Springer-Verlag), 221-239 · Zbl 1153.94400
[17] Meshram, C., A cryptosystem based on double generalized discrete logarithm problem, Int. J. Contemp. Math. Sci., 6, 6, 285-297, (2011) · Zbl 1233.94021
[18] Meshram, C., Modified ID-based public key cryptosystem using double discrete logarithm problem, Int. J. Adv. Comput. Sci. Appl., 1, 6, 30-34, (2010)
[19] U.M. Maurer, Y. Yacobi, Non-interactive public-key cryptography, in: EUROCRYPT 1991, vol. 547, 1991, pp. 498-507. · Zbl 0825.94189
[20] Gangishetti, R.; Gorantla, M. C.; Das, M. L.; Saxena, A., Threshold key issuing in identity-based cryptosystems, Computer Standards and Interfaces, 29, 260-264, (2007)
[21] Sun, J.; Zhang, C.; Zhang, Y.; Fang, Y., An identity-based security system for user privacy in vehicular ad hoc networks, IEEE Trans. Parall. Distrib. Syst., 27, 9, 1227-1239, (2010)
[22] Boneh, D.; Franklin, M. K., Identity based encryption from the Weil pairing, SIAM J. Comput., 32, 3, 586-615, (2003) · Zbl 1046.94008
[23] Boneh, D.; Canetti, R.; Halevi, S.; Katz, J., Chosen-ciphertext security from identity-based encryption, SIAM J. Comput., 36, 5, 1301-1328, (2003) · Zbl 1138.94010
[24] Cocks, C., An identity based encryption scheme based on quadratic residues, (International Conference on Cryptography and Coding (Proceedings of IMA), Lecture Notes in Comput. Sci., vol. 2260, (2001), Springer-Verlag), 360-363 · Zbl 0999.94532
[25] Meshram, C.; Meshram, S. A., Some modification in ID-based cryptosystem using IFP and DDLP, Int. J. Adv. Comput. Sci. Appl., 2, 8, 25-29, (2011)
[26] C. Meshram, S.A. Meshram, An identity based beta cryptosystem, in: IEEE Proceedings of 7th International Conference on Information Assurance and Security (IAS 2011), Dec. 5-8, 2011, pp. 298-303. · Zbl 1233.94021
[27] Meshram, C.; Meshram, S. A.; Zhang, M., An ID-based cryptographic mechanisms based on GDLP and IFP, Inform. Process. Lett., 112, 753-758, (2012) · Zbl 1250.94059
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.