{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T14:33:29Z","timestamp":1787495609026,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319108780","type":"print"},{"value":"9783319108797","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10879-7_9","type":"book-chapter","created":{"date-parts":[[2014,8,20]],"date-time":"2014-08-20T21:19:04Z","timestamp":1408569544000},"page":"135-154","source":"Crossref","is-referenced-by-count":23,"title":["On the Classification of Finite Boolean Functions up to Fairness"],"prefix":"10.1007","author":[{"given":"Nikolaos","family":"Makriyannis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-40041-4_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"S. Agrawal","year":"2013","unstructured":"Agrawal, S., Prabhakaran, M.: On fair exchange, fair coins and fair sampling. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol.\u00a08042, pp. 259\u2013276. Springer, Heidelberg (2013)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-642-54242-8_13","volume-title":"Theory of Cryptography","author":"G. Asharov","year":"2014","unstructured":"Asharov, G.: Towards characterizing complete fairness in secure two-party computation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol.\u00a08349, pp. 291\u2013316. Springer, Heidelberg (2014)"},{"key":"9_CR3","unstructured":"Asharov, G.: Towards characterizing complete fairness in secure two-party computation (extended version). Cryptology ePrint Archive, Report 2014\/098\u00a0098 (2014), \n                    \n                      http:\/\/eprint.iacr.org\/2014\/098"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-36594-2_14","volume-title":"Theory of Cryptography","author":"G. Asharov","year":"2013","unstructured":"Asharov, G., Lindell, Y., Rabin, T.: A full characterization of functions that imply fair coin tossing and ramifications to fairness. In: Sahai, A. (ed.) TCC 2013. LNCS, vol.\u00a07785, pp. 243\u2013262. Springer, Heidelberg (2013)"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1008908.1008911","volume":"15","author":"M. Blum","year":"1983","unstructured":"Blum, M.: Coin flipping by telephone a protocol for solving impossible problems. SIGACT News\u00a015(1), 23\u201327 (1983)","journal-title":"SIGACT News"},{"issue":"1","key":"9_CR6","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. J. Cryptology\u00a013(1), 143\u2013202 (2000)","journal-title":"J. Cryptology"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: STOC 1986, pp. 364\u2013369. ACM (1986)","DOI":"10.1145\/12130.12168"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Applications, vol.\u00a02. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Gordon, D.S., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. In: STOC 2008, pp. 413\u2013422. ACM (2008)","DOI":"10.1145\/1374376.1374436"},{"key":"9_CR10","unstructured":"Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation (extended version). Cryptology ePrint Archive, Report 2008\/303 (2008), \n                    \n                      http:\/\/eprint.iacr.org\/2008\/303"},{"key":"9_CR11","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)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-0348-8438-9_1","volume-title":"Polytopes Combinatorics and Computation, DMV Seminar","author":"G.M. Ziegler","year":"2000","unstructured":"Ziegler, G.M.: Lectures on 0\/1-polytopes. In: Kalai, G., Ziegler, G.M. (eds.) Polytopes Combinatorics and Computation, DMV Seminar, pp. 1\u201341. Birkhauser, Basel (2000)"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10879-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T12:36:47Z","timestamp":1558960607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10879-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319108780","9783319108797"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10879-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}