{"title":"Fiat-Naor广播加密方案中的一些实现问题","authors":"B. B. Amberker, P. Koulgi, M. Nirmala","doi":"10.1109/ADCOM.2006.4289975","DOIUrl":null,"url":null,"abstract":"We consider the problems of assignment of keys and construction of common key at the Broadcast center, in the zero-message and one-level broadcast encryption schemes of Fiat-Naor [1]. We propose efficient implementations of key assignment and common key construction, and estimate their complexity. We also propose, in the context of one-level schemes, a quick method for limiting the sizes of perfect hash families constructed as by Fredman, Komi 'os and Szemer 'edi [2].","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Some Implementation issues in the Fiat-Naor Broadcast Encryption Schemes\",\"authors\":\"B. B. Amberker, P. Koulgi, M. Nirmala\",\"doi\":\"10.1109/ADCOM.2006.4289975\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problems of assignment of keys and construction of common key at the Broadcast center, in the zero-message and one-level broadcast encryption schemes of Fiat-Naor [1]. We propose efficient implementations of key assignment and common key construction, and estimate their complexity. We also propose, in the context of one-level schemes, a quick method for limiting the sizes of perfect hash families constructed as by Fredman, Komi 'os and Szemer 'edi [2].\",\"PeriodicalId\":296627,\"journal\":{\"name\":\"2006 International Conference on Advanced Computing and Communications\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Conference on Advanced Computing and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ADCOM.2006.4289975\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Conference on Advanced Computing and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ADCOM.2006.4289975","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Some Implementation issues in the Fiat-Naor Broadcast Encryption Schemes
We consider the problems of assignment of keys and construction of common key at the Broadcast center, in the zero-message and one-level broadcast encryption schemes of Fiat-Naor [1]. We propose efficient implementations of key assignment and common key construction, and estimate their complexity. We also propose, in the context of one-level schemes, a quick method for limiting the sizes of perfect hash families constructed as by Fredman, Komi 'os and Szemer 'edi [2].
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
