Efficient authentication, traitor detection, and privacy-preserving for the most common queries in two-tiered wireless sensor networks

被引:7
作者
Bui, Thach V. [1 ,2 ]
Nguyen, Thuc D. [3 ]
Sonehara, Noboru [1 ,2 ]
Echizen, Isao [1 ,2 ]
机构
[1] Grad Univ Adv Studies SOKENDAI, Hayama, Kanagawa, Japan
[2] Natl Inst Informat, Tokyo, Japan
[3] Univ Sci, Ho Chi Minh City, Vietnam
来源
2015 IEEE 29TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (IEEE AINA 2015) | 2015年
关键词
Wireless Sensor Network; Authentication; Privacy-preserving; Common Query; Group Testing; List Decoding; REED-SOLOMON CODES;
D O I
10.1109/AINA.2015.208
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Wireless Sensor Networks (WSNs) are being used more and more and are becoming a key technology in applications ranging from military ones to ones used in daily life. There are basic architectures: one comprising sensors and a server and one comprising sensors, a server, and storage nodes between them ("two-tiered architecture"). We investigate this second type as it has many advantages in terms of energy usage, computation, and data transmission. Although two-tiered wireless sensor networks have many advantages, security is a critical due to three main problems. First, sensors located in hostile areas can be surreptitiously replaced with fake ones that send bogus data. Second, an attacker could install new sensors with valid authentication keys that send bogus data to storage nodes and deceive the server. Third, a storage nodes could be compromised and reveal data received from sensors. Therefore, the server must authenticate sensors before accepting data from them, detect whether a key was intercepted and identify which one, and handle the most common queries while preserving the privacy of data received from storage nodes. W have developed a novel solution using Non-Adaptive Group Testing that enables a server to perform these tasks efficiently and effectively. This solution is secure with high probability against an attack that tries to guess sensor data and thus protects data confidentiality.
引用
收藏
页码:365 / 372
页数:8
相关论文
共 35 条
[1]  
Alekhnovich M, 2002, ANN IEEE SYMP FOUND, P439, DOI 10.1109/SFCS.2002.1181968
[2]   Key equations for list decoding of Reed-Solomon codes and how to solve them [J].
Beelen, Peter ;
Brander, Kristian .
JOURNAL OF SYMBOLIC COMPUTATION, 2010, 45 (07) :773-786
[3]  
Bui Thach V., 2013, Information and Communication Technology. International Conference, ICT-EurAsia 2013. Proceedings: LNCS 7804, P324, DOI 10.1007/978-3-642-36818-9_35
[4]  
Bui Thach V., 2013, 2013 Seventh International Conference on Next-Generation Mobile Apps, Services and Technologies (NGMAST), P111, DOI 10.1109/NGMAST.2013.28
[5]  
Chen Fei, 2010, P 29 ANN IEEE C COMP
[6]   New constructions of one- and two-stage pooling designs [J].
Cheng, Yongxi ;
Du, Ding-Zhu .
JOURNAL OF COMPUTATIONAL BIOLOGY, 2008, 15 (02) :195-205
[7]  
Cheraghchi M, 2009, LECT NOTES COMPUT SC, V5699, P62, DOI 10.1007/978-3-642-03409-1_7
[8]  
CORMODE G, 2003, P 22 ACM SIGMOD SIGA
[9]   The detection of defective members of large populations [J].
Dorfman, R .
ANNALS OF MATHEMATICAL STATISTICS, 1943, 14 :436-440
[10]  
Du D., 1993, COMBINATORIAL GROUP