Rational secret sharing and multiparty computation. (English) Zbl 1192.94119
Proceedings of the 36th annual ACM symposium on theory of computing (STOC 2004), Chicago, IL, USA, June 13 - 15, 2004. New York, NY: ACM Press (ISBN 1-58113-852-0). 623-632, electronic only (2004).
MSC:
| 94A62 | Authentication, digital signatures and secret sharing |
| 91A80 | Applications of game theory |
| 68M12 | Network protocols |
Keywords:
game theory; secret sharing; multiparty computation; iterated deletion of weakly dominated strategies; non-cooperative computingReferences:
| [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.]] 10.1145/62212.62213 |
| [2] | M. Blum. How to exchange (secret) keys. ACM Trans. on Computer Systems, 1(2):175-193, 1983.]] 10.1145/357360.357368 |
| [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.]] · Zbl 0989.94517 |
| [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, C. Crepeau, and I. Damgåard. Multi-party unconditionally secure protocols. In Proc. 20th ACM Symp. on Theory of Computing, pages 11-19, 1988.]] 10.1145/62212.62214 |
| [7] | R. Cleve. Controlled gradual disclosure schemes for random bits and their applications. In Proc. CRYPTO ’89, pages 573-588, 1989.]] · Zbl 0722.68044 |
| [8] | I. Damgard. Practical and provably secure release of a secret and exchange of signatures. Journal of Cryptology, 8(4):201-222, 1995.]] · Zbl 0840.94014 |
| [9] | S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM, 28(6):637-647, 1985.]] 10.1145/3812.3818 |
| [10] | R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning about Knowledge. MIT Press, Cambridge, Mass., 1995.]] · Zbl 0839.68095 |
| [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.]] 10.1145/570810.570812 |
| [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.]] · Zbl 1068.94011 |
| [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.]] 10.1145/28395.28420 |
| [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.]] 10.1145/846241.846249 |
| [17] | M. J. Osborne and A. Rubinstein. A Course in Game Theory. MIT Press, Cambridge, Mass., 1994.]] · Zbl 1194.91003 |
| [18] | A. Shamir. How to share a secret. Communications of the ACM, 22:612-613, 1979.]] 10.1145/359168.359176 · Zbl 0414.94021 |
| [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.]] 10.1016/j.tcs.2005.05.009 |
| [20] | A. Yao. Protocols for secure computation (extended abstract). In Proc. 23rd IEEE Symp. on Foundations of Computer Science, pages 160-164, 1982.]] |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
