{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:45:20Z","timestamp":1761061520092,"version":"3.40.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T00:00:00Z","timestamp":1635552000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T00:00:00Z","timestamp":1635552000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"IITP","award":["2016-6-00600"],"award-info":[{"award-number":["2016-6-00600"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10623-021-00961-w","type":"journal-article","created":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T18:03:09Z","timestamp":1635616989000},"page":"17-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Functional encryption for set intersection in the multi-client setting"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1910-8890","authenticated-orcid":false,"given":"Kwangsu","family":"Lee","sequence":"first","affiliation":[]},{"given":"Minhye","family":"Seo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,30]]},"reference":[{"key":"961_CR1","unstructured":"Apple and google privacy-preserving contact tracing. https:\/\/covid19.apple.com\/contacttracing (2020)."},{"key":"961_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/11535218_13","volume-title":"Advances in Cryptology\u2014CRYPTO 2005","author":"M Abdalla","year":"2005","unstructured":"Abdalla M., Bellare M., Catalano D., Kiltz E., Kohno T., Lange T., Malone-Lee J., Neven G., Paillier P., Shi H.: Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions. In: Shoup V. (ed.) Advances in Cryptology\u2014CRYPTO 2005, vol. 3621, pp. 205\u2013222. LNCS. Springer, Heidelberg (2005)."},{"key":"961_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/978-3-662-46447-2_33","volume-title":"Public-Key Cryptography\u2014PKC 2015","author":"M Abdalla","year":"2015","unstructured":"Abdalla M., Bourse F., Caro A.D., Pointcheval D.: Simple functional encryption schemes for inner products. In: Katz J. (ed.) Public-Key Cryptography\u2014PKC 2015, vol. 9020, pp. 733\u2013751. LNCS. Springer, Heidelberg (2015)."},{"key":"961_CR4","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/978-3-319-56620-7_21","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2017","author":"M Abdalla","year":"2017","unstructured":"Abdalla M., Gay R., Raykova M., Wee H.: Multi-input inner-product functional encryption from pairings. In: Coron J., Nielsen J.B. (eds.) Advances in Cryptology\u2014EUROCRYPT 2017, vol. 10210, pp. 601\u2013626. LNCS. Springer, Heidelberg (2017)."},{"key":"961_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-662-53015-3_12","volume-title":"Advances in Cryptology\u2014CRYPTO 2016","author":"S Agrawal","year":"2016","unstructured":"Agrawal S., Libert B., Stehl\u00e9 D.: Fully secure functional encryption for inner products, from standard assumptions. In: Robshaw M., Katz J. (eds.) Advances in Cryptology\u2014CRYPTO 2016, vol. 9816, pp. 333\u2013362. LNCS. Springer, Heidelberg (2016)."},{"key":"961_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-63688-7_3","volume-title":"Advances in Cryptology\u2014CRYPTO 2017","author":"CEZ Baltico","year":"2017","unstructured":"Baltico C.E.Z., Catalano D., Fiore D., Gay R.: Practical functional encryption for quadratic functions with applications to predicate encryption. In: Katz J., Shacham H. (eds.) Advances in Cryptology\u2014CRYPTO 2017, vol. 10401, pp. 67\u201398. LNCS. Springer, Heidelberg (2017)."},{"key":"961_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/11426639_26","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2005","author":"D Boneh","year":"2005","unstructured":"Boneh D., Boyen X., Goh E.J.: Hierarchical identity based encryption with constant size ciphertext. In: Cramer R. (ed.) Advances in Cryptology\u2014EUROCRYPT 2005, vol. 3494, pp. 440\u2013456. LNCS. Springer, Heidelberg (2005)."},{"key":"961_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh D., Crescenzo G.D., Ostrovsky R., Persiano G.: Public key encryption with keyword search. In: Cachin C., Camenisch J. (eds.) Advances in Cryptology\u2014EUROCRYPT 2004, vol. 3027, pp. 506\u2013522. LNCS. Springer, Heidelberg (2004)."},{"key":"961_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology\u2014CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh D., Franklin M.K.: Identity-based encryption from the weil pairing. In: Kilian J. (ed.) Advances in Cryptology\u2014CRYPTO 2001, vol. 2139, pp. 213\u2013229. LNCS. Springer, Heidelberg (2001)."},{"key":"961_CR10","series-title":"LNCS","first-page":"253","volume-title":"Advances in Cryptology\u2014CRYPTO 2001","author":"D Boneh","year":"2011","unstructured":"Boneh D., Sahai A., Waters B.: Functional encryption: definitions and challenges. In: Ishai Y. (ed.) Advances in Cryptology\u2014CRYPTO 2001, vol. 6597, pp. 253\u2013273. LNCS. Springer, Heidelberg (2011)."},{"issue":"11","key":"961_CR11","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/2366316.2366333","volume":"55","author":"D Boneh","year":"2012","unstructured":"Boneh D., Sahai A., Waters B.: Functional encryption: a new vision for public-key cryptography. Commun. ACM 55(11), 56\u201364 (2012).","journal-title":"Commun. ACM"},{"key":"961_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-00468-1_12","volume-title":"Public Key Cryptography\u2014PKC 2009","author":"J Camenisch","year":"2009","unstructured":"Camenisch J., Kohlweiss M., Rial A., Sheedy C.: Blind and anonymous identity-based encryption and authorised private searches on public key encrypted data. In: Jarecki S., Tsudik G. (eds.) Public Key Cryptography\u2014PKC 2009, vol. 5443, pp. 196\u2013214. LNCS. Springer, Heidelberg (2009)."},{"key":"961_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-39200-9_16","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2003","author":"R Canetti","year":"2003","unstructured":"Canetti R., Halevi S., Katz J.: A forward-secure public-key encryption scheme. In: Biham E. (ed.) Advances in Cryptology\u2014EUROCRYPT 2003, vol. 2656, pp. 255\u2013271. LNCS. Springer, Heidelberg (2003)."},{"key":"961_CR14","first-page":"1243","volume-title":"ACM Conference on Computer and Communications Security\u2014CCS 2017","author":"H Chen","year":"2017","unstructured":"Chen H., Laine K., Rindal P.: Fast private set intersection from homomorphic encryption. In: Thuraisingham B.M., Evans D., Malkin T., Xu D. (eds.) ACM Conference on Computer and Communications Security\u2014CCS 2017, pp. 1243\u20131255. ACM, New York (2017)."},{"key":"961_CR15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/978-3-030-03329-3_24","volume-title":"Advances in Cryptology\u2014ASIACRYPT 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.D. (eds.) Advances in Cryptology\u2014ASIACRYPT 2018, vol. 11273, pp. 703\u2013732. LNCS. Springer, Heidelberg (2018)."},{"key":"961_CR16","first-page":"789","volume-title":"ACM Conference on Computer and Communications Security\u2014CCS\u201913","author":"C Dong","year":"2013","unstructured":"Dong C., Chen L., Wen Z.: When private set intersection meets big data: an efficient and scalable protocol. In: Sadeghi A., Gligor V.D., Yung M. (eds.) ACM Conference on Computer and Communications Security\u2014CCS\u201913, pp. 789\u2013800. ACM, New York (2013)."},{"key":"961_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1007\/978-3-030-64840-4_29","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2020","author":"T Duong","year":"2020","unstructured":"Duong T., Phan D.H., Trieu N.: Catalic: delegated PSI cardinality with applications to contact tracing. In: Moriai S., Wang H. (eds.) Advances in Cryptology\u2014ASIACRYPT 2020, vol. 12493, pp. 870\u2013899. LNCS. Springer, Heidelberg (2020)."},{"key":"961_CR18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology\u2014EUROCRYPT 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. (eds.) Advances in Cryptology\u2014EUROCRYPT 2004, vol. 3027, pp. 1\u201319. LNCS. Springer, Heidelberg (2004)."},{"key":"961_CR19","series-title":"LNCS","first-page":"303","volume-title":"Theory of Cryptography\u2014TCC 2005","author":"MJ Freedman","year":"2005","unstructured":"Freedman M.J., Ishai Y., Pinkas B., Reingold O.: Keyword search and oblivious pseudorandom functions. In: Kilian J. (ed.) Theory of Cryptography\u2014TCC 2005, vol. 3378, pp. 303\u2013324. LNCS. Springer, Heidelberg (2005)."},{"key":"961_CR20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-642-13190-5_3","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2010","author":"DM Freeman","year":"2010","unstructured":"Freeman D.M.: Converting pairing-based cryptosystems from composite-order groups to prime-order groups. In: Gilbert H. (ed.) Advances in Cryptology\u2014EUROCRYPT 2010, vol. 6110, pp. 44\u201361. LNCS. Springer, Heidelberg (2010)."},{"key":"961_CR21","doi-asserted-by":"crossref","unstructured":"Garg S., Gentry C., Halevi S., Raykova M., Sahai A., Waters B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: FOCS 2013, pp. 40\u201349. IEEE Computer Society (2013).","DOI":"10.1109\/FOCS.2013.13"},{"key":"961_CR22","first-page":"169","volume-title":"ACM Symposium on Theory of Computing\u2013STOC 2009","author":"C Gentry","year":"2009","unstructured":"Gentry C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher M. (ed.) ACM Symposium on Theory of Computing\u2013STOC 2009, pp. 169\u2013178. ACM, New York (2009)."},{"key":"961_CR23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/3-540-36178-2_34","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2002","author":"C Gentry","year":"2002","unstructured":"Gentry C., Silverberg A.: Hierarchical id-based cryptography. In: Zheng Y. (ed.) Advances in Cryptology\u2014ASIACRYPT 2002, vol. 2501, pp. 548\u2013566. LNCS. Springer, Heidelberg (2002)."},{"key":"961_CR24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-642-55220-5_32","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2014","author":"S Goldwasser","year":"2014","unstructured":"Goldwasser S., Gordon S.D., Goyal V., Jain A., Katz J., Liu F., Sahai A., Shi E., Zhou H.: Multi-input functional encryption. In: Nguyen P.Q., Oswald E. (eds.) Advances in Cryptology\u2014EUROCRYPT 2014, vol. 8441, pp. 578\u2013602. LNCS. Springer, Heidelberg (2014)."},{"key":"961_CR25","first-page":"89","volume-title":"ACM Conference on Computer and Communications Security\u2014CCS 2006","author":"V Goyal","year":"2006","unstructured":"Goyal V., Pandey O., Sahai A., Waters B.: Attribute-based encryption for fine-grained access control of encrypted data. In: Juels A., Wright R.N., di Vimercati S.D.C. (eds.) ACM Conference on Computer and Communications Security\u2014CCS 2006, pp. 89\u201398. ACM, New York (2006)."},{"key":"961_CR26","unstructured":"Huang Y., Evans D., Katz J.: Private set intersection: are garbled circuits better than custom protocols? In: Network and Distributed System Security Symposium\u2014NDSS 2012, The Internet Society (2012)"},{"key":"961_CR27","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/336992.337012","volume-title":"ACM Conference on Electronic Commerce\u2014EC-99","author":"BA Huberman","year":"1999","unstructured":"Huberman B.A., Franklin M.K., Hogg T.: Enhancing privacy and trust in electronic communities. In: Feldman S.I., Wellman M.P. (eds.) ACM Conference on Electronic Commerce\u2014EC-99, pp. 78\u201386. ACM, New York (1999)."},{"key":"961_CR28","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-3-662-45472-5_13","volume-title":"Financial Cryptography and Data Security\u2014FC 2014","author":"S Kamara","year":"2014","unstructured":"Kamara S., Mohassel P., Raykova M., Sadeghian S.S.: Scaling private set intersection to billion-element sets. In: Christin N., Safavi-Naini R. (eds.) Financial Cryptography and Data Security\u2014FC 2014, vol. 8437, pp. 195\u2013215. LNCS. Springer, Heidelberg (2014)."},{"key":"961_CR29","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-78967-3_9","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2008","author":"J Katz","year":"2008","unstructured":"Katz J., Sahai A., Waters B.: Predicate encryption supporting disjunctions, polynomial equations, and inner products. In: Smart N.P. (ed.) Advances in Cryptology\u2014EUROCRYPT 2008, vol. 4965, pp. 146\u2013162. LNCS. Springer, Heidelberg (2008)."},{"key":"961_CR30","unstructured":"Lee K.: Efficient multi-client functional encryption for conjunctive equality and range queries. Cryptology ePrint Archive, Report 2020\/822. http:\/\/eprint.iacr.org\/2020\/822 (2020)."},{"key":"961_CR31","doi-asserted-by":"crossref","unstructured":"Lee K., Lee D.H.: Two-input functional encryption for inner products from bilinear maps. IEICE Trans. 101-A(6):915\u2013928 (2018).","DOI":"10.1587\/transfun.E101.A.915"},{"key":"961_CR32","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/3-540-48910-X_23","volume-title":"Advances in Cryptology\u2014EUROCRYPT \u201999","author":"M Naor","year":"1999","unstructured":"Naor M., Pinkas B., Reingold O.: Distributed pseudo-random functions and KDCs. In: Stern J. (ed.) Advances in Cryptology\u2014EUROCRYPT \u201999, vol. 1592, pp. 327\u2013346. LNCS. Springer, Heidelberg (1999)."},{"key":"961_CR33","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology\u2014EUROCRYPT \u201997","author":"V Shoup","year":"1997","unstructured":"Shoup V.: Lower bounds for discrete logarithms and related problems. In: Fumy W. (ed.) Advances in Cryptology\u2014EUROCRYPT \u201997, vol. 1233, pp. 256\u2013266. LNCS. Springer, Heidelberg (1997)."},{"issue":"2","key":"961_CR34","first-page":"95","volume":"43","author":"N Trieu","year":"2020","unstructured":"Trieu N., Shehata K., Saxena P., Shokri R., Song D.: Epione: lightweight contact tracing with strong privacy. IEEE Data Eng. Bull. 43(2), 95\u2013107 (2020).","journal-title":"IEEE Data Eng. Bull."},{"key":"961_CR35","series-title":"LNCS","first-page":"97","volume-title":"Information Security and Privacy\u2014ACISP 2019","author":"T van de Kamp","year":"2019","unstructured":"van de Kamp T., Stritzl D., Jonker W., Peter A.: Two-client and multi-client functional encryption for set intersection. In: Jang-Jaccard J., Guo F. (eds.) Information Security and Privacy\u2014ACISP 2019, vol. 11547, pp. 97\u2013115. LNCS. Springer, Heidelberg (2019)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00961-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-021-00961-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00961-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T23:13:02Z","timestamp":1744153982000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-021-00961-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,30]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["961"],"URL":"https:\/\/doi.org\/10.1007\/s10623-021-00961-w","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2021,10,30]]},"assertion":[{"value":"10 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}