{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T11:40:03Z","timestamp":1755862803464,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,2,2]],"date-time":"2024-02-02T00:00:00Z","timestamp":1706832000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072207"],"award-info":[{"award-number":["62072207"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangdong Basic and Applied Basic Research Foundation","award":["2022A1515140090"],"award-info":[{"award-number":["2022A1515140090"]}]},{"name":"Doctoral Scientific Research Foundation of Huizhou University","award":["2020JB059"],"award-info":[{"award-number":["2020JB059"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,2,2]]},"DOI":"10.1145\/3651671.3651682","type":"proceedings-article","created":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T18:55:50Z","timestamp":1717786550000},"page":"65-72","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Break Two PSI-CA Protocols in Polynomial Time"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1015-5279","authenticated-orcid":false,"given":"Yang","family":"Tan","sequence":"first","affiliation":[{"name":"Decision Department, Shenzhen Qianhai Xinxin Digital Technology Co., Ltd., China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-2420-3843","authenticated-orcid":false,"given":"Bo","family":"Lv","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Huizhou University, China"}]}],"member":"320","published-online":{"date-parts":[[2024,6,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872771"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054851"},{"volume-title":"The Decision Diffie-Hellman problem","author":"Boneh Dan","key":"e_1_3_2_1_4_1","unstructured":"Dan Boneh. 1998. The Decision Diffie-Hellman problem. In Algorithmic Number Theory, Joe\u00a0P. Buhler (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 48\u201363."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35404-5_17"},{"volume-title":"Provable Security, Man-Ho Au and Atsuko Miyaji (Eds.)","author":"Debnath Sumit\u00a0Kumar","key":"e_1_3_2_1_6_1","unstructured":"Sumit\u00a0Kumar Debnath and Ratna Dutta. 2015. Efficient Private Set Intersection Cardinality in the Presence of Malicious Adversaries. In Provable Security, Man-Ho Au and Atsuko Miyaji (Eds.). Springer International Publishing, Cham, 326\u2013339."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23318-5_12"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2020071"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2721360"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19962-7_24"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39568-7_2"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55220-5_12"},{"key":"e_1_3_2_1_13_1","volume-title":"On Deploying Secure Computing: Private Intersection-Sum-with-Cardinality. In 2020 IEEE European Symposium on Security and Privacy (EuroS&P). IEEE, 370\u2013389","author":"Ion Mihaela","year":"2020","unstructured":"Mihaela Ion, Ben Kreuter, Ahmet\u00a0Erhan Nergiz, Sarvar Patel, Shobhit Saxena, Karn Seth, Mariana Raykova, David Shanahan, and Moti Yung. 2020. On Deploying Secure Computing: Private Intersection-Sum-with-Cardinality. In 2020 IEEE European Symposium on Security and Privacy (EuroS&P). IEEE, 370\u2013389."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45472-5_13"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Matt Lepinski and Stephen Kent. 2008. Additional Diffie-Hellman groups for use with ietf standards. Technical Report. RFC 5114 January.","DOI":"10.17487\/rfc5114"},{"key":"e_1_3_2_1_16_1","volume-title":"Mistakes of A Popular Protocol Calculating Private Set Intersection and Union Cardinality and Its Corrections. arXiv preprint arXiv:2207.13277","author":"Tan Yang","year":"2022","unstructured":"Yang Tan and Bo Lv. 2022. Mistakes of A Popular Protocol Calculating Private Set Intersection and Union Cardinality and Its Corrections. arXiv preprint arXiv:2207.13277 (2022)."},{"key":"e_1_3_2_1_17_1","volume-title":"Fermat\u2019s little theorem. https:\/\/mathworld. wolfram. com\/","author":"Weisstein W","year":"2004","unstructured":"Eric\u00a0W Weisstein. 2004. Fermat\u2019s little theorem. https:\/\/mathworld. wolfram. com\/ (2004)."}],"event":{"name":"ICMLC 2024: 2024 16th International Conference on Machine Learning and Computing","acronym":"ICMLC 2024","location":"Shenzhen China"},"container-title":["Proceedings of the 2024 16th International Conference on Machine Learning and Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3651671.3651682","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3651671.3651682","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T11:19:45Z","timestamp":1755861585000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3651671.3651682"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,2]]},"references-count":17,"alternative-id":["10.1145\/3651671.3651682","10.1145\/3651671"],"URL":"https:\/\/doi.org\/10.1145\/3651671.3651682","relation":{},"subject":[],"published":{"date-parts":[[2024,2,2]]},"assertion":[{"value":"2024-06-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}