Abstract
Verifiable secret sharing is a special kind of secret sharing. In this paper, A secure and efficient threshold secret sharing scheme is proposed by using the plane parametric curve on the basis of the principle of secret sharing. And the performance of this threshold scheme is analyzed. The results reveal that the threshold scheme has its own advantage of one-parameter representation for a master key, and it is a perfect ideal secret sharing scheme. It can easily detect cheaters by single operation in the participants so that the probability of valid cheating is less than 1/p (where p is a large prime).
Highlights
In the field of information security, as an important means of key management, the basic principle of secret sharing is to split the master key into many subkeys, and distribute these subkeys to all members of the set P = {P1, P2, Pn}composed of a limited number of participants
The results reveal that the threshold scheme has its own advantage of one-parameter representation for a master key, and it is a perfect ideal secret sharing scheme
This paper proposes a verifiable secret sharing scheme based on the plane parameter curve
Summary
In the field of information security, as an important means of key management, the basic principle of secret sharing is to split the master key into many subkeys, and distribute these subkeys to all members of the set P = {P1, P2 , , Pn}. Composed of a limited number of participants. After some members of the authorization set show their subkeys, they can reconstruct the original master key through a series of calculations. In essence, secret sharing is an operation process for the distribution, preservation and recovery of secret keys. Using the secure sharing scheme in the secret system can reduce the burden of the key holder due to the loss and damage of the system key, and reduce the success rate of the adversary’s malicious attack on the key
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have