基于身份公平的匿名多接收者签密方案

doi:10.3969/j.issn.1000-436x.2013.08.021

通信学报 ›› 2013, Vol. 34 ›› Issue (8): 161-168.doi: 10.3969/j.issn.1000-436x.2013.08.021

基于身份公平的匿名多接收者签密方案

庞辽军^1,²,高璐²,裴庆祺²,王育民²

¹ 西安电子科技大学生命科学技术学院，陕西西安710071
² 西安电子科技大学综合业务网国家重点实验室，陕西西安710071

出版日期:2013-08-25 发布日期:2017-08-31
基金资助:
国家自然科学基金资助项目;NSFC-广东联合基金资助项目;高等学校博士学科点专项科研基金新教师基金资助项目;教育部计算机网络与信息安全重点实验室(西安电子科技大学)开放基金资助项目

Fair and anonymous ID-based multi-receiver signcryption

Liao-jun PANG^1,²,Lu GAO²,Qing-qi PEI²,Yu-min WANG²

¹ School of Life Sciences and Technology,Xidian University,Xi’an 710071,China
² State Key Lab.of Integrated Service Networks,Xidian University,Xi’an 710071,China

Online:2013-08-25 Published:2017-08-31
Supported by:
The National Natural Science Foundation of China;The Key Program of NSFC-Guangdong Union Foundation of China;The Research Fund for the Doctoral Program of Higher Education of China;The Open Foundation of the Key Laboratory of Network and Information Security in Xidian University,Ministry of Education of China

摘要/Abstract

摘要：

针对Lal等人所提出的基于身份的多接收者签密方案中存在的暴露接收者身份信息隐私性和解密不公平的问题，应用拉格拉日插值方法，提出一种满足接收者身份匿名性和解密公平性的新的多接收者签密方案。基于双线性 Diffie-Hellman 问题和计算 Diffie-Hellman 问题，对随机模预言模型下的 IND-sMIBSC-CCA2 和EUF-sMIBSC-CMA的安全性进行了证明，验证本方案具有保密性和不可否认性。

关键词: 多接收者签密, 公平性, 匿名性, 保密性, 不可否认性

Abstract:

In order to solve the identify information exposure problem and the decryption unfairness problem in Lal et al’s identity-based multi-receiver signcryption scheme,a novel identity-based multi-receiver signcryption scheme,using the Lagrange interpolation method,was proposed to meet the requirements of the identity anonymity and the decryption fairness.Based on the Bilinear Diffie-Hellman and computational Diffie-Hellman assumptions,the security of IND-sMIBSC-CCA2 and EUF-sMIBSC-CMA was proved formally under the random oracle model,which shows that the proposed scheme can achieve the confidentiality and the unforgeablity required.

Key words: multi-receiver signcryption, fairness, anonymity, confidentiality, unforgeablity

庞辽军,高璐,裴庆祺,王育民. 基于身份公平的匿名多接收者签密方案[J]. 通信学报, 2013, 34(8): 161-168.

Liao-jun PANG,Lu GAO,Qing-qi PEI,Yu-min WANG. Fair and anonymous ID-based multi-receiver signcryption[J]. Journal on Communications, 2013, 34(8): 161-168.

图/表 1

参考文献 12

[1]	ZHENG Y . Digital signcryption or how to achieve cost (signature ＆encryption)[A]. CRYPTO 1997[C]. Springer-Verlag, 1977. 165-179.
[2]	MALONE-LEE J . Identity based signcryption[EB/OL]. , 2002.
[3]	BELLARE M , BOLDYREVA A , MICALI S . Public-key encryption in a multi-user setting:security proofs and improvements[A]. EUROCRYPT 2000[C]. Springer-Verlag, 2000. 259-274.
[4]	BAUDRON O , POINTCHEVAL D , STERN J . Extended notions of security for multicast public key cryptosystems[A]. ICALP 2000[C]. Springer-Verlag, 2000. 499-511.
[5]	DUAN S , CAO Z . Efficient and provably secure multi receiver identity based signcryption[A]. ACISP 2006[C]. Springer-Verlag, 2006. 195-206.
[6]	SHARMILA S , SREE S , SRINIVASAN R ,et al. An efficient identity-based signcryption scheme for multiple receivers[A]. IWSEC 2009[C]. Springer-Verlag, 2009. 71-88.
[7]	ELKAMCHOUCHI H , ABOUELSEOUD Y . MIDSCYK:an efficient provably secure multirecipient identity-based signcryption scheme[A]. ICNM 2009,Networking and Media Convergence[C]. 2009. 70-75.
[8]	CHEN L , MALONE-LEE J . Improved identity-based signcryption[A]. PKC 2005[C]. Springer-Verlag, 2005. 362-379.
[9]	YU Y , YANG B , HUANG X . Efficient identity-based signcryption scheme for multiple receivers[A]. ATC 2007[C]. Springer-Verlag, 2007. 13-21.
[10]	LAL S , KUSHWAH P . Anonymous ID based signcryption scheme for multiple receivers[EB/OL]. , 2009.
[11]	FAN C , HUANG L , HO P . Anonymous multireceiver identity-based encryption[J]. IEEE Transactions on Computers, 2010,59(9): 1239-1249.
[12]	庞辽军, 李慧贤, 焦李成 ,等. 可证明安全的多接收者公钥加密方案设计与分析[J]. 软件学报, 2009,20(10): 2739-2745. PANG L J , LI H X , JIAO L L ,et al. Design and analysis of a provable secure multi-recipient public key encryption scheme[J]. Journal of Software, 2009,20(10): 2739-2745.

