{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T09:23:29Z","timestamp":1773912209269,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642365935","type":"print"},{"value":"9783642365942","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-36594-2_34","type":"book-chapter","created":{"date-parts":[[2013,2,6]],"date-time":"2013-02-06T21:43:27Z","timestamp":1360187007000},"page":"600-620","source":"Crossref","is-referenced-by-count":87,"title":["On the Power of Correlated Randomness in Secure Computation"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Ishai","sequence":"first","affiliation":[]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[]},{"given":"Sigurd","family":"Meldgaard","sequence":"additional","affiliation":[]},{"given":"Claudio","family":"Orlandi","sequence":"additional","affiliation":[]},{"given":"Anat","family":"Paskin-Cherniavsky","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","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, pp. 119\u2013135. Springer, Heidelberg (2001)"},{"key":"34_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"D. Beaver","year":"1992","unstructured":"Beaver, D.: Efficient Multiparty Protocols Using Circuit Randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 420\u2013432. Springer, Heidelberg (1992)"},{"key":"34_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/3-540-44750-4_8","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"D. Beaver","year":"1995","unstructured":"Beaver, D.: Precomputing Oblivious Transfer. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 97\u2013109. Springer, Heidelberg (1995)"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Commodity-based cryptography (extended abstract). In: STOC, pp. 446\u2013455 (1997)","DOI":"10.1145\/258533.258637"},{"key":"34_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-34961-4_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"M. Bellare","year":"2012","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol.\u00a07658, pp. 134\u2013153. Springer, Heidelberg (2012)"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"34_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-20465-4_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"R. Bendlin","year":"2011","unstructured":"Bendlin, R., Damg\u00e5rd, I., Orlandi, C., Zakarias, S.: Semi-homomorphic Encryption and Multiparty Computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 169\u2013188. Springer, Heidelberg (2011)"},{"issue":"1-3","key":"34_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1023\/A:1016501125022","volume":"26","author":"C. Blundo","year":"2002","unstructured":"Blundo, C., Masucci, B., Stinson, D.R., Wei, R.: Constructions and bounds for unconditionally secure non-interactive commitment schemes. Des. Codes Cryptography\u00a026(1-3), 97\u2013110 (2002)","journal-title":"Des. Codes Cryptography"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Bogdanov, D., Talviste, R., Willemson, J.: Deploying secure multi-party computation for financial data analysis - (short paper), pp. 57\u201364 (2012)","DOI":"10.1007\/978-3-642-32946-3_5"},{"key":"34_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-03549-4_20","volume-title":"Financial Cryptography and Data Security","author":"P. Bogetoft","year":"2009","unstructured":"Bogetoft, P., Christensen, D.L., Damg\u00e5rd, I., Geisler, M., Jakobsen, T., Kr\u00f8igaard, M., Nielsen, J.D., Nielsen, J.B., Nielsen, K., Pagter, J., Schwartzbach, M., Toft, T.: Secure Multiparty Computation Goes Live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol.\u00a05628, pp. 325\u2013343. Springer, Heidelberg (2009)"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: STOC, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"34_CR12","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: FOCS, pp. 41\u201350 (1995)"},{"key":"34_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"CRYPTO 2012","author":"I. Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N.P., Zakarias, S.: Multiparty Computation from Somewhat Homomorphic Encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 643\u2013662. Springer, Heidelberg (2012)"},{"key":"34_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1007\/978-3-642-36594-2_35","volume-title":"TCC","author":"I. Damg\u00e5rd","year":"2013","unstructured":"Damg\u00e5rd, I., Zakarias, S.: Constant-Overhead Secure Computation of Boolean Circuits Using Preprocessing. In: Sahai, A. (ed.) TCC 2013. LNCS, vol.\u00a07785, pp. 621\u2013641. Springer, Heidelberg (2013)"},{"key":"34_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-17955-6_25","volume-title":"Information Security Applications","author":"R. Dowsley","year":"2011","unstructured":"Dowsley, R., van de Graaf, J., Marques, D., Nascimento, A.C.A.: A Two-Party Protocol with Trusted Initializer for Computing the Inner Product. In: Chung, Y., Yung, M. (eds.) WISA 2010. LNCS, vol.\u00a06513, pp. 337\u2013350. Springer, Heidelberg (2011)"},{"issue":"6","key":"34_CR16","doi-asserted-by":"publisher","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. Commun. ACM\u00a028(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"34_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/3-540-46035-7_32","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"M. Fitzi","year":"2002","unstructured":"Fitzi, M., Gisin, N., Maurer, U.M., von Rotz, O.: Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 482\u2013501. Springer, Heidelberg (2002)"},{"key":"34_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/978-3-540-28628-8_34","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"M. Fitzi","year":"2004","unstructured":"Fitzi, M., Wolf, S., Wullschleger, J.: Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 562\u2013578. Springer, Heidelberg (2004)"},{"key":"34_CR19","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"34_CR20","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: STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"34_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-28914-9_2","volume-title":"Theory of Cryptography","author":"Y. Ishai","year":"2012","unstructured":"Ishai, Y., Ostrovsky, R., Seyalioglu, H.: Identifying Cheaters without an Honest Majority. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 21\u201338. Springer, Heidelberg (2012)"},{"key":"34_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y. Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding Cryptography on Oblivious Transfer \u2013 Efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 572\u2013591. Springer, Heidelberg (2008)"},{"key":"34_CR23","doi-asserted-by":"crossref","unstructured":"Kaplan, E., Naor, M., Reingold, O.: Derandomized constructions of k-wise (almost) independent permutations, vol.\u00a055, pp. 113\u2013133 (2009)","DOI":"10.1007\/s00453-008-9267-y"},{"key":"34_CR24","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: STOC, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"key":"34_CR25","doi-asserted-by":"crossref","unstructured":"Kuperberg, G., Lovett, S., Peled, R.: Probabilistic existence of rigid combinatorial structures, pp. 1091\u20131106 (2012)","DOI":"10.1145\/2213977.2214075"},{"key":"34_CR26","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SODA, pp. 448\u2013457 (2001)"},{"key":"34_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-642-32009-5_40","volume-title":"CRYPTO 2012","author":"J.B. Nielsen","year":"2012","unstructured":"Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A New Approach to Practical Active-Secure Two-Party Computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 681\u2013700. Springer, Heidelberg (2012)"},{"key":"34_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-642-10628-6_26","volume-title":"Progress in Cryptology - INDOCRYPT 2009","author":"A. Patra","year":"2009","unstructured":"Patra, A., Choudhary, A., Rangan, C.P.: Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience. In: Roy, B., Sendrier, N. (eds.) INDOCRYPT 2009. LNCS, vol.\u00a05922, pp. 398\u2013417. Springer, Heidelberg (2009)"},{"key":"34_CR29","unstructured":"Pfitzmann, B., Waidner, M.: Information-theoretic pseudosignatures and byzantine agreement for t \u2265 n\/3. IBM Research Report RZ 2882 (#90830) (1996)"},{"key":"34_CR30","unstructured":"Rabin, M.: How to exchange secrets by oblivious transfer. Technical Report TR-81. Harvard Aiken Computation Laboratory (1981)"},{"key":"34_CR31","unstructured":"Rivest, R.: Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer. Manuscript (1999)"},{"key":"34_CR32","unstructured":"Tonicelli, R., Dowsley, R., Hanaoka, G., Imai, H., M\u00fcller-Quade, J., Otsuka, A., Nascimento, A.C.A.: Information-theoretically secure oblivious polynomial evaluation in the commodity-based model. IACR Cryptology ePrint Archive, 2009: 270 (2009)"},{"key":"34_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/978-3-642-14623-7_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"S. Winkler","year":"2010","unstructured":"Winkler, S., Wullschleger, J.: On the Efficiency of Classical and Quantum Oblivious Transfer Reductions. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 707\u2013723. Springer, Heidelberg (2010)"},{"key":"34_CR34","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"34_CR35","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Protocols for secure computations (extended abstract). In: FOCS, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"}],"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-36594-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T23:22:46Z","timestamp":1557530566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36594-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642365935","9783642365942"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36594-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}