一种用户匿名的身份型混合广播签密方案
An ID-based Hybrid Broadcast Signcryption Scheme with User Anonymity
作者：林志强(武警工程大学 电子技术系 武警部队密码与信息安全保密重点实验室)；杨晓元(武警工程大学 电子技术系 武警部队密码与信息安全保密重点实验室;武警工程大学 电子技术系 网络与信息安全研究所)；韩益亮(武警工程大学 电子技术系 武警部队密码与信息安全保密重点实验室;武警工程大学 电子技术系 网络与信息安全研究所)
Author：Lin Zhiqiang(Key Lab. of the Chinese Armed Police Force for Cryptology and Info. Security,Dept. of Electronic Technol.,Eng. Univ. of the Chinese Armed Police Force)；Yang Xiaoyuan(Key Lab. of the Chinese Armed Police Force for Cryptology and Info. Security,Dept. of Electronic Technol.,Eng. Univ. of the Chinese Armed Police Force;Inst. of Network and Info. Security Under the Chinese Armed Police Force,Dept. of Electronic Technol.,En)；Han Yiliang(Key Lab. of the Chinese Armed Police Force for Cryptology and Info. Security,Dept. of Electronic Technol.,Eng. Univ. of the Chinese Armed Police Force;Inst. of Network and Info. Security Under the Chinese Armed Police Force,Dept. of Electronic Technol.,En)
收稿日期：2013-06-15 年卷（期）页码：2013,45(6):33-38
期刊名称：工程科学与技术
Journal Name：Advanced Engineering Sciences
关键字：广播签密；Lagrange插值；可公开验证；用户匿名
Key words：broadcast signcryption;Lagrange interpolation;public verifiability;user anonymity
基金项目：国家自然科学基金资助项目（61272492;61103231;61103230）；陕西省自然科学研究计划资助项目（2011JM8012）
中文摘要
广播签密能够通过一步操作实现发送方对多个接收方的消息发送。为了有效解决“一对多”通信模型中的效率不高、开销较大以及隐私安全等问题，提出一种用户匿名的身份型广播签密方案。方案利用双线性对与Lagrange插值函数进行构造，并基于判定双线性Diffie-Hellman问题与计算性Diffie-Hellman问题证明了算法的安全性。除保证了机密性和不可伪造性之外，还满足可公开验证性和用户匿名性。分析表明，提出的方案签密运算量仅为(t+3)s+p，比同类方案的运算量小，大幅度地提高了运算效率。
英文摘要
Broadcast signcryption can make the sender send multi messages to recipients by one operation. In order to efficiently solve the problems of low efficiency, large overhead and privacy security in “one-to-many” communication model, an ID-based broadcast signcryption scheme (IBBSC) with user anonymity was proposed. Using bilinear pairings and the Lagrange interpolating function, the signcryption scheme was constructed. And the security of the algorithms was proven based on decisional bilinear Diffie-Hellman problem and computational Diffie-Hellman problem. The public verifiablity and user anonymity were also achieved in addition to the confidentiality and unforgeability in the IBBSC. Analysis showed that the signcryption algorithm operates only in(t+3)s+p, smaller than the amount of computation of similar schemes, and it significantly improved the efficiency of computations.
【关闭】
