Chun-Ying Huang, Yun-Peng Chiu, Kuan-Ta Chen, H. Chiou, C. Lei
{"title":"Secure content delivery using key composition","authors":"Chun-Ying Huang, Yun-Peng Chiu, Kuan-Ta Chen, H. Chiou, C. Lei","doi":"10.1109/LCN.2005.120","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a novel framework for secure multicast on overlay networks. Our contributions are three-fold: 1) a technique key composition is proposed to cope with the secure multicast problems, 2) the proposed framework is totally distributed, i.e., no centralized control is required for subgroup configurations, and 3) a comparison of similar frameworks is provided, in which we show the proposed framework is more efficient in that its time and space complexity are bounded by constants, regardless of the number of coexisting groups, the group size, and the degree of transit nodes","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2005.120","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we propose a novel framework for secure multicast on overlay networks. Our contributions are three-fold: 1) a technique key composition is proposed to cope with the secure multicast problems, 2) the proposed framework is totally distributed, i.e., no centralized control is required for subgroup configurations, and 3) a comparison of similar frameworks is provided, in which we show the proposed framework is more efficient in that its time and space complexity are bounded by constants, regardless of the number of coexisting groups, the group size, and the degree of transit nodes