{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:34:51Z","timestamp":1769297691879,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642315848","type":"print"},{"value":"9783642315855","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31585-5_50","type":"book-chapter","created":{"date-parts":[[2012,6,23]],"date-time":"2012-06-23T11:56:29Z","timestamp":1340452589000},"page":"561-572","source":"Crossref","is-referenced-by-count":30,"title":["Byzantine Agreement with a Rational Adversary"],"prefix":"10.1007","author":[{"given":"Adam","family":"Groce","sequence":"first","affiliation":[]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[]},{"given":"Aishwarya","family":"Thiruvengadam","sequence":"additional","affiliation":[]},{"given":"Vassilis","family":"Zikas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"50_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Gonen, R., Halpern, J.: Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In: PODC 2006, pp. 53\u201362. ACM Press (2006)","DOI":"10.1145\/1146381.1146393"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Aiyer, A.S., Alvisi, L., Clement, A., Dahlin, M., Martin, J.-P., Porth, C.: BAR fault tolerance for cooperative services. In: SOSP 2005, pp. 45\u201358. ACM (2005)","DOI":"10.1145\/1095809.1095816"},{"key":"50_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-642-20465-4_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"G. Asharov","year":"2011","unstructured":"Asharov, G., Canetti, R., Hazay, C.: Towards a Game Theoretic View of Secure Computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 426\u2013445. Springer, Heidelberg (2011)"},{"key":"50_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BFb0020806","volume-title":"STACS 91","author":"B. Baum-Waidner","year":"1991","unstructured":"Baum-Waidner, B., Pfitzmann, B., Waidner, M.: Unconditional Byzantine Agreement With Good Majority. In: Jantzen, M., Choffrut, C. (eds.) STACS 1991. LNCS, vol.\u00a0480, pp. 285\u2013295. Springer, Heidelberg (1991)"},{"key":"50_CR5","unstructured":"Bei, X., Chen, W., Zhang, J.: Distributed consensus resilient to both crash failures and strategic manipulations, arXiv 1203.4324 (2012)"},{"key":"50_CR6","doi-asserted-by":"crossref","unstructured":"Clement, A., Li, H.C., Napper, J., Martin, J.-P., Alvisi, L., Dahlin, M.: BAR primer. In: DSN 2008, pp. 287\u2013296. IEEE Computer Society (2008)","DOI":"10.1109\/DSN.2008.4630097"},{"key":"50_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/3-540-46035-7_32","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"M. Fitzi","year":"2002","unstructured":"Fitzi, M., Gisin, N., Maurer, U., von Rotz, O.: Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 482\u2013501. Springer, Heidelberg (2002)"},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Gottesman, D., Hirt, M., Holenstein, T., Smith, A.: Detectable Byzantine agreement secure against faulty majorities. In: PODC 2002, pp. 118\u2013126. ACM Press (2002)","DOI":"10.1145\/571836.571841"},{"key":"50_CR9","unstructured":"Gordon, S.D., Katz, J.: Byzantine agreement with a rational adversary. Rump session presentation, Crypto 2006 (2006)"},{"key":"50_CR10","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":"S.D. Gordon","year":"2006","unstructured":"Gordon, S.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":"50_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-29011-4_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A. Groce","year":"2012","unstructured":"Groce, A., Katz, J.: Fair Computation with Rational Players. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 81\u201398. Springer, Heidelberg (2012)"},{"key":"50_CR12","doi-asserted-by":"crossref","unstructured":"Halpern, J., Teague, V.: Rational secret sharing and multiparty computation: Extended abstract. In: STOC 2004, pp. 623\u2013632. ACM Press (2004)","DOI":"10.1145\/1007352.1007447"},{"key":"50_CR13","doi-asserted-by":"crossref","unstructured":"Izmalkov, S., Micali, S., Lepinski, M.: Rational secure computation and ideal mechanism design. In: FOCS 2005, pp. 585\u2013595. IEEE Computer Society Press (2005)","DOI":"10.1109\/SFCS.2005.64"},{"key":"50_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-540-78524-8_15","volume-title":"Theory of Cryptography","author":"J. Katz","year":"2008","unstructured":"Katz, J.: Bridging Game Theory and Cryptography: Recent Results and Future Directions. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 251\u2013272. Springer, Heidelberg (2008)"},{"issue":"3","key":"50_CR15","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The Byzantine generals problem. ACM Trans. Programming Language Systems\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Programming Language Systems"},{"key":"50_CR16","unstructured":"Li, H.C., Clement, A., Wong, E.L., Napper, J., Roy, I., Alvisi, L., Dahlin, M.: Bar gossip. In: OSDI 2006, pp. 191\u2013204. USENIX Association (2006)"},{"key":"50_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-00457-5_3","volume-title":"Theory of Cryptography","author":"S.J. Ong","year":"2009","unstructured":"Ong, S.J., Parkes, D.C., Rosen, A., Vadhan, S.: Fairness with an Honest Minority and a Rational Majority. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 36\u201353. Springer, Heidelberg (2009)"},{"issue":"2","key":"50_CR18","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"Pease, M., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM\u00a027(2), 228\u2013234 (1980)","journal-title":"Journal of the ACM"},{"key":"50_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/3-540-55210-3_195","volume-title":"STACS 92","author":"B. Pfitzmann","year":"1992","unstructured":"Pfitzmann, B., Waidner, M.: Unconditional Byzantine Agreement for any Number of Faulty Processors. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol.\u00a0577, pp. 339\u2013350. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31585-5_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T13:49:04Z","timestamp":1743601744000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31585-5_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315848","9783642315855"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31585-5_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}