Publicly Verifiable Secret Sharing Scheme Based on Large Numbers Factorization
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Due to the existence of indeterminate equation integer solutions and the difficulty of large numbers factorization, a publicly verified secret sharing scheme was proposed based on Shamir(t, n) threshold scheme. With the difficulty of big integer factorization, the scheme established a secret share for the sharers and calculated special solution combination of equation through the existence of indeterminate equation integer solutions. Share secret was recovered common calculation of sharers' secret share and special solution combination elements. In addition, the scheme realized the effective validation of the secret share, between the participants, as well as participants and the distributors. Security analysis shows that the scheme is safe, and has certain practical value.

    Reference
    Related
    Cited by
Get Citation

曹阳.基于大整数分解可公开验证的秘密共享方案.计算机系统应用,2016,25(3):271-273

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:June 26,2015
  • Revised:September 06,2015
  • Adopted:
  • Online: March 17,2016
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063