Affiliation:
1. Hainan Institute of Science and Technology
2. China University of Geosciences Wuhan
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.
Publisher
Trans Tech Publications, Ltd.
Reference13 articles.
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).
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).
4. Galbraith, S.: Supersingular curves in cryptography. In: Boyd, C. (ed. ) ASIACRYPT 2001. pp.495-513. No. 2248 in LNCS, Springer (2001).
5. Cantor, D. Computing in the Jacobian of a hyperelliptic curve. Math. Comput. 48(177), 95-101 (1987).