基于多线性映射的多接收者签密方案  

Multi-receiver Signcryption Scheme Based on Multilinear Maps

作　　者：于志敏[1,2] 景征骏[1,3,2] 古春生[1,2] 

机构地区：[1]江苏理工学院计算机工程学院,江苏常州213001 [2]常州市云计算与智能信息处理重点实验室,江苏常州213001 [3]南京邮电大学计算机学院,南京210003

出　　处：《小型微型计算机系统》2015年第5期986-989,共4页Journal of Chinese Computer Systems

基　　金：教育部人文社会科学研究项目(14YJAZH023)资助;江苏省"青蓝工程"项目(KYQ14004)资助;常州市应用基础研究项目(CJ20140040)资助;江苏省前瞻性联合研究项目(BY2014038-03)资助;江苏理工学院面上项目(KYY14007)资助;常州市云计算与智能信息处理重点实验室2014开放基金资助

摘　　要：为满足后量子时代日益增长的网络组播需求,设计了基于多线性映射的多接收者签密方案.通过把加密和签名有效结合起来,大大降低了密文规模,较少了网络和计算开销.每个接收者使用自己私钥解密,获得明文后可以验证发送者身份,保证了接收的公平性.基于多级Diffie-Hellman判定(GDDH)问题难度假设,在随机预言模型下证明了消息保密性满足CCA2安全,证明了签密在选择消息攻击下具有不可伪造性.方案中主要计算在多项式环上进行,所以计算复杂性较低.To meet the growing demand of multicast in post-quantum era, we propose a multi-receiver signcryption scheme based on multilinear maps. Through the effective combination of the encryption and signature, We greatly reduce the ciphertext size, network burden and computational overhead. Each recipient decrypts ciphertext using his private key and verifies the identity of the sender after obtaining plaintext from decryption to ensure the fairness of receiving. Based on the hardness assumption of the graded Diffie-Hellman （ GDDH） and under the random oracle model, we prove that the proposed scheme can achieve the message confidentiality under chosen ciphertext attack and the signcryption of our scheme is unforgeable under chosen message attack. The main programme is computed in polynomial rings, so the computational complexity is low.

关 键 词：多线性映射 GDDH 签密 CCA2 

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