{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:26:56Z","timestamp":1778128016754,"version":"3.51.4"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T00:00:00Z","timestamp":1298937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s00145-011-9098-x","type":"journal-article","created":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T21:04:57Z","timestamp":1299013497000},"page":"383-433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":48,"title":["Efficient Set Operations in the Presence of Malicious Adversaries"],"prefix":"10.1007","volume":"25","author":[{"given":"Carmit","family":"Hazay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kobbi","family":"Nissim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,3,1]]},"reference":[{"key":"9098_CR1","series-title":"LNCS","first-page":"40","volume-title":"EUROCRYPT\u201904","author":"G. Aggarwal","year":"2004","unstructured":"G. Aggarwal, N. Mishra, B. Pinkas, Secure computation of the kth-ranked element, in EUROCRYPT\u201904. LNCS, vol.\u00a03027 (Springer, Berlin, 2004), pp.\u00a040\u201355"},{"key":"9098_CR2","series-title":"LNCS","first-page":"137","volume-title":"4th TCC","author":"Y. Aumann","year":"2007","unstructured":"Y. Aumann, Y. Lindell, Security against covert adversaries: efficient protocols for realistic adversaries, in 4th TCC. LNCS, vol.\u00a04392 (Springer, Berlin, 2007), pp.\u00a0137\u2013156"},{"issue":"1","key":"9098_CR3","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y. Azar","year":"1999","unstructured":"Y. Azar, A.Z. Broder, A.R. Karlin, E. Upfal, Balanced allocations. SIAM J. Comput.\n                  29(1), 180\u2013200 (1999)","journal-title":"SIAM J. Comput."},{"key":"9098_CR4","first-page":"1","volume-title":"20th STOC","author":"M. Ben-Or","year":"1988","unstructured":"M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non cryptographic fault tolerant distributed computations, in 20th STOC (1988), pp.\u00a01\u201310"},{"key":"9098_CR5","series-title":"LNCS","first-page":"325","volume-title":"2nd TCC","author":"D. Boneh","year":"2005","unstructured":"D. Boneh, E. Goh, K. Nissim, Evaluating 2-DNF formulas on ciphertexts, in 2nd TCC. LNCS, vol.\u00a03378 (Springer, Berlin, 2005), pp. 325\u2013341"},{"issue":"1","key":"9098_CR6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.4304\/jsw.3.1.9-17","volume":"3","author":"S. B\u00f6ttcher","year":"2008","unstructured":"S. B\u00f6ttcher, S. Obermeier, Secure set union and bag union computation for guaranteeing anonymity of distrustful participants. J. Softw.\n                  3(1), 9\u201317 (2008)","journal-title":"J. Softw."},{"issue":"1","key":"9098_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"R. Canetti, Security and composition of multiparty cryptographic protocols. J. Cryptol.\n                  13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"9098_CR8","first-page":"128","volume-title":"Financial Crypto","author":"J. Camenisch","year":"2009","unstructured":"J. Camenisch, G.M. Zaverucha, Private intersection of certified sets, in Financial Crypto (2009), pp.\u00a0128\u2013127"},{"key":"9098_CR9","first-page":"136","volume-title":"42nd FOCS","author":"R. Canetti","year":"2001","unstructured":"R. Canetti, Universally composable security: A new paradigm for cryptographic protocols, in 42nd FOCS (2001), pp.\u00a0136\u2013145"},{"key":"9098_CR10","first-page":"136","volume-title":"44th FOCS","author":"R. Canetti","year":"2003","unstructured":"R. Canetti, E. Kushilevitz, Y. Lindell, On the limitations of universal composable two-party computation without set-up assumptions, in 44th FOCS (2003), pp.\u00a0136\u2013145"},{"key":"9098_CR11","series-title":"LNCS","first-page":"89","volume-title":"CRYPTO\u201992","author":"D. Chaum","year":"1992","unstructured":"D. Chaum, T.P. Pedersen, Wallet databases with observers, in CRYPTO\u201992. LNCS, vol.\u00a0740 (Springer, Berlin, 1992), pp.\u00a089\u2013105"},{"key":"9098_CR12","first-page":"11","volume-title":"20th STOC","author":"D. Chaum","year":"1988","unstructured":"D. Chaum, C. Cr\u00e9peau, I. Damg\u00e5rd, Multiparty unconditionally secure protocols, in 20th STOC (1988), pp.\u00a011\u201319"},{"key":"9098_CR13","series-title":"LNCS","first-page":"174","volume-title":"CRYPTO\u201994","author":"R. Cramer","year":"1994","unstructured":"R. Cramer, I. Damg\u00e5rd, B. Schoenmakers, Proofs of partial knowledge and simplified design of witness hiding protocols, in CRYPTO\u201994. LNCS, vol.\u00a0839 (Springer, Berlin, 1994), pp.\u00a0174\u2013187"},{"key":"9098_CR14","series-title":"LNCS","first-page":"125","volume-title":"ANCS","author":"D. Dachman-Soled","year":"2009","unstructured":"D. Dachman-Soled, T. Malkin, M. Raykova, M. Yung, Efficient robust private set intersection, in ANCS. LNCS, vol.\u00a05479 (Springer, Berlin, 2009), pp.\u00a0125\u2013142"},{"key":"9098_CR15","series-title":"LNCS","first-page":"418","volume-title":"EUROCRYPT\u201900","author":"I. Damg\u00e5rd","year":"2000","unstructured":"I. Damg\u00e5rd, Efficient concurrent zero-knowledge in the auxiliary string model, in EUROCRYPT\u201900. LNCS, vol.\u00a01807 (Springer, Berlin, 2000), pp.\u00a0418\u2013430"},{"key":"9098_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I. Damg\u00e5rd","year":"2001","unstructured":"I. Damg\u00e5rd, M. Jurik, A generalisation, a simplification and some applications of Paillier\u2019s probabilistic public-key system, in Public Key Cryptography. LNCS, vol.\u00a01992 (Springer, Berlin, 2001), pp.\u00a0119\u2013136"},{"key":"9098_CR17","series-title":"LNCS","first-page":"3","volume-title":"CRYPTO\u201902","author":"I. Damg\u00e5rd","year":"2002","unstructured":"I. Damg\u00e5rd, J.B. Nielsen, Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor, in CRYPTO\u201902. LNCS, vol.\u00a02442 (Springer, Berlin, 2002), pp.\u00a03\u201342"},{"key":"9098_CR18","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I. Damg\u00e5rd","year":"2001","unstructured":"I. Damg\u00e5rd, M. Jurik, J.B. Nielsen, A generalization of Paillier\u2019s public-key system with applications to electronic voting, in Public Key Cryptography (2001), pp.\u00a0119\u2013136"},{"key":"9098_CR19","series-title":"LNCS","first-page":"10","volume-title":"CRYPTO\u201984","author":"T. ElGamal","year":"1984","unstructured":"T. ElGamal, A public-key cryptosystem and a signature scheme based on discrete logarithms, in CRYPTO\u201984. LNCS, vol.\u00a0196 (Springer, Berlin, 1984), pp.\u00a010\u201318"},{"issue":"3","key":"9098_CR20","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1145\/1159892.1159900","volume":"2","author":"J. Feigenbaum","year":"2006","unstructured":"J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M.J. Strauss, R.N. Wright, Secure multiparty computation of approximations. ACM Trans. Algorithms\n                  2(3), 435\u2013472 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"9098_CR21","first-page":"573","volume-title":"Asiacrypt","author":"P. Fouque","year":"2000","unstructured":"P. Fouque, D. Pointcheval, Threshold cryptosystems secure against chosen-ciphertext attacks, in Asiacrypt (2000), pp.\u00a0573\u2013584"},{"key":"9098_CR22","first-page":"90","volume-title":"Financial Crypto","author":"P. Fouque","year":"2009","unstructured":"P. Fouque, G. Poupard, J. Stern, Sharing decryption in the context of voting of lotteries, in Financial Crypto (2009), pp.\u00a090\u2013104"},{"key":"9098_CR23","series-title":"LNCS","first-page":"303","volume-title":"2nd TCC","author":"M.J. Freedman","year":"2005","unstructured":"M.J. Freedman, Y. Ishai, B. Pinkas, O. Reingold, Keyword search and oblivious pseudorandom functions, in 2nd TCC. LNCS, vol.\u00a03378 (Springer, Berlin, 2005), pp.\u00a0303\u2013324"},{"key":"9098_CR24","series-title":"LNCS","first-page":"1","volume-title":"EUROCRYPT\u201904","author":"M. Freedman","year":"2004","unstructured":"M. Freedman, K. Nissim, B. Pinkas, Efficient private matching and set-intersection, in EUROCRYPT\u201904. LNCS, vol.\u00a03027 (Springer, Berlin, 2004), pp.\u00a01\u201319"},{"key":"9098_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography: Volume 1\u2014Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"O. Goldreich, Foundations of Cryptography: Volume 1\u2014Basic Tools (Cambridge University Press, Cambridge, 2001)"},{"key":"9098_CR26","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Volume 2\u2014Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"O. Goldreich, Foundations of Cryptography: Volume 2\u2014Basic Applications (Cambridge University Press, Cambridge, 2004)"},{"issue":"3","key":"9098_CR27","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O. Goldreich","year":"1996","unstructured":"O. Goldreich, A. Kahan, How to construct constant-round zero-knowledge proof systems for NP. J. Cryptol.\n                  9(3), 167\u2013190 (1996)","journal-title":"J. Cryptol."},{"key":"9098_CR28","first-page":"218","volume-title":"19th STOC","author":"O. Goldreich","year":"1987","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game, in 19th STOC (1987), pp.\u00a0218\u2013229"},{"issue":"2","key":"9098_CR29","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser, S. Micali, Probabilistic encryption. J. Comput. Syst. Sci.\n                  28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"9098_CR30","series-title":"LNCS","first-page":"155","volume-title":"5th TCC","author":"C. Hazay","year":"2008","unstructured":"C. Hazay, Y. Lindell, Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries, in 5th TCC. LNCS, vol.\u00a04948 (Springer, Berlin, 2008), pp.\u00a0155\u2013175"},{"key":"9098_CR31","unstructured":"S. Jarecki, Personal Communication"},{"key":"9098_CR32","series-title":"LNCS","first-page":"577","volume-title":"6th TCC","author":"S. Jarecki","year":"2009","unstructured":"S. Jarecki, X. Liu, Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection, in 6th TCC. LNCS, vol.\u00a05444 (Springer, Berlin, 2009), pp.\u00a0577\u2013594"},{"key":"9098_CR33","series-title":"LNCS","first-page":"291","volume-title":"5th TCC","author":"E. Kiltz","year":"2007","unstructured":"E. Kiltz, P. Mohassel, E. Weinreb, M.K. Franklin, Secure linear algebra using linearly recurrent sequences, in 5th TCC. LNCS, vol.\u00a04392 (Springer, Berlin, 2007), pp.\u00a0291\u2013310"},{"key":"9098_CR34","series-title":"LNCS","first-page":"241","volume-title":"CRYPTO\u201905","author":"L. Kissner","year":"2005","unstructured":"L. Kissner, D.X. Song, Privacy-preserving set operations, in CRYPTO\u201905. LNCS, vol.\u00a03621 (Springer, Berlin, 2005), pp.\u00a0241\u2013257. See technical report CMU-CS-05-113 for the full version"},{"issue":"3","key":"9098_CR35","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00145-001-0019-2","volume":"15","author":"Y. Lindell","year":"2002","unstructured":"Y. Lindell, B. Pinkas, Privacy preserving data mining. J. Cryptol.\n                  15(3), 177\u2013206 (2002)","journal-title":"J. Cryptol."},{"key":"9098_CR36","series-title":"LNCS","first-page":"481","volume-title":"CRYPTO\u201908","author":"P. Mohassel","year":"2009","unstructured":"P. Mohassel, E. Weinreb, Efficient secure linear algebra in the presence of covert or computationally unbounded adversaries, in CRYPTO\u201908. LNCS, vol.\u00a05157 (Springer, Berlin, 2009), pp.\u00a0481\u2013496"},{"key":"9098_CR37","first-page":"590","volume-title":"33th STOC","author":"M. Naor","year":"2001","unstructured":"M. Naor, K. Nissim, Communication preserving protocols for secure function evaluation, in 33th STOC (2001), pp.\u00a0590\u2013599"},{"key":"9098_CR38","first-page":"231","volume-title":"38th FOCS","author":"M. Naor","year":"1997","unstructured":"M. Naor, O. Reingold, Number-theoretic constructions of efficient pseudo-random functions, in 38th FOCS (1997), pp.\u00a0231\u2013262"},{"key":"9098_CR39","first-page":"522","volume-title":"4th TCC","author":"K. Nissim","year":"2006","unstructured":"K. Nissim, E. Weinreb, Communication efficient secure linear algebra, in 4th TCC (2006), pp.\u00a0522\u2013541"},{"key":"9098_CR40","series-title":"LNCS","first-page":"31","volume-title":"CRYPTO\u201992","author":"T. Okamoto","year":"1992","unstructured":"T. Okamoto, Provably secure and practical identification schemes and corresponding signature schemes, in CRYPTO\u201992. LNCS, vol.\u00a0740 (Springer, Berlin, 1992), pp.\u00a031\u201353"},{"key":"9098_CR41","series-title":"LNCS","first-page":"223","volume-title":"EUROCRYPT\u201999","author":"P. Paillier","year":"1999","unstructured":"P. Paillier, Public-key cryptosystems based on composite degree residuosity classes, in EUROCRYPT\u201999. LNCS, vol.\u00a01592 (Springer, Berlin, 1999), pp.\u00a0223\u2013238"},{"key":"9098_CR42","series-title":"LNCS","first-page":"129","volume-title":"CRYPTO\u201991","author":"T.P. Pedersen","year":"1991","unstructured":"T.P. Pedersen, Non-interactive and information-theoretical secure verifiable secret sharing, in CRYPTO\u201991. LNCS, vol.\u00a0576 (Springer, Berlin, 1991), pp.\u00a0129\u2013140"},{"key":"9098_CR43","series-title":"LNCS","first-page":"554","volume-title":"CRYPTO\u201908","author":"C. Peikert","year":"2008","unstructured":"C. Peikert, V. Vaikuntanathan, B. Waters, A framework for efficient and composable oblivious transfer, in CRYPTO\u201908. LNCS, vol.\u00a05157 (Springer, Berlin, 2008), pp.\u00a0554\u2013571"},{"key":"9098_CR44","series-title":"LNCS","first-page":"239","volume-title":"CRYPTO\u201989","author":"C.P. Schnorr","year":"1989","unstructured":"C.P. Schnorr, Efficient identification and signatures for smart cards, in CRYPTO\u201989. LNCS, vol.\u00a0435 (Springer, Berlin, 1989), pp.\u00a0239\u2013252"},{"issue":"4","key":"9098_CR45","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1145\/792538.792546","volume":"50","author":"B. Vocking","year":"2003","unstructured":"B. Vocking, How asymmetry helps load balancing. J. ACM\n                  50(4), 568\u2013589 (2003)","journal-title":"J. ACM"},{"key":"9098_CR46","first-page":"160","volume-title":"23th FOCS","author":"A.C. Yao","year":"1982","unstructured":"A.C. Yao, Protocols for secure computations, in 23th FOCS (1982), pp.\u00a0160\u2013164"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-011-9098-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-011-9098-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-011-9098-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-011-9098-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:05:23Z","timestamp":1586333123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-011-9098-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,1]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["9098"],"URL":"https:\/\/doi.org\/10.1007\/s00145-011-9098-x","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,1]]},"assertion":[{"value":"10 May 2010","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2011","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}