{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T22:59:45Z","timestamp":1773269985981,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":44,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819562022","type":"print"},{"value":"9789819562039","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-6203-9_2","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:29:29Z","timestamp":1767320969000},"page":"23-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Concretely Efficient Constructions for\u00a0Differentially Private Set Intersection"],"prefix":"10.1007","author":[{"given":"Xinyu","family":"Peng","sequence":"first","affiliation":[]},{"given":"Yufei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Weiran","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Liqiang","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Feng","family":"Han","sequence":"additional","affiliation":[]},{"given":"Li","family":"Duan","sequence":"additional","affiliation":[]},{"given":"Zhen","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Jianling","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Yuan","family":"Hong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"issue":"11","key":"2_CR1","doi-asserted-by":"publisher","first-page":"2691","DOI":"10.14778\/3407790.3407854","volume":"13","author":"J Bater","year":"2020","unstructured":"Bater, J., Park, Y., He, X., Wang, X., Rogers, J.: SAQE: practical privacy-preserving approximate query processing for data federations. Proc. VLDB Endow. 13(11), 2691\u20132705 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Bittau, A., et al.: Prochlo: strong privacy for analytics in the crowd. In: SOSP 2017, pp. 441\u2013459. ACM (2017)","DOI":"10.1145\/3132747.3132769"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Boyle, E., et al.: Efficient two-round ot extension and silent non-interactive secure computation. In: CCS 2019, pp. 291\u2013308. ACM (2019)","DOI":"10.1145\/3319535.3354255"},{"issue":"3","key":"2_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory 6(3), 1\u201336 (2014)","journal-title":"ACM Trans. Comput. Theory"},{"key":"2_CR5","unstructured":"Canonne, C.L., Kamath, G., Steinke, T.: The discrete gaussian for differential privacy. In: NeurIPS 2020. NeurIPS Foundation (2020)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Chandran, N., Gupta, D., Shah, A.: Circuit-psi with linear complexity via relaxed batch opprf. Proceedings on Privacy Enhancing Technologies Symposium (2022)","DOI":"10.2478\/popets-2022-0018"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Chen, Y., Zhang, M., Zhang, C., Dong, M., Liu, W.: Private set operations from multi-query reverse private membership test. In: PKC 2024, pp. 387\u2013416. Springer, Switzerland (2024)","DOI":"10.1007\/978-3-031-57725-3_13"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Couteau, G., Rindal, P., Raghuraman, S.: Silver: silent vole and oblivious transfer from hardness of decoding structured ldpc codes. In: Crypto 2021. Springer (2021)","DOI":"10.1007\/978-3-030-84252-9_17"},{"key":"2_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"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Duchi, J.C., Jordan, M.I., Wainwrigh, M.J.: Local privacy and statistical minimax rates. In: FOCS 2013 (2013)","DOI":"10.1109\/FOCS.2013.53"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Found. Trends Theoretical Comput. Sci. 9(3\u20134), 211\u2013407 (2014)","DOI":"10.1561\/0400000042"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Edmonds, A., Nikolov, A., Ullman, J.R.: The power of factorization mechanisms in local and central differential privacy. In: STOC 2020, pp. 425\u2013438. ACM (2020)","DOI":"10.1145\/3357713.3384297"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Erlingsson, \u00da., Pihur, V., Korolova, A.: RAPPOR: randomized aggregatable privacy-preserving ordinal response. In: CCS 2014, pp. 1054\u20131067. ACM (2014)","DOI":"10.1145\/2660267.2660348"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Garimella, G., Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: Oblivious key-value stores and amplification for private set intersection. In: Crypto 2021. Springer (2021)","DOI":"10.1007\/978-3-030-84245-1_14"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC 2009, pp. 169\u2013178. ACM (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"2_CR16","unstructured":"Goldreich, O.: Foundations of cryptography: Basic Applications, vol. 2. Cambridge University Press (2009)"},{"issue":"3","key":"2_CR17","doi-asserted-by":"publisher","first-page":"6","DOI":"10.2478\/popets-2019-0034","volume":"2019","author":"A Groce","year":"2019","unstructured":"Groce, A., Rindal, P., Rosulek, M.: Cheaper private set intersection via differentially private leakage. Proc. Priv. Enhancing Technol. 2019(3), 6\u201325 (2019)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"2_CR18","unstructured":"Guo, X., Han, Y., Liu, Z., Wang, D., Jia, Y., Li, J.: Birds of a feather flock together: How set bias helps to deanonymize you via revealed intersection sizes. In: USENIX Security 2022, pp. 1487\u20131504. USENIX (2022)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Haney, S., Machanavajjhala, A., Abowd, J.M., Graham, M., Kutzbach, M., Vilhuber, L.: Utility cost of formal privacy for releasing national employer-employee statistics. In: SIGMOD 2017, pp. 1339\u20131354. ACM (2017)","DOI":"10.1145\/3035918.3035940"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"He, X., Machanavajjhala, A., Flynn, C., Srivastava, D.: Composing differential privacy and secure computation: a case study on scaling private record linkage. In: CCS 2017, pp. 1389\u20131406. ACM (2017)","DOI":"10.1145\/3133956.3134030"},{"key":"2_CR21","unstructured":"Information Commissioner\u2019s Office: Chapter 5: Privacy-enhancing technologies (2022)"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Ion, M., et al.: On deploying secure computing: Private intersection-sum-with-cardinality. In: EuroS &P 2020, pp. 370\u2013389. IEEE (2020)","DOI":"10.1109\/EuroSP48549.2020.00031"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Crypto 2003, pp. 145\u2013161. Springer (2003)","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Jiang, B., Du, J., Yan, Q.: Anonpsi: An anonymity assessment framework for PSI. Cryptology ePrint Archive (2024)","DOI":"10.14722\/ndss.2024.241279"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Kacsmar, B., et al.: Differentially private two-party set operations. In: EuroS &P 2020, pp. 390\u2013404. IEEE (2020)","DOI":"10.1109\/EuroSP48549.2020.00032"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N.: Efficient batched oblivious prf with applications to private set intersection. In: CCS 2016. ACM (2016)","DOI":"10.1145\/2976749.2978381"},{"issue":"6","key":"2_CR27","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/s00778-015-0398-x","volume":"24","author":"C Li","year":"2015","unstructured":"Li, C., Miklau, G., Hay, M., McGregor, A., Rastogi, V.: The matrix mechanism: optimizing linear counting queries under differential privacy. VLDB J. 24(6), 757\u2013781 (2015). https:\/\/doi.org\/10.1007\/s00778-015-0398-x","journal-title":"VLDB J."},{"key":"2_CR28","unstructured":"Mahdavi, R.A., et al.: PEPSI: practically efficient private set intersection in the unbalanced setting. In: USENIX Security 2024. USENIX Association (2024)"},{"key":"2_CR29","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: S &P 1986. IEEE (1986)","DOI":"10.1109\/SP.1986.10022"},{"key":"2_CR30","unstructured":"Narayan, A., Haeberlen, A.: Djoin: differentially private join queries over distributed databases. In: OSDI 2012, pp. 149\u2013162. USENIX (2012)"},{"key":"2_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44676-1_10","volume-title":"Algorithms \u2014 ESA 2001","author":"R Pagh","year":"2001","unstructured":"Pagh, R., Rodler, F.F.: Cuckoo hashing. In: auf der Heide, F.M. (ed.) ESA 2001. LNCS, vol. 2161, pp. 121\u2013133. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44676-1_10"},{"key":"2_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":"2_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/978-3-030-45724-2_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"B Pinkas","year":"2020","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: PSI from PaXoS: fast, malicious private set intersection. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 739\u2013767. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_25"},{"key":"2_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":"2_CR35","doi-asserted-by":"crossref","unstructured":"Raghuraman, S., Rindal, P.: Blazing fast psi from improved okvs and subfield vole. In: CCS 2022, pp. 2505\u20132517. ACM (2022)","DOI":"10.1145\/3548606.3560658"},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"Rindal, P., Rosulek, M.: Malicious-secure private set intersection via dual execution. In: CCS 2017. pp. 1229\u20131242. ACM (2017)","DOI":"10.1145\/3133956.3134044"},{"key":"2_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1007\/978-3-030-77886-6_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"P Rindal","year":"2021","unstructured":"Rindal, P., Schoppmann, P.: VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 901\u2013930. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_31"},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Wang, Y., Yi, K.: Secure yannakakis: Join-aggregate queries over private data. In: SIGMOD 2021, pp. 1969\u20131981. ACM (2021)","DOI":"10.1145\/3448016.3452808"},{"issue":"309","key":"2_CR39","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/01621459.1965.10480775","volume":"60","author":"SL Warner","year":"1965","unstructured":"Warner, S.L.: Randomized response: a survey technique for eliminating evasive answer bias. J. Am. Stat. Assoc. 60(309), 63\u201369 (1965)","journal-title":"J. Am. Stat. Assoc."},{"key":"2_CR40","unstructured":"Yagisawa, M.: Fully homomorphic encryption without bootstrapping. Cryptology ePrint Archive (2015). https:\/\/eprint.iacr.org\/2011\/277"},{"key":"2_CR41","doi-asserted-by":"crossref","unstructured":"Yang, K., Weng, C., Lan, X., Zhang, J., Wang, X.: Ferret: fast extension for correlated ot with small communication. In: CCS 2020 (2020)","DOI":"10.1145\/3372297.3417276"},{"key":"2_CR42","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: FOCS 1986. IEEE (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"2_CR43","doi-asserted-by":"crossref","unstructured":"Yuan, G., Yang, Y., Zhang, Z., Hao, Z.: Convex optimization for linear query processing under approximate differential privacy. In: SIGKDD 2016. ACM (2016)","DOI":"10.1145\/2939672.2939818"},{"key":"2_CR44","unstructured":"Zhang, C., Chen, Y., Liu, W., Zhang, M., Lin, D.: Linear private set union from $$\\{$$Multi-Query$$\\}$$ reverse private membership test. In: USENIX Security 2023, pp. 337\u2013354. USENIX (2023)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-6203-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T07:36:27Z","timestamp":1773214587000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-6203-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819562022","9789819562039"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-6203-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Inscrypt","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cisc22025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/inscrypt2025.xidian.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}