{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:58:55Z","timestamp":1778065135313,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540338512","type":"print"},{"value":"9783540338529","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11745853_30","type":"book-chapter","created":{"date-parts":[[2006,4,13]],"date-time":"2006-04-13T09:18:58Z","timestamp":1144919938000},"page":"458-473","source":"Crossref","is-referenced-by-count":92,"title":["Efficiency Tradeoffs for Malicious Two-Party Computation"],"prefix":"10.1007","author":[{"given":"Payman","family":"Mohassel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Franklin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1145\/28395.28417","volume-title":"STOC 1987: Proceedings of the nineteenth annual ACM conference on Theory of computing","author":"M. Abadi","year":"1987","unstructured":"Abadi, M., Feigenbaum, J., Kilian, J.: On hiding information from an oracle. In: STOC 1987: Proceedings of the nineteenth annual ACM conference on Theory of computing, pp. 195\u2013203. ACM Press, New York (1987)"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44987-6_8","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"W. Aiello","year":"2001","unstructured":"Aiello, W., Ishai, Y., Reingold, O.: Priced oblivious transfer: How to sell digital goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, p. 119. Springer, Heidelberg (2001)"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Bar-Yehuda, R., Chor, B., Kushilevitz, E., Orlitsky, A.: Privacy, additional information, and communication. IEEE Transactions on Information Theory (1993)","DOI":"10.1109\/18.265501"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/0-387-34805-0_50","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"R. Cleve","year":"1990","unstructured":"Cleve, R.: Controlled gradual disclosure schemes for random bits and their applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 573\u2013588. Springer, Heidelberg (1990)"},{"issue":"5","key":"30_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/229459.229469","volume":"39","author":"R. Fagin","year":"1996","unstructured":"Fagin, R., Naor, M., Winkler, P.: Comparing information without leaking it. Commun. ACM\u00a039(5), 77\u201385 (1996)","journal-title":"Commun. ACM"},{"issue":"1","key":"30_CR6","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput.\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in np have zero-knowledge proofs. In: Proceedings of the 27th FOCS, pp. 174\u2013187 (1986)","DOI":"10.1109\/SFCS.1986.47"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proceedings of 19th Annual ACM Symposium on Theory of Computing, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of cryptography - vol.2, ch. 7 (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/s000370050019","volume":"8","author":"O. Goldreich","year":"1999","unstructured":"Goldreich, O., Petrank, E.: Quantifying knowledge complexity. Computational Complexity\u00a08, 50\u201398 (1999)","journal-title":"Computational Complexity"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"luby, M., Micali, S., Rackoff., C.: How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin. In: FOCS (1983)","DOI":"10.1109\/SFCS.1983.25"},{"key":"30_CR12","unstructured":"Lindell, Y., Pinkas, B.: A proof of yao\u2019s protocol for secure two-party computation. eprint archive (2004)"},{"key":"30_CR13","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay\u2013 a secure twoparty computation system. In: Proceedings of Usenix security (2004)"},{"key":"30_CR14","unstructured":"Pederson, T.P.: Non-interactive and information-theoritic secure verifiable secret-sharing (1991)"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Pinkas, B.: Fair secure two-party computation. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 87\u2013105. Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-39200-9_6"},{"key":"30_CR16","unstructured":"Rabin, M.: How to exchange secrets by oblivious transfer. Technical Report Tech., Memo. TR-81, Aiken Computation Labratory, Harvard University (1981)"},{"key":"30_CR17","unstructured":"Woodruff, D.: unpublished manuscript (2006)"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: Proceedings of the 27th IEEE symposioum on Foundations of Computer science, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography - PKC 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11745853_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T11:06:17Z","timestamp":1736334377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11745853_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540338512","9783540338529"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11745853_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}