{"title":"A New Centralized Group Key Distribution and Revocation in Sensor Network","authors":"Tegshbayar Gerelbayar, Jong Sou Park","doi":"10.1109/CIS.2007.11","DOIUrl":null,"url":null,"abstract":"Sensor networks have a wide spectrum of military and civil applications, particularly with respect to security and secure keys for encryption and authentication. This paper presents a new centralized approach which focuses on the group key distribution with revocation capability for sen- sor networks. We propose a new personal key share dis- tribution. When utilized, this approach proves to be secure against k-number of illegitimate colluding nodes. In con- trast to related approaches, our scheme can overcome the security shortcomings while keeping the small overhead re- quirements per node. It will be shown that our scheme is unconditionally secure and achieves forward secrecy. The analysis is demonstrated in terms of communication and storage overheads.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"451 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.2007.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Sensor networks have a wide spectrum of military and civil applications, particularly with respect to security and secure keys for encryption and authentication. This paper presents a new centralized approach which focuses on the group key distribution with revocation capability for sen- sor networks. We propose a new personal key share dis- tribution. When utilized, this approach proves to be secure against k-number of illegitimate colluding nodes. In con- trast to related approaches, our scheme can overcome the security shortcomings while keeping the small overhead re- quirements per node. It will be shown that our scheme is unconditionally secure and achieves forward secrecy. The analysis is demonstrated in terms of communication and storage overheads.