원문정보
초록
영어
In the setting of (m,n) rational secret sharing, n rational players wish to share a secret s , arbitrarily m players can reconstruct it, they always choose the strategies which can bring them more utilities. The security requirement includes privacy, correctness and fairness. Fairness is a central objective of the rational secret sharing scheme, complete fair means either all players get the secret s or none of them get it, but most existing schemes do not meet this nature. In this work, a rational secret sharing protocol is proposed, which neither need particular communication channel, nor assume the existence of honest minority, in addition, the scheme can resist the collusion attack with k(k m) players, and can achieve sequential equilibrium. Theoretical analysis shows that the proposed protocol is complete fair.
목차
1. Introduction
1.1 Related Work
1.2 Our Contribution
1.3 Paper Outline
2. Preliminaries
2.1 Game Theory Model and Definition
2.2 Non-interactive Publicly Verifiable Secret Sharing
3. Fair Rational Secret Sharing Protocol
3.1 Initialization
3.2 Distribution Phase
3.3 Player's Protocol
4. Protocol Analysis
4.1 Security Analysis
4.2 Player’s Motivation Analysis
4.3 Sequential Equilibrium Analysis
5. Conclusion
References