{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:39:31Z","timestamp":1725475171424},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540462446"},{"type":"electronic","value":"9783540462453"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11889342_80","type":"book-chapter","created":{"date-parts":[[2006,12,7]],"date-time":"2006-12-07T05:27:10Z","timestamp":1165469230000},"page":"1097-1099","source":"Crossref","is-referenced-by-count":0,"title":["Multiparty Computations in Non-private Environments"],"prefix":"10.1007","author":[{"given":"M.","family":"Li\u015bkiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"80_CR1","doi-asserted-by":"publisher","first-page":"1930","DOI":"10.1109\/18.265501","volume":"39","author":"R. Bar-Yehuda","year":"1993","unstructured":"Bar-Yehuda, R., Chor, B., Kushilevitz, E., Orlitsky, A.: Privacy, additional information, and communication. IEEE Trans. Inform. Theory\u00a039, 1930\u20131943 (1993)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"80_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"},{"key":"80_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-45708-9_13","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"M. Bl\u00e4ser","year":"2002","unstructured":"Bl\u00e4ser, M., Jakoby, A., Li\u015bkiewicz, M., Siebert, B.: Private computation \u2014 k-connected versus 1-connected networks. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 194\u2013209. Springer, Heidelberg (2002)"},{"key":"80_CR4","unstructured":"Bl\u00e4ser, M., Jakoby, A., Li\u015bkiewicz, M., Siebert, B.: Privacy in non-private environments, SIIM TR A-03-10, Unverity L\u00fcbeck (2003)"},{"key":"80_CR5","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: 20th STOC, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"issue":"2","key":"80_CR6","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":"80_CR7","doi-asserted-by":"crossref","unstructured":"Orlitsky, A., El Gamal, A.: Communication with secrecy constraints. In: 16th STOC, pp. 217\u2013224 (1984)","DOI":"10.1145\/800057.808684"},{"key":"80_CR8","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Protocols for secure computations. In: 23rd FOCS, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","General Theory of Information Transfer and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11889342_80.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:31:20Z","timestamp":1619508680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11889342_80"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540462446","9783540462453"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11889342_80","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}