{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T11:19:21Z","timestamp":1780571961529,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642365935","type":"print"},{"value":"9783642365942","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-36594-2_14","type":"book-chapter","created":{"date-parts":[[2013,2,7]],"date-time":"2013-02-07T02:43:27Z","timestamp":1360205007000},"page":"243-262","source":"Crossref","is-referenced-by-count":21,"title":["A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness"],"prefix":"10.1007","author":[{"given":"Gilad","family":"Asharov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yehuda","family":"Lindell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tal","family":"Rabin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Full version of this work. Cryptology ePrint Archive (2013)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: 20th STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"issue":"1","key":"14_CR3","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. Journal of Cryptology\u00a013(1), 143\u2013202 (2000)","journal-title":"Journal of Cryptology"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: The 20th STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62214"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: The 18th STOC, pp. 364\u2013369 (1986)","DOI":"10.1145\/12130.12168"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The Foundations of Cryptography. Basic Applications, vol.\u00a02. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"issue":"1","key":"14_CR7","first-page":"691","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. JACM\u00a038(1), 691\u2013729 (1991)","journal-title":"JACM"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: The 19th STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"issue":"6","key":"14_CR9","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/2049697.2049698","volume":"58","author":"S.D. Gordon","year":"2011","unstructured":"Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. JACM\u00a058(6), 24 (2011)","journal-title":"JACM"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A general completeness theorem for two-party games. In: 23rd STOC, pp. 553\u2013560 (1991)","DOI":"10.1145\/103418.103475"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: The 21st STOC, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"key":"14_CR12","first-page":"36","volume":"12","author":"J. Neumann von","year":"1951","unstructured":"von Neumann, J.: Various Techniques Used in Connection with Random Digits. Journal of Research of the National Bureau of Standards\u00a012, 36\u201338 (1951)","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Yao, A.: How to generate and exchange secrets (extended abstract). In: The 27th FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"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-36594-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T00:21:36Z","timestamp":1595377296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36594-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642365935","9783642365942"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36594-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}