A Peer-to-Peer Key Establishment Scheme without Pre-distributing Keys in Ad-Hoc Networks 


Vol. 29,  No. 7, pp. 1015-1023, Jul.  2004


PDF
  Abstract

In order to protect an exchanged data, it is indispensable to establish a peer-to-peer key between the two communicating nodes. Pre-distributing keys among the nodes is unrealistic in Ad-Hoc network environment because of the dynamic nature of its network topology and the equal authority of its nodes. This paper presents a peer-to-peer key establishment scheme without pre-distributing keys in Ad-Hoc networks. The proposed scheme is based on the Diffie-Hellman key exchange protocol. Main idea is to prevent the falsification of Diffie-Hellman values using some elements of a hash chain. As a result, it is as safe as the underlying hash function against a man-in-the-middle attack. Simulation results have shown that the proposed scheme dramatically reduces the number of messages, and has relatively higher scalability, as compared with the key pre-distribution based scheme.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

G. Wang, S. Bang, B. Chung, G. Cho, "A Peer-to-Peer Key Establishment Scheme without Pre-distributing Keys in Ad-Hoc Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 7, pp. 1015-1023, 2004. DOI: .

[ACM Style]

Gicheol Wang, Sangwon Bang, Byungho Chung, and Gihwan Cho. 2004. A Peer-to-Peer Key Establishment Scheme without Pre-distributing Keys in Ad-Hoc Networks. The Journal of Korean Institute of Communications and Information Sciences, 29, 7, (2004), 1015-1023. DOI: .

[KICS Style]

Gicheol Wang, Sangwon Bang, Byungho Chung, Gihwan Cho, "A Peer-to-Peer Key Establishment Scheme without Pre-distributing Keys in Ad-Hoc Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 7, pp. 1015-1023, 7. 2004.