TY - GEN
T1 - Proactive code verification protocol in wireless sensor network
AU - Choi, Young Geun
AU - Kang, Jeonil
AU - Nyang, Dae Hun
PY - 2007
Y1 - 2007
N2 - For WSN(Wireless Sensor Network) to provide reliable service, authentication is one of the most important requirements. The authentication usually means the entity authentication, but owing to the data centric nature of sensor network, much more importance must be put on the authentication(or attestation) for code of sensor nodes. The naive approach to the attestation is for the verifier to compare the previously known memory contents of the target node with the actual memory contents in the target node, but it has a significant drawback. In this paper, we show what the drawback is and propose a countermeasure. The basic idea of our countermeasure is not to give the malicious code any memory space to reside by cleaning the target node's memory space where the malicious code can reside. This scheme can verify the whole memory space of the target node and provides extremely low probability of malicious code's concealment without depending on accurate timing information unlike SWATT[1]. We provide this verification method and show the performance estimation in various environments.
AB - For WSN(Wireless Sensor Network) to provide reliable service, authentication is one of the most important requirements. The authentication usually means the entity authentication, but owing to the data centric nature of sensor network, much more importance must be put on the authentication(or attestation) for code of sensor nodes. The naive approach to the attestation is for the verifier to compare the previously known memory contents of the target node with the actual memory contents in the target node, but it has a significant drawback. In this paper, we show what the drawback is and propose a countermeasure. The basic idea of our countermeasure is not to give the malicious code any memory space to reside by cleaning the target node's memory space where the malicious code can reside. This scheme can verify the whole memory space of the target node and provides extremely low probability of malicious code's concealment without depending on accurate timing information unlike SWATT[1]. We provide this verification method and show the performance estimation in various environments.
UR - http://www.scopus.com/inward/record.url?scp=38049155586&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-74477-1_97
DO - 10.1007/978-3-540-74477-1_97
M3 - Conference contribution
AN - SCOPUS:38049155586
SN - 9783540744757
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1085
EP - 1096
BT - Computational Science and Its Applications - ICCSA 2007 - International Conference, Proceedings
PB - Springer Verlag
T2 - International Conference on Computational Science and its Applications, ICCSA 2007
Y2 - 26 August 2007 through 29 August 2007
ER -