{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,9]],"date-time":"2026-08-09T03:41:38Z","timestamp":1786246898794,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032353665","type":"print"},{"value":"9783032353672","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-35367-2_1","type":"book-chapter","created":{"date-parts":[[2026,8,9]],"date-time":"2026-08-09T02:47:51Z","timestamp":1786243671000},"page":"3-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Pseudo-Equilibria, Or: How to\u00a0Stop Worrying About Crypto and\u00a0Just Analyze the\u00a0Game"],"prefix":"10.1007","author":[{"given":"Alexandros","family":"Psomas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Athina","family":"Terzoglou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Wei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vassilis","family":"Zikas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,9]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-32009-5_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"J Alwen","year":"2012","unstructured":"Alwen, J., Katz, J., Maurer, U., Zikas, V.: Collusion-preserving computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 124\u2013143. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_9"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-540-24638-1_19","volume-title":"Theory of Cryptography","author":"M Backes","year":"2004","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A general composition theorem for secure reactive systems. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 336\u2013354. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_19"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Bahrani, M., Weinberg, S.M.: Undetectable selfish mining. In: Proceedings of the 25th ACM Conference on Economics and Computation, pp. 1017\u20131044 (2024)","DOI":"10.1145\/3670865.3673485"},{"issue":"1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1090\/S0002-9947-1941-0003498-3","volume":"49","author":"AC Berry","year":"1941","unstructured":"Berry, A.C.: The accuracy of the gaussian approximation to the sum of independent variates. Trans. Am. Math. Soc. 49(1), 122\u2013136 (1941)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1\u20132","key":"1_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10660-008-9013-1","volume":"8","author":"PG Bradford","year":"2008","unstructured":"Bradford, P.G., Park, S., Rothkopf, M.H., Park, H.: Protocol completion incentive problems in cryptographic vickrey auctions. Electron. Commer. Res. 8(1\u20132), 57\u201377 (2008)","journal-title":"Electron. Commer. Res."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Brown-Cohen, J., Narayanan, A., Psomas, A., Weinberg, S.M.: Formal barriers to longest-chain proof-of-stake protocols. In: Proceedings of the 2019 ACM Conference on Economics and Computation, pp. 459\u2013473. (2019)","DOI":"10.1145\/3328526.3329567"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security. J. ACM 67(5) (2020). https:\/\/doi.org\/10.1145\/3402457","DOI":"10.1145\/3402457"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Carlsten, M., Kalodner, H., Weinberg, S.M., Narayanan, A.: On the instability of bitcoin without the block reward. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 154\u2013167 (2016)","DOI":"10.1145\/2976749.2978408"},{"key":"1_CR10","unstructured":"Chou, C., Geanakoplos, J.: On finitely repeated games and pseudo-nash equilibria. Cowles Foundation Discussion Papers\u00a0777, Cowles Foundation for Research in Economics, Yale University (1985). https:\/\/doi.org\/None. https:\/\/ideas.repec.org\/p\/cwl\/cwldpp\/777.html"},{"key":"1_CR11","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 \u2014 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. 1880, pp. 112\u2013130. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_7"},{"key":"1_CR12","unstructured":"Essaidi, M., Ferreira, M.V., Weinberg, S.M.: Credible, strategyproof, optimal, and bounded expected-round single-item auctions for all distributions. In: Innovations in Theoretical Computer Science Conference (2022)"},{"key":"1_CR13","first-page":"1","volume":"28","author":"CG Esseen","year":"1942","unstructured":"Esseen, C.G.: On the Liapunov limit error in the theory of probability. Ark. Mat. Astr. Fys. 28, 1\u201319 (1942)","journal-title":"Ark. Mat. Astr. Fys."},{"issue":"7","key":"1_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/3212998","volume":"61","author":"I Eyal","year":"2018","unstructured":"Eyal, I., Sirer, E.G.: Majority is not enough: bitcoin mining is vulnerable. Commun. ACM 61(7), 95\u2013102 (2018)","journal-title":"Commun. ACM"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Ferreira, M.V., Ganesh, A., Hourigan, J., Huh, H., Weinberg, S.M., Yu, C.: Computing optimal manipulations in cryptographic self-selection proof-of-stake protocols. In: Proceedings of the 25th ACM Conference on Economics and Computation, pp. 676\u2013702 (2024)","DOI":"10.1145\/3670865.3673602"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Ferreira, M.V., Hahn, Y.L.S., Weinberg, S.M., Yu, C.: Optimal strategic mining against cryptographic self-selection in proof-of-stake. In: Proceedings of the 23rd ACM Conference on Economics and Computation, pp. 89\u2013114 (2022)","DOI":"10.1145\/3490486.3538337"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Ferreira, M.V., Weinberg, S.M.: Credible, truthful, and two-round (optimal) auctions via cryptographic commitments. In: Proceedings of the 21st ACM Conference on Economics and Computation, pp. 683\u2013712 (2020)","DOI":"10.1145\/3391403.3399495"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Ferreira, M.V., Weinberg, S.M.: Proof-of-stake mining games with perfect randomness. In: Proceedings of the 22nd ACM Conference on Economics and Computation, pp. 433\u2013453 (2021)","DOI":"10.1145\/3465456.3467636"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Fiat, A., Karlin, A., Koutsoupias, E., Papadimitriou, C.: Energy equilibria in proof-of-work mining. In: Proceedings of the 2019 ACM Conference on Economics and Computation, pp. 489\u2013502. (2019)","DOI":"10.1145\/3328526.3329630"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-11799-2_25","volume-title":"Theory of Cryptography","author":"G Fuchsbauer","year":"2010","unstructured":"Fuchsbauer, G., Katz, J., Naccache, D.: Efficient rational secret sharing in standard communication networks. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 419\u2013436. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_25"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Garay, J.A., Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Rational protocol design: cryptography against incentive-driven adversaries. In: FOCS, pp. 648\u2013657. IEEE Computer Society (2013)","DOI":"10.1109\/FOCS.2013.75"},{"key":"1_CR22","unstructured":"Goldreich, O.: Foundations of Cryptography: Volume1, Basic Tools. Cambridge University Press, Cambridge (2003)"},{"key":"1_CR23","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":"SD Gordon","year":"2006","unstructured":"Gordon, S.D., Katz, J.: Rational secret sharing, revisited. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol. 4116, pp. 229\u2013241. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11832072_16"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Goren, G., Spiegelman, A.: Mind the mining. In: Proceedings of the 2019 ACM Conference on Economics and Computation, pp. 475\u2013487. ACM, Phoenix (2019)","DOI":"10.1145\/3328526.3329566"},{"issue":"1","key":"1_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2399187.2399189","volume":"1","author":"R Gradwohl","year":"2013","unstructured":"Gradwohl, R., Livne, N., Rosen, A.: Sequential rationality in cryptographic protocols. ACM Trans. Econ. Comput. (TEAC) 1(1), 1\u201338 (2013)","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Halpern, J., Teague, V.: Rational secret sharing and multiparty computation. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 623\u2013632. ACM, Chicago (2004)","DOI":"10.1145\/1007352.1007447"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-25280-8_1","volume-title":"Decision and Game Theory for Security","author":"JY Halpern","year":"2011","unstructured":"Halpern, J.Y.: Beyond nash equilibrium: solution concepts for the 21st century. In: Baras, J.S., Katz, J., Altman, E. (eds.) GameSec 2011. LNCS, vol. 7037, pp. 1\u20133. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25280-8_1"},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.jet.2014.04.007","volume":"156","author":"JY Halpern","year":"2015","unstructured":"Halpern, J.Y., Pass, R.: Algorithmic rationality: game theory with costly computation. J. Econ. Theory 156, 246\u2013268 (2015)","journal-title":"J. Econ. Theory"},{"key":"1_CR29","unstructured":"Halpern, J.Y., Pass, R.: Sequential equilibrium in games of imperfect recall. In: KR, pp. 278\u2013287. ACM (2016)"},{"issue":"2","key":"1_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3340232","volume":"7","author":"JY Halpern","year":"2019","unstructured":"Halpern, J.Y., Pass, R.: Sequential equilibrium in computational games. ACM Trans. Econ. Comput. (TEAC) 7(2), 1\u201319 (2019)","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-319-13129-0_20","volume-title":"Web and Internet Economics","author":"JY Halpern","year":"2014","unstructured":"Halpern, J.Y., Pass, R., Seeman, L.: Not just an empty threat: subgame-perfect equilibrium in repeated games played by computationally bounded players. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 249\u2013262. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13129-0_20"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Halpern, J.Y., Pass, R., Seeman, L.: Computational extensive-form games. In: Proceedings of the 2016 ACM Conference on Economics and Computation, pp. 681\u2013698. ACM, Maastricht (2016)","DOI":"10.1145\/2940716.2940733"},{"issue":"301","key":"1_CR33","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Izmalkov, S., Micali, S., Lepinski, M.: Rational secure computation and ideal mechanism design. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201905), pp. 585\u2013594. IEEE, IEEE Computer Society, Pittsburgh (2005)","DOI":"10.1109\/SFCS.2005.64"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Kahneman, D., Tversky, A.: Prospect theory: an analysis of decision under risk. Econometrica 47(2), 263\u2013291 (1979). http:\/\/www.jstor.org\/stable\/1914185","DOI":"10.2307\/1914185"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Koutsoupias, E., Kyropoulou, M., Tselekounis, Y.: Blockchain mining games. In: Proceedings of the 2016 ACM Conference on Economics and Computation, pp. 365\u2013382. ACM, Maastricht (2016)","DOI":"10.1145\/2940716.2940773"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Kol, G., Naor, M.: Games for exchanging information. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 423\u2013432. ACM, Victoria (2008)","DOI":"10.1145\/1374376.1374437"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"Lepinksi, M., Micali, S., Shelat, A.: Collusion-free protocols. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 543\u2013552. ACM, Baltimore (2005)","DOI":"10.1145\/1060590.1060671"},{"issue":"4","key":"1_CR39","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/BF01384489","volume":"2","author":"H Nurmi","year":"1993","unstructured":"Nurmi, H., Salomaa, A.: Cryptographic protocols for Vickrey auctions. Group Decis. Negot. 2(4), 363\u2013373 (1993)","journal-title":"Group Decis. Negot."},{"key":"1_CR40","unstructured":"Psomas, A., Terzoglou, A., Wei, Y., Zikas, V.: Pseudo-equilibria, or: How to stop worrying about crypto and just analyze the game. arXiv preprint arXiv:2506.22089 (2025)"},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-662-54970-4_30","volume-title":"Financial Cryptography and Data Security","author":"A Sapirshtein","year":"2017","unstructured":"Sapirshtein, A., Sompolinsky, Y., Zohar, A.: Optimal selfish mining strategies in bitcoin. In: Grossklags, J., Preneel, B. (eds.) FC 2016. LNCS, vol. 9603, pp. 515\u2013532. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54970-4_30"},{"key":"1_CR42","doi-asserted-by":"crossref","unstructured":"Tsabary, I., Eyal, I.: The gap game. In: Proceedings of the 2018 ACM SIGSAC conference on Computer and Communications Security, pp. 713\u2013728. ACM, Toronto (2018)","DOI":"10.1145\/3243734.3243737"},{"key":"1_CR43","doi-asserted-by":"crossref","unstructured":"Tversky, A., Kahneman, D.: Advances in prospect theory: cumulative representation of uncertainty. J. Risk Uncertainty 5(4), 297\u2013323 (1992). https:\/\/EconPapers.repec.org\/RePEc:kap:jrisku:v:5:y:1992:i:4:p:297-323","DOI":"10.1007\/BF00122574"},{"key":"1_CR44","doi-asserted-by":"crossref","unstructured":"Tyagi, N., Arun, A., Freitag, C., Wahby, R., Bonneau, J., Mazi\u00e8res, D.: Riggs: decentralized sealed-bid auctions. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 1227\u20131241. ACM, Copenhagen (2023)","DOI":"10.1145\/3576915.3623182"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-35367-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,9]],"date-time":"2026-08-09T02:48:02Z","timestamp":1786243682000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35367-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032353665","9783032353672"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35367-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"9 August 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}