一种可证安全的异构聚合签密方案  

A Provable Aggregate Signcryption for Heterogeneous Systems

作　　者：牛淑芬[1] 牛灵[1] 王彩芬[1] 杜小妮[1] 

机构地区：[1]西北师范大学计算机科学与工程学院,兰州730070

出　　处：《电子与信息学报》2017年第5期1213-1218,共6页Journal of Electronics & Information Technology

基　　金：国家自然科学基金(61562077;61462077;61662071);西北师范大学青年教师科研提升计划(NWNU-LKQN-13-12)~~

摘　　要：异构签密可实现不同安全域之间数据通信的机密性、认证性和不可伪造性。分析现有的异构签密方案,发现它们仅是针对单个消息而设计的,计算效率普遍较低,不适合大数据环境下的网络通信系统。该文提出一个异构的聚合签密方案,该方案不但可以实现单个消息的签密验证,而且可以实现多个消息的聚合验证,并且验证需要的双线性对个数固定,与所签密消息的个数无关。同时,在随机预言模型下,证明了方案的机密性和不可伪造性分别基于q双线性Diffie-Hellman逆问题和离散对数问题。数值结果表明,该方案与现有方案相比在计算效率和传输效率上有着极大的提高。Heterogeneous signcryp^ion can ensure the confidentiality, authentication and unforgeability of information transmission of cross cryptograph environment. Through analyzing some existing heterogeneous signcryption schemes, it is found that they can only be applicable to single message of signcryption. In order to improve the efficiency of computation and transmission in heterogeneous systems, a provable multi-message aggregate signcryption is proposed. In the new scheme, the pairing numbers are constant in verification phase, it not depends on the number of signcryption message. Moreover, based on the assumption of q-bilinear Diffie- Hellman inversion issue and Discrete logarithm, in the random oracle model, it is proved that the new scheme satisfies the properties of confidentiality and unforgeability. Furthermore, theoretical analysis and experimental results demonstrate that the computation overhead efficiency of the proposed scheme is better than the existing one.

关 键 词：聚合签密 异构系统 q双线性Diffie-Hellman逆问题 离散对数问题 

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