{"title":"A Cluster-Based Key Management Scheme for MANET","authors":"Haitao Xie","doi":"10.1109/ISA.2011.5873305","DOIUrl":null,"url":null,"abstract":"Based on the characteristic of MANET, this paper designed an Id-based and hierarchical group key management scheme on large-scale MANET. ,Our group key distribution is different from traditional scheme, its secret shadows are not brought from group controller, but from each sub-group center node's private key signature, by getting together all these n secret shadows, the GC can construct polynomial, any of sub-group center node can request these secret shadows from t of its neighbor nodes. When node was roaming from one sub-group to another, we would use delay rekeying policy to decrease the cost of these two sub-group center nodes. By analyzing, our scheme is more secure¿Aefficient¿Aexpansive and fault- tolerant.","PeriodicalId":128163,"journal":{"name":"2011 3rd International Workshop on Intelligent Systems and Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 3rd International Workshop on Intelligent Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISA.2011.5873305","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
Based on the characteristic of MANET, this paper designed an Id-based and hierarchical group key management scheme on large-scale MANET. ,Our group key distribution is different from traditional scheme, its secret shadows are not brought from group controller, but from each sub-group center node's private key signature, by getting together all these n secret shadows, the GC can construct polynomial, any of sub-group center node can request these secret shadows from t of its neighbor nodes. When node was roaming from one sub-group to another, we would use delay rekeying policy to decrease the cost of these two sub-group center nodes. By analyzing, our scheme is more secure¿Aefficient¿Aexpansive and fault- tolerant.