一种新的基于身份的群体签密方案  

New ID-based group signcryption scheme

作　　者：陈尚弟[1] 卞广旭[1] 

机构地区：[1]中国民航大学理学院,天津300300

出　　处：《中国民航大学学报》2013年第1期93-96,共4页Journal of Civil Aviation University of China

基　　金：中央高校基本科研业务费专项(ZXH2012K003);中国民航大学科研基金项目(2012KYM01)

摘　　要：在公开的网络通信系统中安全地传送敏感消息时,有时会由于通信双方的权限过于集中而引起欺骗行为,而面向群体的签密方案能解决通信系统中个体的权限过于集中而引起的安全问题。利用基于身份的密码体制和椭圆曲线离散对数问题,提出了一种新的基于身份的群体签密方案。在方案中,任何t个或者多于t个签密组成员相互协作能够生成有效的群签密,少于t个签密组成员则不能生成有效的群签密;任何w个或者多于w个接收组成员相互协作可以验证群签密的合法性及恢复加密的消息。通过对提出的方案进行安全性分析,该方案具有认证性、保密性、数据完整性、不可否认性及不可伪造性等特性。When sensitive information is safely transmitted in the public network communication system, the over- concentrated privilege between the communication parties can sometimes cause cheating, but such safety problem can be solved by the group signcryption scheme. Based on the ID-based cryptography and elliptic curve discrete logarithm problem, a new ID-based group signcryption scheme is proposed. In the scheme, any t or more than t signcryption group members collaboratively can generate a valid group signcryption, and less than t can not generate a valid group signcryption; any w or more w receiver group members collaboratively can verify the legitimacy of the group signcryption and recover the encrypted message. Through security analysis of the proposed program, the program has authentication, confidentiality, data integrity, non- repudiation and unforgeability and other features.

关 键 词：基于身份 门限方案 签密 椭圆曲线离散对数问题 

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