论文部分内容阅读
主要研究已有的理性秘密共享方案中存在的参与者欺骗问题,在以往的理性秘密分享方案中,理性参与者为了最大化自己的利益选择发送自己的子秘密,如果存在参与者发送错误的子秘密则共享秘密不能被重构,这对其他诚实的参与者来说是不公平的;针对此问题,提出将欺骗者从参与重构的集合中排除的解决方案,以保证对其他诚实的参与者的公平性,在方案中使用承诺值来验证本轮是否为有意义轮,利用单向函数来验证参与者发送的子秘密的正确性.结合多秘密分享,提出了一个对诚实的参与者公平的理性多秘密分享方案.
In the previous rational secret sharing scheme, rational participants choose to send their own sub-secrets in order to maximize their own interests. If there is a participant who sends the wrong son The secret is that the shared secret can not be reconstructed, which is unfair to other honest participants. In response to this question, a solution is proposed to exclude the deceiver from the set of participation and reconstruction in order to guarantee other honest participation We use the commitment value in the scheme to verify whether the current round is a meaningful round and use the one-way function to verify the correctness of the sub-secret sent by the participants.Combining with multi-secret sharing, Fair and rational multi-secret sharing program.