{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:49:21Z","timestamp":1770900561496,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642542411","type":"print"},{"value":"9783642542428","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54242-8_10","type":"book-chapter","created":{"date-parts":[[2014,2,3]],"date-time":"2014-02-03T02:42:54Z","timestamp":1391395374000},"page":"217-239","source":"Crossref","is-referenced-by-count":19,"title":["Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?"],"prefix":"10.1007","author":[{"given":"Dana","family":"Dachman-Soled","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Mahmoody","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tal","family":"Malkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Blum, M.: Coin flipping by telephone - a protocol for solving impossible problems. In: COMPCON, pp. 133\u2013137 (1982)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Barak, B., Mahmoody, M.: Lower bounds on signatures from symmetric primitives. In: FOCS: IEEE Symposium on Foundations of Computer Science, FOCS (2007)","DOI":"10.1109\/FOCS.2007.4389536"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-03356-8_22","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"B. Barak","year":"2009","unstructured":"Barak, B., Mahmoody-Ghidary, M.: Merkle puzzles are optimal\u2013an o(n 2)-query attack on key exchange from a random oracle. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 374\u2013390. Springer, Heidelberg (2009)"},{"key":"10_CR4","unstructured":"Barak, B., Mahmoody, M.: Merkle\u2019s key agreement protocol is optimal - an O(n 2)-query attack on any key exchange from random oracles (2013), http:\/\/www.cs.cornell.edu\/~mohammad\/files\/papers\/MerkleFull.pdf"},{"key":"10_CR5","unstructured":"Cleve, R., Impagliazzo, R.: Martingales, collective coin flipping and discrete control processes (1993) (unpublished)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: STOC, pp. 364\u2013369 (1986)","DOI":"10.1145\/12130.12168"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-642-19571-6_27","volume-title":"Theory of Cryptography","author":"D. Dachman-Soled","year":"2011","unstructured":"Dachman-Soled, D., Lindell, Y., Mahmoody, M., Malkin, T.: On the black-box complexity of optimally-fair coin tossing. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 450\u2013467. Springer, Heidelberg (2011)"},{"issue":"4","key":"10_CR8","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM\u00a033(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci.\u00a028(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Trevisan, L.: Lower bounds on the efficiency of generic cryptographic constructions. In: FOCS, pp. 305\u2013313 (2000)","DOI":"10.1109\/SFCS.2000.892119"},{"issue":"4","key":"10_CR11","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput.\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-642-36594-2_25","volume-title":"Theory of Cryptography","author":"I. Haitner","year":"2013","unstructured":"Haitner, I., Omri, E., Zarosim, H.: Limits on the usefulness of random oracles. In: Sahai, A. (ed.) TCC 2013. LNCS, vol.\u00a07785, pp. 437\u2013456. Springer, Heidelberg (2013)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography (extended abstract). In: FOCS, pp. 230\u2013235 (1989)","DOI":"10.1109\/SFCS.1989.63483"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: STOC, pp. 44\u201361 (1989)","DOI":"10.1145\/73007.73012"},{"issue":"2","key":"10_CR15","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput.\u00a017(2), 373\u2013386 (1988)","journal-title":"SIAM J. Comput."},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Mahmoody, M., Maji, H.K., Prabhakaran, M.: Limits of random oracles in secure computation. To Appear in: Innovations in Theoretical Computer Science, ITCS (2013)","DOI":"10.1145\/2554797.2554801"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-00457-5_1","volume-title":"Theory of Cryptography","author":"T. Moran","year":"2009","unstructured":"Moran, T., Naor, M., Segev, G.: An optimally fair coin toss. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 1\u201318. Springer, Heidelberg (2009)"},{"issue":"2","key":"10_CR18","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. J. Cryptology\u00a04(2), 151\u2013158 (1991)","journal-title":"J. Cryptology"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: STOC, pp. 33\u201343 (1989)","DOI":"10.1145\/73007.73011"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: STOC, pp. 387\u2013394 (1990)","DOI":"10.1145\/100216.100269"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24638-1_1","volume-title":"Theory of Cryptography","author":"O. Reingold","year":"2004","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.: Notions of reducibility between cryptographic primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 1\u201320. Springer, Heidelberg (2004)"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Theory and applications of trapdoor functions. In: FOCS, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54242-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T19:09:03Z","timestamp":1746126543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54242-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642542411","9783642542428"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54242-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}