{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T11:41:49Z","timestamp":1777376509683,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540345466","type":"print"},{"value":"9783540345473","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11761679_30","type":"book-chapter","created":{"date-parts":[[2006,7,4]],"date-time":"2006-07-04T14:11:19Z","timestamp":1152022279000},"page":"504-521","source":"Crossref","is-referenced-by-count":14,"title":["On the (Im-)Possibility of Extending Coin Toss"],"prefix":"10.1007","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","reference":[{"key":"30_CR1","first-page":"250","volume-title":"19th Annual IEEE Conference on Computational Complexity, Proceedings of CoCo 2002","author":"A. Ambanis","year":"2004","unstructured":"Ambanis, A., Buhrman, H., Dodis, Y., R\u00f6hrig, H.: Multiparty quantum coin flipping. In: 19th Annual IEEE Conference on Computational Complexity, Proceedings of CoCo 2002, pp. 250\u2013259. IEEE Computer Society, Los Alamitos (2004)"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/1103576.1103579","volume-title":"3rd ACM Workshop on Formal Methods in Security Engineering, Proceedings of FMSE 2005","author":"M. Backes","year":"2005","unstructured":"Backes, M., Hofheinz, D., M\u00fcller-Quade, J., Unruh, D.: On fairness in simulatability-based cryptographic systems. In: 3rd ACM Workshop on Formal Methods in Security Engineering, Proceedings of FMSE 2005, pp. 13\u201322. ACM Press, New York (2005)"},{"key":"30_CR3","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: Secure asynchronous reactive systems. IACR ePrint Archive (March 2004)"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/248052.248090","volume-title":"Fifteenth Annual ACM Symposium on Principles of Distributed Computing, Proceedings of PODC 1996","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Garay, J.A., Rabin, T.: Distributed pseudo-random bit generators \u2013 a new way to speed-up shared coin tossing. In: Fifteenth Annual ACM Symposium on Principles of Distributed Computing, Proceedings of PODC 1996, pp. 191\u2013200. ACM Press, New York (1996)"},{"key":"30_CR5","unstructured":"Blum, M.: Coin flipping by telephone. In: Gersho, A (ed.) Advances in Cryptology, A report on CRYPTO 1981, number 82-04 in ECE Report, University of California, Electrical and Computer Engineering, pp. 11\u201315 (1982)"},{"key":"30_CR6","first-page":"136","volume-title":"42th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2001, pp. 136\u2013145. IEEE Computer Society, Los Alamitos (2001)"},{"key":"30_CR7","first-page":"136","volume-title":"42th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42th Annual Symposium on Foundations of Computer Science, Proceedings of FOCS 2001, pp. 136\u2013145. IEEE Computer Society, Los Alamitos (2001)"},{"key":"30_CR8","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. IACR ePrint Archive (January 2005), Full and revised version of [7]"},{"key":"30_CR9","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 - CRYPTO 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 19\u201340. Springer, Heidelberg (2001)"},{"key":"30_CR10","first-page":"494","volume-title":"34th Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2002","author":"R. Canetti","year":"2002","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: 34th Annual ACM Symposium on Theory of Computing, Proceedings of STOC 2002, pp. 494\u2013503. ACM Press, New York (2002) (extended abstract)"},{"issue":"2","key":"30_CR11","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J.L. Carter","year":"1979","unstructured":"Carter, J.L., Wegman, M.N.: Universal classes of hash functions. Journal of Computer and System Sciences\u00a018(2), 143\u2013154 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/12130.12168","volume-title":"Eighteenth Annual ACM Symposium on Theory of Computing, Proceedings of STOC 1986","author":"R. Cleve","year":"1986","unstructured":"Cleve, R.: 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, pp. 364\u2013369. ACM Press, New York (1986)"},{"key":"30_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography (Basic Applications), vol.\u00a02. Cambridge University Press, Cambridge (2004)"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Hofheinz, D., M\u00fcller-Quade, J., Unruh, D.: On the (im-)possibility of extending coin toss. IACR ePrint Archive, Full version of this paper (2006)","DOI":"10.1007\/11761679_30"},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/73007.73009","volume-title":"Twenty-First Annual ACM Symposium on Theory of Computing, Proceedings of STOC 1989","author":"R. Impagliazzo","year":"1989","unstructured":"Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions. In: Twenty-First Annual ACM Symposium on Theory of Computing, Proceedings of STOC 1989, pp. 12\u201324. ACM Press, New York (1989) (extended abstract)"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1109\/SECPRI.2001.924298","volume-title":"IEEE Symposium on Security and Privacy, Proceedings of SSP 2001","author":"B. Pfitzmann","year":"2001","unstructured":"Pfitzmann, B., Waidner, M.: A model for asynchronous reactive systems and its application to secure message transmission. In: IEEE Symposium on Security and Privacy, Proceedings of SSP 2001, pp. 184\u2013200. IEEE Computer Society, Los Alamitos (2001)"},{"key":"30_CR17","first-page":"3","volume":"42","author":"D.R. Stinson","year":"2002","unstructured":"Stinson, D.R.: Universal hash families and the leftover hash lemma, and applications to cryptography and computing. Journal of Combinatorial Mathematics and Combinatorial Computing\u00a042, 3\u201331 (2002)","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - EUROCRYPT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11761679_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T19:50:03Z","timestamp":1555703403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11761679_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540345466","9783540345473"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11761679_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}