{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T01:40:05Z","timestamp":1745199605271,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642349607"},{"type":"electronic","value":"9783642349614"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34961-4_9","type":"book-chapter","created":{"date-parts":[[2012,11,16]],"date-time":"2012-11-16T09:22:26Z","timestamp":1353057746000},"page":"116-133","source":"Crossref","is-referenced-by-count":5,"title":["Completeness for Symmetric Two-Party Functionalities - Revisited"],"prefix":"10.1007","author":[{"given":"Yehuda","family":"Lindell","sequence":"first","affiliation":[]},{"given":"Eran","family":"Omri","sequence":"additional","affiliation":[]},{"given":"Hila","family":"Zarosim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/3-540-48405-1_6","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"A. Beimel","year":"1999","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)"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1137\/0404004","volume":"4","author":"B. Chor","year":"1991","unstructured":"Chor, B., Kushilevitz, E.: A zero-one law for Boolean privacy. SIAM J. on Discrete Mathematics\u00a04(1), 36\u201347 (1991)","journal-title":"SIAM J. on Discrete Mathematics"},{"issue":"6","key":"9_CR3","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. CACM\u00a028(6), 637\u2013647 (1985)","journal-title":"CACM"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Gertner, Y., Kannan, S., Malkin, T., Reingold, O., Viswanathan, M.: The relationship between public key encryption and oblivious transfer. In: Proc. of the 41st IEEE Symp. on Foundations of Computer Science, pp. 325\u2013335 (2000)","DOI":"10.1109\/SFCS.2000.892121"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography, vol. II \u2013 Basic Applications. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proc. of the 19th ACM Symp. on the Theory of Computing, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Harnik, D., Naor, M., Reingold, O., Rosen, A.: Completeness in two-party secure computation: A computational view. In: Proc. of the 36th ACM Symp. on the Theory of Computing, pp. 252\u2013261 (2004)","DOI":"10.1145\/1007352.1007395"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: Proc. of the 21st ACM Symp. on the Theory of Computing, pp. 44\u201361 (1989)","DOI":"10.1145\/73007.73012"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Basing cryptography on oblivious transfer. In: Proc. of the 20th ACM Symp. on the Theory of Computing, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A general completeness theorem for two-party games. In: Proc. of the 23th ACM Symp. on the Theory of Computing, pp. 553\u2013560 (1991)","DOI":"10.1145\/103418.103475"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Kilian, J.: More general completeness theorems for two-party games. In: Proc. of the 32nd ACM Symp. on the Theory of Computing, pp. 316\u2013324 (2000)","DOI":"10.1145\/335305.335342"},{"issue":"4","key":"9_CR12","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1137\/S0097539797321742","volume":"28","author":"J. Kilian","year":"2000","unstructured":"Kilian, J., Kushilevitz, E., Micali, S., Ostrovsky, R.: Reducibility and completeness in private computations. SIAM J. on Computing\u00a028(4), 1189\u20131208 (2000); This is the Journal version of [10, 14]","journal-title":"SIAM J. on Computing"},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/0405021","volume":"5","author":"E. Kushilevitz","year":"1992","unstructured":"Kushilevitz, E.: Privacy and communication complexity. SIAM J. on Discrete Mathematics\u00a05(2), 273\u2013284 (1992)","journal-title":"SIAM J. on Discrete Mathematics"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Micali, S., Ostrovsky, R.: Reducibility and completeness in multi-party private computations. In: Proc. of the 35th IEEE Symp. on Foundations of Computer Science, pp. 478\u2013491 (1994)","DOI":"10.1109\/SFCS.1994.365743"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Maji, H.K., Prabhakaran, M., Rosulek, M.: Complexity of multi-party computation problems: The case of 2-party symmetric secure function evaluation, pp. 256\u2013273 (2009)","DOI":"10.1007\/978-3-642-00457-5_16"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-03356-8_8","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"I. Mironov","year":"2009","unstructured":"Mironov, I., Pandey, O., Reingold, O., Vadhan, S.: Computational Differential Privacy. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 126\u2013142. Springer, Heidelberg (2009)"},{"key":"9_CR17","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory (1981), Cryptology ePrint Archive, Report 2005\/187, eprint.iacr.org\/2005\/187"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proc. of the 23th IEEE Symp. on Foundations of Computer Science, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: Proc. of the 27th IEEE Symp. on Foundations of Computer Science, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34961-4_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T01:08:46Z","timestamp":1745197726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34961-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642349607","9783642349614"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34961-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}