Volume- 2
Issue- 6
Year- 2014
Article Tools: Print the Abstract | Indexing metadata | How to cite item | Email this article | Post a Comment
S.Kuzhalvaimozhi , Dr.G.Raghavendra Rao
In a conventional public key crypto system, the participants must verify the certificate prior to use the public key. The main drawback of the certificate in conventional public key system are large storage, large computing time to store and verify each user’s public key and the corresponding certificate. Identity based cryptography is the new system which reduces the key management process in conventional public key infrastructures (PKI). Any public information such as the e-mail address, name, etc., can be used as a public key. This resolves the problem of getting the public key of a user and checking the validity of certificate. This paper provides a general idea of the Digital signature based on Identity based cryptography. The various efficient Identity Based Signature schemes are analyzed based various criteria like number of operations required for generation and verifying signature, size of the signature and number of paring operations.
[1] A. Shamir. Identity-based Cryptosystems and Signature Schemes,Advances in Cryptology - CRYPTO ’84, LNCS 196, pp. 47-53, 1985.
[2] D. Boneh and M. Franklin. Identity-Based Encryption from the Weil Pairing, Advances in Cryptology - CRYPTO ’2001, LNCS 2139, pp.213-229, 2001.
[3] F. Hess. Efficient Identity based Signature Schemes based on Pairings. Selected Areas in Cryptography –SAC 2002, LNCS 2595, pp. 310-324, 2003.
[4] R. Sakai, K. Ohgishi, and M. Kasahara. Cryptosystems Based on Pairings, The 2000 Symposium on Cryptography and Information Security, pp. 26-28, 2000.
[5] C. Boyd, W. Mao, and K.G. Paterson. Key Agreemet Using Statically Keyed Authenticators, Applied Cryptography and Network Security, ACNS 2004, LNCS 3089, pp. 248-262, 2004.
[6] L. Chen and C. Kudla. Identity Based Authenticated Key Agreement Protocols from Pairings. Hewlett-Packard Technical Report HPL-2003-25 20030212, HP Laboratories, 2003.
[7] K. Hoeper and G. Gong. Limitations of Key Escrow in Identity- Based Schemes in Ad Hoc Networks. Security and Privacy for Emerging Areas in Communication Networks –SecureComm 2005, submitted for publication.
[8] M. Girault. Self-Certified Public Keys, Advances in CryptologyEUROCRYPT ’91, LNCS 547, pp. 490-497, 1991.
[9] J.C. Cha and J.H. Cheon. An identity-based signature from gap Diffie-Hellman groups. Cryptology ePrint Archive, Report 2002/018, 2002. http://eprint.iacr.org/.
[10] F. Hess. Exponent group signature schemes and efficient identity based signature schemes based on pairings. Cryptology ePrint Archive, Report 2002/012, 2002. http://eprint.iacr.org/.
[11] K.G. Paterson. ID-based signatures from pairings on elliptic curves. Electronics Letters,38(18):1025–1026, 2002.
[12] R. Sakai, K. Ohgishi, and M. Kasahara. Cryptosystems based on pairing. In The 2000 Sympoium on Cryptography and Information Security, Okinawa, Japan, January 2000.
[13] Shamir. Identity-based cryptosystems and signature schemes. In Advances in Cryp-tology -CRYPTO ’84, volume 196 of Lecture Notes in Computer Science, pages 47–53. Springer-Verlag, 1984.
[14] Zhang and K. Kim, ID-based Blind Signature and Ring Signature from Pairings, Advances inCryptology – Proceddings of ASIACRYPT 2002,LNCS 2501, pages 533–547, Springer-Verlag, 2002
[15] P. Barreto, H. Kim, B. Lynn, and M. Scott, Efficient Algorithms for Pairing-Based Crypto systems , Advances in Cryptology - Proceedings of CRYPTO 2002, LNCS 2442, pages 354–369, Springer-Verlag, 2002
Department of Information Science and Engineering, National Institute of Engineering, Mysore, Karnataka, India.
No. of Downloads: 3 | No. of Views: 935
