{"title":"具有反向保密的长寿命自愈组密钥分发方案","authors":"Tomasz Rams, P. Pacyna","doi":"10.1109/NetSys.2013.19","DOIUrl":null,"url":null,"abstract":"Self-healing group key distribution schemes allow for the establishment of a secure multicast communication between a group manager and group members through an unreliable broadcast channel. They can be used in multicast networks with centralized management, such as machine-to-machine systems, embedded and sensor networks, cellular networks and wireless networks. Constructions based on the exponential arithmetic are currently the most efficient long-lived schemes, but they lack backward secrecy. In this paper we present a new mechanism, which allows to achieve backward secrecy in this class of schemes and we illustrate its use in a long-lived key distribution scheme. Then, we perform security and performance analyses of the scheme, in order to show that it is efficient, achieves forward and backward secrecy, and resists collusion between the newly joined users and the revoked ones.","PeriodicalId":198664,"journal":{"name":"2013 Conference on Networked Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Long-Lived Self-Healing Group Key Distribution Scheme with Backward Secrecy\",\"authors\":\"Tomasz Rams, P. Pacyna\",\"doi\":\"10.1109/NetSys.2013.19\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Self-healing group key distribution schemes allow for the establishment of a secure multicast communication between a group manager and group members through an unreliable broadcast channel. They can be used in multicast networks with centralized management, such as machine-to-machine systems, embedded and sensor networks, cellular networks and wireless networks. Constructions based on the exponential arithmetic are currently the most efficient long-lived schemes, but they lack backward secrecy. In this paper we present a new mechanism, which allows to achieve backward secrecy in this class of schemes and we illustrate its use in a long-lived key distribution scheme. Then, we perform security and performance analyses of the scheme, in order to show that it is efficient, achieves forward and backward secrecy, and resists collusion between the newly joined users and the revoked ones.\",\"PeriodicalId\":198664,\"journal\":{\"name\":\"2013 Conference on Networked Systems\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-03-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Conference on Networked Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NetSys.2013.19\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Conference on Networked Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NetSys.2013.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Long-Lived Self-Healing Group Key Distribution Scheme with Backward Secrecy
Self-healing group key distribution schemes allow for the establishment of a secure multicast communication between a group manager and group members through an unreliable broadcast channel. They can be used in multicast networks with centralized management, such as machine-to-machine systems, embedded and sensor networks, cellular networks and wireless networks. Constructions based on the exponential arithmetic are currently the most efficient long-lived schemes, but they lack backward secrecy. In this paper we present a new mechanism, which allows to achieve backward secrecy in this class of schemes and we illustrate its use in a long-lived key distribution scheme. Then, we perform security and performance analyses of the scheme, in order to show that it is efficient, achieves forward and backward secrecy, and resists collusion between the newly joined users and the revoked ones.