A Rational Multiple Secret Sharing Method Fair to Honest Participants

Abstract

The invention provides a fair and rational multi-secret sharing method for honest participants. The method relates to a system parameter setting module, a distributor authentication module, a secret distributing module and a secret reconstructing module, wherein the system parameter setting module generates public parameters of a system and public keys of distributors and the participants, the public parameters are transmitted to the other modules, the distributor authentication module authenticates the distributors according to a bit commitment agreement, the secret distributing module mainly relates to that the distributors distribute sub-secrets to the corresponding participants, the secrets reconstructing module is mainly used for authenticating accuracy of the sub-secrets, deleting the participants having deceit behaviors from an assembly of the participants that reconstruct secrets and reconstructing the secrets by judging whether the secrets are meaningful. If new secrets need to be shared, just parameters and commitment values which are chosen randomly need to be publicized. According to the solution, the unfair problem to the honest participants is solved, and multi-secret sharing can be effectively achieved.

Description

technical field [0001] The invention belongs to the technical field of information security, and specifically refers to a rational multi-secret sharing method that is fair to honest participants. Background technique [0002] With the development of information technology and the popularization of computer and communication systems, people rely more and more on the Internet, such as online banking, electronic auctions, electronic bidding and electronic cash transactions. Therefore, more and more attention has been paid to how to ensure the security of information in the process of generation and transmission, and it has become an important research field of modern cryptography. The design and research of modern cryptographic systems are all carried out under the assumption of Kerckhoff. Under such assumptions, the security of cryptographic algorithms depends entirely on the security of the key. Therefore, the management or shared control of the key is in It occupies a very ...

AI Technical Summary

Problems solved by technology

This may cause two problems: first, the distribution center is dishonest, and it distributes forged secret shares, so that the share holders cannot recover the secret even if they are all gathered together; second, the share holders are dishonest, and through Presenting a fake share prevents the recovery of the secret

[0012] In 2004, Halpern and Teague first proposed the concept of rational secret sharing, in which participants are no longer just honest and malicious participants, but introduce the concept of rational participants, and put forward utility assumptions for rational participants, rational Participants choose the execution strategy by calculating the utility value according to the utility function, and prove that the secret sharing with a fixed number of interactions in game theory cannot be guaranteed to be completed within a limited time

However, there is a problem in the above schemes. If there is a cheater cheating, all participants will not be able to obtain the secret, which is unfair to the rational participants who have always been honest.

Images