期刊文献+

基于区块链的有序多重签名方案 被引量:7

Sequential multi⁃signature scheme based on blockchain
下载PDF
导出
摘要 有序多重签名是由多个用户按一定顺序对同一文件进行签名和认证。目前的有序多重签名都是由签名者对签名进行验证,导致整体签名时间过长,为了解决这一问题,采用智能合约解决签名验证的时间消耗,同时为了保证签名过程的公平性,引入了罚金机制。方案将区块链技术与有序多重签名方案相结合,使得在限制签名者签名时间的同时保证了签名过程完全透明,以及保证了合同的机密性。基于计算Diffie⁃Hellman问题的困难性,方案是可证安全的。通过理论分析和原型实现,设计的方案是高效的,对比同类方案,时间效率提高了24%。 Recently,signing a contract has becoming an essential part of the company.A sequential multi⁃signature scheme for the enabled multiple users is used to jointly sign a document in order.Because of the commercial value of the current commercial contract and the actual effectiveness of the contract itself,each signer must control the signing time during the signing process.Also,since the signature process of orderly multi⁃signatures is passed between signers,once the signer delays the signing time,it will inevitably cause disputes in the handling of the entire contract.The current sequential multi⁃signatures are verified by the signers,resulting in the overall signature time to be too long.To solve the problem,a smart contract is introduced to solve the time consumption of the signature verification and a penalty mechanism to ensure the fairness of the signature process.Based on the blockchain,a sequential multi⁃signature scheme is used for making the signing process completely transparent while limiting the signing time of signers.Based on the the difficulty of the computational Diffie⁃Hellman problem,the scheme is provably secure.By using the theoretical analysis and the prototype implementation,the scheme is proved to be efficient.
作者 徐朝东 王化群 XU Chaodong;WANG Huaqun(School of Computer Science,Nanjing University of Posts and Telecommunications,Nanjing 210023,China)
出处 《南京邮电大学学报(自然科学版)》 北大核心 2021年第2期85-94,共10页 Journal of Nanjing University of Posts and Telecommunications:Natural Science Edition
基金 国家自然科学基金(61872192,61941116)资助项目。
关键词 有序多重签名 智能合约 罚金机制 区块链 计算Diffie⁃Hellman问题 sequential multi⁃signatures smart contract penalty mechanism blockchain computational Diffie⁃Hellman problem
  • 相关文献

参考文献3

二级参考文献28

  • 1王飞跃.人工社会、计算实验、平行系统——关于复杂社会经济系统计算研究的讨论[J].复杂系统与复杂性科学,2004,1(4):25-35. 被引量:234
  • 2AL-RIYAMI S, PATERSON K G, Certifieateless public key cryptog- raphy[A]. Proceedings of ASIACRYPT 2003[C]. Springer-Verlag, 2003.452-473.
  • 3ITAKURA K, NAKAMURA K. A public-key cryptosystem suitable for digital multisignatures[J]. NEC Research and Development, 1983, (71):1-8.
  • 4BELLARE M, NEVEN G, Multi-signatures in the plain public-key model and a general forking lemma[A]. 13th ACM Conference on Computer and Communications Security (CCS'06)[C]. Alexandria, USA, 2006.
  • 5BAGHERZANDI A, CHEON J H, JARECKI S. Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma [A]. 15th ACM conference on Computer arid commu- nications security (CCS'08)[C]. Alexandria, USA, 2009.27-31.
  • 6MA C, WENG J, LI Y, et al. Efficient discrete logarithm based multi-signature scheme in the plain public key model [J]. Designs, Codes and Cryptography. 2010, 54(2): 121 - 133.
  • 7FAN Y K, LU H D, JIA Y, et al. Lattice-based multi-signature schemes [J]. Applied Mechanics and Materials, 2013, 411-414: 3-6.
  • 8BOLDREVA A, GENTRY C, NEILL A. Ordered multisignatures and ID-based sequential aggregate signatures with applications to secure routing[A]. Proe of the 14th ACM Conf on Computer and Communi- cations Security[C]. New York, USA, 2007. 276-285.
  • 9JIN Z P, WEN Q Y. Certiflcateless multi-proxy signature [J]. Com- puter Communications, 2011, 34(3): 344-352.
  • 10XU J, SUN H X, WEN Q Y, et aL Improved certificateless multi-proxy signature [J], The Journal of China Universities of Posts and Telecommunications, 2012,19(4):94-105.

共引文献271

同被引文献59

引证文献7

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部