{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:02:40Z","timestamp":1772906560651,"version":"3.50.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319446172","type":"print"},{"value":"9783319446189","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-44618-9_24","type":"book-chapter","created":{"date-parts":[[2016,8,9]],"date-time":"2016-08-09T21:10:01Z","timestamp":1470777001000},"page":"449-467","source":"Crossref","is-referenced-by-count":9,"title":["Bounded Size-Hiding Private Set Intersection"],"prefix":"10.1007","author":[{"given":"Tatiana","family":"Bradley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sky","family":"Faber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gene","family":"Tsudik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,11]]},"reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/978-3-642-19379-8_10","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"G Ateniese","year":"2011","unstructured":"Ateniese, G., De Cristofaro, E., Tsudik, G.: (If) size matters: size-hiding private set intersection. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 156\u2013173. Springer, Heidelberg (2011)"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: ACM Conference on Computer and Communications Security, pp. 62\u201373. ACM (1993)","DOI":"10.1145\/168588.168596"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/978-3-540-24676-3_4","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56\u201373. Springer, Heidelberg (2004)"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506\u2013522. Springer, Heidelberg (2004)"},{"key":"24_CR5","unstructured":"Bradley, T., Faber, S., Tsudik, G.: Bounded size-hiding private set intersection. IACR Cryptology ePrint Archive, Report 2016\/657 (2016). http:\/\/eprint.iacr.org\/2016\/657"},{"issue":"1","key":"24_CR6","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0167-4048(99)80008-X","volume":"18","author":"WJ Caelli","year":"1999","unstructured":"Caelli, W.J., Dawson, E.P., Rea, S.A.: Pki, elliptic curve cryptography, and digital signatures. Comput. Secur. 18(1), 47\u201366 (1999)","journal-title":"Comput. Secur."},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1007\/978-3-662-46803-6_18","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"M Chase","year":"2015","unstructured":"Chase, M., Ostrovsky, R., Visconti, I.: Executable proofs, input-size hiding secure computation and a new ideal world. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 532\u2013560. Springer, Heidelberg (2015)"},{"issue":"4","key":"24_CR8","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1504\/IJACT.2012.048080","volume":"2","author":"D Dachman-Soled","year":"2012","unstructured":"Dachman-Soled, D., Malkin, T., Raykova, M., Yung, M.: Efficient robust private set intersection. Int. J. Appl. Cryptogr. 2(4), 289\u2013303 (2012)","journal-title":"Int. J. Appl. Cryptogr."},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/978-3-642-31410-0_23","volume-title":"Progress in Cryptology - AFRICACRYPT 2012","author":"P D\u2019Arco","year":"2012","unstructured":"D\u2019Arco, P., Gonz\u00e1lez Vasco, M.I., P\u00e9rez del Pozo, A.L., Soriente, C.: Size-hiding in private set intersection: existential results and constructions. In: Mitrokotsa, A., Vaudenay, S. (eds.) AFRICACRYPT 2012. LNCS, vol. 7374, pp. 378\u2013394. Springer, Heidelberg (2012)"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/978-3-642-31410-0_23","volume-title":"Progress in Cryptology - AFRICACRYPT 2012","author":"P D\u2019Arco","year":"2012","unstructured":"D\u2019Arco, P., Gonz\u00e1lez Vasco, M.I., P\u00e9rez del Pozo, A.L., Soriente, C.: Size-hiding in private set intersection: existential results and constructions. In: Mitrokotsa, A., Vaudenay, S. (eds.) AFRICACRYPT 2012. LNCS, vol. 7374, pp. 378\u2013394. Springer, Heidelberg (2012)"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"De Cristofaro, E., Faber, S., Gasti, P., Tsudik, G.: Genodroid: are privacy-preserving genomic tests ready for prime time? In: WPES, pp. 97\u2013108. ACM (2012)","DOI":"10.1145\/2381966.2381980"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"De Cristofaro, E., Faber, S., Tsudik, G.: Secure genomic testing with size- and position-hiding private substring matching. In: WPES, pp. 107\u2013118. ACM (2013)","DOI":"10.1145\/2517840.2517849"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","first-page":"218","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)"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/978-3-642-17373-8_13","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"E Cristofaro De","year":"2010","unstructured":"De Cristofaro, E., Kim, J., Tsudik, G.: Linear-complexity private set intersection protocols secure in malicious model. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 213\u2013231. Springer, Heidelberg (2010)"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Dong, C., Chen, L., Wen, Z.: When private set intersection meets big data: an efficient and scalable protocol. In: Proceedings of the ACM SIGSAC Conference on Computer & Communications Security, pp. 789\u2013800. ACM (2013)","DOI":"10.1145\/2508859.2516701"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Faber, S., Petrlic, R., Tsudik, G.: Unlinked: private proximity-based off-line OSN interaction. In: Proceedings of the 14th ACM Workshop on Privacy in the Electronic Society, pp. 121\u2013131. ACM (2015)","DOI":"10.1145\/2808138.2808149"},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"24_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"The Foundations of Cryptography - Volume 2, Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: The Foundations of Cryptography - Volume 2, Basic Applications. Cambridge University Press, Cambridge (2004)"},{"issue":"2","key":"24_CR20","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Goyal, V., Ostrovsky, R., Scafuro, A., Visconti, I.: Black-box non-black-box zero knowledge. In: STOC, pp. 515\u2013524. ACM (2014)","DOI":"10.1145\/2591796.2591879"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Hahn, C., Hur, J.: Scalable and secure private set intersection for big data. In: International Conference on Big Data and Smart Computing, BigComp 2016, Hong Kong, China, 18\u201320 January 2016, pp. 285\u2013288 (2016)","DOI":"10.1109\/BIGCOMP.2016.7425929"},{"key":"24_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/978-3-662-46497-7_4","volume-title":"Theory of Cryptography","author":"C Hazay","year":"2015","unstructured":"Hazay, C.: Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015, Part II. LNCS, vol. 9015, pp. 90\u2013120. Springer, Heidelberg (2015)"},{"key":"24_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 4948, pp. 155\u2013175. Springer, Heidelberg (2008)"},{"key":"24_CR25","unstructured":"Huang, Y., Evans, D., Katz, J.: Private set intersection: are garbled circuits better than custom protocols? In: NDSS (2012)"},{"key":"24_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/978-3-540-70936-7_31","volume-title":"Theory of Cryptography","author":"Y Ishai","year":"2007","unstructured":"Ishai, Y., Paskin, A.: Evaluating branching programs on encrypted data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 575\u2013594. Springer, Heidelberg (2007)"},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"Kerschbaum, F.: Outsourced private set intersection using homomorphic encryption. In: Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security, pp. 85\u201386. ACM (2012)","DOI":"10.1145\/2414456.2414506"},{"key":"24_CR28","doi-asserted-by":"crossref","unstructured":"Kissner, L., Song, D.: Private and threshold set-intersection. Technical report, DTIC Document (2004)","DOI":"10.21236\/ADA461119"},{"key":"24_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/978-3-642-42045-0_22","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"Y Lindell","year":"2013","unstructured":"Lindell, Y., Nissim, K., Orlandi, C.: Hiding the input-size in secure two-party computation. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part II. LNCS, vol. 8270, pp. 421\u2013440. Springer, Heidelberg (2013)"},{"key":"24_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/978-3-642-42045-0_22","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"Y Lindell","year":"2013","unstructured":"Lindell, Y., Nissim, K., Orlandi, C.: Hiding the input-size in secure two-party computation. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part II. LNCS, vol. 8270, pp. 421\u2013440. Springer, Heidelberg (2013)"},{"key":"24_CR31","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M.O., Kilian, J.: Zero-knowledge sets. In: FOCS, pp. 80\u201391. IEEE Computer Society (2003)","DOI":"10.1109\/SFCS.2003.1238183"},{"key":"24_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/978-3-540-30574-3_19","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"L Nguyen","year":"2005","unstructured":"Nguyen, L.: Accumulators from bilinear pairings and applications. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 275\u2013292. Springer, Heidelberg (2005)"},{"key":"24_CR33","unstructured":"Pinkas, B., Schneider, T., Zohner, M.: Faster private set intersection based on OT extension. In: 23rd USENIX Security Symposium (USENIX Security 2014), pp. 797\u2013812 (2014)"},{"key":"24_CR34","unstructured":"Tanaka, N., Saito, T.: On the q-strong Diffie-Hellman problem. IACR Cryptology ePrint Archive, 2010:215 (2010)"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44618-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T06:27:00Z","timestamp":1568269620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44618-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319446172","9783319446189"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44618-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}