{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:01:10Z","timestamp":1783008070379,"version":"3.54.5"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031092336","type":"print"},{"value":"9783031092343","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09234-3_29","type":"book-chapter","created":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T07:23:45Z","timestamp":1655450625000},"page":"585-604","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["PSI-Stats: Private Set Intersection Protocols Supporting Secure Statistical Functions"],"prefix":"10.1007","author":[{"given":"Jason H. M.","family":"Ying","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuwei","family":"Cao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Geong Sen","family":"Poh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jia","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hoon Wei","family":"Lim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,6,18]]},"reference":[{"key":"29_CR1","unstructured":"IEEE 754-2019 - IEEE Standard for Floating-Point Arithmetic. standards.ieee.org"},{"key":"29_CR2","unstructured":"Kaggle. https:\/\/www.kaggle.com\/uciml\/default-of-credit-card-clients-dataset"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Evfimievski, A., Srikant, R.: Information sharing across private databases. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 86\u201397 (2003)","DOI":"10.1145\/872757.872771"},{"issue":"3","key":"29_CR4","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0022-0531(70)90039-6","volume":"2","author":"AB Atkinson","year":"1970","unstructured":"Atkinson, A.B.: On the measurement of inequality. J. Econ. Theor. 2(3), 244\u2013263 (1970)","journal-title":"J. Econ. Theor."},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Baldi, P., Baronio, R., Cristofaro, E.D., Gasti, P., Tsudik, G.: Countering GATTACA: efficient and secure testing of fully-sequenced human genomes. In: ACM Conference on Computer and Communications Security, pp. 691\u2013702 (2011)","DOI":"10.1145\/2046707.2046785"},{"issue":"57","key":"29_CR6","first-page":"1","volume":"800","author":"E Barker","year":"2016","unstructured":"Barker, E.: Recommendation for key management part 1: general (revision 4). NIST Spec. Publ. 800(57), 1\u2013147 (2016)","journal-title":"NIST Spec. Publ."},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Theory of Cryptography Conference, pp. 325\u2013341 (2005)","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Chase, M., Miao, P.: Private set intersection in the internet setting from lightweight oblivious prf. In: Annual International Cryptology Conference, CRYPTO 2020, pp. 34\u201363 (2020)","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: ASIACRYPT 2017, pp. 409\u2013437 (2017)","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Ciampi, M., Orlandi, C.: Combining private set-intersection with secure two-party computation. In: International Conference on Security and Cryptography for Networks, pp. 464\u2013482 (2018)","DOI":"10.1007\/978-3-319-98113-0_25"},{"key":"29_CR11","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"},{"key":"29_CR12","unstructured":"Dheeru, D., Taniskidou, E.K.: UCI Machine Learning Repository (2017)"},{"key":"29_CR13","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 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS 2013, pp. 789\u2013800 (2013)","DOI":"10.1145\/2508859.2516701"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Durlauf, S.N., Blume, L.E.: The New Palgrave Dictionary of Economics, vol. 6 (2008)","DOI":"10.1057\/b.9780631218234.2009.X"},{"key":"29_CR15","unstructured":"Falk, B.H., Noble, D., Ostrovsky, R.: Private set intersection with linear communication from general assumptions. In: Proceedings of the 18th ACM Workshop on Privacy in the Electronic Society, pp. 14\u201325 (2019)"},{"issue":"1","key":"29_CR16","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00145-014-9190-0","volume":"29","author":"MJ Freedman","year":"2016","unstructured":"Freedman, M.J., Hazay, C., Nissim, K., Pinkas, B.: Efficient set intersection with simulation-based security. J. Cryptol. 29(1), 115\u2013155 (2016)","journal-title":"J. Cryptol."},{"key":"29_CR17","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":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-030-75248-4_21","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"G Garimella","year":"2021","unstructured":"Garimella, G., Mohassel, P., Rosulek, M., Sadeghian, S., Singh, J.: Private set operations from oblivious switching. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12711, pp. 591\u2013617. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_21"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Hallgren, P., Orlandi, C., Sabelfeld, A.: PrivatePool: privacy-preserving ridesharing. In: 2017 IEEE 30th Computer Security Foundations Symposium (CSF), pp. 276\u2013291 (2017)","DOI":"10.1109\/CSF.2017.24"},{"key":"29_CR21","unstructured":"Huang, Y., Evans, D., Katz, J.: Private set intersection: are garbled circuits better than custom protocols? In: Network and Distributed System Security, NDSS 2012 (2012)"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Ion, M., et al.: On deploying secure computing: private intersection-sum-with-cardinality. In: IEEE European Symposium on Security and Privacy, EuroS&P 2020, pp. 370\u2013389 (2020)","DOI":"10.1109\/EuroSP48549.2020.00031"},{"key":"29_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145\u2013161. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9"},{"key":"29_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-40084-1_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"V Kolesnikov","year":"2013","unstructured":"Kolesnikov, V., Kumaresan, R.: Improved OT extension for transferring short secrets. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 54\u201370. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_4"},{"key":"29_CR25","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N.: Efficient batched oblivious PRF with applications to private set intersection. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS 2016, pp. 818\u2013829 (2016)","DOI":"10.1145\/2976749.2978381"},{"key":"29_CR26","doi-asserted-by":"crossref","unstructured":"Meadows, C.: A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. In: Symposium on Security and Privacy, S&P 1986, pp. 134\u2013137 (1986)","DOI":"10.1109\/SP.1986.10022"},{"key":"29_CR27","unstructured":"Moro, S., Laureano, R., Cortez, P.: Using data mining for bank direct marketing: an application of the CRISP-DM methodology. In: Proceedings of the European Simulation and Modelling Conference, ESM 2011, pp. 117\u2013121 (2011)"},{"key":"29_CR28","unstructured":"Nagaraja, S., Mittal, P., Hong, C., Caesar, M., Borisov, N.: BotGrep: finding P2P bots with structured graph analysis. In: USENIX Security Symposium, pp. 95\u2013110 (2010)"},{"key":"29_CR29","unstructured":"Narayanan, A., Thiagarajan, N., Lakhani, M., Hamburg, M., Boneh, D.: Location privacy via private proximity testing. In: NDSS, vol. 11 (2011)"},{"key":"29_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-319-52153-4_22","volume-title":"Topics in Cryptology \u2013 CT-RSA 2017","author":"M Orr\u00f9","year":"2017","unstructured":"Orr\u00f9, M., Orsini, E., Scholl, P.: Actively secure 1-out-of-N OT extension with application to private set intersection. In: Handschuh, H. (ed.) CT-RSA 2017. LNCS, vol. 10159, pp. 381\u2013396. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-52153-4_22"},{"key":"29_CR31","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). https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"key":"29_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-030-26954-8_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"B Pinkas","year":"2019","unstructured":"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 2019. LNCS, vol. 11694, pp. 401\u2013431. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_13"},{"key":"29_CR33","unstructured":"Pinkas, B., Schneider, T., Segev, G., Zohner, M.: Phasing: private set intersection using permutation-based hashing. In: 24th USENIX Security Symposium, USENIX Security 2015, pp. 515\u2013530 (2015)"},{"key":"29_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-030-17659-4_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"B Pinkas","year":"2019","unstructured":"Pinkas, B., Schneider, T., Tkachenko, O., Yanai, A.: Efficient circuit-based PSI with linear communication. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 122\u2013153. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_5"},{"key":"29_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-78372-7_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"B Pinkas","year":"2018","unstructured":"Pinkas, B., Schneider, T., Weinert, C., Wieder, U.: Efficient circuit-based PSI via Cuckoo hashing. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 125\u2013157. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_5"},{"key":"29_CR36","unstructured":"Pinkas, B., Schneider, T., Zohner, M.: Faster private set intersection based on OT extension. In: USENIX Security Symposium, vol. 14, pp. 797\u2013812 (2014)"},{"issue":"2","key":"29_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3154794","volume":"21","author":"B Pinkas","year":"2018","unstructured":"Pinkas, B., Schneider, T., Zohner, M.: Scalable private set intersection based on OT extension. ACM Trans. Priv. Secur. (TOPS) 21(2), 1\u201335 (2018)","journal-title":"ACM Trans. Priv. Secur. (TOPS)"},{"issue":"2","key":"29_CR38","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"29_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-642-39884-1_23","volume-title":"Financial Cryptography and Data Security","author":"T Schneider","year":"2013","unstructured":"Schneider, T., Zohner, M.: GMW vs. Yao? Efficient secure two-party computation with low depth circuits. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 275\u2013292. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39884-1_23"},{"key":"29_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1007\/3-540-10003-2_100","volume-title":"Automata, Languages and Programming","author":"A Shamir","year":"1980","unstructured":"Shamir, A.: On the power of commutativity in cryptography. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 582\u2013595. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10003-2_100"},{"key":"29_CR41","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science, SFCS 1986, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"},{"issue":"1","key":"29_CR42","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1515\/popets-2017-0010","volume":"2017","author":"Y Zhao","year":"2017","unstructured":"Zhao, Y., Chow, S.S.M.: Are you the one to share? Secret transfer with access structure. Proc. Priv. Enhancing Technol. 2017(1), 149\u2013169 (2017)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"29_CR43","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Chow, S.S.M.: Can you find the one for me? In: Proceedings of the Workshop on Privacy in the Electronic Society, pp. 54\u201365 (2018)","DOI":"10.1145\/3267323.3268965"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09234-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T19:41:43Z","timestamp":1671478903000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09234-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031092336","9783031092343"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09234-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"18 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/di.uniroma1.it\/acns2022\/","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":"185","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":"44","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":"5","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":"24% - 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":"3.7","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":"5","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)"}},{"value":"For the Workshops, 52 papers were submitted, from which 31 were accepted. Additionally they include 5 posters.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}