{"title":"具有有限组成员属性的自修复密钥分发","authors":"Ting Yuan, Jianqing Ma, Yiping Zhong, Shiyong Zhang","doi":"10.1109/ICINIS.2008.9","DOIUrl":null,"url":null,"abstract":"Self-healing key distribution enables users in a large and dynamic group to establish session keys for secure group communication over an unreliable network. The main property of self-healing key distribution is that the users are capable of recovering lost session keys on their own, without requesting additional transmissions from the group manager. In this paper, we propose a self-healing key distribution scheme for unreliable networks with constrained bandwidth resources. Our scheme has the limited group membership property that there exists an upper bound on the number of members in the group. We show that our scheme has a better tradeoff between storage and communication overhead than some previous schemes.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Self-Healing Key Distribution with Limited Group Membership Property\",\"authors\":\"Ting Yuan, Jianqing Ma, Yiping Zhong, Shiyong Zhang\",\"doi\":\"10.1109/ICINIS.2008.9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Self-healing key distribution enables users in a large and dynamic group to establish session keys for secure group communication over an unreliable network. The main property of self-healing key distribution is that the users are capable of recovering lost session keys on their own, without requesting additional transmissions from the group manager. In this paper, we propose a self-healing key distribution scheme for unreliable networks with constrained bandwidth resources. Our scheme has the limited group membership property that there exists an upper bound on the number of members in the group. We show that our scheme has a better tradeoff between storage and communication overhead than some previous schemes.\",\"PeriodicalId\":185739,\"journal\":{\"name\":\"2008 First International Conference on Intelligent Networks and Intelligent Systems\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 First International Conference on Intelligent Networks and Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICINIS.2008.9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 First International Conference on Intelligent Networks and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICINIS.2008.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Self-Healing Key Distribution with Limited Group Membership Property
Self-healing key distribution enables users in a large and dynamic group to establish session keys for secure group communication over an unreliable network. The main property of self-healing key distribution is that the users are capable of recovering lost session keys on their own, without requesting additional transmissions from the group manager. In this paper, we propose a self-healing key distribution scheme for unreliable networks with constrained bandwidth resources. Our scheme has the limited group membership property that there exists an upper bound on the number of members in the group. We show that our scheme has a better tradeoff between storage and communication overhead than some previous schemes.