Rational secret sharing and multiparty computation: Extended abstract

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 623-632

  Halpern, Joseph ^a   Teague, Vanessa ^b  

^a School of Operations Research and Information Engineering   (United States)

^b Stanford University   (United States)

Author keywords

Game Theory; Iterated deletion of weakly dominated strategies; Multiparty computation; Non cooperative computing; Secret sharing

Indexed keywords

INTERATED DELETION OF WEAKLY DOMINATED STRATEGIES; MULTIPARTY COMPUTATION; NON-COOPERATIVE COMPUTING; SECRET SHARING;

BOOLEAN ALGEBRA; COMPUTATIONAL METHODS; FUNCTIONS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

GAME THEORY;

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

References (20)

1. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. 20th ACM Symp. on Theory of Computing, pages 1-10, 1988.
2. M. Blum. How to exchange (secret) keys. ACM Trans. on Computer Systems, 1(2):175-193, 1983.
3. D. Boneh and M. Naor. Timed commitments. In Proc. CRYPTO 2000, Lecture Notes in Computer Science, Volume 1880, pages 236-254. Springer-Verlag, 2000.
4. A. Brandenburger and J. Keisler. Epistemic conditions for iterated admissibility. Unpublished manuscript; first version 6/16/00, latest draft 6/9/03., 2000.
5. R. Canetti. Studies in Secure Multiparty Computation and Applications. PhD thesis, Technion, 1996.
6. D. Chaum, G. Crépeau, and I. Damgård. Multi-party unconditionally secure protocols. In Proc. 20th ACM Symp. on Theory of Computing, pages 11-19, 1988.
7. R. Cleve. Controlled gradual disclosure schemes for random bits and their applications. In Proc. CRYPTO '89, pages 573-588, 1989.
8. I. Damgård. Practical and provably secure release of a secret and exchange of signatures. Journal of Cryptology, 8(4):201-222, 1995.
9. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM, 28(6):637-647, 1985.
10. R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning about Knowledge. MIT Press, Cambridge, Mass., 1995.
11. J. Feigenbaum and S. Shenker. Distributed algorithmic mechanism design: Recent results and future directions. In Proc. 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pages 1-13. ACM Press, 2002.
12. O. Goldreich. Foundations of Cryptography, Vol. 2. Cambridge University Press, 2004. To appear; draft available at www.wisdom.weizmann.ac.il/~oded/foc. html.
13. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proc. 19th ACM Symp. on Theory of Computing, pages 218-229, 1987.
14. M. Luby, S. Micali, and C. Rackoff. How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin. In Proc. 24th IEEE Symp. on Foundations of Computer Science, pages 11-21, 1983.
15. R. McGrew, R. Porter, and Y. Shoham. Towards infomational mechanism design: A new perspective on secure function evaluation. Unpublished manuscript.
16. R. McGrew, R. Porter, and Y. Shoham. Towards a general theory of non-cooperative computing. In Theoretical Aspects of Rationality and Knowledge: Proc. Ninth Conference (TARK 2003), pages 59-51, 2003.
17. M. J. Osborne and A. Rubinstein. A Course in Game Theory. MIT Press, Cambridge, Mass., 1994.
18. A. Shamir. How to share a secret. Communications of the ACM, 22:612-613, 1979.
19. Y. Shoham and M. Tennenholtz. Non-cooperative computing: Boolean functions with correctness and exclusivity. Theoretical Computer Science, 2004. To appear. Also available at iew3.technion.ac.il/~moshet/NCC-TCS.pdf.
20. A. Yao. Protocols for secure computation (extended abstract). In Proc. 23rd IEEE Symp. on Foundations of Computer Science, pages 160-164, 1982.