Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 2006, Issue , 2006, Pages 53-62

  Abraham, Ittai ^a   Dolev, Danny ^a   Gonen, Rica ^b   Halpern, Joe ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b LUCENT TECHNOLOGIES   (United States)

^c Cornell University ^*  (United States)

Author keywords

Distributed Computing; Game Theory; Secret Sharing; Secure Multiparty Computation

Indexed keywords

DISTRIBUTED COMPUTING; SECRET SHARING; SECURE MULTIPARTY COMPUTATIONS;

AUTONOMOUS AGENTS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; GAME THEORY; INFORMATION THEORY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33748686155     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. E. Adar and B. Huberman. Free riding on Gnutella, First Monday, 5(10), 2000.
2. R Aumann. Acceptable points in general cooperative n-person games. Contributions to the Theory of Games, Annals of Mathematical Studies, IV:287-324, 1959.
3. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. 20th ACM Symp. Theory of Computing, pages 1-10, 1988.
4. E. Ben-Porath. Cheap talk in games with incomplete information. J. Economic Theory, 108(1):45-71, 2003.
5. B. D. Bernheim, B. Peleg, and M. Whinston. Coalition proof Nash equilibrium: Concepts. J. Economic Theory, 42(1):1-12, 1989.
6. F. M. Forges. An approach to communication equilibria. Econometrica, 54(6): 1375-85, 1986.
7. O. Goldreich. Foundations of Cryptography, Vol. 2. Cambridge University Press, 2004.
8. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proc. 19th ACM Symp. Theory of Computing, pages 218-229, 1987.
9. D. Gordon and J. Katz. Rational secret sharing, revisited. Unpublished manuscript, 2006.
10. J. Y. Halpern and V. Teague. Rational secret sharing and multiparty computation: extended abstract. In Proc. 36th ACM Symp. Theory of Computing, pages 623-632, 2004.
11. Yuval Heller. A minority-proof cheap-talk protocol. Unpublished manuscript, 2005.
12. S. Izmalkov, S. Micali, and M. Lepinski. Rational secure computation and ideal mechanism design. In Proc. 46th IEEE Symp. Foundations of Computer Science, pages 585-595, 2005.
13. J. Justesen. On the complexity of decoding Reed-Solomon codes (corresp). IEEE Trans. on Information Theory, 22(2):237-238, 1976.
14. L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals problem. ACM Trans. on Programming Languages and Systems, 4(3):382-401, 1982.
15. M. Lepinksi, S. Micali, and A. Shelat. Collusion-free protocols. In Proc. 37th ACM Symp. Theory of Computing, pages 543-552, 2005.
16. M. Lepinski, S. Micali, C. Peikert, and A. Shelat. Completely fair SFE and coalition-safe cheap talk. In Proc. 23rd ACM Symp. Principles of Distributed Computing, pages 1-10, 2004.
17. A. Lysyanskaya and N. Triandopoulos. Rationality and adversarial behavior in multi-party computation. Unpublished manuscript, 2006.
18. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay secure two-party computation system. In Proc. 13th USENIX Security Symposium, pages 287-302, 2004.
19. D. Moreno and J. Wooders. Coalition-proof equilibrium. Games and Economic Behavior, 17(1):80-112, 1996.
20. G. Neiger and S. Toueg. Automatically increasing them fault-tolerance of distributed algorithms. Journal of Algorithms, 11(3):374-419, 1990.
21. M. J. Osborne and A. Rubinstein. A Course in Game Theory. MIT Press, Cambridge, Mass., 1994.
22. T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proc. 21st ACM Symp. Theory of Computing, pages 73-85, 1989.
23. A. Shamir. How to share a secret. Commun. ACM, 22(11):612-613, 1979.
24. Y. Shoham and M. Tennenholtz. Non-cooperative computing: Boolean functions with correctness and exclusivity. Theoretical Computer Science, 343(1-2):97-113, 2005.
25. A. Yao. Protocols for secure computation (extended abstract). In Proc. 23rd IEEE Symp. Foundations of Computer Science, pages 160-164, 1982.