{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:12Z","timestamp":1772283552218,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319598697","type":"print"},{"value":"9783319598703","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-59870-3_15","type":"book-chapter","created":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T02:14:17Z","timestamp":1496110457000},"page":"261-278","source":"Crossref","is-referenced-by-count":39,"title":["An Efficient Toolkit for Computing Private Set\u00a0Operations"],"prefix":"10.1007","author":[{"given":"Alex","family":"Davidson","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Cid","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Blanton, M., Aguiar, E.: Private and oblivious set and multiset operations. In: Youm, H.Y., Won, Y. (eds.) ASIACCS 2012, pp. 40\u201341. ACM Press, May 2012","DOI":"10.1145\/2414456.2414479"},{"issue":"7","key":"15_CR2","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"issue":"4","key":"15_CR3","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.ipl.2008.05.018","volume":"108","author":"P Bose","year":"2008","unstructured":"Bose, P., Guo, H., Kranakis, E., Maheshwari, A., Morin, P., Morrison, J., Smid, M.H.M., Tang, Y.: On the false-positive rate of bloom filters. Inf. Process. Lett. 108(4), 210\u2013213 (2008)","journal-title":"Inf. Process. Lett."},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/11593447_13","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"J Brickell","year":"2005","unstructured":"Brickell, J., Shmatikov, V.: Privacy-preserving graph algorithms in the semi-honest model. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 236\u2013252. Springer, Heidelberg (2005). doi:\n10.1007\/11593447_13"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-35404-5_17","volume-title":"Cryptology and Network Security","author":"E Cristofaro De","year":"2012","unstructured":"De Cristofaro, E., Gasti, P., Tsudik, G.: Fast and private computation of cardinality of set intersection and union. In: Pieprzyk, J., Sadeghi, A.-R., Manulis, M. (eds.) CANS 2012. LNCS, vol. 7712, pp. 218\u2013231. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-35404-5_17"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Davidson, A., Fenn, G., Cid, C.: A model for secure and mutually beneficial software vulnerability sharing. In: Proceedings of the 2016 ACM on Workshop on Information Sharing and Collaborative Security (WISCS 2016), pp. 3\u201314, New York, NY, USA. ACM (2016)","DOI":"10.1145\/2994539.2994547"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-14577-3_13","volume-title":"Financial Cryptography and Data Security","author":"E Cristofaro De","year":"2010","unstructured":"De Cristofaro, E., Tsudik, G.: Practical private set intersection protocols with linear complexity. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 143\u2013159. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-14577-3_13"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-319-26059-4_18","volume-title":"Provable Security","author":"SK Debnath","year":"2015","unstructured":"Debnath, S.K., Dutta, R.: Efficient private set intersection cardinality in the presence of malicious adversaries. In: Au, M.-H., Miyaji, A. (eds.) ProvSec 2015. LNCS, vol. 9451, pp. 326\u2013339. Springer, Cham (2015). doi:\n10.1007\/978-3-319-26059-4_18"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-319-23318-5_12","volume-title":"Information Security","author":"SK Debnath","year":"2015","unstructured":"Debnath, S.K., Dutta, R.: Secure and efficient private set intersection cardinality using bloom filter. In: Lopez, J., Mitchell, C.J. (eds.) ISC 2015. LNCS, vol. 9290, pp. 209\u2013226. Springer, Cham (2015). doi:\n10.1007\/978-3-319-23318-5_12"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Dong, C., Chen, L., Wen, Z.: When private set intersection meets big data: an efficient and scalable protocol. In: Sadeghi, A.-R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, pp. 789\u2013800. ACM Press (2013)","DOI":"10.1145\/2508859.2516701"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-319-19962-7_24","volume-title":"Information Security and Privacy","author":"R Egert","year":"2015","unstructured":"Egert, R., Fischlin, M., Gens, D., Jacob, S., Senker, M., Tillmanns, J.: Privately computing set-union and set-intersection cardinality via bloom filters. In: Foo, E., Stebila, D. (eds.) ACISP 2015. LNCS, vol. 9144, pp. 413\u2013430. Springer, Cham (2015). doi:\n10.1007\/978-3-319-19962-7_24"},{"key":"15_CR12","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":"MJ 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. 3027, pp. 1\u201319. Springer, Heidelberg (2004). doi:\n10.1007\/978-3-540-24676-3_1"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-540-72738-5_16","volume-title":"Applied Cryptography and Network Security","author":"K Frikken","year":"2007","unstructured":"Frikken, K.: Privacy-preserving set union. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol. 4521, pp. 237\u2013252. Springer, Heidelberg (2007). doi:\n10.1007\/978-3-540-72738-5_16"},{"issue":"3","key":"15_CR14","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s00145-011-9098-x","volume":"25","author":"C Hazay","year":"2012","unstructured":"Hazay, C., Nissim, K.: Efficient set operations in the presence of malicious adversaries. J. Cryptol. 25(3), 383\u2013433 (2012)","journal-title":"J. Cryptol."},{"issue":"12","key":"15_CR15","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1093\/bioinformatics\/btu294","volume":"30","author":"F Hormozdiari","year":"2014","unstructured":"Hormozdiari, F., Joo, J.W.J., Wadia, A., Guan, F., Ostrovsky, R., Sahai, A., Eskin, E.: Privacy preserving protocol for detecting genetic relatives using rare variants. Bioinformatics 30(12), 204\u2013211 (2014)","journal-title":"Bioinformatics"},{"key":"15_CR16","unstructured":"Huang, Y., Evans, D., Katz, J.: Private set intersection: are garbled circuits better than custom protocols? In: NDSS 2012. The Internet Society, February 2012"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Kerschbaum, F.: Outsourced private set intersection using homomorphic encryption. In: Youm, H.Y., Won, Y. (eds.) ASIACCS 2012, pp. 85\u201386. ACM Press, May 2012","DOI":"10.1145\/2414456.2414506"},{"key":"15_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.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241\u2013257. Springer, Heidelberg (2005). doi:\n10.1007\/11535218_15"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N.: Efficient batched oblivious PRF with applications to private set intersection. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 818\u2013829. ACM Press (2016)","DOI":"10.1145\/2976749.2978381"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Meadows, C.A.: A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. In: Proceedings of the 1986 IEEE Symposium on Security and Privacy, Oakland, California, USA, April 7\u20139, 1986, pp. 134\u2013137 (1986)","DOI":"10.1109\/SP.1986.10022"},{"key":"15_CR21","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 \u2014 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. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). doi:\n10.1007\/3-540-48910-X_16"},{"key":"15_CR22","unstructured":"Pinkas, B., Schneider, T., Segev, G., Zohner, M.: Phasing: private set intersection using permutation-based hashing. In: USENIX Security Symposium, pp. 515\u2013530. USENIX Association (2015)"},{"key":"15_CR23","unstructured":"Pinkas, B., Schneider, T., Zohner, M.: Faster private set intersection based on OT extension. In: Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, USA, 20\u201322 August, 2014, pp. 797\u2013812 (2014)"},{"key":"15_CR24","unstructured":"Rindal, P., Rosulek, M.: Improved private set intersection against malicious adversaries. Cryptology ePrint Archive, Report 2016\/746 (2016). \nhttp:\/\/eprint.iacr.org\/2016\/746"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-642-30057-8_24","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"JH Seo","year":"2012","unstructured":"Seo, J.H., Cheon, J.H., Katz, J.: Constant-round multi-party private set union using reversed laurent series. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 398\u2013412. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-30057-8_24"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59870-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T02:19:54Z","timestamp":1496110794000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59870-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319598697","9783319598703"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59870-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}