{"title":"一种基于正交向量的高效分层群密钥管理方案","authors":"Junchang Wang, X. Lin","doi":"10.1109/IAS.2009.237","DOIUrl":null,"url":null,"abstract":"This paper proposes a novel orthogonal algorithm and protocol of efficient group key management for secure multicast in distributed systems. In the proposed method, the sever only requires to multicast to update the group key after a subgroup or a user left and therefore bandwidth is reduced effectively. The nice features of the proposed scheme include few messages required in updating and almost instant reception of the new key information. Performance evaluation for the proposed scheme is also presented to show the superiority of the proposed method.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"112 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Efficient Hierarchical Group Key Management Scheme Based on Orthogonal Vectors\",\"authors\":\"Junchang Wang, X. Lin\",\"doi\":\"10.1109/IAS.2009.237\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a novel orthogonal algorithm and protocol of efficient group key management for secure multicast in distributed systems. In the proposed method, the sever only requires to multicast to update the group key after a subgroup or a user left and therefore bandwidth is reduced effectively. The nice features of the proposed scheme include few messages required in updating and almost instant reception of the new key information. Performance evaluation for the proposed scheme is also presented to show the superiority of the proposed method.\",\"PeriodicalId\":240354,\"journal\":{\"name\":\"2009 Fifth International Conference on Information Assurance and Security\",\"volume\":\"112 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Fifth International Conference on Information Assurance and Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IAS.2009.237\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fifth International Conference on Information Assurance and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IAS.2009.237","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Efficient Hierarchical Group Key Management Scheme Based on Orthogonal Vectors
This paper proposes a novel orthogonal algorithm and protocol of efficient group key management for secure multicast in distributed systems. In the proposed method, the sever only requires to multicast to update the group key after a subgroup or a user left and therefore bandwidth is reduced effectively. The nice features of the proposed scheme include few messages required in updating and almost instant reception of the new key information. Performance evaluation for the proposed scheme is also presented to show the superiority of the proposed method.