方案	Pa	Add	Mul	Exp	Hash	参数个数	密文长度
方案[6]	1	n+1	n+3	1	2	n+9	3\|G₁\|+n\|ID\|+\|m\|
方案[7]	2	n+1	n+4	2	2	8	(n+2)\|G₁\|+\|m\|+n\|ID\|+\|Z_q\|
方案[9]	1	1	n+3	1	2	10	(n+2)\|G₁\|+\|G₂\|+n\|ID\|+\|m\|
方案[10]	0	3n	3n+2	1	3	11	(2n+2)\|G₁\|+2n\|ID\|+\|m\|
本方案	1	1	n+3	1	3	11	(n+2)\|G₁\|+\|ID\|+\|m\|

[1]	王振宇, 郭阳, 李少青, 侯申, 邓丁. 面向轻量级物联网设备的高效匿名身份认证协议设计[J]. 通信学报, 2022, 43(7): 49-61.
[2]	孙彦景, 程枫陟, 周家思, 李松. 公平性驱动的RSMA-SDMA预编码设计[J]. 通信学报, 2022, 43(4): 177-185.
[3]	叶迎晖,施丽琴,卢光跃. 反向散射辅助的无线供能通信网络中用户能效公平性研究[J]. 通信学报, 2020, 41(7): 84-94.
[4]	王竹,袁青云,郝凡凡,房梁,李凤华. 基于链路容量的多路径拥塞控制算法[J]. 通信学报, 2020, 41(5): 59-71.
[5]	谭国真,韩国栋,张福新,丁男,刘明剑. 基于网络效用最大化理论的分布式车联网拥塞控制策略[J]. 通信学报, 2019, 40(2): 82-91.
[6]	田传俊. 密钥非均匀分布的完善保密通信系统[J]. 通信学报, 2018, 39(11): 1-9.
[7]	傅晓彤,陈思,张宁. 基于代理的密码货币支付系统[J]. 通信学报, 2017, 38(7): 199-206.
[8]	张恩,耿魁,金伟,李勇俊,孙韵清,李凤华. 抗隐蔽敌手的云外包秘密共享方案[J]. 通信学报, 2017, 38(5): 57-65.
[9]	苏成龙,金光,江先亮,钮俊. 公平和低时延的主动队列管理算法研究[J]. 通信学报, 2017, 38(5): 199-206.
[10]	谢显中,卢华兵,施赵媛. 基于轮询机制的公平高效机会干扰对齐算法[J]. 通信学报, 2017, 38(10): 1-9.
[11]	王彩芬,刘超,李亚红,牛淑芬,张玉磊. 基于PKI和IBC的双向匿名异构签密方案[J]. 通信学报, 2017, 38(10): 10-17.
[12]	张波,孙涛,于代荣. 基于身份的多接收者匿名签密改进方案[J]. 通信学报, 2015, 36(9): 109-118.
[13]	朱更明,王志强,李哲涛,李仁发. 信道公平分配的局部拥塞控制算法[J]. 通信学报, 2015, 36(4): 9-18.
[14]	陈桢,张文芳,王小敏. 基于属性的抗合谋攻击可变门限环签名方案[J]. 通信学报, 2015, 36(12): 212-222.
[15]	王志军,胡封晔,尹颖奇,刘小兰. 基于无线体域网的传输功率控制和调度算法[J]. 通信学报, 2015, 36(10): 271-277.

基于身份公平的匿名多接收者签密方案

Fair and anonymous ID-based multi-receiver signcryption

在线阅读

PDF下载

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 1

参考文献 12

相关文章 15

Metrics

推荐阅读 0