BlocKP: Key-Predistribution-Based Secure Data Transfer

被引:0
作者
Gharib, Mohammed [1 ]
Owfi, Ali [1 ]
Afghah, Fatemeh [1 ]
Bentley, Elizabeth Serena [2 ]
机构
[1] Clemson Univ, Elect & Comp Engn Dept, Clemson, SC 29634 USA
[2] Air Force Res Lab, Commun Technol & Syst Branch, Rome, NY 13441 USA
基金
美国国家科学基金会;
关键词
Blockchain; key predistribution; multihop wireless network; secure end-to-end communication; WIRELESS SENSOR NETWORKS; PRE-DISTRIBUTION; DISTRIBUTION SCHEME; ESTABLISHMENT; PAIRWISE;
D O I
10.1109/JIOT.2021.3137900
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Key predistribution schemes are promising lightweight solutions to be placed as the cornerstone of key management systems in multihop wireless networks. The intermediate decryption-encryption problem, however, is considered as the security threat of such schemes. Multipath algorithms have been proposed to face such a shortcoming. Alas, these solutions are vulnerable against the node capture attack, where the attacker compromises a fraction of network nodes. In this article, we propose BlocKP, a Blockchain-based solution to increase the resistance of the network against the node capture attack. BlocKP utilizes disjoint key paths for a key-exchange process, where the keying materials form a block at the source side. Each key path step generates the next block of the Blockchain until the keying materials reach the destination. BlocKP is a general framework applicable to any key predistribution schemes. We propose BlocKP in two versions BlocKP-I and BlocKP-II, where the latter enhances the resistance of BlocKP-I using erasure codes at the cost of negligible control traffic. We analytically show that BlocKP improves the resistance of the network against the node capture attack to almost perfect resistance, using just a small number of paths. We evaluate our solution by performing extensive simulations, considering three baseline key predistribution schemes, including probabilistic asymmetric key predistribution (PAKP), strong Steiner trade (SST), and unital key predistribution (UKP). We equipped these schemes with a compatible multipath algorithm to offer end-to-end security. Results show that BlocKP improves the throughput up to 5% and decreases the flow completion time into 20% compared to baseline schemes. It has comparable routing traffic, latency, and throughput with augmented solutions but up to 60% improvement in the resistance against the node capture attack.
引用
收藏
页码:3851 / 3863
页数:13
相关论文
共 32 条
[1]  
Assmus E. F., 1992, DESIGNS THEIR CODES
[2]   A Highly Scalable Key Pre-Distribution Scheme for Wireless Sensor Networks [J].
Bechkit, Walid ;
Challal, Yacine ;
Bouabdallah, Abdelmadjid ;
Tarokh, Vahid .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2013, 12 (02) :948-959
[3]   Mobility helps peer-to-peer security [J].
Capkun, S ;
Hubaux, JP ;
Buttyán, L .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2006, 5 (01) :43-51
[4]   Random key predistribution schemes for sensor networks [J].
Chan, HW ;
Perrig, A ;
Song, D .
2003 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS, 2003, :197-213
[5]  
Donggang Liu, 2005, ACM Transactions on Information and Systems Security, V8, P41, DOI 10.1145/1053283.1053287
[6]  
Eschenauer L, 2002, Proc. ACM Conf. Comput. Commun. Securit, P41, DOI [10.1145/586110.586117, DOI 10.1145/586110.586117]
[7]   A Key Distribution Scheme for Mobile Wireless Sensor Networks: q-s-Composite [J].
Gandino, Filippo ;
Ferrero, Renato ;
Rebaudengo, Maurizio .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2017, 12 (01) :34-47
[8]   A survey of key pre-distribution and overlay routing in unstructured wireless networks [J].
Gharib, M. ;
Yousefi'Zadeh, H. ;
Movaghar, A. .
SCIENTIA IRANICA, 2016, 23 (06) :2831-2844
[9]  
Gharib M, 2019, Arxiv, DOI arXiv:1911.05126
[10]   Secure Overlay Routing for Large Scale Networks [J].
Gharib, Mohammed ;
Yousefi'zadeh, Homayoun ;
Movaghar, Ali .
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2019, 6 (03) :501-511