Journal of South China University of Technology (Natural Science Edition) ›› 2007, Vol. 35 ›› Issue (1): 102-105.

• Computer Science & Technology • Previous Articles     Next Articles

Verifiable (t , n) Threshold Secret-Sharing Scheme and Its Security

Pαng Liαo-jun1  Li Hui-xian2  wang Yu-min1   

  1. 1. State Key Laboratory of Integrated Service Networks , Xidian Univ. , Xi' an 710071 , Shaanxi , China;2. School of Computer Science and Engineering , Northwestem Polytechnical Univ. , Xi' an 710072 , Shaanxi , China
  • Received:2006-01-19 Online:2007-01-25 Published:2007-01-25
  • Contact: 庞辽军(1978-)，男，博士，讲师，主要从事电子商务中的安全理论与技术方面的研究。 E-mail:ljpang@mail.xidian.edu.cn
  • About author:庞辽军(1978-)，男，博士，讲师，主要从事电子商务中的安全理论与技术方面的研究。
  • Supported by:

    国家"973" 计划项目( GI999035805) ;国家自然科学基金资助项目(50479055 )

PDF

628

Abstract:

In order to share a secret among a group of participants without a trusted center and to prevent the parti-cipants from cheating each other , a dynamic and verifiable (t , n) threshold secret-sharing scheme is proposed. In this scheme , the secret shadow of each participant is negotiated by all participants , and the secret dealer does not have to distribute any secret shadow. 50 , in the process of secret distribution , the dealer is only asked to compute some public values without sending any information to each participant. Furthermore , in the process of secret reco-very, each participant of a cooperative only submits a pseudo-shadow computed via the secret shadow to the secret computer , and anyone is allowed to check the validity of the pseudo-shadow. The security of the proposed scheme can be effectively guaranteed due to the difficulty in solving the discrete logarithm problem.

Key words: data security, secret sharing, threshold scheme, verification