{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:29:13Z","timestamp":1725578953839},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642195709"},{"type":"electronic","value":"9783642195716"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19571-6_23","type":"book-chapter","created":{"date-parts":[[2011,3,22]],"date-time":"2011-03-22T12:04:42Z","timestamp":1300795482000},"page":"382-399","source":"Crossref","is-referenced-by-count":4,"title":["A Zero-One Law for Secure Multi-party Computation with Ternary Outputs"],"prefix":"10.1007","author":[{"given":"Gunnar","family":"Kreitz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","first-page":"65","volume-title":"Proceedings of DIMACS Workshop on Distributed Computing and Cryptology","author":"D. Beaver","year":"1989","unstructured":"Beaver, D.: Perfect privacy for two-party protocols. In: Feigenbaum, J., Merritt, M. (eds.) Proceedings of DIMACS Workshop on Distributed Computing and Cryptology, vol.\u00a02, pp. 65\u201377. American Mathematical Society, Providence (1989)"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-540-78524-8_14","volume-title":"Theory of Cryptography","author":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2008","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Fitzi, M., Hirt, M., Maurer, U.M., Zikas, V.: MPC vs. SFE: Perfect security in a unified corruption model. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 231\u2013250. Springer, Heidelberg (2008)"},{"key":"23_CR3","first-page":"1","volume-title":"STOC","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC, pp. 1\u201310. ACM, New York (1988)"},{"key":"23_CR4","first-page":"11","volume-title":"STOC","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: STOC, pp. 11\u201319. ACM, New York (1988)"},{"issue":"1","key":"23_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF00195209","volume":"7","author":"B. Chor","year":"1994","unstructured":"Chor, B., Ger\u00e9b-Graus, M., Kushilevitz, E.: On the structure of the privacy hierarchy. J. Cryptology\u00a07(1), 53\u201360 (1994)","journal-title":"J. Cryptology"},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/inco.2000.3013","volume":"167","author":"B. Chor","year":"2001","unstructured":"Chor, B., Ishai, Y.: On privacy and partition arguments. Inf. Comput.\u00a0167(1), 2\u20139 (2001)","journal-title":"Inf. Comput."},{"issue":"1","key":"23_CR7","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. Discrete Math.\u00a04(1), 36\u201347 (1991)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"23_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0020-0190(93)90120-X","volume":"45","author":"B. Chor","year":"1993","unstructured":"Chor, B., Kushilevitz, E.: A communication-privacy tradeoff for modular addition. Inf. Process. Lett.\u00a045(4), 205\u2013210 (1993)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"23_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF01277955","volume":"5","author":"B. Chor","year":"1995","unstructured":"Chor, B., Shani, N.: The privacy of dense symmetric functions. Computational Complexity\u00a05(1), 43\u201359 (1995)","journal-title":"Computational Complexity"},{"issue":"1","key":"23_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M. Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U.M.: Player simulation and general adversary structures in perfect multiparty computation. J. Cryptology\u00a013(1), 31\u201360 (2000)","journal-title":"J. Cryptology"},{"issue":"4","key":"23_CR11","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1137\/S0097539797321742","volume":"29","author":"J. Kilian","year":"2000","unstructured":"Kilian, J., Kushilevitz, E., Micali, S., Ostrovsky, R.: Reducibility and completeness in private computations. SIAM J. Comput.\u00a029(4), 1189\u20131208 (2000)","journal-title":"SIAM J. Comput."},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Kreitz, G.: A zero-one law for secure multi-party computation with ternary outputs (full version), Cryptology ePrint Archive, Report 2011\/002 (2011), \n                    \n                      http:\/\/www.eprint.iacr.org\/","DOI":"10.1007\/978-3-642-19571-6_23"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-00457-5_15","volume-title":"Theory of Cryptography","author":"R. K\u00fcnzler","year":"2009","unstructured":"K\u00fcnzler, R., M\u00fcller-Quade, J., Raub, D.: Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 238\u2013255. Springer, Heidelberg (2009)"},{"issue":"2","key":"23_CR14","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. Discrete Math.\u00a05(2), 273\u2013284 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"23_CR15","first-page":"160","volume-title":"FOCS","author":"A.C.-C. Yao","year":"1982","unstructured":"Yao, A.C.-C.: Protocols for secure computations (extended abstract). In: FOCS, pp. 160\u2013164. IEEE, Los Alamitos (1982)"}],"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-19571-6_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:48:23Z","timestamp":1606186103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19571-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642195709","9783642195716"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19571-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}