Call for Paper - August 2019 Edition
IJCA solicits original research papers for the August 2019 Edition. Last date of manuscript submission is July 20, 2019. Read More

An Efficient Security Protocol based on ECC with Forward Secrecy and Public Verification

Print
PDF
{/tag}
IJCA Proceedings on International Conference on Emergent Trends in Computing and Communication (ETCC-2014)
© 2014 by IJCA Journal
ETCC - Number 1
Year of Publication: 2014
Authors:
Anjali Pandey
Sumanjit Das

Anjali Pandey and Sumanjit Das. Article: An Efficient Security Protocol based on ECC with Forward Secrecy and Public Verification. IJCA Proceedings on International Conference on Emergent Trends in Computing and Communication (ETCC-2014) ETCC(1):59-65, September 2014. Full text available. BibTeX

@article{key:article,
	author = {Anjali Pandey and Sumanjit Das},
	title = {Article: An Efficient Security Protocol based on ECC with Forward Secrecy and Public Verification},
	journal = {IJCA Proceedings on International Conference on Emergent Trends in Computing and Communication (ETCC-2014)},
	year = {2014},
	volume = {ETCC},
	number = {1},
	pages = {59-65},
	month = {September},
	note = {Full text available}
}

Abstract

The novel technique titled as "signcryption" announced by Yuliang Zheng, completes both the functionality of signature scheme and encryption scheme in single logical step with a reduced amount of computational cost and communication overhead than Signature-then-encryption scheme. A number of signcryption scheme has previously been announced by many researchers nonetheless each scheme has their own restriction. This paper is grounded on an elliptic curve cryptosystem (ECC) implemented using java technology with reduced amount of computational cost and communication overhead than the existing techniques. It not only offers the integrity, authenticity, confidentiality, unforgeability, non-repudiation beside that forward secrecy and public verification. By forward secrecy of message confidentiality, unauthorized person cannot be able to mine the original message content even if the long-term private key of the sender is compromised. It doesn't be affect the confidentiality of the previously stored message. By the public verification, Anyone can confirm the sender signature without reading the content of message since the message is in encrypted format . As our proposed scheme takes a comparable amount of computational cost, it can be applied in lower computational power devices like smart card based applications ,e-voting etc.

References

  • Yuliang Zheng. Digital signcryption or how to achieve cost (signature encryption)Cost (signature), Cost (encryption). In CRYPTO '97Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology, pages 165-179, London, UK, 1997. Springer-Verlag.
  • F. Bao, R. H. Deng, "A signcryption scheme with signature directly verifiable by public key", Proceedings of PKC'98, LNCS 1431, Springer-Verlag, 1998, pp. 55–59.
  • Yuliang Zheng and Hideki Imai. How to construct efficient signcryption schemes on elliptic curves. Inf. Process. Lett. , 68(5):227-233, 1998.
  • Gamage, C. , J. Leiwo, Encrypted message authentication by firewalls. Proceedings of International Workshop on Practice of Theory in Public Key Cryptography, Berlin, 69-81, 1999
  • Hwang Lai Su, An efficient signcryption scheme with forward secrecy based on elliptic curve, journal of applied mathematics and computation, pages 870-881,2005.
  • M. Dutta,A. K Singh, A. Kumar,"An efficient signcryption schemebased on ECC with forward secrecy and encrypted message authentication", 3rd IEEE international Advance Computing Conference(IACC),2013
  • Mohsen Toorani and Ali Asghar BeheshtiShirazi, " An elliptic curve based signcryption with forward secrecy", Journel of Applied Science, 9(6):1025-1035,2009.
  • H. Y. Jung, K. S Chang ,D. H Lee and J. I Lim,"Signcryption schemes with forward secrecy",Proceeding of Information Security Application-WISA 2001,pp. 403-475,2001.
  • William Stalling, Cryptography and Network Security: Principle and Practices. Prentice Hall Inc. ,Second Edition,1999.
  • K. H Rosen, "Elementary Number Theory and Its Application,"2nd edition,Addison-Wesley,1988
  • L. Batin, S. B Preneel, J. Vandewalle, Hardware architectures for public key cryptography, Integration the VLSI Journal 34 (1-2) (2003) 1-64.
  • X. Yang Y. Han and T. Hu. "Signcryption based on elliptic curve and its multy-party schemes", Proceeding of the 3rd ACM International Conference on Information Security(InfoSecu 04),pages 216-217,2004
  • J. Beak, R. steinfeld, Y. Zheng, Formal proofs for the security of signcryption, in: Proceedings of PKC'02LNCS 2274 , Springer-Verlag , 2002,pp. 81-98.
  • D. Johnson , A. Menezes, S. Venstone , The elliptic curve digital signature algorithm (ECDSA), International Journal of Information Security 1(1) (2001) 36-63.
  • Certicom Research, Standard for efficient cryptography, SEC1: elliptic curve cryptographyStandard for efficient cryptography group (SECG), sept 20, 2000.
  • N. Kobiltz, Hyperelliptic cryptosystem, Journal of Cryptology, Volume 1, Number 3,pp. 139-150(1989).
  • D. Boneh, R. J Lipton, Algorithm for black-box fields and their application to cryptography, in: Advancse in Cryptography: Crypto' 96, 1996, pp. 283-297.