{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:48Z","timestamp":1766281008433,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642552199"},{"type":"electronic","value":"9783642552205"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-55220-5_36","type":"book-chapter","created":{"date-parts":[[2014,4,30]],"date-time":"2014-04-30T11:47:50Z","timestamp":1398858470000},"page":"659-676","source":"Crossref","is-referenced-by-count":15,"title":["A Full Characterization of Completeness for Two-Party Randomized Function Evaluation"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Kraschewski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hemanta K.","family":"Maji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manoj","family":"Prabhakaran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Precomputing oblivious transfer. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 97\u2013109. Springer, Heidelberg (1995)","DOI":"10.1007\/3-540-44750-4_8"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Beimel, A., Ishai, Y., Kumaresan, R., Kushilevitz, E.: On the cryptographic complexity of the worst functions (2013), http:\/\/www.cs.umd.edu\/~ranjit\/BIKK.pdf (retrieved October 16, 2013)","DOI":"10.1007\/978-3-642-54242-8_14"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Beimel, A., Malkin, T., Micali, S.: The all-or-nothing nature of two-party secure computation. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 80\u201397. Springer, Heidelberg (1999)","DOI":"10.1007\/3-540-48405-1_6"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: Simon, J. (ed.) STOC, pp. 1\u201310. ACM (1988)","DOI":"10.1145\/62212.62213"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Brassard, G., Cr\u00e9peau, C., Robert, J.-M.: All-or-nothing disclosure of secrets. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 234\u2013238. Springer, Heidelberg (1987)","DOI":"10.1007\/3-540-47721-7_17"},{"key":"#cr-split#-36_CR6.1","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. Electronic Colloquium on Computational Complexity (ECCC) TR01-016 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"#cr-split#-36_CR6.2","unstructured":"Previous version \"A unified framework for analyzing security of protocols\" available at the ECCC archive TR01-016. Extended abstract in FOCS 2001 (2001)"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000\/067 (2005); Revised version of [6]","DOI":"10.1109\/SFCS.2001.959888"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: Simon, J. (ed.) STOC, pp. 11\u201319. ACM (1988)","DOI":"10.1145\/62212.62214"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Choi, S.G., Dachman-Soled, D., Malkin, T., Wee, H.: Simple, black-box constructions of adaptively secure protocols. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 387\u2013402. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-00457-5_23"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Cover, T.M., Thomas, J.A.: Elements of information theory. Wiley-Interscience, New York (1991)","DOI":"10.1002\/0471200611"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions (extended abstract). In: FOCS, pp. 42\u201352. IEEE (1988)","DOI":"10.1109\/SFCS.1988.21920"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Morozov, K., Wolf, S.: Efficient unconditional oblivious transfer from almost any noisy channel. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol.\u00a03352, pp. 47\u201359. Springer, Heidelberg (2005)","DOI":"10.1007\/978-3-540-30598-9_4"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Garay, J.A., Maurer, U.M., Ostrovsky, R.: Minimal complete primitives for secure multi-party computation. J. Cryptology\u00a018(1), 37\u201361 (2005)","DOI":"10.1007\/s00145-004-0150-y"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Maurer, U.M.: From partial consistency to global broadcast. In: Frances Yao, F., Luks, E.M. (eds.) STOC, pp. 494\u2013503. ACM (2000)","DOI":"10.1145\/335305.335363"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Applications. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play ANY mental game. In: Aho, A.V. (ed.) STOC, pp. 218\u2013229. ACM (1987); See [15, Ch. 7] for more details","DOI":"10.1145\/28395.28420"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Vainish, R.: How to solve any protocol problem - an efficiency improvement. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 73\u201386. Springer, Heidelberg (1988)","DOI":"10.1007\/3-540-48184-2_6"},{"key":"36_CR18","unstructured":"Haber, S., Micali, S.: Unpublished manuscript (1986)"},{"key":"36_CR19","doi-asserted-by":"crossref","unstructured":"Haitner, I.: Semi-honest to malicious oblivious transfer - the black-box way. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 412\u2013426. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-78524-8_23"},{"key":"36_CR20","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Lindell, Y., Petrank, E.: Black-box constructions for secure computation. In: STOC, pp. 99\u2013108. ACM (2006)","DOI":"10.1145\/1132516.1132531"},{"key":"36_CR21","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Prabhakaran, M., Sahai, A., Wullschleger, J.: Constant-rate oblivious transfer from noisy channels. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 667\u2013684. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-22792-9_38"},{"key":"36_CR22","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer - efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 572\u2013591. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"36_CR23","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: Simon, J. (ed.) STOC, pp. 20\u201331. ACM (1988)","DOI":"10.1145\/62212.62215"},{"key":"36_CR24","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A general completeness theorem for two-party games. In: Koutsougeras, C., Vitter, J.S. (eds.) STOC, pp. 553\u2013560. ACM (1991)","DOI":"10.1145\/103418.103475"},{"key":"36_CR25","doi-asserted-by":"crossref","unstructured":"Kilian, J.: More general completeness theorems for secure two-party computation. In: Frances Yao, F., Luks, E.M. (eds.) STOC, pp. 316\u2013324. ACM (2000)","DOI":"10.1145\/335305.335342"},{"key":"36_CR26","doi-asserted-by":"crossref","unstructured":"Kilian, J., Kushilevitz, E., Micali, S., Ostrovsky, R.: Reducibility and completeness in private computations. SIAM J. Comput.\u00a029(4), 1189\u20131208 (2000)","DOI":"10.1137\/S0097539797321742"},{"key":"36_CR27","doi-asserted-by":"crossref","unstructured":"Kraschewski, D., Maji, H.K., Prabhakaran, M., Sahai, A.: A full characterization of completeness for two-party randomized function evaluation. IACR Cryptology ePrint Archive, 2014:50 (2014)","DOI":"10.1007\/978-3-642-55220-5_36"},{"key":"36_CR28","doi-asserted-by":"crossref","unstructured":"Kraschewski, D., M\u00fcller-Quade, J.: Completeness theorems with constructive proofs for finite deterministic 2-party functions. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 364\u2013381. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-19571-6_22"},{"key":"36_CR29","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Micali, S., Ostrovsky, R.: Reducibility and completeness in multi-party private computations. In: FOCS, pp. 478\u2013489. IEEE Computer Society (1994)","DOI":"10.1109\/SFCS.1994.365743"},{"key":"36_CR30","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Omri, E., Zarosim, H.: Completeness for symmetric two-party functionalities - revisited. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol.\u00a07658, pp. 116\u2013133. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-34961-4_9"},{"key":"36_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-34931-7_4","volume-title":"Progress in Cryptology - INDOCRYPT 2012","author":"H.K. Maji","year":"2012","unstructured":"Maji, H.K., Prabhakaran, M., Rosulek, M.: A unified characterization of completeness in secure function evaluation. In: Galbraith, S., Nandi, M. (eds.) INDOCRYPT 2012. LNCS, vol.\u00a07668, pp. 40\u201359. Springer, Heidelberg (2012)"},{"key":"36_CR32","unstructured":"Rabin, M.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory (1981)"},{"key":"36_CR33","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Johnson, D.S. (ed.) STOC, pp. 73\u201385. ACM (1989)","DOI":"10.1145\/73007.73014"},{"key":"36_CR34","doi-asserted-by":"crossref","unstructured":"Wiesner, S.: Conjugate coding. SIGACT News\u00a015, 78\u201388 (1983)","DOI":"10.1145\/1008908.1008920"},{"key":"36_CR35","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Some complexity questions related to distributive computing (preliminary report). In: STOC, pp. 209\u2013213. ACM (1979)","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-55220-5_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T16:36:46Z","timestamp":1746203806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-55220-5_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642552199","9783642552205"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-55220-5_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}