理性多秘密分享

Rational Multi-secret Sharing

主要研究已有的理性秘密共享方案中存在的参与者欺骗问题,在以往的理性秘密分享方案中,理性参与者为了最大化自己的利益选择发送自己的子秘密,如果存在参与者发送错误的子秘密则共享秘密不能被重构,这对其他诚实的参与者来说是不公平的;针对此问题,提出将欺骗者从参与重构的集合中排除的解决方案,以保证对其他诚实的参与者的公平性,在方案中使用承诺值来验证本轮是否为有意义轮,利用单向函数来验证参与者发送的子秘密的正确性.结合多秘密分享,提出了一个对诚实的参与者公平的理性多秘密分享方案.

In this paper, we mainly focused on the cheating problem in the existed rational secret sharing schemes. In the past the in- teracting times is uncertainty in the scheme which has random interaction times, rational players send their secret share since they want to maximize their own interests. However, if there are players who deceive secret share then others can not reconstructed secret, this is not fair to the other honest players. To solve this problem, this paper give a solution to protect the fairness for honest players, the solution is that when cheaters are discovered they will be excluded from the player collection who will reconstruct the secret. This pa- per uses the commitment value to verify whether this run is meanness, and verify the correctness of secret share by one-way hash function. Then combined with the property of the multi-secret sharing, we give a rational multi-secret sharing scheme.