TY - GEN
T1 - Secret key revocation in sensor networks
AU - Maeng, Young Jae
AU - Mohaisen, Abedelaziz
AU - Nyang, Dae Hun
N1 - Funding Information:
The author would like to express his thanks to Hiroyuki Hirashita, Mitsuru Takeuchi, Toshihiro Kawaguchi, Jun Fukue, Shoji Kato, and Roberto Terlevich for their numerous comments and to referee for his/her meaningful suggestions. The author is also grateful to Shin Mineshige for his valuable discussions and kind reading of the previous draft. This work was supported in part by the Japan Society for the Promotion of Science (9852).
PY - 2007
Y1 - 2007
N2 - Many challenging security-related issues have been studied in wireless sensor networks to provide a demanded quality and security for deliverable data. Yet, one of these issues which are not handled is the secret key revocation. In a semi-dynamic, resource-constrained and long-living sensor network with self organization features, traditional revocation methods are not desirable and somehow impractical. Through this paper, we discuss the rising issue of key revocation due to the predistribution and provide several techniques, structures and algorithms for several network and security conditions and requirements. In addition to the saving of the resources represented by the communication, computation and memory, we provide an extension for special-case networks in which our work can provide a higher performance.
AB - Many challenging security-related issues have been studied in wireless sensor networks to provide a demanded quality and security for deliverable data. Yet, one of these issues which are not handled is the secret key revocation. In a semi-dynamic, resource-constrained and long-living sensor network with self organization features, traditional revocation methods are not desirable and somehow impractical. Through this paper, we discuss the rising issue of key revocation due to the predistribution and provide several techniques, structures and algorithms for several network and security conditions and requirements. In addition to the saving of the resources represented by the communication, computation and memory, we provide an extension for special-case networks in which our work can provide a higher performance.
UR - http://www.scopus.com/inward/record.url?scp=38049001918&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-73549-6_119
DO - 10.1007/978-3-540-73549-6_119
M3 - Conference contribution
AN - SCOPUS:38049001918
SN - 9783540735489
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1222
EP - 1232
BT - Ubiquitous Intelligence and Computing - 4th International Conference, UIC 2007, Proceedings
PB - Springer Verlag
Y2 - 11 July 2007 through 13 July 2007
ER -