STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first 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
Proceedings of the thirty-seventh annual ACM symposium on Theory of 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
Breaking the O(n2) bit barrier: scalable byzantine agreement with an adaptive adversary
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Vanish: increasing data privacy with self-destructing data
SSYM'09 Proceedings of the 18th conference on USENIX security symposium
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
Hi-index | 0.00 |
We consider the classical secret sharing problem in the case where all agents are selfish but rational. In recent work, Kol and Naor show that in the non-simultaneous communciation model (i.e. when rushing is possible), there is no Nash equilibrium that ensures all agents learn the secret. However, they describe a mechanism for this problem that is an ε-Nash equilibrium, i.e. it is close to an equilibrium in the sense that no player can gain more than ε utility by deviating from it. Unfortunately, the Kol and Naor mechanism, and, to the best of our knowledge, all previous mechanisms for this problem require each agent to send O(n) messages in expectation, where n is the number of agents. This may be problematic for some applications of rational secret sharing such as secure multiparty computation and simulation of a mediator. We address this issue by describing a mechanism for rational n-out-of-n secret sharing that is an ε-Nash equilibrium, and is scalable in the sense that it requires each agent to send only an expected O(1) bits. Moreover, the latency of our mechanism is O(log n) in expectation, compared to O(n) expected latency for the Kol and Naor result. We also design mechanisms for a relaxed variant of rational m-out-of-n secret sharing where m = Θ(n) that require each processor to send O(log n) bits and have O(\log n) latency. Our mechanisms are non-cryptographic, and are not susceptible to backwards induction.