文章基本信息

标题：Secured Broadcast Encryption Using Key Generation
本地全文：下载
作者：G.Deepika ; N. Kavitha ; M. Kiruthika 等
期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2017
卷号：5
期号：3
页码：5602
DOI：10.15680/IJIRCCE.2017.0503125
出版社：S&S Publications
摘要：Show encryption (BE) plans permit a sender to safely telecast to any subset of individuals howeverrequire a trusted gathering to convey decoding keys. Bunch key understanding (GKA) conventions empower agathering of individuals to arrange a typical encryption key through open systems so that lone the gathering individualscan decode the ciphertexts encoded under the common encryption key, however a sender can't prohibit a specific partfrom unscrambling the ciphertexts. In this paper, we connect these two ideas with a half breed primitive alluded to ascontributory show encryption (ConBE). In this new primitive, a gathering of individuals arrange a typical openencryption key while every part holds a decoding key. A sender seeing the general population bunch encryption keycan constrain the unscrambling to a subset of individuals from his decision. Tailing this model, we propose a ConBEplan with short ciphertexts. The plan is turned out to be completely agreement safe under the choice n-Bilinear Diffie-Hellman Exponentiation (BDHE) supposition in the standard model. Of autonomous interest, we display another BEplan that is aggregatable. The aggregatability property is appeared to be valuable to develop propelled conventions
关键词：Group key agreement (GKA); security; n-Bilinear Diffie-Hellman Exponentiation (BDHE); Scalability;confidentiality; integrity.