{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:18:02Z","timestamp":1761581882030},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030321000"},{"type":"electronic","value":"9783030321017"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-32101-7_18","type":"book-chapter","created":{"date-parts":[[2019,10,11]],"date-time":"2019-10-11T07:04:00Z","timestamp":1570777440000},"page":"282-300","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["ROYALE: A Framework for Universally Composable Card Games with Financial Rewards and Penalties Enforcement"],"prefix":"10.1007","author":[{"given":"Bernardo","family":"David","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Dowsley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Larangeira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,30]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-662-44774-1_8","volume-title":"Financial Cryptography and Data Security","author":"M Andrychowicz","year":"2014","unstructured":"Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, \u0141.: Fair two-party computations via bitcoin deposits. In: B\u00f6hme, R., Brenner, M., Moore, T., Smith, M. (eds.) FC 2014. LNCS, vol. 8438, pp. 105\u2013121. Springer, Heidelberg (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-662-44774-1_8"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, L.: Secure multiparty computations on bitcoin. In: 2014 IEEE Symposium on Security and Privacy, pp. 443\u2013458. IEEE Computer Society Press, May 2014","DOI":"10.1109\/SP.2014.35"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-540-40974-8_29","volume-title":"Cryptography and Coding","author":"A Barnett","year":"2003","unstructured":"Barnett, A., Smart, N.P.: Mental poker revisited. In: Paterson, K.G. (ed.) Cryptography and Coding 2003. LNCS, vol. 2898, pp. 370\u2013383. Springer, Heidelberg (2003). \n                      https:\/\/doi.org\/10.1007\/978-3-540-40974-8_29"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-29011-4_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"S Bayer","year":"2012","unstructured":"Bayer, S., Groth, J.: Efficient zero-knowledge argument for correctness of a shuffle. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 263\u2013280. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-29011-4_17"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Ashby, V. (ed.) ACM CCS 93, pp. 62\u201373. ACM Press, November 1993","DOI":"10.1145\/168588.168596"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-662-44381-1_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"I Bentov","year":"2014","unstructured":"Bentov, I., Kumaresan, R.: How to use bitcoin to design fair protocols. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 421\u2013439. Springer, Heidelberg (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-662-44381-1_24"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-319-70697-9_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"I Bentov","year":"2017","unstructured":"Bentov, I., Kumaresan, R., Miller, A.: Instantaneous decentralized poker. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 410\u2013440. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-70697-9_15"},{"key":"18_CR8","unstructured":"Buterin, V.: White paper. \n                      https:\/\/github.com\/ethereum\/wiki\/wiki\/White-Paper\n                      \n                     (2013). Accessed 5 Dec 2017"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-319-78381-9_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"J Camenisch","year":"2018","unstructured":"Camenisch, J., Drijvers, M., Gagliardoni, T., Lehmann, A., Neven, G.: The wonderful world of global random Oracles. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 280\u2013312. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-78381-9_11"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-642-25385-0_24","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"J Camenisch","year":"2011","unstructured":"Camenisch, J., Krenn, S., Shoup, V.: A framework for practical universally composable zero-knowledge protocols. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 449\u2013467. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-25385-0_24"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE Computer Society Press, October 2001","DOI":"10.1109\/SFCS.2001.959888"},{"key":"18_CR12","unstructured":"Canetti, R.: Universally composable signature, certification, and authentication. In: 17th IEEE Computer Security Foundations Workshop, (CSFW-17 2004), p. 219. IEEE Computer Society (2004)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"R Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 19\u201340. Springer, Heidelberg (2001). \n                      https:\/\/doi.org\/10.1007\/3-540-44647-8_2"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/11537878_4","volume-title":"Trust, Privacy, and Security in Digital Business","author":"J Castell\u00e0-Roca","year":"2005","unstructured":"Castell\u00e0-Roca, J., Seb\u00e9, F., Domingo-Ferrer, J.: Dropout-tolerant TTP-free mental poker. In: Katsikas, S., L\u00f3pez, J., Pernul, G. (eds.) TrustBus 2005. LNCS, vol. 3592, pp. 30\u201340. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/11537878_4"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Advances in Cryptology \u2014 CRYPTO 92","author":"D Chaum","year":"1993","unstructured":"Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89\u2013105. Springer, Heidelberg (1993). \n                      https:\/\/doi.org\/10.1007\/3-540-48071-4_7"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-39799-X_8","volume-title":"Advances in Cryptology \u2014 CRYPTO 85 Proceedings","author":"C Cr\u00e9peau","year":"1986","unstructured":"Cr\u00e9peau, C.: A secure poker protocol that minimizes the effect of player coalitions. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 73\u201386. Springer, Heidelberg (1986). \n                      https:\/\/doi.org\/10.1007\/3-540-39799-X_8"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C.: A zero-knowledge poker protocol that achieves confidentiality of the players\u2019 strategy or how to achieve an electronic poker face. In: Odlyzko [25], pp. 239\u2013247","DOI":"10.1007\/3-540-47721-7_18"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-319-93638-3_4","volume-title":"Information Security and Privacy","author":"B David","year":"2018","unstructured":"David, B., Dowsley, R., Larangeira, M.: 21 - bringing down the complexity: fast composable protocols for card games without secret state. In: Susilo, W., Yang, G. (eds.) ACISP 2018. LNCS, vol. 10946, pp. 45\u201363. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-93638-3_4"},{"key":"18_CR19","unstructured":"David, B., Dowsley, R., Larangeira, M.: Kaleidoscope: an efficient poker protocol with payment distribution and penalty enforcement. To appear on Financial Cryptography and Data Security (FC) 2018 (2018). \n                      http:\/\/eprint.iacr.org\/2017\/899"},{"key":"18_CR20","unstructured":"David, B., Dowsley, R., Larangeira, M.: Royale: a framework for universally composable card games with financial rewards and penalties enforcement. Cryptology ePrint Archive, Report 2018\/157 (2018). \n                      https:\/\/eprint.iacr.org\/2018\/157"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko [25], pp. 186\u2013194","DOI":"10.1007\/3-540-47721-7_12"},{"key":"18_CR22","unstructured":"Golle, P.: Dealing cards in poker games. In: International Symposium on Information Technology: Coding and Computing (ITCC 2005), vol. 1, 4\u20136 April 2005, Las Vegas, Nevada, USA, pp. 506\u2013511 (2005)"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Kumaresan, R., Bentov, I.: How to use bitcoin to incentivize correct computations. In: Ahn, G.J., Yung, M., Li, N. (eds.) ACM CCS 2014, pp. 30\u201341. ACM Press, November 2014","DOI":"10.1145\/2660267.2660380"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Kumaresan, R., Moran, T., Bentov, I.: How to use bitcoin to play decentralized poker. In: Ray, I., Li, N., Kruegel: C. (eds.) ACM CCS 2015, pp. 195\u2013206. ACM Press (Oct 2015)","DOI":"10.1145\/2810103.2813712"},{"key":"18_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47721-7","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","year":"1987","unstructured":"Odlyzko, A.M. (ed.): CRYPTO 1986. LNCS, vol. 263. Springer, Heidelberg (1987). \n                      https:\/\/doi.org\/10.1007\/3-540-47721-7"},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/3-540-68339-9_33","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 96","author":"D Pointcheval","year":"1996","unstructured":"Pointcheval, D., Stern, J.: Security proofs for signature schemes. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 387\u2013398. Springer, Heidelberg (1996). \n                      https:\/\/doi.org\/10.1007\/3-540-68339-9_33"},{"key":"18_CR27","unstructured":"Schindelhauer, C.: A toolbox for mental card games. Technical report, University of L\u00fcbeck (1998)"},{"issue":"3","key":"18_CR28","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"CP Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. J. Cryptol. 4(3), 161\u2013174 (1991)","journal-title":"J. Cryptol."},{"key":"18_CR29","doi-asserted-by":"crossref","unstructured":"Sebe, F., Domingo-Ferrer, J., Castella-Roca, J.: On the security of a repaired mental poker protocol. In: Third International Conference on Information Technology: New Generations, pp. 664\u2013668 (2006)","DOI":"10.1109\/ITNG.2006.103"},{"key":"18_CR30","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-1-4684-6686-7_5","volume-title":"The Mathematical Gardner","author":"A Shamir","year":"1981","unstructured":"Shamir, A., Rivest, R.L., Adleman, L.M.: Mental poker. In: Klarner, D.A. (ed.) The Mathematical Gardner, pp. 37\u201343. Springer, Boston (1981)"},{"key":"18_CR31","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/j.ins.2014.02.151","volume":"273","author":"TJ Wei","year":"2014","unstructured":"Wei, T.J.: Secure and practical constant round mental poker. Inf. Sci. 273, 352\u2013386 (2014)","journal-title":"Inf. Sci."},{"issue":"1","key":"18_CR32","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1515\/jmc-2012-0004","volume":"6","author":"TJ Wei","year":"2012","unstructured":"Wei, T.J., Wang, L.C.: A fast mental poker protocol. J. Math. Cryptol. 6(1), 39\u201368 (2012)","journal-title":"J. Math. Cryptol."},{"key":"18_CR33","unstructured":"Wikipedia: Online Poker (2017). \n                      https:\/\/en.wikipedia.org\/wiki\/Online_poker\n                      \n                    . Accessed 29 Aug 2017"},{"key":"18_CR34","unstructured":"Zhang, B., Zhou, H.S.: Digital liquid democracy: How to vote your delegation statement. Cryptology ePrint Archive, Report 2017\/616 (2017). \n                      http:\/\/eprint.iacr.org\/2017\/616"},{"key":"18_CR35","unstructured":"Zhao, W., Varadharajan, V.: Efficient TTP-free mental poker protocols. In: International Symposium on Information Technology: Coding and Computing (ITCC 2005), vol. 1, 4\u20136 April 2005, Las Vegas, Nevada, USA, pp. 745\u2013750 (2005)"},{"key":"18_CR36","unstructured":"Zhao, W., Varadharajan, V., Mu, Y.: A secure mental poker protocol over the internet. In: Proceedings of the Australasian Information Security Workshop Conference on ACSW Frontiers 2003, ACSW Frontiers 2003, vol. 21, pp. 105\u2013109. Australian Computer Society Inc., Darlinghurst (2003)"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-32101-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,11]],"date-time":"2019-10-11T07:07:13Z","timestamp":1570777633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-32101-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030321000","9783030321017"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-32101-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"30 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Kitts","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Saint Kitts and Nevis","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 February 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc19.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"178","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,08","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7,6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}