用於靜態無線感測網路之金鑰建立協定

A Location-Id Sensitive Key Establishment Scheme in Static Wireless Sensor Network

陳立(Li Chen)

指導教授 ： 雷欽隆

國立臺灣大學/電機資訊學院/資訊網路與多媒體研究所/碩士(2008年)

https://doi.org/10.6342/NTU.2008.01313

摘要

無線感測網路一般都由數千個資源受限的節點所組成，並部屬在不具網路基礎架構的地點上。目前對於無線感測網路的主要研究都集中在如何安全建立兩兩節點之間的金鑰機制，但許多利用路由資訊，資源消耗，和竊取節點中秘密的攻擊行為可以很快的欺騙或癱瘓整個網路，攻擊者也不需使用太多的技術與機器。我們以LEAP+為基礎架構之下，提出一個結合LEAP+與節點位置資訊的金鑰建立機制，利用驗證節點身分與節點位置的真實性，我們有效的抑制了身分詐欺攻擊，節點複製攻擊的影響範圍。我們進一步提出一個認證節點的機制來防止可能的竊聽重送攻擊，以實作在NS2 的系統證明我們的機制與LEAP+相比能夠更防止惡意攻擊對網路所造成的影響。

關鍵字

感測網路 ； 金鑰建立機制 ； 路由攻擊 ； 身分詐欺攻擊

並列摘要

Sensor networks usually consist of thousands of resource-limited nodes and are deployed in a designated area without any fixed infrastructure. While the establishment of the pairwise keys between any pair of adjacent nodes to build a secure link remains the main concern in the design of key management protocols, malicious attacks aim at routing information, exhaust node’s resource, and compromised secrets can misdirect the data flow or denial the network service with relatively small effort. Many mission-critic sensor network applications demand an effective, light, and flexible algorithm yet robust under attacks. Based on the LEAP+ scheme, we propose an improved LEAP+ by adding location information into the key establishment phase. By identifying the correctness of the id-location pair, our scheme effectively limits the Sybil attack and mitigates the damage of HELLO flood attack and node cloning attack. We furthermore propose an authentication phase in our scheme to defend possible replay attacks. The analysis shows that our scheme is more robust than LEAP+ with only minor increase of computation overhead.

並列關鍵字

sensor network ； location-based key establishment ； HELLO flood attack ； node cloning ； sybil attack

參考文獻

4. C. Blundo, A. D. Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung, “Perfectly Secure Key Distribution for Dynamic Conferences,” Proceedings of CRYPTO’92, Advances in Cryptology, Lecture Notes in Computer Science, vol. 740, pp.471–486, 1993.

5. R. Blom, “An Optimal Class of Symmetric Key Generation Systems,” Proceedings of EUROCRYPT’84, Advances in Cryptology, Lecture Notes in Computer Science, vol. 209, pp. 335–338, 1984.

6. C. Boyd, “On Key Agreement and Conference Key Agreement,” Proceedings of the Second Australasian Conference on Information Security and Privacy, Lecture Notes In Computer Science, Vol. 1270, 1997.

7. B. Brisco, “MARKS: Multicast Key Management Using Arbitrarily Revealed Key Sequences,” Proceedings of First Int’l Workshop Networked Group Communications, November. 1999.

9. R. Canetti, T. Malkin, and K. Nissim, “Efficient Communication-Storage Tradeoffs for Multicast Encryption,” Proceedings of Conference: Advances in Cryptology (EUROCRYPT ’99), pp. 459-474, 1999.