公平的基于身份的多接收者匿名签密设计与分析  

Design and Analysis of a Fair ID-Based Multi-Receiver Anonymous Signcryption

作　　者：庞辽军[1,2] 李慧贤[3] 崔静静[2] 王育民[2] 

机构地区：[1]西安电子科技大学生命科学技术学院,陕西西安710071 [2]综合业务网理论及关键技术国家重点实验室(西安电子科技大学),陕西西安710071 [3]西北工业大学计算机学院,陕西西安710072

出　　处：《软件学报》2014年第10期2409-2420,共12页Journal of Software

基　　金：国家自然科学基金(61103178;60803151);西安电子科技大学基本科研业务费(K5051310006)

摘　　要：针对现有基于身份的多接收者签密方案中存在的接收者身份泄露以及解密不公平性等问题,提出一种具有解密公平性的基于身份的多接收者匿名签密方案.新方案不仅能够解决现有方案中不能保护接收者身份隐私性的问题,并且满足解密公平性,从而有效地防止了发送者可能的欺骗行为.接着,基于双线性Diffie-Hellman假设和计算Diffie-Hellman假设,对所提方案的保密性和不可伪造性进行了证明.同时,对方案的正确性及性能进行了分析.分析发现,该方案是一个安全、有效的公钥签密方案,能够解决现有方案中存在的接收者身份暴露和解密不公平性等问题.这使得该方案具有非常重要的应用,尤其是可以用来实现安全广播,以便在不安全和开放的网络环境中安全地广播敏感信息.Existing ID-based multi-receiver signcryption schemes presents some security problems. For example, the identities of receivers can be revealed and the receivers do not have fairness in decryption. In order to avoid those problems, this paper proposes a fair ID-based multi-receiver anonymous signcryption scheme. The new scheme can not only solve the problem that the existing schemes can not protect the privacy of receivers, but also meet the fairness of decryption to effectively prevent possible cheating behavior of the sender. It then proves the confidentiality and unforgeability under of the scheme the bilinear Diffie-Hellman assumption and the computational Diffie-Hellman assumption. Simultaneity, the correctness and the performance of this scheme are analyzed. It concludes that this scheme is a secure and effective public-key signcryption scheme and can solve the problems of the receivers’ identity exposure and unfairness decryption. Therefore, the new scheme has very important applications, especially it can be used to broadcast sensitive information in unsafe and open network environment.

关 键 词：公平性 匿名性 签密 多接收者签密 基于身份的签密 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]