Scalable rational secret sharing

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2011, Pages 187-196

  Dani, Varsha ^a   Movahedi, Mahnush ^a   Rodriguez, Yamel ^a   Saia, Jared ^a  

^a University of New Mexico   (United States)

Author keywords

cryptography; game theory; multiparty computation; secret sharing

Indexed keywords

MULTIPARTY COMPUTATION; NASH EQUILIBRIUM; NON-SIMULTANEOUS; SECRET SHARING; SECURE MULTI-PARTY COMPUTATION;

CRYPTOGRAPHY; DISTRIBUTED COMPUTER SYSTEMS; GAME THEORY;

COMPUTATION THEORY;

EID: 79959906999     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993806.1993833     Document Type: Conference Paper

References (13)

1. I. Abraham, D. Dolev, R. Gonen, and J. Halpern. Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, pages 53-62. ACM, 2006.
2. R. Geambasu, T. Kohno, A. Levy, and H. Levy. Vanish: Increasing data privacy with self-destructing data. In Proceedings of the 18th conference on USENIX security symposium, pages 299-316. USENIX Association, 2009.
3. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proceedings of the nineteenth annual ACM symposium on Theory of computing, pages 218-229. ACM, 1987.
4. S. Gordon and J. Katz. Rational secret sharing, revisited. Security and Cryptography for Networks, pages 229-241, 2006.
5. J. Halpern and V. Teague. Rational secret sharing and multiparty computation: extended abstract. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, page 632. ACM, 2004.
6. S. Izmalkov, S. Micali, and M. Lepinski. Rational secure computation and ideal mechanism design. In Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on, pages 585-594. IEEE, 2005.
7. V. King and J. Saia. Breaking the O (n 2) bit barrier: scalable byzantine agreement with an adaptive adversary. In Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, pages 420-429. ACM, 2010.
8. G. Kol and M. Naor. Games for exchanging information. In Proceedings of the 40th annual ACM symposium on Theory of computing, pages 423-432. ACM, 2008.
9. M. Lepinksi, S. Micali, and A. Shelat. Collusion-free protocols. In ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, volume 37, page 543. Citeseer, 2005.
10. M. Lepinski, S. Micali, C. Peikert, and A. Shelat. Completely fair SFE and coalition-safe cheap talk. In Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pages 1-10. ACM, 2004.
11. A. Lysyanskaya and N. Triandopoulos. Rationality and adversarial behavior in multi-party computation. Advances in Cryptology-CRYPTO 2006, pages 180-197, 2006.
12. T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proceedings of the twenty-first annual ACM symposium on Theory of computing, pages 73-85. ACM, 1989.
13. M. Wegman and J. Carter. New hash functions and their use in authentication and set equality. Journal of computer and system sciences, 22(3):265-279, 1981. (Pubitemid 12444638)