{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:59:32Z","timestamp":1766138372673,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T00:00:00Z","timestamp":1688947200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,10]]},"DOI":"10.1145\/3579856.3582826","type":"proceedings-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T14:52:13Z","timestamp":1688568733000},"page":"678-688","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Communication-Efficient Inner Product Private Join and Compute with Cardinality"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7705-5996","authenticated-orcid":false,"given":"Koji","family":"Chida","sequence":"first","affiliation":[{"name":"Gunma University, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8863-6809","authenticated-orcid":false,"given":"Koki","family":"Hamada","sequence":"additional","affiliation":[{"name":"NTT Social Informatics Laboratories, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8013-7071","authenticated-orcid":false,"given":"Atsunori","family":"Ichikawa","sequence":"additional","affiliation":[{"name":"NTT Social Informatics Laboratories, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1323-0983","authenticated-orcid":false,"given":"Masanobu","family":"Kii","sequence":"additional","affiliation":[{"name":"NTT Social Informatics Laboratories, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7995-877X","authenticated-orcid":false,"given":"Junichi","family":"Tomida","sequence":"additional","affiliation":[{"name":"NTT Social Informatics Laboratories, Japan"}]}],"member":"320","published-online":{"date-parts":[[2023,7,10]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[\n  1\n  ]  Microsoft SEAL https:\/\/github.com\/Microsoft\/SEAL  [1] Microsoft SEAL https:\/\/github.com\/Microsoft\/SEAL"},{"key":"e_1_3_2_1_2_1","unstructured":"[\n  2\n  ]  The sodium crypto library (libsodium) https:\/\/doc.libsodium.org  [2] The sodium crypto library (libsodium) https:\/\/doc.libsodium.org"},{"key":"e_1_3_2_1_3_1","first-page":"97","volume-title":"Srikant","author":"Agrawal R.","year":"2003","unstructured":"[ 3 ] Agrawal , R. , Evfimievski , A.V. , Srikant , R. : Information sharing across private databases. In : Halevy, A.Y., Ives, Z.G., Doan, A. (eds.) ACM SIGMOD 2003 . pp. 86\u2013 97 . ACM (2003), https:\/\/doi.org\/10.1145\/872757.872771 10.1145\/872757.872771 [3] Agrawal, R., Evfimievski, A.V., Srikant, R.: Information sharing across private databases. In: Halevy, A.Y., Ives, Z.G., Doan, A. (eds.) ACM SIGMOD 2003. pp. 86\u201397. ACM (2003), https:\/\/doi.org\/10.1145\/872757.872771"},{"key":"e_1_3_2_1_4_1","first-page":"702","volume-title":"Tsudik","author":"Baldi P.","year":"2011","unstructured":"[ 4 ] Baldi , P. , Baronio , R. , De Cristofaro , E. , Gasti , P. , Tsudik , G. : Countering GATTACA: efficient and secure testing of fully-sequenced human genomes. In : Chen, Y., Danezis, G., Shmatikov, V. (eds.) ACM CCS 2011 . pp. 691\u2013 702 . ACM Press (Oct 2011) [4] Baldi, P., Baronio, R., De Cristofaro, E., Gasti, P., Tsudik, G.: Countering GATTACA: efficient and secure testing of fully-sequenced human genomes. In: Chen, Y., Danezis, G., Shmatikov, V. (eds.) ACM CCS 2011. pp. 691\u2013702. ACM Press (Oct 2011)"},{"key":"e_1_3_2_1_5_1","first-page":"308","volume-title":"Scholl","author":"Boyle E.","year":"2019","unstructured":"[ 5 ] Boyle , E. , Couteau , G. , Gilboa , N. , Ishai , Y. , Kohl , L. , Rindal , P. , Scholl , P. : Efficient two-round OT extension and silent non-interactive secure computation. In : Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019 . pp. 291\u2013 308 . ACM Press (Nov 2019) [5] Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Rindal, P., Scholl, P.: Efficient two-round OT extension and silent non-interactive secure computation. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019. pp. 291\u2013308. ACM Press (Nov 2019)"},{"key":"e_1_3_2_1_6_1","volume-title":"Vlaskin","author":"Buddhavarapu P.","year":"2020","unstructured":"[ 6 ] Buddhavarapu , P. , Knox , A. , Mohassel , P. , Sengupta , S. , Taubeneck , E. , Vlaskin , V. : Private matching for compute. Cryptology ePrint Archive, Report 2020 \/599 (2020), https:\/\/eprint.iacr.org\/2020\/599 [6] Buddhavarapu, P., Knox, A., Mohassel, P., Sengupta, S., Taubeneck, E., Vlaskin, V.: Private matching for compute. Cryptology ePrint Archive, Report 2020\/599 (2020), https:\/\/eprint.iacr.org\/2020\/599"},{"key":"e_1_3_2_1_7_1","first-page":"520","volume-title":"2011 IEEE Symposium on Security and Privacy.","author":"Bursztein E.","unstructured":"[ 7 ] Bursztein , E. , Hamburg , M. , Lagarenne , J. , Boneh , D. : OpenConflict: Preventing real time map hacks in online games . In: 2011 IEEE Symposium on Security and Privacy. pp. 506\u2013 520 . IEEE Computer Society Press (May 2011) [7] Bursztein, E., Hamburg, M., Lagarenne, J., Boneh, D.: OpenConflict: Preventing real time map hacks in online games. In: 2011 IEEE Symposium on Security and Privacy. pp. 506\u2013520. IEEE Computer Society Press (May 2011)"},{"key":"e_1_3_2_1_8_1","first-page":"34","volume":"12172","author":"Chase M.","year":"2020","unstructured":"[ 8 ] Chase , M. , Miao , P. : Private set intersection in the internet setting from lightweight oblivious PRF . In : Micciancio, D., Ristenpart , T. (eds.) CRYPT O\u00a0 2020 , Part\u00a0III. LNCS , vol. 12172 , pp. 34 \u2013 63 . Springer, Heidelberg (Aug 2020) [8] Chase, M., Miao, P.: Private set intersection in the internet setting from lightweight oblivious PRF. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO\u00a02020, Part\u00a0III. LNCS, vol. 12172, pp. 34\u201363. Springer, Heidelberg (Aug 2020)","journal-title":"Part\u00a0III. LNCS"},{"key":"e_1_3_2_1_9_1","first-page":"142","volume-title":"LNCS","volume":"5536","author":"Dachman-Soled D.","unstructured":"[ 9 ] Dachman-Soled , D. , Malkin , T. , Raykova , M. , Yung , M. : Efficient robust private set intersection. In: Abdalla, M., Pointcheval, D., Fouque, P.A., Vergnaud, D. (eds.) ACNS 09 . LNCS , vol. 5536 , pp. 125\u2013 142 . Springer, Heidelberg (Jun 2009) [9] Dachman-Soled, D., Malkin, T., Raykova, M., Yung, M.: Efficient robust private set intersection. In: Abdalla, M., Pointcheval, D., Fouque, P.A., Vergnaud, D. (eds.) ACNS 09. LNCS, vol. 5536, pp. 125\u2013142. Springer, Heidelberg (Jun 2009)"},{"key":"e_1_3_2_1_10_1","first-page":"231","volume-title":"LNCS","volume":"7712","author":"De Cristofaro E.","unstructured":"[ 10 ] 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 12 . LNCS , vol. 7712 , pp. 218\u2013 231 . Springer, Heidelberg (Dec 2012) [10] 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 12. LNCS, vol. 7712, pp. 218\u2013231. Springer, Heidelberg (Dec 2012)"},{"key":"e_1_3_2_1_11_1","first-page":"231","volume-title":"Tsudik","author":"De Cristofaro E.","year":"2010","unstructured":"[ 11 ] De Cristofaro , E. , Kim , J. , Tsudik , G. : Linear-complexity private set intersection protocols secure in malicious model. In : Abe, M. (ed.) ASIACRYPT\u00a0 2010 . LNCS , vol. 6477 , pp. 213\u2013 231 . Springer, Heidelberg (Dec 2010) [11] De Cristofaro, E., Kim, J., Tsudik, G.: Linear-complexity private set intersection protocols secure in malicious model. In: Abe, M. (ed.) ASIACRYPT\u00a02010. LNCS, vol. 6477, pp. 213\u2013231. Springer, Heidelberg (Dec 2010)"},{"key":"e_1_3_2_1_12_1","first-page":"226","volume-title":"Dutta","author":"Debnath S.K.","year":"2015","unstructured":"[ 12 ] Debnath , S.K. , Dutta , R. : Secure and efficient private set intersection cardinality using bloom filter. In : Lopez, J., Mitchell, C.J. (eds.) ISC\u00a0 2015 . LNCS , vol. 9290 , pp. 209\u2013 226 . Springer, Heidelberg (Sep 2015) [12] Debnath, S.K., Dutta, R.: Secure and efficient private set intersection cardinality using bloom filter. In: Lopez, J., Mitchell, C.J. (eds.) ISC\u00a02015. LNCS, vol. 9290, pp. 209\u2013226. Springer, Heidelberg (Sep 2015)"},{"key":"e_1_3_2_1_13_1","first-page":"800","volume-title":"Wen","author":"Dong C.","year":"2013","unstructured":"[ 13 ] 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\u2013 800 . ACM Press (Nov 2013) [13] 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 (Nov 2013)"},{"key":"e_1_3_2_1_14_1","first-page":"430","volume-title":"LNCS","volume":"9144","author":"Egert R.","unstructured":"[ 14 ] 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 15 . LNCS , vol. 9144 , pp. 413\u2013 430 . Springer, Heidelberg (Jun\u00a0\/\u00a0Jul 2015) [14] 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 15. LNCS, vol. 9144, pp. 413\u2013430. Springer, Heidelberg (Jun\u00a0\/\u00a0Jul 2015)"},{"key":"e_1_3_2_1_15_1","first-page":"25","volume-title":"Ostrovsky","author":"Falk B.H.","year":"2019","unstructured":"[ 15 ] Falk , B.H. , Noble , D. , Ostrovsky , R. : Private set intersection with linear communication from general assumptions. In : Cavallaro, L., Kinder, J., Domingo-Ferrer, J. (eds.) WPES @CCS, 2019 . pp. 14\u2013 25 . ACM (2019), https:\/\/doi.org\/10.1145\/3338498.3358645 10.1145\/3338498.3358645 [15] Falk, B.H., Noble, D., Ostrovsky, R.: Private set intersection with linear communication from general assumptions. In: Cavallaro, L., Kinder, J., Domingo-Ferrer, J. (eds.) WPES@CCS, 2019. pp. 14\u201325. ACM (2019), https:\/\/doi.org\/10.1145\/3338498.3358645"},{"key":"e_1_3_2_1_16_1","first-page":"324","volume-title":"Reingold","author":"Freedman M.J.","year":"2005","unstructured":"[ 16 ] Freedman , M.J. , Ishai , Y. , Pinkas , B. , Reingold , O. : Keyword search and oblivious pseudorandom functions. In : Kilian, J. (ed.) TCC\u00a0 2005 . LNCS , vol. 3378 , pp. 303\u2013 324 . Springer, Heidelberg (Feb 2005) [16] Freedman, M.J., Ishai, Y., Pinkas, B., Reingold, O.: Keyword search and oblivious pseudorandom functions. In: Kilian, J. (ed.) TCC\u00a02005. LNCS, vol. 3378, pp. 303\u2013324. Springer, Heidelberg (Feb 2005)"},{"key":"e_1_3_2_1_17_1","first-page":"19","volume-title":"Pinkas","author":"Freedman M.J.","year":"2004","unstructured":"[ 17 ] Freedman , M.J. , Nissim , K. , Pinkas , B. : Efficient private matching and set intersection. In : Cachin, C., Camenisch, J. (eds.) EUROCRYPT\u00a0 2004 . LNCS , vol. 3027 , pp. 1\u2013 19 . Springer, Heidelberg (May 2004) [17] Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J. (eds.) EUROCRYPT\u00a02004. LNCS, vol. 3027, pp. 1\u201319. Springer, Heidelberg (May 2004)"},{"key":"e_1_3_2_1_18_1","first-page":"591","volume":"12711","author":"Garimella G.","year":"2021","unstructured":"[ 18 ] Garimella , G. , Mohassel , P. , Rosulek , M. , Sadeghian , S. , Singh , J. : Private set operations from oblivious switching. In: Garay, J. (ed.) PK C\u00a0 2021 , Part\u00a0II. LNCS , vol. 12711 , pp. 591 \u2013 617 . Springer, Heidelberg (May 2021) [18] Garimella, G., Mohassel, P., Rosulek, M., Sadeghian, S., Singh, J.: Private set operations from oblivious switching. In: Garay, J. (ed.) PKC\u00a02021, Part\u00a0II. LNCS, vol. 12711, pp. 591\u2013617. Springer, Heidelberg (May 2021)","journal-title":"Part\u00a0II. LNCS"},{"key":"e_1_3_2_1_19_1","first-page":"229","volume-title":"Wigderson","author":"Goldreich O.","unstructured":"[ 19 ] Goldreich , O. , Micali , S. , Wigderson , A. : How to play any mental game or A completeness theorem for protocols with honest majority. In : Aho, A. (ed.) 19th ACM STOC. pp. 218\u2013 229 . ACM Press (May 1987) [19] Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: Aho, A. (ed.) 19th ACM STOC. pp. 218\u2013229. ACM Press (May 1987)"},{"key":"e_1_3_2_1_20_1","volume-title":"Katz","author":"Huang Y.","year":"2012","unstructured":"[ 20 ] Huang , Y. , Evans , D. , Katz , J. : Private set intersection: Are garbled circuits better than custom protocols? In : NDSS\u00a0 2012 . The Internet Society (Feb 2012) [20] Huang, Y., Evans, D., Katz, J.: Private set intersection: Are garbled circuits better than custom protocols? In: NDSS\u00a02012. The Internet Society (Feb 2012)"},{"key":"e_1_3_2_1_21_1","first-page":"86","volume-title":"Hogg","author":"Huberman B.A.","year":"1999","unstructured":"[ 21 ] 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 , 1999 . pp. 78\u2013 86 . ACM (1999), https:\/\/doi.org\/10.1145\/336992.337012 10.1145\/336992.337012 [21] 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, 1999. pp. 78\u201386. ACM (1999), https:\/\/doi.org\/10.1145\/336992.337012"},{"key":"e_1_3_2_1_22_1","first-page":"389","volume-title":"Yung","author":"Ion M.","year":"2020","unstructured":"[ 22 ] Ion , M. , Kreuter , B. , Nergiz , A.E. , Patel , S. , Saxena , S. , Seth , K. , Raykova , M. , Shanahan , D. , Yung , M. : On deploying secure computing: Private intersection-sum-with-cardinality. In : EuroS &P 2020 . pp. 370\u2013 389 . IEEE (2020), https:\/\/doi.org\/10.1109\/EuroSP48549.2020.00031 10.1109\/EuroSP48549.2020.00031 [22] Ion, M., Kreuter, B., Nergiz, A.E., Patel, S., Saxena, S., Seth, K., Raykova, M., Shanahan, D., Yung, M.: On deploying secure computing: Private intersection-sum-with-cardinality. In: EuroS&P 2020. pp. 370\u2013389. IEEE (2020), https:\/\/doi.org\/10.1109\/EuroSP48549.2020.00031"},{"key":"e_1_3_2_1_23_1","first-page":"257","volume-title":"Song","author":"Kissner L.","year":"2005","unstructured":"[ 23 ] Kissner , L. , Song , D.X. : Privacy-preserving set operations. In : Shoup, V. (ed.) CRYPTO\u00a0 2005 . LNCS , vol. 3621 , pp. 241\u2013 257 . Springer, Heidelberg (Aug 2005) [23] Kissner, L., Song, D.X.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO\u00a02005. LNCS, vol. 3621, pp. 241\u2013257. Springer, Heidelberg (Aug 2005)"},{"key":"e_1_3_2_1_24_1","first-page":"829","volume-title":"Trieu","author":"Kolesnikov V.","year":"2016","unstructured":"[ 24 ] 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\u2013 829 . ACM Press (Oct 2016) [24] 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 (Oct 2016)"},{"key":"e_1_3_2_1_25_1","first-page":"605","volume":"13091","author":"Lepoint T.","year":"2021","unstructured":"[ 25 ] Lepoint , T. , Patel , S. , Raykova , M. , Seth , K. , Trieu , N. : Private join and compute from PIR with default. In: Tibouchi, M., Wang , H. (eds.) ASIACRYP T\u00a0 2021 , Part\u00a0II. LNCS , vol. 13091 , pp. 605 \u2013 634 . Springer, Heidelberg (Dec 2021) [25] Lepoint, T., Patel, S., Raykova, M., Seth, K., Trieu, N.: Private join and compute from PIR with default. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT\u00a02021, Part\u00a0II. LNCS, vol. 13091, pp. 605\u2013634. Springer, Heidelberg (Dec 2021)","journal-title":"Part\u00a0II. LNCS"},{"key":"e_1_3_2_1_26_1","first-page":"2443","volume-title":"Lou","author":"Li M.","year":"2011","unstructured":"[ 26 ] Li , M. , Cao , N. , Yu , S. , Lou , W. : Findu: Privacy-preserving personal profile matching in mobile social networks. In : INFOCOM , 2011 . pp. 2435\u2013 2443 . IEEE (2011), https:\/\/doi.org\/10.1109\/INFCOM.2011.5935065 10.1109\/INFCOM.2011.5935065 [26] Li, M., Cao, N., Yu, S., Lou, W.: Findu: Privacy-preserving personal profile matching in mobile social networks. In: INFOCOM,2011. pp. 2435\u20132443. IEEE (2011), https:\/\/doi.org\/10.1109\/INFCOM.2011.5935065"},{"key":"e_1_3_2_1_27_1","first-page":"137","volume-title":"IEEE Symposium on Security and Privacy","author":"Meadows C.A.","year":"1986","unstructured":"[ 27 ] Meadows , C.A. : A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party . In: IEEE Symposium on Security and Privacy , 1986 . pp. 134\u2013 137 . IEEE Computer Society (1986), https:\/\/doi.org\/10.1109\/SP.1986.10022 10.1109\/SP.1986.10022 [27] Meadows, C.A.: A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. In: IEEE Symposium on Security and Privacy, 1986. pp. 134\u2013137. IEEE Computer Society (1986), https:\/\/doi.org\/10.1109\/SP.1986.10022"},{"key":"e_1_3_2_1_28_1","first-page":"3","volume":"12172","author":"Miao P.","year":"2020","unstructured":"[ 28 ] Miao , P. , Patel , S. , Raykova , M. , Seth , K. , Yung , M. : Two -sided malicious security for private intersection-sum with cardinality. In: Micciancio, D., Ristenpart , T. (eds.) CRYPT O\u00a0 2020 , Part\u00a0III. LNCS , vol. 12172 , pp. 3 \u2013 33 . Springer, Heidelberg (Aug 2020) [28] Miao, P., Patel, S., Raykova, M., Seth, K., Yung, M.: Two-sided malicious security for private intersection-sum with cardinality. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO\u00a02020, Part\u00a0III. LNCS, vol. 12172, pp. 3\u201333. Springer, Heidelberg (Aug 2020)","journal-title":"Part\u00a0III. LNCS"},{"key":"e_1_3_2_1_29_1","first-page":"110","volume-title":"Borisov","author":"Nagaraja S.","year":"2010","unstructured":"[ 29 ] Nagaraja , S. , Mittal , P. , Hong , C.Y. , Caesar , M. , Borisov , N. : BotGrep: Finding P 2P bots with structured graph analysis. In : USENIX Security 2010 . pp. 95\u2013 110 . USENIX Association (Aug 2010) [29] Nagaraja, S., Mittal, P., Hong, C.Y., Caesar, M., Borisov, N.: BotGrep: Finding P2P bots with structured graph analysis. In: USENIX Security 2010. pp. 95\u2013110. USENIX Association (Aug 2010)"},{"key":"e_1_3_2_1_30_1","volume-title":"Boneh","author":"Narayanan A.","year":"2011","unstructured":"[ 30 ] Narayanan , A. , Thiagarajan , N. , Lakhani , M. , Hamburg , M. , Boneh , D. : Location privacy via private proximity testing. In : NDSS\u00a0 2011 . The Internet Society (Feb 2011) [30] Narayanan, A., Thiagarajan, N., Lakhani, M., Hamburg, M., Boneh, D.: Location privacy via private proximity testing. In: NDSS\u00a02011. The Internet Society (Feb 2011)"},{"key":"e_1_3_2_1_31_1","first-page":"40","volume-title":"LNCS","volume":"5888","author":"Narayanan G.S.","unstructured":"[ 31 ] Narayanan , G.S. , Aishwarya , T. , Agrawal , A. , Patra , A. , Choudhary , A. , Rangan , C.P. : Multi party distributed private matching, set disjointness and cardinality of set intersection with information theoretic security. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 09 . LNCS , vol. 5888 , pp. 21\u2013 40 . Springer, Heidelberg (Dec 2009) [31] Narayanan, G.S., Aishwarya, T., Agrawal, A., Patra, A., Choudhary, A., Rangan, C.P.: Multi party distributed private matching, set disjointness and cardinality of set intersection with information theoretic security. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 09. LNCS, vol. 5888, pp. 21\u201340. Springer, Heidelberg (Dec 2009)"},{"key":"e_1_3_2_1_32_1","first-page":"401","volume":"11694","author":"Pinkas B.","year":"2019","unstructured":"[ 32 ] Pinkas , B. , Rosulek , M. , Trieu , N. , Yanai , A. : Sp OT-light: Lightweight private set intersection from sparse OT extension. In: Boldyreva, A., Micciancio , D. (eds.) CRYPT O\u00a0 2019 , Part\u00a0III. LNCS , vol. 11694 , pp. 401 \u2013 431 . Springer, Heidelberg (Aug 2019) [32] Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: SpOT-light: Lightweight private set intersection from sparse OT extension. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO\u00a02019, Part\u00a0III. LNCS, vol. 11694, pp. 401\u2013431. Springer, Heidelberg (Aug 2019)","journal-title":"Part\u00a0III. LNCS"},{"key":"e_1_3_2_1_33_1","first-page":"739","volume":"12106","author":"Pinkas B.","year":"2020","unstructured":"[ 33 ] Pinkas , B. , Rosulek , M. , Trieu , N. , Yanai , A. : PSI from PaXo S: Fast, malicious private set intersection. In : Canteaut, A., Ishai , Y. (eds.) EUROCRYP T\u00a0 2020 , Part\u00a0II. LNCS , vol. 12106 , pp. 739 \u2013 767 . Springer, Heidelberg (May 2020) [33] Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: PSI from PaXoS: Fast, malicious private set intersection. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT\u00a02020, Part\u00a0II. LNCS, vol. 12106, pp. 739\u2013767. Springer, Heidelberg (May 2020)","journal-title":"Part\u00a0II. LNCS"},{"key":"e_1_3_2_1_34_1","first-page":"530","volume-title":"Zohner","author":"Pinkas B.","year":"2015","unstructured":"[ 34 ] Pinkas , B. , Schneider , T. , Segev , G. , Zohner , M. : Phasing: Private set intersection using permutation-based hashing. In : Jung, J., Holz, T. (eds.) USENIX Security 2015 . pp. 515\u2013 530 . USENIX Association (Aug 2015) [34] Pinkas, B., Schneider, T., Segev, G., Zohner, M.: Phasing: Private set intersection using permutation-based hashing. In: Jung, J., Holz, T. (eds.) USENIX Security 2015. pp. 515\u2013530. USENIX Association (Aug 2015)"},{"key":"e_1_3_2_1_35_1","first-page":"122","volume":"11478","author":"Pinkas B.","year":"2019","unstructured":"[ 35 ] Pinkas , B. , Schneider , T. , Tkachenko , O. , Yanai , A. : Efficient circuit-based PSI with linear communication. In: Ishai, Y., Rijmen , V. (eds.) EUROCRYP T\u00a0 2019 , Part\u00a0III. LNCS , vol. 11478 , pp. 122 \u2013 153 . Springer, Heidelberg (May 2019) [35] Pinkas, B., Schneider, T., Tkachenko, O., Yanai, A.: Efficient circuit-based PSI with linear communication. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT\u00a02019, Part\u00a0III. LNCS, vol. 11478, pp. 122\u2013153. Springer, Heidelberg (May 2019)","journal-title":"Part\u00a0III. LNCS"},{"key":"e_1_3_2_1_36_1","first-page":"125","volume":"10822","author":"Pinkas B.","year":"2018","unstructured":"[ 36 ] Pinkas , B. , Schneider , T. , Weinert , C. , Wieder , U. : Efficient circuit-based PSI via cuckoo hashing. In: Nielsen, J.B., Rijmen , V. (eds.) EUROCRYP T\u00a0 2018 , Part\u00a0III. LNCS , vol. 10822 , pp. 125 \u2013 157 . Springer, Heidelberg (Apr\u00a0\/\u00a0May 2018) [36] Pinkas, B., Schneider, T., Weinert, C., Wieder, U.: Efficient circuit-based PSI via cuckoo hashing. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT\u00a02018, Part\u00a0III. LNCS, vol. 10822, pp. 125\u2013157. Springer, Heidelberg (Apr\u00a0\/\u00a0May 2018)","journal-title":"Part\u00a0III. LNCS"},{"key":"e_1_3_2_1_37_1","first-page":"812","volume-title":"Zohner","author":"Pinkas B.","year":"2014","unstructured":"[ 37 ] Pinkas , B. , Schneider , T. , Zohner , M. : Faster private set intersection based on OT extension. In : Fu, K., Jung, J. (eds.) USENIX Security 2014 . pp. 797\u2013 812 . USENIX Association (Aug 2014) [37] Pinkas, B., Schneider, T., Zohner, M.: Faster private set intersection based on OT extension. In: Fu, K., Jung, J. (eds.) USENIX Security 2014. pp. 797\u2013812. USENIX Association (Aug 2014)"},{"key":"e_1_3_2_1_38_1","first-page":"235","volume":"10210","author":"Rindal P.","year":"2017","unstructured":"[ 38 ] Rindal , P. , Rosulek , M. : Improved private set intersection against malicious adversaries. In: Coron, J.S., Nielsen , J.B. (eds.) EUROCRYP T\u00a0 2017 , Part\u00a0I. LNCS , vol. 10210 , pp. 235 \u2013 259 . Springer, Heidelberg (Apr\u00a0\/\u00a0May 2017) [38] Rindal, P., Rosulek, M.: Improved private set intersection against malicious adversaries. In: Coron, J.S., Nielsen, J.B. (eds.) EUROCRYPT\u00a02017, Part\u00a0I. LNCS, vol. 10210, pp. 235\u2013259. Springer, Heidelberg (Apr\u00a0\/\u00a0May 2017)","journal-title":"Part\u00a0I. LNCS"},{"key":"e_1_3_2_1_39_1","first-page":"1242","volume-title":"Rosulek","author":"Rindal P.","year":"2017","unstructured":"[ 39 ] Rindal , P. , Rosulek , M. : Malicious-secure private set intersection via dual execution. In : Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017 . pp. 1229\u2013 1242 . ACM Press (Oct\u00a0\/\u00a0Nov 2017) [39] Rindal, P., Rosulek, M.: Malicious-secure private set intersection via dual execution. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017. pp. 1229\u20131242. ACM Press (Oct\u00a0\/\u00a0Nov 2017)"},{"key":"e_1_3_2_1_40_1","first-page":"901","volume":"12697","author":"Rindal P.","year":"2021","unstructured":"[ 40 ] Rindal , P. , Schoppmann , P. : VOLE-PSI: Fast OPRF and circuit-PSI from vector-OLE. In : Canteaut, A., Standaert , F.X. (eds.) EUROCRYP T\u00a0 2021 , Part\u00a0II. LNCS , vol. 12697 , pp. 901 \u2013 930 . Springer, Heidelberg (Oct 2021) [40] Rindal, P., Schoppmann, P.: VOLE-PSI: Fast OPRF and circuit-PSI from vector-OLE. In: Canteaut, A., Standaert, F.X. (eds.) EUROCRYPT\u00a02021, Part\u00a0II. LNCS, vol. 12697, pp. 901\u2013930. Springer, Heidelberg (Oct 2021)","journal-title":"Part\u00a0II. LNCS"},{"key":"e_1_3_2_1_41_1","volume-title":"Clifton","author":"Vaidya J.","year":"2005","unstructured":"[ 41 ] Vaidya , J. , Clifton , C. : Secure set intersection cardinality with application to association rule mining. J. Comput. Secur . 13(4), 593\u2013622 ( 2005 ), http:\/\/content.iospress.com\/articles\/journal-of-computer-security\/jcs223 [41] Vaidya, J., Clifton, C.: Secure set intersection cardinality with application to association rule mining. J. Comput. Secur. 13(4), 593\u2013622 (2005), http:\/\/content.iospress.com\/articles\/journal-of-computer-security\/jcs223"},{"key":"e_1_3_2_1_42_1","first-page":"167","volume-title":"27th FOCS.","author":"Yao A.C.C.","unstructured":"[ 42 ] Yao , A.C.C. : How to generate and exchange secrets (extended abstract) . In: 27th FOCS. pp. 162\u2013 167 . IEEE Computer Society Press (Oct 1986) [42] Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th FOCS. pp. 162\u2013167. IEEE Computer Society Press (Oct 1986)"}],"event":{"name":"ASIA CCS '23: ACM ASIA Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Melbourne VIC Australia","acronym":"ASIA CCS '23"},"container-title":["Proceedings of the ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579856.3582826","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:27Z","timestamp":1750182687000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579856.3582826"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,10]]},"references-count":42,"alternative-id":["10.1145\/3579856.3582826","10.1145\/3579856"],"URL":"https:\/\/doi.org\/10.1145\/3579856.3582826","relation":{},"subject":[],"published":{"date-parts":[[2023,7,10]]},"assertion":[{"value":"2023-07-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}