{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T00:10:06Z","timestamp":1751587806483,"version":"3.41.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,4,26]],"date-time":"2018-04-26T00:00:00Z","timestamp":1524700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s00145-018-9296-x","type":"journal-article","created":{"date-parts":[[2018,4,26]],"date-time":"2018-04-26T18:37:32Z","timestamp":1524767852000},"page":"1120-1163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the (Im-)Possibility of Extending Coin Toss"],"prefix":"10.1007","volume":"31","author":[{"given":"Dennis","family":"Hofheinz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rn","family":"M\u00fcller-Quade","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Unruh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,26]]},"reference":[{"key":"9296_CR1","doi-asserted-by":"crossref","unstructured":"A.\u00a0Ambainis, H.\u00a0Buhrman, Y.\u00a0Dodis, H.\u00a0R\u00f6hrig, Multiparty quantum coin flipping, in 19th Annual IEEE Conference on Computational Complexity, Proceedings of CCC\u201904, (IEEE Computer Society, 2004), Online available at arXiv:quant-ph\/0304112 . pp. 250\u2013259","DOI":"10.1109\/CCC.2004.1313848"},{"key":"9296_CR2","doi-asserted-by":"crossref","unstructured":"M.\u00a0Backes, D.\u00a0Hofheinz, J.\u00a0M\u00fcller-Quade, D.\u00a0Unruh, On fairness in simulatability-based cryptographic systems, in R.\u00a0K\u00fcsters, J.\u00a0Mitchell, editors, Proceedings of the 2005 ACM Workshop on Formal Methods in Security Engineering, (ACM Press, 2005). Full version as IACR ePrint 2005\/294. pp. 13\u201322","DOI":"10.1145\/1103576.1103579"},{"key":"9296_CR3","unstructured":"M.\u00a0Backes, B.\u00a0Pfitzmann, M.\u00a0Waidner, Secure asynchronous reactive systems. IACR ePrint Archive, (2004). Online available at http:\/\/eprint.iacr.org\/2004\/082"},{"key":"9296_CR4","doi-asserted-by":"crossref","unstructured":"M.\u00a0Bellare, J.A. Garay, T.\u00a0Rabin, Distributed pseudo-random bit generators\u2014a new way to speed-up shared coin tossing, in Fifteenth Annual ACM Symposium on Principles of Distributed Computing, Proceedings of PODC 2003, (ACM Press, 1996). Online available at http:\/\/www-cse.ucsd.edu\/users\/mihir\/papers\/dprg.pdf . pp. 191\u2013200","DOI":"10.1145\/248052.248090"},{"issue":"2","key":"9296_CR5","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1006\/inco.2000.2885","volume":"163","author":"M Bellare","year":"2000","unstructured":"M.\u00a0Bellare, O.\u00a0Goldreich, E.\u00a0Petrank, Uniform generation of NP-witnesses using an NP-oracle. Inf. Comput., 163(2), 510\u2013526 (2000).","journal-title":"Inf. Comput."},{"key":"9296_CR6","unstructured":"M.\u00a0Blum, Coin flipping by telephone, in A.\u00a0Gersho, editor, Advances in Cryptology: A Report on CRYPTO 81, U.C. Santa Barbara Department of Electrical and Computer Engineering, (1981). Online available at http:\/\/www-2.cs.cmu.edu\/~mblum\/research\/pdf\/coin\/ . pp. 11\u201315"},{"key":"9296_CR7","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, Universally composable security: a new paradigm for cryptographic protocols, in 42th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2001, (IEEE Computer Society, 2001). Full version online available at http:\/\/www.eccc.uni-trier.de\/eccc-reports\/2001\/TR01-016\/revisn01.ps . pp. 136\u2013145","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9296_CR8","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, M.\u00a0Fischlin, Universally composable commitments, in J.\u00a0Kilian, editor, Advances in Cryptology, Proceedings of CRYPTO \u201901, vol. 2139 Lecture Notes in Computer Science, (Springer-Verlag, 2001). Full version online available at http:\/\/eprint.iacr.org\/2001\/055.ps . pp. 19\u201340","DOI":"10.1007\/3-540-44647-8_2"},{"key":"9296_CR9","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, Y.\u00a0Lindell, R.\u00a0Ostrovsky, A.\u00a0Sahai, Universally composable two-party and multi-party secure computation, in 34th Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2002, (ACM Press, 2002). Extended abstract, full version online available at http:\/\/eprint.iacr.org\/2002\/140.ps . pp. 494\u2013503","DOI":"10.1145\/509907.509980"},{"issue":"2","key":"9296_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"JL Carter","year":"1979","unstructured":"J.L. Carter, M.N. Wegman, Universal classes of hash functions. J. Comput. Syst. Sci., 18(2), 143\u2013154 (1979).","journal-title":"J. Comput. Syst. Sci."},{"key":"9296_CR11","doi-asserted-by":"publisher","unstructured":"R.\u00a0Cleve, Limits on the security of coin flips when half the processors are faulty, in Eighteenth Annual ACM Symposium on Theory of Computing, Proceedings of STOC 1986, (ACM Press, 1986). Online available at https:\/\/doi.org\/10.1145\/12130.12168 . pp. 364\u2013369","DOI":"10.1145\/12130.12168"},{"key":"9296_CR12","doi-asserted-by":"crossref","unstructured":"D.\u00a0Dolev, C.\u00a0Dwork, M.\u00a0Naor, Non-malleable cryptography, in Twenty-Third Annual ACM Symposium on Theory of Computing, Proceedings of STOC 1991, (ACM Press, 1991). Extended abstract, full version online available at http:\/\/www.wisdom.weizmann.ac.il\/~naor\/PAPERS\/nmc.ps . pp. 542\u2013552","DOI":"10.1145\/103418.103474"},{"key":"9296_CR13","unstructured":"O.\u00a0Goldreich, Foundations of cryptography\u2014volume\u00a01 (basic tools). (Cambridge University Press, 2001). Previous version online available at http:\/\/www.wisdom.weizmann.ac.il\/~oded\/frag.html"},{"key":"9296_CR14","unstructured":"O.\u00a0Goldreich, Foundations of cryptography\u2013volume\u00a02 (basic applications). (Cambridge University Press, May 2004). Previous version online available at http:\/\/www.wisdom.weizmann.ac.il\/~oded\/frag.html ."},{"key":"9296_CR15","unstructured":"O.\u00a0Goldreich, Basing non-interactive zero-knowledge on (enhanced) trapdoor permutations: The state of the art. Online available at http:\/\/www.wisdom.weizmann.ac.il\/~oded\/PSBookFrag\/nizk-tdp.ps , (Oct. 2009)."},{"key":"9296_CR16","doi-asserted-by":"crossref","unstructured":"O.\u00a0Goldreich, L.A. Levin, A hard-core predicate for all one-way functions, in STOC\u00a0\u201989: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, (New York, NY, USA, 1989. ACM Press). pp. 25\u201332","DOI":"10.1145\/73007.73010"},{"issue":"2","key":"9296_CR17","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"S.\u00a0Goldwasser, S.\u00a0Micali, Probabilistic encryption. J. Comput. Syst. Sci., 28(2), 270\u2013299 (1984).","journal-title":"J. Comput. Syst. Sci."},{"key":"9296_CR18","unstructured":"I.\u00a0Haitner, T.\u00a0Holenstein, O.\u00a0Reingold, S.P. Vadhan, H.\u00a0Wee, Universal one-way hash functions via inaccessible entropy, in Advances in Cryptology, Proceedings of EUROCRYPT 2010, (2010), pp. 616\u2013637"},{"issue":"3","key":"9296_CR19","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s00145-013-9160-y","volume":"28","author":"D Hofheinz","year":"2015","unstructured":"D.\u00a0Hofheinz, V.\u00a0Shoup, GNUC: a new universal composability framework. J. Cryptology, 28(3), 423\u2013508 (2015).","journal-title":"J. Cryptol."},{"key":"9296_CR20","doi-asserted-by":"publisher","unstructured":"R.\u00a0Impagliazzo, L.A. Levin, M.\u00a0Luby, Pseudo-random generation from one-way functions, in Twenty-First Annual ACM Symposium on Theory of Computing, Proceedings of STOC 1989, (ACM Press, 1989). Online available at https:\/\/doi.org\/10.1145\/73007.73009 . pp. 12\u201324","DOI":"10.1145\/73007.73009"},{"key":"9296_CR21","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0304-3975(86)90174-X","volume":"43","author":"M Jerrum","year":"1986","unstructured":"M.\u00a0Jerrum, L.G. Valiant, V.V. Vazirani, Random generation of combinatorial structures from a uniform distribution. Theor. Comput. Sci., 43, 169\u2013188 (1986).","journal-title":"Theor. Comput. Sci."},{"key":"9296_CR22","unstructured":"J.\u00a0Katz, C.\u00a0Koo, On constructing universal one-way hash functions from arbitrary one-way functions. IACR Cryptology ePrint Archive, 2005, 328 (2005)"},{"issue":"3","key":"9296_CR23","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s00145-015-9199-z","volume":"29","author":"T Moran","year":"2016","unstructured":"T.\u00a0Moran, M.\u00a0Naor, G.\u00a0Segev, An optimally fair coin toss. J. Cryptology, 29(3), 491\u2013513 (2016).","journal-title":"J. Cryptol."},{"key":"9296_CR24","doi-asserted-by":"crossref","unstructured":"B.\u00a0Pfitzmann, M.\u00a0Waidner, A model for asynchronous reactive systems and its application to secure message transmission, in IEEE Symposium on Security and Privacy, Proceedings of SSP \u201901, (IEEE Computer Society, 2001). Full version online available at http:\/\/eprint.iacr.org\/2000\/066.ps . pp. 184\u2013200","DOI":"10.1109\/SECPRI.2001.924298"},{"key":"9296_CR25","doi-asserted-by":"crossref","unstructured":"J.\u00a0Rompel, One-way functions are necessary and sufficient for secure signatures, in Twenty-Second Annual ACM Symposium on Theory of Computing, Proceedings of STOC 1990, (ACM Press, 1990), pp. 387\u2013394","DOI":"10.1145\/100216.100269"},{"key":"9296_CR26","unstructured":"D.R. Stinson, Universal hash families and the leftover hash lemma, and applications to cryptography and computing. J. Combin. Math. Combin. Comput., 42, 3\u201331 (2002). Online available at http:\/\/www.cacr.math.uwaterloo.ca\/~dstinson\/papers\/leftoverhash.ps"},{"key":"9296_CR27","unstructured":"D.\u00a0Unruh, Relations among statistical security notions or why exponential adversaries are unlimited, (2006). Available as IACR ePrint 2005\/406"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-018-9296-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-018-9296-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-018-9296-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T23:29:27Z","timestamp":1751585367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-018-9296-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,26]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["9296"],"URL":"https:\/\/doi.org\/10.1007\/s00145-018-9296-x","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2018,4,26]]},"assertion":[{"value":"22 December 2010","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}