List of Journals    /    Call For Papers    /    Subscriptions    /    Login
 
 
 
 
 SEARCH
By Author By Title
 
 
ABOUT CSC
 About CSC Journals
 CSC Journals Objectives
 List of Journals
 CALL FOR PAPERS
 Call For Papers CFP
 Special Issue CFP
AUTHOR GUIDELINES
 Submission Guidelines
 Peer Review Process
 Helpful Hints For Getting Published
 Plagiarism Policies
 Abstracting & Indexing
 Open Access Policy
 Submit Manuscript
 FOR REVIEWERS
 Reviewer Guidelines
 FOR EDITORIAL
 Editor Guidelines
 Join Us As Editor
 Launch Special Issue
 Suggest New Journal
 CSC LIBRARY
 Browse CSC Library
 Open Access Policy
  SERVICES
 Conference Partnership Program (CPP)
 Abstracting & Indexing
 SUBSCRIPTIONS
 Subscriptions
 Discounted Packages
 Archival Subscriptions
 How to Subscribe
 Librarians
 Subscriptions Agents
 Order Form
 DOWNLOADS
 
 
 
 
An Efficient Password Security of Multi-Party Key Exchange Protocol Based on ECDLP
Full text
 PDF(97.6KB)
Source 
International Journal of Computer Science and Security (IJCSS)
Table of Contents
Download Complete Issue    PDF(3.22MB)
Volume:  3    Issue:  5
Pages:  334-447
Publication Date:   November 2009
ISSN (Online): 1985-1553
Pages 
405 - 413
Author(s)  
 
Published Date   
26-12-2009 
Publisher 
CSC Journals, Kuala Lumpur, Malaysia
ADDITIONAL INFORMATION
Keywords   Abstract   References   Cited by   Related Articles   Collaborative Colleague
 
KEYWORDS:   Key exchange protocol, Password based, secure communication, off-line dictionary attack, ECDLP 
 
 
This Manuscript is indexed in the following databases/websites:-
1. Directory of Open Access Journals (DOAJ)
2. OpenJ-Gate
3. Free-Books-Online
4. Docstoc
5. Scribd
6. PDFCAST
7. ScientificCommons
8. WorldCat
9. CiteSeerX
10. Google Scholar
11. ResearchGATE
12. Bielefeld Academic Search Engine (BASE)
13. refSeek
14. iSEEK
15. Socol@r
16. Academic Journals Database
17. Libsearch
18. slideshare
 
 
In this paper we have proposed an efficient password security of multiparty Key Exchange Protocol based on Elliptic Curve Discrete Logarithm Problem. Key exchange protocols allow a group of parties communicating over a public network to establish a common secret key called session key.Due to their significance by in building a secure communication channel, a number of key exchange protocols have been suggested over the years for a variety of settings.our Protocol is password authentication model, where group member are assumed to hold an individual password rather than a common password. Here we have taken two one-way hash functions to built the level of security high. 
 
 
 
