One-Pass Authenticated Key Establishment Protocol on Optimal Eta Pairings for Wireless Sensor Networks

Abstract:

The article proposed one-pass authenticated key establishment protocol from optimal eta pairings in random oracle for Wireless Sensor Networks. Security of the protocol relies on Computational Diffie-Hellman Problem on Optimal Eta Pairings. In one-pass key establishment protocol, the initiator computes a session key and a re1ated message. The key token is to be sent to the intended receiver using receiver's public key and sender secret key. From the received key token the receiver compute the session key, which is the same as the one computed by the sender,using sender public key and receiver's secret key. Because of low communication overhead, the scheme is better suited for Wireless Sensor Networks (WSNs) than the traditional key establishment protocol to establish the session key between two adjacent nodes.

• Periodical: Applied Mechanics and Materials (Volumes 556-562)
• Pages: 4482-4486
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.556-562.4482
• Online since: May 2014
• Authors: Jun Hua Ku*, Zhi Hua Cai, Ye Tong Wang, Bing Zheng
• Keywords: Authenticated, Key Establishment, Optimal Eta Pairing

References

[1] A. Menzes,T. Okamoto，and S. Vanstone Reducing elliptic curve logarithms to logarithms in a finite field ， IEEE Transactions on Information Theory, 39, pp.1639-1646, (1993).

DOI: 10.1109/18.259647

[2] R. Sakai, K. Ohgishi, and M. Kasahara Cryptosystems based on pairing. Symposium on Cryptography and Information Security, Okinawa, Japan, (2000).

[3] Barreto et al ,M.: Efficient pairing computation on supersingular Abelian varieties. Des. Codes Crypt. 42, 239-271 (2007).

DOI: 10.1007/s10623-006-9033-6

[4] Galbraith, S.: Supersingular curves in cryptography. In: Boyd, C. (ed. ) ASIACRYPT 2001. pp.495-513. No. 2248 in LNCS, Springer (2001).

DOI: 10.1007/3-540-45682-1_29

[5] Cantor, D. Computing in the Jacobian of a hyperelliptic curve. Math. Comput. 48(177), 95-101 (1987).

DOI: 10.1090/s0025-5718-1987-0866101-0

[6] Vercauteren, F.: Optimal pairings. IEEE Trans. Inf. Theory 56(1), 455-461 (2010).

[7] Ku J, Yun D, Zheng B, et al. An Efficient ID-Based Directed Signature Scheme from Optimal Eta Pairing[M]/Computational Intelligence and Intelligent Systems. Springer Berlin Heidelberg, 2012: 440-448.

DOI: 10.1007/978-3-642-34289-9_49

[8] M. Choudury G. orantla, Colin Boyd and Juan Manuel GonzaJez Nieto ID-based One-pass Authenticated Key Establishment, in proceeding of Australian Information Security Conference(AISC2008), Wollongong, Australia, January 2008. Conferences in Research and Practice in Information Technology (CRPIT), Vol. 81, (2008).

[9] Joseph K. Liu, Joonsang Baek, Jianying Zhou, Yanjiang Yang and Jun Wen Wong Efficient Online/Offline Identity-Based Signature for Wireless Sensor Network, in IACR Arcieve ePrint-2010/03.

[10] Yuan Wang, Duncan S. Wong, and Liusheng Huang. One-Pass Key Establishment Model and Protocols for Wireless Roaming with User Anonymity, International Journal of Network Security, Vo1. 16, No. 2, PP. 129-142, Mar. (2014).

[11] J. Kar and B. Majhi A Secure Two-Party Identity Based Key Exchange Protocol based on Elliptic Curve Discrete Logarithm Problem. "， Journal of Information Assurance and Security，USA Vol-5(1), pp.473-482, (2009).

[12] Granger, R., Hess, F., Oyono, R., Thériault, N., Vercauteren, F.: Ate pairing on hyperelliptic curves. In: Naor, M. (ed. ) EUROCRYPT 2007. pp.430-447. No. 4515 in LNCS, Springer (2007).

DOI: 10.1007/978-3-540-72540-4_25

[13] Aranha, D.F., Lờpez, J., Hankerson, D.: High-speed parallel software implementation of the pairing. In: Pieprzyk, J. (ed. ) CT-RSA 2010. LNCS, vol. 5985, pp.89-105. Springer (2010).

DOI: 10.1007/978-3-642-11925-5_7