{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T05:50:11Z","timestamp":1749189011418,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030215477"},{"type":"electronic","value":"9783030215484"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-21548-4_6","type":"book-chapter","created":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T23:05:30Z","timestamp":1561503930000},"page":"97-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Two-Client and Multi-client Functional Encryption for Set Intersection"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9794-9882","authenticated-orcid":false,"given":"Tim","family":"van de Kamp","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7001-7308","authenticated-orcid":false,"given":"David","family":"Stritzl","sequence":"additional","affiliation":[]},{"given":"Willem","family":"Jonker","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2929-5001","authenticated-orcid":false,"given":"Andreas","family":"Peter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,30]]},"reference":[{"key":"6_CR1","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-18467-8_1","volume-title":"ICT Systems Security and Privacy Protection","author":"A Abadi","year":"2015","unstructured":"Abadi, A., Terzis, S., Dong, C.: O-PSI: delegated private set intersection on outsourced datasets. In: Federrath, H., Gollmann, D. (eds.) SEC 2015. IAICT, vol. 455, pp. 3\u201317. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18467-8_1"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-662-54970-4_9","volume-title":"Financial Cryptography and Data Security","author":"A Abadi","year":"2017","unstructured":"Abadi, A., Terzis, S., Dong, C.: VD-PSI: verifiable delegated private set intersection on outsourced private datasets. In: Grossklags, J., Preneel, B. (eds.) FC 2016. LNCS, vol. 9603, pp. 149\u2013168. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54970-4_9"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-030-17259-6_5","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"M Abdalla","year":"2019","unstructured":"Abdalla, M., Benhamouda, F., Kohlweiss, M., Waldner, H.: Decentralizing inner-product functional encryption. In: Lin, D., Sako, K. (eds.) PKC 2019, Part II. LNCS, vol. 11443, pp. 128\u2013157. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_5"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-38348-9_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"M Bellare","year":"2013","unstructured":"Bellare, M., Keelveedhi, S., Ristenpart, T.: Message-locked encryption and secure deduplication. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 296\u2013312. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_18"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/3-540-44448-3_41","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000","author":"M Bellare","year":"2000","unstructured":"Bellare, M., Namprempre, C.: Authenticated encryption: relations among notions and analysis of the generic composition paradigm. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 531\u2013545. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_41"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-662-46803-6_19","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"D Boneh","year":"2015","unstructured":"Boneh, D., Lewi, K., Raykova, M., Sahai, A., Zhandry, M., Zimmerman, J.: Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, Part II. LNCS, vol. 9057, pp. 563\u2013594. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_19"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Carpent, X., Faber, S., Sander, T., Tsudik, G.: Private set projections & variants. In: WPES. ACM (2017). https:\/\/doi.org\/10.1145\/3139550.3139554","DOI":"10.1145\/3139550.3139554"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/978-3-030-03329-3_24","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"J Chotard","year":"2018","unstructured":"Chotard, J., Dufour Sans, E., Gay, R., Phan, D.H., Pointcheval, D.: Decentralized multi-client functional encryption for inner product. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11273, pp. 703\u2013732. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_24"},{"key":"6_CR9","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 De Cristofaro","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). https:\/\/doi.org\/10.1007\/978-3-642-14577-3_13"},{"issue":"4","key":"6_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.14778\/1938545.1938550","volume":"4","author":"Bolin Ding","year":"2011","unstructured":"Ding, B., K\u00f6nig, A.C.: Fast set intersection in memory. In: Jagadish, H.V., Koudas, N. (ed.) Proceedings of the VLDB Endowment 4.4, pp. 255\u2013266, January 2011. ISSN: 2150\u20138097. https:\/\/doi.org\/10.14778\/1938545.1938550","journal-title":"Proceedings of the VLDB Endowment"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Dong, C., Chen, L., Wen, Z.: When private set intersection meets big data: an efficient and scalable protocol. In: CCS. ACM (2013). https:\/\/doi.org\/10.1145\/2508859.2516701","DOI":"10.1145\/2508859.2516701"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Douceur, J.R., Adya, A., Bolosky, W.J., Simon, D., Theimer, M.: Reclaiming space from duplicate files in a serverless distributed file system. In: ICDCS. IEEE (2002). https:\/\/doi.org\/10.1109\/ICDCS.2002.1022312","DOI":"10.1109\/ICDCS.2002.1022312"},{"key":"6_CR13","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). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_1"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Galindo, D., Hoepman, J.-H.: Non-interactive distributed encryption: a new primitive for revocable privacy. In: WPES. ACM (2011). https:\/\/doi.org\/10.1145\/2046556.2046567","DOI":"10.1145\/2046556.2046567"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-642-55220-5_32","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"S Goldwasser","year":"2014","unstructured":"Goldwasser, S., et al.: Multi-input functional encryption. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 578\u2013602. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_32"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-642-15317-4_26","volume-title":"Security and Cryptography for Networks","author":"S Jarecki","year":"2010","unstructured":"Jarecki, S., Liu, X.: Fast secure computation of set intersection. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 418\u2013435. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_26"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-662-45472-5_13","volume-title":"Financial Cryptography and Data Security","author":"S Kamara","year":"2014","unstructured":"Kamara, S., Mohassel, P., Raykova, M., Sadeghian, S.: Scaling private set intersection to billion-element sets. In: Christin, N., Safavi-Naini, R. (eds.) FC 2014. LNCS, vol. 8437, pp. 195\u2013215. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45472-5_13"},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Kerschbaum, F.: Collusion-resistant outsourcing of private set intersection. In: SAC. ACM (2012). https:\/\/doi.org\/10.1145\/2245276.2232008","DOI":"10.1145\/2245276.2232008"},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Kerschbaum, F.: Outsourced private set intersection using homomorphic encryption. In: ASIACCS. ACM (2012). https:\/\/doi.org\/10.1145\/2414456.2414506","DOI":"10.1145\/2414456.2414506"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-319-98113-0_29","volume-title":"Security and Cryptography for Networks","author":"S Kim","year":"2018","unstructured":"Kim, S., Lewi, K., Mandal, A., Montgomery, H., Roy, A., Wu, D.J.: Function-hiding inner product encryption is practical. In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 544\u2013562. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_29"},{"key":"6_CR21","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). https:\/\/doi.org\/10.1007\/11535218_15"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-642-20465-4_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"A Lewko","year":"2011","unstructured":"Lewko, A., Waters, B.: Decentralizing attribute-based encryption. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 568\u2013588. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_31"},{"key":"6_CR23","doi-asserted-by":"publisher","unstructured":"Liu, F., Ng, W.K., Zhang, W., Giang, D.H., Han, S.: Encrypted set intersection protocol for outsourced datasets. In: IC2E. IEEE (2014). https:\/\/doi.org\/10.1109\/IC2E.2014.18","DOI":"10.1109\/IC2E.2014.18"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-08506-7_7","volume-title":"Privacy Enhancing Technologies","author":"W Lueks","year":"2014","unstructured":"Lueks, W., Hoepman, J.-H., Kursawe, K.: Forward-secure distributed encryption. In: De Cristofaro, E., Murdoch, S.J. (eds.) PETS 2014. LNCS, vol. 8555, pp. 123\u2013142. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08506-7_7"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Meadows, C.: A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. In: S&P. IEEE (1986). https:\/\/doi.org\/10.1109\/SP.1986.10022","DOI":"10.1109\/SP.1986.10022"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-642-29011-4_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"O Pandey","year":"2012","unstructured":"Pandey, O., Rouselakis, Y.: Property preserving symmetric encryption. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 375\u2013391. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_23"},{"key":"6_CR27","unstructured":"Pinkas, B., Schneider, T., Zohner, M.: Faster private set intersection based on OT extension. In: USENIX Security. USENIX Association (2014)"},{"key":"6_CR28","unstructured":"Shi, E., Chan, T.H., Rieffel, E.G., Chow, R., Song, D.: Privacy-preserving aggregation of time-series data. In: NDSS. The Internet Society (2011)"},{"key":"6_CR29","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21936-3","volume-title":"Cryptography Made Simple","author":"NP Smart","year":"2016","unstructured":"Smart, N.P.: Cryptography Made Simple. Information Security and Cryptography. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-21936-3. ISBN: 978-3-319-21936-3. Ed. by D. Basin and K. Paterson"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-030-02641-7_7","volume-title":"Cryptology and Network Security","author":"T van de Kamp","year":"2018","unstructured":"van de Kamp, T., Peter, A., Everts, M.H., Jonker, W.: Multi-client predicate-only encryption for conjunctive equality tests. In: Capkun, S., Chow, S.S.M. (eds.) CANS 2017. LNCS, vol. 11261, pp. 135\u2013157. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02641-7_7"},{"key":"6_CR31","doi-asserted-by":"publisher","unstructured":"Zheng, Q., Xu, S.: Verifiable delegated set intersection operations on outsourced encrypted data. In: IC2E. IEEE (2015). https:\/\/doi.org\/10.1109\/IC2E.2015.38","DOI":"10.1109\/IC2E.2015.38"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21548-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:40:53Z","timestamp":1710265253000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21548-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030215477","9783030215484"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21548-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"30 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACISP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Conference on Information Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Christchurch","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Zealand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acisp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/acisp19.canterbury.ac.nz\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"129","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}