一种基于身份的面向组的阈值加密方案

2011 IEEE International Conference on Anti-Counterfeiting, Security and Identification Pub Date : 2011-06-24 DOI:10.1109/ASID.2011.5967409

Jinghao Xing, Qiuliang Xu

{"title":"一种基于身份的面向组的阈值加密方案","authors":"Jinghao Xing, Qiuliang Xu","doi":"10.1109/ASID.2011.5967409","DOIUrl":null,"url":null,"abstract":"In many broadcast systems, it is useful to send messages to some (not all) members of the whole group. And the ciphertext can only be decrypted with the participation of a certain number of receivers. In this paper, we construct an efficient identity-based group-oriented threshold encryption scheme. The sender can encrypt a single message for a dynamic k-member group which can be a subset of the n-member group. And at least t receivers are needed to decrypt the ciphertext, where 1≼t≼k≼n. Meanwhile, we provide the formal security proofs of this scheme in random oracle model.","PeriodicalId":328792,"journal":{"name":"2011 IEEE International Conference on Anti-Counterfeiting, Security and Identification","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An identity-based group-oriented threshold encryption scheme\",\"authors\":\"Jinghao Xing, Qiuliang Xu\",\"doi\":\"10.1109/ASID.2011.5967409\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In many broadcast systems, it is useful to send messages to some (not all) members of the whole group. And the ciphertext can only be decrypted with the participation of a certain number of receivers. In this paper, we construct an efficient identity-based group-oriented threshold encryption scheme. The sender can encrypt a single message for a dynamic k-member group which can be a subset of the n-member group. And at least t receivers are needed to decrypt the ciphertext, where 1≼t≼k≼n. Meanwhile, we provide the formal security proofs of this scheme in random oracle model.\",\"PeriodicalId\":328792,\"journal\":{\"name\":\"2011 IEEE International Conference on Anti-Counterfeiting, Security and Identification\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Conference on Anti-Counterfeiting, Security and Identification\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ASID.2011.5967409\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Conference on Anti-Counterfeiting, Security and Identification","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASID.2011.5967409","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

在许多广播系统中，向整个组的一些成员(不是所有成员)发送消息是有用的。并且密文只有在一定数量的接收者参与的情况下才能被解密。本文构造了一种高效的基于身份的面向组的阈值加密方案。发送方可以为动态k成员组加密一条消息，动态k成员组可以是n成员组的一个子集。并且至少需要t个接收方来解密密文，其中1个接收方为1个接收方。同时，给出了该方案在随机oracle模型下的形式化安全性证明。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An identity-based group-oriented threshold encryption scheme

In many broadcast systems, it is useful to send messages to some (not all) members of the whole group. And the ciphertext can only be decrypted with the participation of a certain number of receivers. In this paper, we construct an efficient identity-based group-oriented threshold encryption scheme. The sender can encrypt a single message for a dynamic k-member group which can be a subset of the n-member group. And at least t receivers are needed to decrypt the ciphertext, where 1≼t≼k≼n. Meanwhile, we provide the formal security proofs of this scheme in random oracle model.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2011 IEEE International Conference on Anti-Counterfeiting, Security and Identification

自引率

0.00%

发文量