应用区块链的多接收者多消息签密方案
作者:
作者简介:

王利朋(1987-),男,博士生,主要研究领域为密码学,区块链.
李青山(1977-),男,博士,主要研究领域为区块链.
高健博(1994-),男,博士,主要研究领域为区块链.
陈钟(1963-),男,博士,教授,博士生导师,CCF会士,主要研究领域为区块链.

通讯作者:

陈钟,E-mail:zhongchen@pku.edu.cn

中图分类号:

TP309

基金项目:

国家重点研发计划(2020YFB1005404);河南省科技攻关计划(202102210359);河南省高等学校重点科研项目(22A520048,20B520040)


Blockchain-based Multi-recipient Multi-message Signcryption Scheme
Author:
Fund Project:

National Key Research and Development Program of China (2020YFB1005404); Science and Technology Program of Henan Province (202102210359); Henan Province Higher Education Key Research Project (22A520048, 20B520040)

  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [40]
  • |
  • 相似文献 [20]
  • | | |
  • 文章评论
    摘要:

    信息通过公共链路进行传输时极易遭受窃听、篡改等形式的网络攻击,因此有必要保障信息在传输过程中的机密性和完整性,而签密技术能够有效地实现上述目的.基于椭圆曲线,提出一种多接收者多消息签密方案,能够有效地适配到广播系统中.采用多密钥分发中心管理系统主密钥信息,且能够周期地更新各自的秘密信息,以抵抗对应的APT攻击.不同更新周期注册的用户相互之间能够通信,不会影响系统的可用性.提出了一种基于区块链的周期更新策略,根据公有链中区块高度和时间戳触发密钥更新动作,基于区块链不可篡改特性确保方案的安全性,且该过程不需要执行交易动作,因此是免费的.基于Computational Diffie-Hellman问题和离散对数问题,在随机预言机模型下证明了签密方案的机密性和不可伪造性,该方案同时具有密钥托管安全性、前后向兼容性、不可否认性.性能分析表明,该签密方案具有较短的密文长度和较高的执行效率.在实验仿真部分,首先分析了密钥分发中心数量和门限值对签密算法性能的影响,在排除网络延迟等因素干扰下,引入多密钥分发中心后,性能损耗在5%以内;其次,基于区块链实现周期更新时的时间误差百分比会随周期的增加而下降,当周期大于550s时,其值控制在1%以内.这种误差使得攻击者很难预测更新的准确时间,增大了攻击的难度.

    Abstract:

    When data is transmitted through the network, it is vulnerable to network attacks such as eavesdropping and tampering. Therefore, data confidentiality and data integrity should be guaranteed which can be achieved with the signcryption schemes. Based on the elliptic curve, a multi-receiver multi-message signcryption scheme is proposed, which can be effectively adapted to many scenarios such as broadcast systems. Multiple key distribution centers are used to manage the system master key, and the secrets of each center can be updated periodically to resist the APT attacks. In addition, users registered in different periods can communicate with each other to improve the availability. A secret update strategy based on the public blockchain is proposed, and the update operation is triggered based on the block height and the block timestamp. Blockchain, with its non-tampering feature, can guarantee security of the proposed scheme. In addition, the new scheme does not need to send transactions and is therefore free. Based on the computational Diffie-Hellman problem and the discrete logarithm problem, confidentiality and unforgeability of the proposed scheme are analyzed on the random oracle model. The proposed scheme also has the following security attributes:key escrow security, forward and backward compatibility, and non-repudiation. Performance analysis shows that the proposed scheme has a shorter ciphertext length and higher efficiency. In the simulation part, influence of the number of key distribution centers and the threshold on the system performance is analyzed. Without considering the network delay and other disturbing factors, the performance loss is less than 5% for the proposed scheme compared with those with a single key distribution center. The time errors incurred by the update strategy based on blockchain decrease with the increasing periods. When the period is set more than 550s, the time error percentage is less than 1%. The time errors make it more difficult for the attackers to predict the update time and launch the attacks.

    参考文献
    [1] Zheng YL. Digital signcryption or how to achieve cost(signature & encryption)≪cost(signature)+cost(encryption). In:Proc. of the Int'l Cryptology Conf. 1997. 165-179.
    [2] Shamir A. How to share a secret. Communications of the ACM, 1979,22(11):612-613.
    [3] Qiu J, Fan K, Zhang K, Pan Q, Li H, Yang YT. An efficient multi-message and multi-receiver signcryption scheme for heterogeneous smart mobile IoT. IEEE Access, 2019,7(1):180205-180217.
    [4] Yu Y, Yang B, Huang XY, Zhang MW. Efficient identity-based signcryption scheme for multiple receivers. In:Proc. of the Int'l Conf. on Autonomic and Trusted Computing. 2007. 13-21.
    [5] Li FG, Hu YP, Liu SG. Efficient and provably secure multi-recipient signcryption from bilinear pairings. Wuhan University Journal of Natural Sciences, 2007,12(1):17-20.
    [6] Selvi SSD, Vivek SS, Srinivasan R, Rangan CP. An efficient identity-based signcryption scheme for multiple receivers. In:Proc. of the Int'l Workshop on Security. 2009. 71-88.
    [7] Wu L. An ID-based multi-receiver signcryption scheme in MANET. Journal of Theoretical and Applied Information Technology, 2012,46(1):120-124.
    [8] Peng C, Chen J, Obaidat MS, Pandi V, He DB. Efficient and provably secure multi-receiver signcryption scheme for multicast communication in edge computing. IEEE Internet of Things Journal, 2020,7(7):6056-6068.
    [9] Pang LJ, Cui JJ, Li HX, Pei QQ, Jiang ZT, Wang YM. A new multi-receiver ID-based anonymous signcryption. Chinese Journal of Computers, 2011,34(11):2104-2113(in Chinese with English abstract).
    [10] Pang L, Wei M, Li H. Efficient and anonymous certificateless multi-message and multi-receiver signcryption scheme based on ECC. IEEE Access, 2019,7(1):24511-24526.
    [11] Li HX, Chen XB, Ju LF, Pang LJ, Wang YM. Improved multi-receiver signcryption scheme. Journal of Computer Research and Development, 2013,50(7):1418-1425(in Chinese with English abstract).
    [12] Chen TS, Hsiao TC, Chen TL. An efficient threshold group signature scheme. In:Proc. of the IEEE Region 10 Conf. 2004. 13-16.
    [13] Zhang Y, Xu CX, Ni JB, Li HW, Shen XM. Blockchain-assisted public-key encryption with keyword search against keyword guessing attacks for cloud storage. IEEE Trans. on Cloud Computing, 2019.[doi:10.1109/TCC.2019.2923222]
    [14] Xie D, Li JJ, Shen ZH. A new threshold signature scheme based on elliptic curve cryptosystem. Journal of Hangzhou Normal University, 2013,12(1):57-60(in Chinese with English abstract).
    [15] Asmuth C, Bloom J. A modular approach to key safeguarding. IEEE Trans. on Information Theory, 1983,29(2):208-210.
    [16] Cheng Y, Liu HP. The Asmuth-bloom verifiable threshold sharing scheme. Natural Sciences Journal of Harbin Normal University, 2011,27(3):35-38(in Chinese with English abstract).
    [17] Dang JL, Yu HF. Group signature scheme using Chinese remainder theorem. Computer Engineering, 2015,41(2):113-116(in Chinese with English abstract).
    [18] Liu HW, Xie WX, Yu JP, Zhang P. Efficiency identity-based threshold group signature scheme. Journal on Communications, 2009, 30(5):122-127(in Chinese with English abstract).
    [19] Yan J, Y XR, Zhang WJ. Research on group signature with threshold value based on elliptic curve. Journal of Southeast University (Natural Science Edition), 2008,38(1):43-46(in Chinese with English abstract).
    [20] Gennaro R, Jarecki S, Krawczyk H, Tai R. Robust threshold DSS signatures. In:Proc. of the Advances in Cryptology. 1996. 354-371.
    [21] Gennaro R, Jarecki S, Krawczyk H, Tai R. Secure distributed key generation for discrete-log based cryptosystems. In:Proc. of the Int'l Conf. on Theory and Application of Cryptographic Techniques. 1999. 295-310.
    [22] Steven G, Rosario G, Harry K, Bonneau J, Joshua A, Edward W, Arvind N. Securing Bitcoin Wallets via a New DSA/ECDSA Threshold Signature Scheme. 2015. http://stevengoldfeder.com/papers/threshold_sigs.pdf
    [23] Zhou YW, Yang Bo, Zhang WZ. Multi-receiver and multi-message of certificateless signcryption scheme. Chinese Journal of Computers, 2017,40(7):1714-1724(in Chinese with English abstract).
    [24] Miao SQ, Zhang FT, Zhang L. Cryptanalysis of a certificateless multi-receiver signcryption scheme. In:Proc. of the Int'l Conf. on Multimedia Information Networking & Security. 2010. 593-597.
    [25] Zhou YW, Yang Bo, Wang QL. Anonymous hybrid signcryption scheme with multi-receiver (multi-message) based on identity. Ruan Jian Xue Bao/Journal of Software, 2018,29(2):442-455(in Chinese with English abstract). http://www.jos.org.cn/1000-9825/5250.htm[doi:10.13328/j.cnki.jos.005250]
    [26] Jing Q, Jun B, Chuan SX, Hou SM. Secure and efficient multi-message and multi-receiver ID-based signcryption for rekeying in ad hoc networks. Journal of Chongqing University, 2013,12(2):91-96.
    [27] Pang LJ, Man K, Wei MM, Li HX. Anonymous certificateless multi-receiver signcryption scheme without secure channel. IEEE Access, 2019,7(1):84091-84106.
    [28] Gen LF, Xiong H, Yun NX. A new multi-receiver ID-based signcryption scheme for group communications. In:Proc. of the Int'l Conf. on Communications. 2009. 296-300.
    [29] Bo Z, Liang XQ. An ID-based anonymous signcryption scheme for multiple receivers secure in the standard model. Int'l Journal of Advanced Science Technology, 2010,6059(20):15-27.
    [30] Corp. C. SEC 2:Recommended elliptic curve domain parameters. Certicom Corporation, 2010. 1-33.
    附中文参考文献:
    [9] 庞辽军,崔静静,李慧贤,裴庆祺,姜正涛,王育民.新的基于身份的多接收者匿名签密方案.计算机学报,2011,34(11):2104-2113.
    [11] 李慧贤,陈绪宝,巨龙飞,庞辽军,王育民.改进的多接收者签密方案.计算机研究与发展,2013,50(7):1418-1425.
    [14] 谢冬,李佳佳,沈忠华.一种新的基于椭圆曲线的门限群签名方案.杭州师范大学学报(自然科学版),2013,12(1):57-60.
    [16] 程宇,刘焕平.可验证的Asmuth-Bloom门限秘密共享方案.哈尔滨师范大学自然科学学报,2011,27(3):35-38.
    [17] 党佳莉,俞惠芳.使用中国剩余定理的群签名方案.计算机工程,2015,41(2):113-116.
    [18] 刘宏伟,谢维信,喻建平,张鹏.基于身份密码体制的高效门限群签名方案.通信学报,2009,30(5):122-127.
    [19] 闫杰,尹旭日,张武军.基于椭圆曲线的带门限值的群签名研究.东南大学学报(自然科学版),2008,38(1):43-46.
    [23] 周彦伟,杨波,张文政.无证书多接收者多消息签密机制.计算机学报,2017,40(7):1714-1724.
    [25] 周彦伟,杨波,王青龙.基于身份的多接收者(多消息)匿名混合签密机制.软件学报,2018,29(2):442-455. http://www.jos.org.cn/1000-9825/5250.htm[doi:10.13328/j.cnki.jos.005250]
    引证文献
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

王利朋,高健博,李青山,陈钟.应用区块链的多接收者多消息签密方案.软件学报,2021,32(11):3606-3627

复制
分享
文章指标
  • 点击次数:1050
  • 下载次数: 3183
  • HTML阅读次数: 1417
  • 引用次数: 0
历史
  • 收稿日期:2019-11-29
  • 最后修改日期:2020-03-14
  • 在线发布日期: 2021-11-05
  • 出版日期: 2021-11-06
文章二维码
您是第19938572位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号