1 Murat Fiskiran A and B Ruby Lee “Workload characterization of elliptic curve cryptography and other network security algorithms for constrained environments”. Proc.IEEE Intl.Workshop on Workload Characterization, pp:127-137, 2002.
2 De Win E. and B Preneel “Elliptic curve public-key cryptosystems - an introduction.State of the Art in Applied Cryptography”, LNCS 1528, pp: 131-141, 1998.
3 Aydos M., E Savas and C .K .KoV 1999. “Implementing network security protocols based on elliptic curve cryptography”. Proc. fourth Symposium. Computer Networks, pp: 130-139, 1999
4 Y.F. Chang “A Practical Three-party Key Exchange Protocol with Round Efficiency”. International Journal of Innovative Computing, Information and Control,Vol.4, No.4, April 2008, 953960.
5 N. Koblitz. “A course in Number Theory and Cryptography”, 2nd edition Springer-Verlag-1994.
6 K. H Rosen ”Elementary Number Theory in Science and Communication”,2nd ed., Springer-Verlag, Berlin, 1986.
7 A. Menezes, P. C Van Oorschot and S. A Vanstone “Handbook of applied cryptography”. CRC Press, 1997.
8 D. Hankerson, A .Menezes and S.Vanstone. “Guide to Elliptic Curve Cryptography “Springer Verlag, 2004.
9 ”Certicom ECC Challenge and The Elliptic Curve Cryptosystem” available: http://www.certicom.com/index.php.
10 M. Burmester and Y. Desmedt ”A Secure and Efficient Conference Key Distribution System”. In proceedings of Eurocrypt 1994, LNCS 950, pp. 275-286, Springer-Verlag, 1995.
11 K. Becker and U.Wille ”Communication Complexity of Group Key Distribution”. In proceedings of ACM CCS 1998, pp. 1-6, ACM Press, 1998.
12 M. Steiner, G. Tsudik, M. Waidner ”Diffie-Hellman Key Distribution Extended to Group Communication”. In proceedings of ACM CCS 1996, pp.31-37, ACM Press, 1996.
13 I. Ingemarsson, D. T. Tang, and C. K. Wong ”A Conference Key Distribution System”. In IEEE Transactions on Information Theory 28(5), pp. 714-720, 1982.
14 G. Ateniese, M. Steiner, and G. Tsudik ”Authenticated Group Key Agreement and Friends”. In proceedings of ACM CCS 1998[1], pp. 17-26, ACM Press, 1998.
15 G. Ateniese, M. Steiner, and G. Tsudik “New Multi-party Authenticated Services and Key Agreement Protocols”. In Journal of Selected Areas in Communications, 18(4), pp. 1-13, IEEE, 2000
16 M. Steiner, G. Tsudik and M.Waidner ” Cliques : A New Approach to GroupKey Agreement” In IEEE Conference on Distributed Computing Systems, May 1998, pp. 380.
17 E. Bresson, O. Chevassut, and D. Pointcheval ” Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions”. In proceedings of Eurocrypt 2002, LNCS 2332, pp. 321-336, Springer-Verlag, 2002.
18 E. Bresson, O. Chevassut, and D. Pointcheval. “Provably Authenticated Group Diffie-Hellman ”Key Exchange - The Dynamic Case”. In proceedings of Asiacrypt 2001, LNCS 2248, pp. 290-309, Springer-Verlag, 2001.
19 E. Bresson, O. Chevassut, D. Pointcheval, and J. J. Quisquater ”Provably Authenticated Group Diffie-Hellman Key Exchange”. In proceedings of ACM CCS 2001, pp. 255-264, ACM Press, 2001.
20 Matthew N. Anyanwu, Lih-Yuan Deng and Dipankar Dasgupta “Design of Cryptographically Strong Generator By Transforming Linearly Generated Sequences” . In International Journal of Computer Science and Security, pp 186-200, Vol-3, issue-3
21 O. Pereira and J.J. Quisquater”A Security Analysis of the Cliques Protocol Suite”. In Computer Security Foundations Workshop (CSFW 2001), pp. 73-81, IEEE Computer Society Press, 2001.
22 M. Steiner, G. Tsudik and M.Waidner ”Cliques : “A New Approach to Group Key Agreement”. In IEEE Conference on Distributed Computing Systems, May 1998, pp. 380.
 
 
 
1 S. Gkarafli and A. A. Economides, “Comparing The Proof By Knowledge Authentication Techniques”, International Journal of Computer Science and Security (IJCSS), 4(2), pp. 237 – 255, 2010.
2 Tarek , B. A. Abdel-latef , A. A. Ahmed and A. M. Mahfouz, “Hybrid Compression Encryption Technique for Securing SMS”, International Journal of Computer Science and Security (IJCSS), 3(6), pp. 473 – 481, 2010.
 
 
 
1 TechRepublic
 
2 Academia.edu
 
3 silicon.com
 
4 ZDNet
 
5 King Abdulaziz University
 
 
 
Jayaprakash Kar : Colleagues
Banshidhar Majhi : Colleagues  
 
 
 
  Untitled Document
 
Copyrights (c) 2012 Computer Science Journals. All rights reserved.
Best viewed at 1152 x 864 resolution. Microsoft Internet Explorer.
 
  
 
Copyrights & Usage: Articles published by CSC Journals are Open Access. Permission to copy and distribute any other content, images, animation and other parts of this website is prohibited. CSC Journals has the rights to take action against individual/group if they are found victim of copying these parts of the website.