Construct For Optimal Round Complexity Rational Secret Sharing Scheme

As an important part of distributed cryptography,rational secret sharing plays an important role in the security management of the key.Although the researchers for rational secret sharing has achieved fruitful results,but most of the existing rational secret sharing schemes have a common problem,namely in order to the balance standards,achieve fairness and collusion-free attack,the communication scheme of high complexity,which leads to the low efficiency of this scheme.Will increase the additional communication complexity and communication cost to a certain extent.Therefore,the study of how to optimize the efficiency of rational secret sharing scheme has wide application value.This paper is based on the idea of "uniform group" as the main method to optimize the communication efficiency of secret sharing scheme is studied in detail and systematic review program in three aspects to achieve a balanced,fair and collusion-free attacks on rational secret sharing,the main research results are as follows:?1?Study the traditional secret-sharing scheme based on bilinear pairings,construct a new knowledge commitment function as encryption algorithm to encrypt the secret share,and using the bilinear nature to check whether the secret share is correct,introduce complete information dynamic game theory in game theory,analysis the strategy set and participants the belief system,propose a 2-round rational secret sharing scheme based on the idea of "uniform grouping".?2?Constructing a validation algorithm based on the knowledge commitment scheme and the bivariate one-way function,concealing the true secret in a sequence,the participants could not speculate the real secret location,propose a fair rational secret sharing scheme based on the idea of "uniform grouping".the existing performance comparison.Comparing the scheme to the existing fair rational sharing scheme,the analysis shows that the proposed scheme can achieve fairness and safety requirements,and achieves the Nash equilibrium under the assumption of bilinear Diffie-Hellman,the number of communication rounds only 4,more applicable.?3?Constructing a verification algorithm based on homomorphic encryption system,to check whether the secret share is correct,the rational secret sharing scheme of resisting t-1 party conspiracy was proposed by combining the ideas of the unknown wheel.In the scheme,the true secret to probability a and random number XOR,or hidden in the false secret sequence,participants do not know the current round is the real secret of the round or test round,the participants conspiracy gains less than not conspiracy to obtain the benefits,effectively prevents the t-1 participants from conspiring.At the expense of sacrifice communicating complexity,The scheme the complexity of the scheme is 3+k^-c·?N?-3?.