期刊文献+

一种基于STSS的可验证秘密分享方案

A verifiable secret sharing scheme based on STSS
下载PDF
导出
摘要 针对秘密分享体制下非诚实分发者提供错误份额无法追责的问题,提出了一种基于STSS的可验证秘密分享方案来提升不诚实参与者的检测能力.STSS方案首先让分发者通过Feldman秘密分享方案将主秘密分割成n份,所得子秘密使用SM2算法对其进行签名;其次,所得签名值(r,s)采用TEA算法进行加密得到最终份额;最后,针对秘密分享体制下非诚实分发者提供错误份额无法追责的问题,方案使用双重验证,接收者在收到分享份额后通过对称密钥解密得到签名值,对比分发者公钥,保证其在传输和存储过程中未受到篡改.需要使用主秘密时,t(t<n)位接收者参与验证秘密重构可恢复原始秘密.方案在随机预言机模型下证明了安全性,通过仿真实验表明:该方案在给定门限值和子秘密数量下运算效率较高. A verifiable secret sharing scheme based on STSS is proposed to improve the detection ability of dishonest participants,in response to the problem that dishonest distributors cannot be held accountable for providing incorrect shares under the secret sharing system.The scheme firstly requires the distributor to divide the main secret into n parts using the Feldman secret sharing scheme,and the resulting sub secrets are signed using the SM2 algorithm;Secondly,the obtained signature values(r,s)are encrypted using the TEA algorithm to obtain the final share;Finally,to address the issue of dishonest distribution under the secret sharing system,which cannot be held accountable for providing incorrect shares,the scheme uses double verification.After receiving the shared shares,the receiver decrypts the signature value using a symmetric key,compares it with the distributor's public key,and ensures that it has not been tampered with during transmission and storage.When the master secret needs to be used,t(t<n)receivers participate in verifying the reconstruction of the secret to recover the original secret.The scheme has been proven to be secure under a random oracle model,and simulation experiments have shown that it has high computational efficiency under given threshold values and the number of sub secrets.
作者 杨景奕 郑明辉 汪玉 黄世成 YANG Jingyi;ZHENG Minghui;WANG Yu;HUANG Shicheng(College of Intelligent Systems Science and Engineering,Hubei Minzu University,Enshi 445000,Hubei,China;School of Cyber Science and Engineering,Sichuan University,Chengdu 437100,China)
出处 《中南民族大学学报(自然科学版)》 CAS 2024年第4期540-546,共7页 Journal of South-Central University for Nationalities:Natural Science Edition
基金 国家自然科学基金资助项目(61772181) 湖北民族大学研究生科研创新资助项目(MYK2023079)。
关键词 秘密分享 秘密重构 可验证性 门限值 secret sharing secret reconstruction verifiability threshold
  • 相关文献

参考文献5

二级参考文献21

  • 1许春香,肖国镇.门限多重秘密共享方案[J].电子学报,2004,32(10):1688-1689. 被引量:41
  • 2李发根,胡予濮,李刚.一个高效的基于身份的签密方案[J].计算机学报,2006,29(9):1641-1647. 被引量:73
  • 3SHAMIR A. How to share a secret[J]. Communications of the ACM,1979, 22(11): 612-613.
  • 4BLAKLEY G. Safeguarding cryptographic keys[A]. Proc AFIPS 1979 National Computer Conference[C]. New York: AFIPS Press, 1979.313-317.
  • 5ASMUTH C, BLOOM J. A modular approach to key safegrarding[J].IEEE Transactions on Information Theory, 1983, 29(2): 208-210.
  • 6KARNIN E D, GREEN J W, HELLMAN M E. On sharing secret system[J]. IEEE Transactions on Information Theory, 1983, 29(1): 35-41.
  • 7HARN L. Efficient sharing (broadcasting) of multiple secrets[J]. IEE Proceedings-Computers and Digital Techniques, 1995, 142(3): 237-240.
  • 8CHIEN H Y, JAN J K, TSENG Y M. A practical (t, n) multi-secret sharing scheme [J]. IEICE Transactions on Fundamentals, 2000, 83(12): 2762-2765.
  • 9YANG C C, CHANG T Y, HWANG M S. A (t, n) multi- secret sharing scheme[J]. Applied Mathematics and Computation, 2004,151(2): 483-490.
  • 10HWANG R J, CHANG C C. An on-line secret sharing scheme for multi-secrets[J]. Computer Communications, 1998, 21(13): 1170-1176.

共引文献48

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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