微信服务号

微信订阅号

2025年4月6日 20:37 星期日
首页 > 过刊浏览>2014年第25卷第10期 >2409-2420. DOI:10.13328/j.cnki.jos.004506
PDF HTML阅读 XML下载 导出引用 引用提醒
公平的基于身份的多接收者匿名签密设计与分析
作者:
基金项目:

国家自然科学基金（61103178，60803151）；西安电子科技大学基本科研业务费（K5051310006）


Design and Analysis of a Fair ID-Based Multi-Receiver Anonymous Signcryption
Author:
  • 摘要
    • | |
  • 访问统计
    • |
  • 参考文献 [16]
    • |
  • 相似文献 [20]
    • | | |
  • 文章评论
    摘要:

    针对现有基于身份的多接收者签密方案中存在的接收者身份泄露以及解密不公平性等问题，提出一种具有解密公平性的基于身份的多接收者匿名签密方案.新方案不仅能够解决现有方案中不能保护接收者身份隐私性的问题，并且满足解密公平性，从而有效地防止了发送者可能的欺骗行为.接着，基于双线性Diffie-Hellman假设和计算Diffie-Hellman假设，对所提方案的保密性和不可伪造性进行了证明.同时，对方案的正确性及性能进行了分析.分析发现，该方案是一个安全、有效的公钥签密方案，能够解决现有方案中存在的接收者身份暴露和解密不公平性等问题.这使得该方案具有非常重要的应用，尤其是可以用来实现安全广播，以便在不安全和开放的网络环境中安全地广播敏感信息.

    Abstract:

    Existing ID-based multi-receiver signcryption schemes presents some security problems. For example, the identities of receivers can be revealed and the receivers do not have fairness in decryption. In order to avoid those problems, this paper proposes a fair ID-based multi-receiver anonymous signcryption scheme. The new scheme can not only solve the problem that the existing schemes can not protect the privacy of receivers, but also meet the fairness of decryption to effectively prevent possible cheating behavior of the sender. It then proves the confidentiality and unforgeability under of the scheme the bilinear Diffie-Hellman assumption and the computational Diffie-Hellman assumption. Simultaneity, the correctness and the performance of this scheme are analyzed. It concludes that this scheme is a secure and effective public-key signcryption scheme and can solve the problems of the receivers' identity exposure and unfairness decryption. Therefore, the new scheme has very important applications, especially it can be used to broadcast sensitive information in unsafe and open network environment.

    参考文献
    [1] Duan S, Cao Z. Efficient and provably secure multi receiver identity based signcryption. In: Batten L, Safavi-Naini R, eds. Proc. of the 11th Australasian Conf. on Information Security and Privacy (ACISP 2006). LNCS 4058, Heidelberg: Springer-Verlag, 2006. 195-206. [doi: 10.1007/11780656_17]
    [2] Bellare M, Boldyreva A, Micali S. Public-Key encryption in a multi-user setting: Security proofs and improvements. In: Naor M, ed. Proc. of the Advances in Cryptology (Eurocrypt 2000). LNCS 1807, Heidelberg: Springer-Verlag, 2000. 259-274. [doi: 10. 1007/3-540-45539-6_18]
    [3] Baudron O, Pointcheval D, Stern J. Extended notions of security for multicast public key cryptosystems. In: Widmayer P, Francisco T, et al., eds. Proc. of the 29th Int'l Colloquium on Automata, Languages and Programming (ICALP 2000). LNCS 1853, Heidelberg: Springer-Verlag, 2000. 499-511. [doi: 10.1007/3-540-45022-X_42]
    [4] Yu Y, Yang B, Huang X, Zhang M. Efficient identity-based signcryption scheme for multiple receivers. In: Xiao B, et al., eds. Proc. of the 4th Int'l Conf. on Autonomic and Trusted Computing (ATC 2007). LNCS 4610, Heidelberg: Springer-Verlag, 2007. 13-21. [doi: 10.1007/978-3-540-73547-2_4]
    [5] Sharmila S, Shukla D, Rangan P. Efficient and provably secure certificateless multi-receiver signcryption. In: Baek J, et al., eds. Proc. of the 2nd Int'l Conf. on Provable Security (ProvSec 2008). LNCS 5324, Heidelberg: Springer-Verlag, 2008. 52-67. [doi: 10. 1007/978-3-540-88733-1_4]
    [6] Sharmila S, Sree S, Srinivasan R, Pandu C. An efficient identity-based signcryption scheme for multiple receivers. In: Takagi T, Mambo M, eds. Proc. of the 4th Int'l Workshop on Security (IWSEC 2009). LNCS 5824, Heidelberg: Springer-Verlag, 2009. 71-88. [doi: 10.1007/978-3-642-04846-3_6]
    [7] Elkamchouchi H, Abouelseoud Y. MIDSCYK: An efficient provably secure multirecipient identity-based signcryption scheme. In: Hossam M, Watheq M, et al., eds. Proc. of the 2009 Int'l Conf. on Networking and Media Convergence (ICNM 2009). Piscataway: IEEE Press, 2009. 70-75. [doi: 10.1109/ICNM.2009.4907192]
    [8] Zheng Y. Digital signcryption or how to achieve cost(signature & encryption)<
    [9] Shin JB, Lee K, Shim K. New DSA-verifiable signcryption schemes. In: Lee P, Lim C, eds. Proc. of the 5th Int'l Conf. on Information Security and Cryptology (ICISC 2002). LNCS 2587, Heidelberg: Springer-Verlag, 2003. 35-47. [doi: 10.1007/3-540- 36552-4_3]
    [10] Malone-Lee J. Identity-Based signcryption. IACR Cryptology ePrint Archive: Report 2002/098 (2002), 2002. http://eprint.iacr.org/ 2002/098.pdf
    [11] Malone-Lee J, Mao W. Two birds one stone: Signcryption schemes using RSA. In: Joye M, ed. Proc. of the Cryptographer's Track at RSA Conf. (CT-RSA 2003). LNCS 2612, Heidelberg: Springer-Verlag, 2003. 211-226. [doi: 10.1007/3-540-36563-X_14]
    [12] Libert B, Quisquator J. A new identity based signcryption scheme from pairings. In: Ezio B, Vahid T, eds. Proc. of the 2003 IEEE Information Theory Workshop. Piscataway: IEEE Press, 2003. 155-158. [doi: 10.1109/ITW.2003.1216718]
    [13] Boneh D, Franklin M. Identity-Based encryption from the Weil pairing. In: Kilian J, ed. Proc. of the Advances in Cryptology (CRYPTO 2001). LNCS 2139, Heidelberg: Springer-Verlag, 2001. 213-229. [doi: 10.1007/3-540-44647-8_13]
    [14] Pang LJ, Li HX, Jiao LC, Wang YM. Design and analysis of a provable secure multi-recipient public key encryption scheme. Ruan Jian Xue Bao/Journal of Software, 2009,20(10):2907-2914 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/ 3552.htm [doi: 10.3724/SP.J.1001.2009.03552]
    [15] Lal S, Kushwah P. Anonymous ID based signcryption scheme for multiple receivers. IACR Cryptology ePrint Archive: Report 2009/345 (2009), 2009. http://eprint.iacr.org/2009/345.pdf
    [16] Zhang B, Xu QL. An ID-based anonymous signcryption scheme for multiple receivers secure in the standard model. In: Kim T, Adeli H, eds. Proc. of the AST/UCMA/ISA/ACN 2010 Conf. on Advances in Computer Science and Information Technology (AST/ UCMA/ISA/ACN 2010). LNCS 6059, Heidelberg: Springer-Verlag, 2010. 15-27. [doi: 10.1007/978-3-642-13577-4_2]
    引证文献
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

庞辽军,李慧贤,崔静静,王育民.公平的基于身份的多接收者匿名签密设计与分析.软件学报,2014,25(10):2409-2420

复制
分享
文章指标
  • 点击次数:2888
  • 下载次数: 5786
  • HTML阅读次数: 1335
  • 引用次数: 0
历史
  • 收稿日期:2011-06-16
  • 最后修改日期:2013-01-25
  • 在线发布日期: 2014-09-30
文章二维码
友情链接:中国科学院软件研究所中国计算机学会中国科学院国家自然科学基金委员会CCF数字图书馆Int'l J of Softw Info计算机系统应用
您是第19794856位访问者
版权所有：中国科学院软件研究所 京ICP备05046678号-3
地址：北京市海淀区中关村南四街4号,邮政编码：100190
电话：010-62562563 传真：010-62562533 Email：jos@iscas.ac.cn
技术支持：北京勤云科技发展有限公司

京公网安备 11040202500063号