Procedia Computer Science 78 ( 2016 ) 824 – 830
1877-0509 © 2016 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
Peer-review under responsibility of organizing committee of the ICISP2015 doi: 10.1016/j.procs.2016.02.065
ScienceDirect
International Conference on Information Security & Privacy (ICISP2015), 11-12 December 2015,
Nagpur, INDIA
Comparative Analysis of Authenticated Key Agreement Protocols
Based on Elliptic Curve Cryptography
Sonali Nimbhorkar
a, Dr. Latesh Malik
ba
Research Scholar,Computer science & Engineering ,G.H.Raisoni College of Engineering, Nagpur,India
b
Professor Computer Science & Engineering ,G.H.Raisoni College of Engineering, Nagpur,India
Abstract
Authenticated key agreement protocol must put in a nutshell of competent and strong cryptographic algorithm which is ensure confidentiality and integrity of message. Key Agreement Protocol using Elliptic Curve Cryptography provide significant development in cryptography to protect integrity, user anonymity and confidentiality of data than RSA, DSA. To examine, at a fundamental level, the environment of existing key agreement protocol. So that improved elliptic curve cryptosystem addressing implementation of secure key agreement protocol with greater security. To study network security tools in order to establish key agreement between two party or multi party communications various techniques and algorithms for implementation elliptic curve cryptosystem are discussed. Therefore suggested protocol can apply on wireless network to condense the security, performance requirement and cost of computation.
© 2016 The Authors. Published by Elsevier B.V.
Peer-review under responsibility of organizing committee of the ICISP2015.
Keywords: Respiratory mask; Leakage detection; Wearer; Canny Edge Detector;
1. Introduction
The rapid development of information technology that was resulted in significant advances in cryptography to provide security features such as confidentiality, integrity, access control, and non repudiation of data. Elliptic curve cryptography is an alternative for conventional public key schemes such as RSA, DSA and Diffie-hellman Key exchange which provides highest strength with smaller key size which resulted in faster computation, low © 2016 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license
(http://creativecommons.org/licenses/by-nc-nd/4.0/).
power consumption, requires less storage, bandwidth and memory. Such public key scheme provides methodology for efficient implementation of protocol for authenticated key agreement. EC arithmetic can be used to develop variety of elliptic curve public key based scheme including key exchange, encryption and digital credential. Key establishment deal with establishing a shared secret key between one or more parties. Key establishment is strongly associated with identification .Key establishment methods are of two types namely key transport and key agreement. In key transport only one communicating party established key where as in key agreement both commutating parties established key. Many authenticated and secure key agreement protocol have been proposed may contained weaknesses which oppressed with active and passive kind of attack, so that continuous analysis of protocol is carried out to check sound working. There have been many attempts to create a formal methodology for authenticated key agreement protocol based on elliptic curve cryptosystem. All active existing protocols based elliptic curve cryptosystems that are used for either key exchange or for ciphering. The intricacy of designing accurate protocols for authentication and key agreement is difficult to solve in any environment. This is particularly evident from the large numbers of published protocol which have later been found to contain various flaws. A variety of protocol specifically designed for use in mobile environment has been proposed in recent year by many authors [25][26][27][28][29][30][31][32][33][34] .The remaining Section of this paper is planned as follows: Section 2 describes literature review of elliptic curves, key agreement protocol, Section 3 discusses the main security consideration for elliptic curve cryptography, performance parameters, desirable properties and section 4 analyze and compare the design methodology key agreement protocol using ECC for communication network, in section 5, Performance analysis parameters and properties of key Agreement Protocols are examined. Finally, conclusion is described.
2. Literature Review
Key agreement protocols are the common way for two communicating parties to achieve secure communication by establishing a session key to encrypt the data and exchange data among the communicating parties. In 2005, secure and scalable authenticated key exchange (agreement), Diffie-hellman key exchange with cryptographic assumption protocol system in which during transmission controlling of keys and management carried out[23-25]. In 2009, Id-based authentication with key agreement schemes for mobile devices communication on elliptic curve cryptosystem based on pairing free, certificate less were discussed to overcome attack [4][6][11][12][27]. In 2010 -2012, Binary field is considered to be more suitable for hardware implementation of ECC than large prime number domain GF(p) and GF(2m). By analyzing the modular arithmetic in binary field and choosing the suitable algorithm, they exchange all the modular arithmetic to three types of modular arithmetic such modular addition, modular multiplication and modular square[16][35].
An Identity-based multi-server authentication with key agreement scheme without verification table on elliptic curve cryptosystem was proposed in electronic transactions, remote user authentication in insecure channel is an important issue[10][15][19][32]. In 2015, efficient and secure authenticated key agreement protocol based on elliptic curve cryptosystem for user anonymity, for UMTS network, grid network has been discussed. Novel mutual authentication scheme for session initiation protocol based on elliptic curve cryptography implemented for controlling communication on the internet was proposed [31][34].
As technology is becoming more advanced and more integrated in everyday life new challenges are constantly emerging
3. Performance Analysis Finite Field (Fp &F2 m
)
Elliptic curve based cryptosystems applications and protocols relies on the elliptic curve group operations such as point adding, point doubling and scalar multiplication(kP), Comparative Analysis of Elliptic curve cryptography over binary Field GF(2m )with the ECC using Prime field. In an average, n -1 doublings and n -1/ 2 additions requires in binary method where n is the bit length. The addition-subtraction algorithm performs n-1 doublings and
n-1/3 additions in an average which improve the speed of the Elliptic curve cryptography over binary field. So, number of instances also reduces in the binary method. However, the rate of change is much faster in binary more than the Elliptic curve cryptography over prime field.
Following graph shows the comparison analysis of Elliptic curve cryptography over binary field with Elliptic curve cryptography over prime field. Here Following graph shows, how much time taken by binary algorithm as compared with prime. Blue line indicates time taken by System using Prime field whereas Red line indicates time taken by system using Elliptic curve cryptography over binary field.
Table 1 : Comparison analysis of ECC Algorithm over Binary and Prime Field(Time in micro seconds)
Word Result_Ecc_Prime Result_Ecc_F2m
hiii 0.109 0.078
How are you 0.187 0.05
Hru 0.218 0.031 I'm Fine 0.218 0.046 Hey 0.093 0.078 Hello 0.203 0.062 LoL 0.187 0.093 ROFT 0.156 0.09 BTW 0.109 0.046 What abt u 0.125 0.078 TTYL 0.187 0.062 g2g 0.062 0.046 bjiij 0.125 0.089 asewgyy 0.172 0.076
In elliptic curve cryptography, scalar multiplication is the most time consuming operations like point addition, point doubling and scalar multiplication .Operational efficiency of scalar multiplication is directly proportional to its performance of elliptic curve cryptography. Hence from above analysis, it is summarized that elliptic curve cryptography over a binary field is much faster as compared with prime field[1-9].
Fig1. a : Comparison analysis of ECC Algorithm over Binary and Prime Field(Time in micro seconds) 4. Design Methodology Authenticated key Agreement Protocols
Technical categories of Authentication with key agreement approaches are Password based key, Public key
infrastructure based, Identity-based key, and Group key based exchanges. There are several challenges concerning key exchange and key agreement such as ensuring that the keys are exchanged between dispatcher and recipient perform Encryption and Decryption, Preventing an eavesdropper from getting to know the key. Give the receiver
0 0.05 0.1 0.15 0.2 0.25 1 3 5 7 9 11 13 result_ECC_pri me result_ECC_F2 m
some proof that a message was encrypted by the party who claims to have sent the message [1-15][34]. The proposed scheme is divided into six algorithms:
x Setup, Set-Secret-Value, x Partial-Private-Key-Extract, x Set-Private-Key, Set-Public-Key, x Key-Agreement.
4.1. Practical &Efficiency comparison analysis of key Agreement Protocols
There are three major categories of key agreement schemes defined in the standards [1-16]like Two-Party, one-Party, no ephemeral keys Participation. In addition desired security features and implementation requirement parameters to be considered such as Mutual Authentication, on-repudiation of Service, Confidentiality, Anonymity of User, Physical Requirements, Terminal Security.
Table 2: Practical &Efficiency Comparison of Authenticated Key Agreement Protocol
5. Performance analysis of key Agreement Protocols based On Elliptic Curve Cryptography
This section consists of key agreement protocols based on Elliptic curve Cryptography with detailed and brief explanation, also contributes the issues while designing a Protocol. Table number two mentioned below gives thorough explanation of comparisons of mechanisms.
5.1. The designed protocol should achieve the following goals by the end of a successful run[1-15]:
x Mutual authentication between server and user;
x Agreement between user and server on a secret authentication key to protect the data used in mutual authentication process;
Properties AKA[10] AKA[15] AKA[14] AKA[17] AKA[18] AKA[19] AKA[20]
Mutual Authentication
Yes Yes Yes Provided Provided Provided Provided
Key agreement Yes Yes Yes Yes Yes Yes Yes
Certification computation Yes No No No No No No Parings computations No No No Yes No No No Computation Cost(user side) 3PM+2PA +1MM 1PM+2PA 3PM+2 PA 12PM 10PM 10PM 6PM Communication rounds 3 2 2 3 2 2 2 Bandwidth 2P+2p 2P 2P+2p 2P+2p 2P 2P P+H
x Non-repudiation of origin by user for relevant data sent from user to server; concurrence between communicating parties on a secret session key which will be used to encrypt data sent by each party;
x User confidentiality and user anonymity.
Table3: Technical Sheet AKA Mechanism comparison based on No. of Mechanism
Parameters EC-AKA SE-AKA Standard AKA
Security 1 2 3
Cost 1 3 1
Overhead 2 3 1
Delay 2 3 1
Performance 2 3 1
Table4: Security Comparison Design schemes of attacks
Security Properties [11] [12] [13] [14] [15] Proposed
Scheme
Stolen-Verifier attack ¥ ¥ ¥ ¥ ¥ ¥
Impersonation attack x ¥ ¥ ¥ ¥ ¥
Session-key perfect forward secrecy x x x ¥ ¥ ¥
Insider Attack ¥ ¥ ¥ ¥ ¥ ¥
Clock synchronization x x x ¥ ¥ ¥
Replay attack x x x ¥ ¥ ¥
Many logged-in users x x ¥ ¥ x ¥
Known Session-specific temporary information x x x x x ¥
Known key attack ¥ ¥ x ¥ ¥ ¥
Denial of service attack ¥ ¥ ¥ x ¥ ¥
Mutual Authentication x ¥ ¥ ¥ ¥ ¥
Session Key Exchange ¥ ¥ ¥ ¥ ¥ ¥
No Verification Table ¥ ¥ ¥ x ¥ ¥ User’s Anonymity x ¥ ¥ ¥ ¥ ¥ Revocation Phase x x x ¥ ¥ ¥ Outsider attack x x x x x ¥ Forgery Attack x x x x x ¥ Key Control x x x x x ¥
Protocols are analyzed using properties such as Known session keys, Perfect forward secrecy, Unknown key-share, Key-compromise impersonation, Loss of information, Key control, Identity assurance, Computational efficiency and Communication efficiency. EC-AKA deduce 95 % less Processing when compared with SA-AKA[2].
Table 5. Comparison analysis of Computation Cost
Computation Type Authentication Registration
[11] 8PM+5PA+8H 1PM+1H
[12] 7PM+4PA+12H 1PM+1H
[13] 8PM+4PA+11H 1PM+4H
[14] 7PM+4PA+6H 1PM+1H
[15] 7PM+2PA+10H 1PM+1H
Proposed Scheme 7PM+2PA+4H 1PM+1H
Authentication and registration computed based on operation of point multiplication, point addition and hash value calculation .
6. Conclusion
In this paper, comparative analysis of various key agreement protocols carried out based on practical and efficiency measures of key agreement protocols. Also performance analysis of existing key agreement protocols based on ECC have been carried out for different security properties to detect their weaknesses. It is observed that, If a protocol prone to attacks, it may not work appropriately and hazards the security . The proposed scheme will improve the successful run of key agreement protocol without affliction of any kinds of attacks like eavesdropping, modification, replay, and denial of service, cryptanalysis and many more. In Future the proposed authenticated key agreement protocol will develop and tested for performance and security requirements for wireless communication.
References
1. Amr Farouk, Mohamed M. Fouad and Ahmed A. Abdelhafez. Analysis And Improvement Of Pairing-Free Certificate-Less Two-Party Authenticated Key Agreement Protocol For Grid Computing. International Journal of Security, Privacy and Trust Management
(IJSPTM) Vol 3, No 1, February 2014.
2. Jacques Bou Abdo,Jacques Demerjian ,Hakima chaouchi. Security v/s QOS for LTE Authentication and key Agreement Protocol.
International Journalof network security &its application (IJNSA),VOL , NO. 5,september2012.
3. Yan Ding , Xian-wei Zhou ,Zhi-mi Cheng ,Wen-lu Zeng. Efficient Authentication and Key Agreement Protocol with Anonymity for Delay Tolerant Networks. Wireless Press Communication (2013) 70:1473–1485DOI 10.1007/s11277-012-0760-x.Springer
4. Geng Manman and Zhang Futai. Provably secure certificateless two-party authenticated keyagreement protocol without pairing. In
IEEE International Conference on Computational Intelligenceand Security, volume 2, pages 208–212, 2009.
5. Mohamed Nashwa, Hashim Mohsin, Bashier Eihab, and Hassouna Mohamed. Fully-secure and efficient pairing-free certificateless authenticated key agreement protocol. In IEEE World Congresson Internet Security, pages 167–172, 2012.
6. Hou Mengbo and Xu Qiuliang. A two-party certificateless authenticated key agreement protocol without pairing. In the 2nd IEEE
International Conference on Computer Science and InformationTechnology, pages 412–416, 2009.
7. Yang Guomin and Tan Chik-How. Strongly secure certificateless key exchange without pairing. In the 6th ACM Symposium on
Information, Computer and Communication Security, pages 71–79,2011.
8. He Debiao, Chen Jianhua, and Hu Jin. A pairing-free certificateless authenticated key agreement protocol. International journal of
network Security,Vol.7 No.5,2010 Elsevier .
9. He Debiao, Chen Yitao, Chen Jianhua, Zhang Rui, and Han Weiwei. A new two-round certificate less Authenticated key agreement protocol without bilinear pairings. Mathematical and Computer Modelling, 54(11):3143–3152, Aug. 2011.
10. He Debiao, Padhye Sahadeo, and Chen Jianhua. An efficient certificate less two-party authenticated key agreement protocol”Computers & Mathematics with Applications, 64(6):1914–1926, Sep. 2012.
11. 11. J.-H. Yang and C.-C. Chang. An id-based remote mutual authentication with key agreement scheme for mobile devices on elliptic curve cryptosystem. computers & Security, vol. 28, no. 3-4, pp. 138–143,2009.
12. E.-J. Yoon and K.-Y. Yoo. Robust id-based remote mutual authentication with key agreement scheme for mobile devices on ecc.
Computational Science and Engineering, IEEE International Conference on, vol. 2, pp. 633–640, 2009.
13. T.-H. Chen, Y.-C. Chen, and W.-K. Shih. An advanced ecc id-based remote mutual authentication scheme for mobile devices. 2010
Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing, pp. 116–120, 2010.
14. S. H. Islam and G. P. Biswas. A more efficient and secure id-based remote mutual authentication with key agreement scheme for mobile devices on elliptic curve cryptosystem. Journal of Systems and Software, vol. 84, no. 11, pp. 1892–1898, 2011.
15. Tianhua Liu,Hongfeng zhu. An ID based multi-server authentication with key agreement scheme without verification table on elliptic curve cryptosystem. 2010 International conference on computational aspectsof social Networks,978-7695-4202/10 ,IEEE2010.
16. Andre Weimerskirch,douglas stebila,Sheueling chang Shantz. Generic GF(2m )arithmetic in software and its Application to ECC. the
8th Australasian conference on Information security and Privacy(ACISP2003)
17. R.W.Zhu,G.Yang,R.Sun. An efficient identity-based key agreement protocol with KGS forward secrecy for low-power devices.
Theoretical Computer Science ,no.378,pp198-207,2007.
18. X.cao,W.Kou,Y yu,R.sun. identity-based authentication key agreement protocols without bilinear pairings. IEICE tran.Fundamental .vol.E91-a,No.12,pp3833-3836,2008.
19. X.cao,W.Kou. A pairing –free identity-based authenticated key agreement protocol with minimal message Exchanges . Information
sciences (2010),doi:10.1016/j.ins.2010.04.002.
20. Debiao He,jianhua chen,jiN Hu. A New Provably Secure autheicated Key agreement protocol without Bilinear pairings. Journal of
information &Computational science 7:5(2010),1089-1096.
21. H.-A. Wen, C.-L. Lin and T. Hwang. Provably secure authenticated key exchange protocols for low power computing clients.
Computers & Security, vol. 25, 2006,pp. 106-113.
22. C. Popescu. "A Secure Authenticated Key Agreement Protocol". Proceedings of the12th IEEE Mediterranean Electrotechnical
Conference, Dubrovnik, Croatia, pp. 783-786, May 2004.
23. L. Harn, W.-J. Hsin and M. Mehta. Authenticated Diffie-Hellman key agreement protocol using a single cryptographic assumption.
IEE Proceedings on Communications,vol. 152, issue 4, pp. 404-410, 2005.
24. Y.-M. Tseng. Efficient authenticated key agreement protocols resistant to a denialof-service attack. International Journal of Network
Management, vol. 15, 2005, pp.193-202.
25. E.-J. Yoon and K.-Y. Yoo. New Efficient Simple Authenticated Key Agreement Protocol. ,Proceedings of Lecture Notes in Computer
Science, vol. 3595, pp. 945-954,2005.
26. Eun-jun yoon ,sung-bae choi,kee-young yoo, a secure and efficiency id-based authenticated key agreement scheme based on elliptic curve cryptosystem for mobile devices. international journal of innovative computing ,information and control volume8,number4,iSSN1349-4198pp2637-2653.2012
27. Hou, H., & Liu, S. CPK-based authentication and key agreement protocols with anonymity
28. for wireless network. In International conference on multimedia information networking and security(pp. 347–350).(elated). 29. Shengbao Wang, Zhenfu Cao1, Zhaohui Cheng, Kim-Kwang Raymond Choo, Perfect Forward Secure Identity-Based Authenticated
Key Agreement Protocol in the Escrow Mode. eprint.iacr.org/2007/313.
30. Majid Bayat, MohammadReza Aref. A Secure and efficient elliptic curve based authentication and key agreement protocol suitable for WSN. Elsevier June 10, 2013.
31. Neetesh Saxena,Jaya Thomas, Narendra S. Chaudhari. ES-AKA: An Efficient and Secure Authentication and Key Agreement Protocol for UMTS Networks 17april2015 Springer
32. Dheerendra Mishra , Ashok Kumar Das,Sourav Mukhopadhyay. A secure and efficient ECC-based user anonymity-preserving session initiation authentication protocol using smart card. 09 December 2014 Springer
33. Mohammad Sabzinejad Farash,Mahmoud Ahmadian Attari. An ID-Based Key Agreement Protocol Based on ECC Among Users of Separate Networks. 2012 9th International ISC Conference on Information Security and Cryptology,978-1-4673-2386-4/12,2012 IEEE.
34. Zhang Juan,Deng fangmin. The Authentication and Key Agreement Protocol Based on ECC for Wireless Communications. 978-1-4244-4639-1/09.2009 IEEE.
35. Nimbhorkar, S.U., and L.G. Malik Exploration of Schemes for Authenticated Key Agreement Protocol Based on Elliptic Curve Cryptosystem, 2013 6th International Conference on Emerging Trends in Engineering and Technology, 978-1-4799-2560-5 2013. 36. Yingjie qu and Zhengming hu .Research and Design of Elliptic Curve Cryptography .(2010 IEEE).
