{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:47:58Z","timestamp":1725504478254},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540785231"},{"type":"electronic","value":"9783540785248"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78524-8_17","type":"book-chapter","created":{"date-parts":[[2008,2,25]],"date-time":"2008-02-25T09:18:12Z","timestamp":1203931092000},"page":"302-319","source":"Crossref","is-referenced-by-count":14,"title":["Lower Bounds on Implementing Robust and Resilient Mediators"],"prefix":"10.1007","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Dolev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph Y.","family":"Halpern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Gonen, R., Halpern, J.Y.: Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation. In: Proc.\u00a025th ACM Symp.\u00a0Principles of Distributed Computing, pp. 53\u201362 (2006)","DOI":"10.1145\/1146381.1146393"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Gonen, R., Halpern, J.Y.: Distributed computing meets game theory: Robust mechanisms for rational secret sharing and multiparty computation (unpublished manuscript, 2007)","DOI":"10.1145\/1146381.1146393"},{"key":"17_CR3","unstructured":"Abraham, I., Dolev, D., Halpern, J.Y.: Lower bounds on implementing robust and resilient mediators. arXiv:0704.3646v2"},{"key":"17_CR4","first-page":"287","volume":"IV","author":"R.J. Aumann","year":"1959","unstructured":"Aumann, R.J.: Acceptable points in general cooperative n-person games. Contributions to the Theory of Games, Annals of Mathematical Studies\u00a0IV, 287\u2013324 (1959)","journal-title":"Contributions to the Theory of Games, Annals of Mathematical Studies"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1911154","volume":"55","author":"R.J. Aumann","year":"1987","unstructured":"Aumann, R.J.: Correlated equilibrium as an expression of Bayesian rationality. Econometrica\u00a055, 1\u201318 (1987)","journal-title":"Econometrica"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1287\/moor.17.2.327","volume":"17","author":"I. Barany","year":"1992","unstructured":"Barany, I.: Fair distribution protocols or how the players replace fortune. Mathematics of Operations Research\u00a017, 327\u2013340 (1992)","journal-title":"Mathematics of Operations Research"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proc.\u00a020th ACM Symp.\u00a0Theory of Computing, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0022-0531(02)00011-X","volume":"108","author":"E. Ben-Porath","year":"2003","unstructured":"Ben-Porath, E.: Cheap talk in games with incomplete information. J.\u00a0Economic Theory\u00a0108(1), 45\u201371 (2003)","journal-title":"J.\u00a0Economic Theory"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-44598-6_15","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"D. Boneh","year":"2000","unstructured":"Boneh, D., Naor, M.: Timed commitments. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 236\u2013254. Springer, Heidelberg (2000)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: Proc.\u00a020th ACM Symp.\u00a0Theory of Computing, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"issue":"6","key":"17_CR11","doi-asserted-by":"publisher","first-page":"1431","DOI":"10.2307\/1913390","volume":"50","author":"V.P. Crawford","year":"1982","unstructured":"Crawford, V.P., Sobel, J.: Strategic information transmission. Econometrica\u00a050(6), 1431\u20131451 (1982)","journal-title":"Econometrica"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-44598-6_7","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Y. Dodis","year":"2000","unstructured":"Dodis, Y., Halevi, S., Rabin, T.: A cryptographic solution to a game theoretic problem. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 112\u2013130. Springer, Heidelberg (2000)"},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1111\/1467-937X.t01-1-00023","volume":"69","author":"K. Eliaz","year":"2002","unstructured":"Eliaz, K.: Fault-tolerant implementation. Review of Economic Studies\u00a069(3), 589\u2013610 (2002)","journal-title":"Review of Economic Studies"},{"issue":"6","key":"17_CR14","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM\u00a028(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"issue":"2","key":"17_CR15","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty processor. Journal of the ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"Journal of the ACM"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-39200-9_4","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"M. Fitzi","year":"2003","unstructured":"Fitzi, M., Hirt, M., Holenstein, T., Wullschleger, J.: Two-threshold broadcast and detectable multi-party computation. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 51\u201367. Springer, Heidelberg (2003)"},{"issue":"6","key":"17_CR17","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.2307\/2938319","volume":"58","author":"F. Forges","year":"1990","unstructured":"Forges, F.: Universal mechanisms. Econometrica\u00a058(6), 1341\u20131364 (1990)","journal-title":"Econometrica"},{"key":"17_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography, vol.\u00a02. Cambridge University Press, Cambridge (2004)"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proc.\u00a019th ACM Symp.\u00a0Theory of Computing, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/11832072_16","volume-title":"Security and Cryptography for Networks","author":"D. Gordon","year":"2006","unstructured":"Gordon, D., Katz, J.: Rational secret sharing, revisited. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol.\u00a04116, pp. 229\u2013241. Springer, Heidelberg (2006)"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Halpern, J.Y., Teague, V.: Rational secret sharing and multiparty computation: extended abstract. In: Proc.\u00a036th ACM Symp.\u00a0Theory of Computing, pp. 623\u2013632 (2004)","DOI":"10.1145\/1007352.1007447"},{"key":"17_CR22","unstructured":"Heller, Y.: A minority-proof cheap-talk protocol (2005) (Unpublished manuscript)"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Izmalkov, S., Micali, S., Lepinski, M.: Rational secure computation and ideal mechanism design. In: Proc.\u00a046th IEEE Symp.\u00a0Foundations of Computer Science, pp. 585\u2013595 (2005)","DOI":"10.1109\/SFCS.2005.64"},{"issue":"3","key":"17_CR24","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/2402.322398","volume":"30","author":"L. Lamport","year":"1983","unstructured":"Lamport, L.: The weak byzantine generals problem. J. ACM\u00a030(3), 668\u2013676 (1983)","journal-title":"J. ACM"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Lepinksi, M., Micali, S., Shelat, A.: Collusion-free protocols. In: Proc.\u00a037th ACM Symp.\u00a0Theory of Computing, pp. 543\u2013552 (2005)","DOI":"10.1145\/1060590.1060671"},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Lepinski, M., Micali, S., Peikert, C., Shelat, A.: Completely fair SFE and coalition-safe cheap talk. In: Proc.\u00a023rd ACM Symp.\u00a0Principles of Distributed Computing, pp. 1\u201310 (2004)","DOI":"10.1145\/1011767.1011769"},{"key":"17_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/11818175_11","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"A. Lysyanskaya","year":"2006","unstructured":"Lysyanskaya, A., Triandopoulos, N.: Rationality and Adversarial Behavior in Multi-party Computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 180\u2013197. Springer, Heidelberg (2006)"},{"key":"17_CR28","unstructured":"Myerson, R.B.: Game Theory: Analysis of Conflict. Harvard University Press (September 1997)"},{"key":"17_CR29","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proc.\u00a021st ACM Symp.\u00a0Theory of Computing, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Shamir, A., Rivest, R.L., Adelman, L.: Mental poker. In: Klarner, D.A. (ed.) The Mathematical Gardner, Prindle, Weber, Schmidt, Boston, Mass, pp. 37\u201343 (1981)","DOI":"10.1007\/978-1-4684-6686-7_5"},{"issue":"5","key":"17_CR31","doi-asserted-by":"publisher","first-page":"1893","DOI":"10.1111\/1468-0262.00357","volume":"70","author":"A. Urbano","year":"2002","unstructured":"Urbano, A., Vila, J.E.: Computational complexity and communication: Coordination in two-player games. Econometrica\u00a070(5), 1893\u20131927 (2002)","journal-title":"Econometrica"},{"issue":"2","key":"17_CR32","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s00199-003-0378-z","volume":"23","author":"A. Urbano","year":"2004","unstructured":"Urbano, A., Vila, J.E.: Computationally restricted unmediated talk under incomplete information. Economic Theory\u00a023(2), 283\u2013320 (2004)","journal-title":"Economic Theory"},{"key":"17_CR33","doi-asserted-by":"crossref","unstructured":"Yao, A.: Protocols for secure computation (extended abstract). In: Proc.\u00a023rd IEEE Symp.\u00a0Foundations of Computer Science, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78524-8_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:12:03Z","timestamp":1619521923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78524-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540785231","9783540785248"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78524-8_17","relation":{},"subject":[]}}