Journal on Communications ›› 2015, Vol. 36 ›› Issue (3): 265-274.doi: 10.11959/j.issn.1000-436x.2015083

• Academic paper • Previous Articles     Next Articles

Key distribution and recovery algorithm based on Shamir's secret sharing

Hui-gui RONG1,Jin-xia MO1,Bing-guo CHANG1,Guang SUN2,Fei LONG3   

  1. 1 College of Computer Science and Engineering, Hunan University, Changsha 410082, China
    2 Department of Information Management, Hunan University of Finance and Economics, Changsha 410205, China
    3 Department of Economics and Management, Changsha University, Changsha 410003, China
  • Online:2015-03-25 Published:2017-06-21
  • Supported by:
    The National Natural Science Foundation of China;The National Key Technology Support Program;The Innovation Foundation of Science and Technology Ministry;The Construct Program of the Key Discipline in Hunan; The Young Teachers Development Plan of Hunan University

Abstract:

In Shamir's secret sharing scheme, the dealer divided the secret s into n shadows and distributed it to share-holders in such a way that any t or more than t shadows can recover this secret, while fewer than t shadows cannot obtain any information about the secret s. During the actual secret recovery process, there exist other cases with more than t par-ticipants. The case of secret sharing problem was discussed based on Shamir's secret sharing scheme and reconstructs the secret by introducing a linear combination of shadows—Lagrange factor. Then, the improved algorithm of key distribu-tion and recovery was proposed and extended to a multi-secret sharing scheme. Theoretical analysis and simulation show that the improved scheme improves its security under the same conditions of complexity.

Key words: secret sharing, key distribution, Lagrange factor, key recovery

No Suggested Reading articles found!