{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T21:16:32Z","timestamp":1766351792644,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642019562"},{"type":"electronic","value":"9783642019579"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01957-9_8","type":"book-chapter","created":{"date-parts":[[2009,5,15]],"date-time":"2009-05-15T11:24:25Z","timestamp":1242386665000},"page":"125-142","source":"Crossref","is-referenced-by-count":99,"title":["Efficient Robust Private Set Intersection"],"prefix":"10.1007","author":[{"given":"Dana","family":"Dachman-Soled","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tal","family":"Malkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mariana","family":"Raykova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","first-page":"86","volume-title":"SIGMOD 2003: Proceedings of the 2003 ACM SIGMOD international conference on Management of data","author":"R. Agrawal","year":"2003","unstructured":"Agrawal, R., Evfimievski, A., Srikant, R.: Information sharing across private databases. In: SIGMOD 2003: Proceedings of the 2003 ACM SIGMOD international conference on Management of data, pp. 86\u201397. ACM, New York (2003)"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1090\/S0025-5718-1970-0276200-X","volume":"24","author":"E. Berlekamp","year":"1970","unstructured":"Berlekamp, E.: Factoring polynomials over large finite fields. Mathematics of Computation\u00a024, 713\u2013735 (1970)","journal-title":"Mathematics of Computation"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"2001","DOI":"10.1016\/S0166-218X(00)00342-5","volume":"111","author":"F. Boudot","year":"2001","unstructured":"Boudot, F., Schoenmakers, B., Traor\u00e9, J.: A fair and efficient solution to the socialist millionaires problem. Discrete Applied Mathematics\u00a0111, 2001 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Zaverucha, G.: Private intersection of certified sets. In: Proceedings of Financial Cryptography 2009 (2009)","DOI":"10.1007\/978-3-642-03549-4_7"},{"key":"8_CR5","first-page":"2000","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology\u00a013, 2000 (2000)","journal-title":"Journal of Cryptology"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-540-78524-8_24","volume-title":"Theory of Cryptography","author":"S. Choi","year":"2008","unstructured":"Choi, S., Dachman-Soled, D., Malkin, T., Wee, H.: Black-box construction of a non-malleable encryption scheme from any semantically secure one. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 427\u2013444. Springer, Heidelberg (2008)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T. El Gamal","year":"1985","unstructured":"El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 10\u201318. Springer, Heidelberg (1985)"},{"key":"8_CR8","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. Communications of the ACM\u00a039, 77\u201385 (1996)","journal-title":"Communications of the ACM"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M.J. Freedman","year":"2004","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 1\u201319. Springer, Heidelberg (2004)"},{"issue":"1","key":"8_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0400000001","volume":"1","author":"O. Goldreich","year":"2005","unstructured":"Goldreich, O.: Foundations of cryptography: a primer. Found. Trends Theor. Comput. Sci.\u00a01(1), 1\u2013116 (2005)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"8_CR11","first-page":"365","volume-title":"STOC 1982: Proceedings of the fourteenth annual ACM symposium on Theory of computing","author":"G. Shafi","year":"1982","unstructured":"Shafi, G., Silvio, M.: Probabilistic encryption & how to play mental poker keeping secret all partial information. In: STOC 1982: Proceedings of the fourteenth annual ACM symposium on Theory of computing, pp. 365\u2013377. ACM, New York (1982)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-78524-8_10","volume-title":"Theory of Cryptography","author":"C. Hazay","year":"2008","unstructured":"Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 155\u2013175. Springer, Heidelberg (2008)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/3-540-48184-2_4","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"R. Impagliazzo","year":"1988","unstructured":"Impagliazzo, R., Yung, M.: Direct minimum knowledge computations. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 40\u201351. Springer, Heidelberg (1988)"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/3-540-68697-5_15","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"M. Jakobsson","year":"1996","unstructured":"Jakobsson, M., Yung, M.: Proving without knowing: On oblivious, agnostic and blindfolded provers. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 186\u2013200. Springer, Heidelberg (1996)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Liu, X.: Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection. In: TCC, pp. 577\u2013594 (2009)","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"8_CR16","series-title":"Chapman & Hall\/Crc Cryptography and Network Security Series","doi-asserted-by":"crossref","DOI":"10.1201\/9781420010756","volume-title":"Introduction to Modern Cryptography","author":"J. Katz","year":"2007","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman & Hall\/Crc Cryptography and Network Security Series. Chapman & Hall\/CRC, Boca Raton (2007)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/11507840_13","volume-title":"Financial Cryptography and Data Security","author":"A. Kiayias","year":"2005","unstructured":"Kiayias, A., Mitrofanova, A.: Testing disjointness of private datasets. In: Patrick, A.S., Yung, M. (eds.) FC 2005. LNCS, vol.\u00a03570, pp. 109\u2013124. Springer, Heidelberg (2005)"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11535218_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"L. Kissner","year":"2005","unstructured":"Kissner, L., Song, D.X.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 241\u2013257. Springer, Heidelberg (2005)"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. Journal of Cryptology, 36\u201354 (2000)","DOI":"10.1007\/3-540-44598-6_3"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-72540-4_4","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"Y. Lindell","year":"2007","unstructured":"Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 52\u201378. Springer, Heidelberg (2007)"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/301250.301312","volume-title":"STOC 1999: Proceedings of the thirty-first annual ACM symposium on Theory of computing","author":"M. Naor","year":"1999","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: STOC 1999: Proceedings of the thirty-first annual ACM symposium on Theory of computing, pp. 245\u2013254. ACM Press, New York (1999)"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"issue":"11","key":"8_CR23","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Protocols for secure computations. In: FOCS, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01957-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:14:20Z","timestamp":1558268060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01957-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642019562","9783642019579"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01957-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}