STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Rational secret sharing and multiparty computation: extended abstract
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Completely fair SFE and coalition-safe cheap talk
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Rational Secure Computation and Ideal Mechanism Design
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Games for exchanging information
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Cryptography and game theory: designing protocols for exchanging information
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Rational secret sharing, revisited
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Rationality and adversarial behavior in multi-party computation
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
An efficient rational secret sharing scheme based on the Chinese remainder theorem
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Ideal secret sharing schemes with share selectability
ICICS'11 Proceedings of the 13th international conference on Information and communications security
Efficient rational secret sharing in standard communication networks
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Fair computation with rational players
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
A game-theoretic perspective on oblivious transfer
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Sequential rationality in cryptographic protocols
ACM Transactions on Economics and Computation - Inaugural Issue
Public-Key encryption with lazy parties
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Fairness in the presence of semi-rational parties in rational two-party secure computation
International Journal of Grid and Utility Computing
| Hi-index | 0.00 |
Rational secret sharing is a problem at the intersection of cryptography and game theory. In essence, a dealer wishes to engineer a communication game that, when rationally played, guarantees that each of the players learns the dealer's secret. Yet, all solutions proposed so far did not rely solely on the players' rationality, but also on their beliefs , and were also quite inefficient. After providing a more complete definition of the problem, we exhibit a very efficient and purely rational solution to it with a verifiable trusted channel.