{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:14:42Z","timestamp":1766441682869,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","funder":[{"name":"National Natural Science Foundation of China (NSFC)","award":["62472247,62425201"],"award-info":[{"award-number":["62472247,62425201"]}]},{"name":"National Key R&D Program of China","award":["2024YFB2906803,2022YFB2403900"],"award-info":[{"award-number":["2024YFB2906803,2022YFB2403900"]}]},{"name":"CIE-Smartchip research grant"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,19]]},"DOI":"10.1145\/3719027.3744824","type":"proceedings-article","created":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T23:32:38Z","timestamp":1763854358000},"page":"483-497","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["RingSG: Optimal Secure Vertex-Centric Computation for Collaborative Graph Processing"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-1681-3786","authenticated-orcid":false,"given":"Zhenhua","family":"Zou","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7532-0434","authenticated-orcid":false,"given":"Zhuotao","family":"Liu","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China and State Key Laboratory of Internet Architecture, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6237-986X","authenticated-orcid":false,"given":"Jinyong","family":"Shan","sequence":"additional","affiliation":[{"name":"Beijing Smartchip Microelectronics Technology Co., Ltd., Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8776-8730","authenticated-orcid":false,"given":"Qi","family":"Li","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China and State Key Laboratory of Internet Architecture, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2587-8517","authenticated-orcid":false,"given":"Ke","family":"Xu","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China and State Key Laboratory of Internet Architecture, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4847-4585","authenticated-orcid":false,"given":"Mingwei","family":"Xu","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China and State Key Laboratory of Internet Architecture, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,11,22]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2025. Complete guide to GDPR compliance. https:\/\/gdpr.eu\/ Accessed: 2025-05-01."},{"volume-title":"The Free Encyclopedia. https:\/\/en.wikipedia.org\/wiki\/Connected-component_labeling, Accessed: 2025-05-01.","key":"e_1_3_2_1_2_1","unstructured":"2025. Connected-component labeling \u2014 Wikipedia, The Free Encyclopedia. https:\/\/en.wikipedia.org\/wiki\/Connected-component_labeling, Accessed: 2025-05-01."},{"key":"e_1_3_2_1_3_1","unstructured":"2025. PageRank \u2014 Wikipedia The Free Encyclopedia. https:\/\/en.wikipedia.org\/ wiki\/PageRank Accessed: 2025-05-01."},{"volume-title":"The Free Encyclopedia. https:\/\/en.wikipedia.org\/wiki\/Shortest_path_problem, Accessed: 2025-05-01.","key":"e_1_3_2_1_4_1","unstructured":"2025. Shortest path problem \u2014 Wikipedia, The Free Encyclopedia. https:\/\/en.wikipedia.org\/wiki\/Shortest_path_problem, Accessed: 2025-05-01."},{"key":"e_1_3_2_1_5_1","first-page":"971","article-title":"An Improved Protocol for Securely Solving the Shortest Path Problem and its Application to Combinatorial Auctions","volume":"2017","author":"Aly Abdelrahaman","year":"2017","unstructured":"Abdelrahaman Aly and Sara Cleemput. 2017. An Improved Protocol for Securely Solving the Shortest Path Problem and its Application to Combinatorial Auctions. IACR Cryptol. ePrint Arch. 2017 (2017), 971.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-17143-7_37"},{"key":"e_1_3_2_1_7_1","volume-title":"Information Security and Cryptology-ICISC 2014: 17th International Conference","author":"Aly Abdelrahaman","year":"2014","unstructured":"Abdelrahaman Aly and Mathieu Van Vyve. 2015. Securely solving classical network flow problems. In Information Security and Cryptology-ICISC 2014: 17th International Conference, Seoul, South Korea, December 3--5, 2014, Revised Selected Papers 17. Springer, 205--221."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.3390\/cryptography5040027"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978331"},{"volume-title":"Secure Graph Analysis at Scale (CCS '21)","author":"Araki Toshinori","key":"e_1_3_2_1_10_1","unstructured":"Toshinori Araki, Jun Furukawa, Kazuma Ohara, Benny Pinkas, Hanan Rosemarin, and Hikaru Tsuchida. 2021. Secure Graph Analysis at Scale (CCS '21). Association for Computing Machinery, New York, NY, USA, 610--629."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560695"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560695"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_13"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64840-4_12"},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings, Part III 38","author":"Chida Koji","year":"2018","unstructured":"Koji Chida, Daniel Genkin, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Yehuda Lindell, and Ariel Nof. 2018. Fast large-scale honest-majority MPC for malicious adversaries. In Advances in Cryptology--CRYPTO 2018: 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19--23, 2018, Proceedings, Part III 38. Springer, 34--64."},{"key":"e_1_3_2_1_16_1","unstructured":"Steven M. D'Antuono. 2018. Combating Money Laundering and Other Forms of Illicit Finance: Regulator and Law Enforcement Perspectives on Reform. https:\/\/www.fbi.gov\/news\/testimony\/combating-money-laundering-and-otherforms-of-illicit-finance Accessed: 2025-05-01."},{"key":"e_1_3_2_1_17_1","unstructured":"Frankfurt. 2022. Enhancing cooperation in the fight against money laundering. https:\/\/www.bankingsupervision.europa.eu\/press\/blog\/2022\/html\/ssm. blog220524 8e08209118.en.html Accessed: 2025-05-01."},{"key":"e_1_3_2_1_18_1","volume-title":"Privacy-Preserving Epidemiological Modeling on Mobile Graphs. arXiv preprint arXiv:2206.00539","author":"G\u00fcnther Daniel","year":"2022","unstructured":"Daniel G\u00fcnther, Marco Holz, Benjamin Judkewitz, Helen M\u00f6llering, Benny Pinkas, Thomas Schneider, and Ajith Suresh. 2022. Privacy-Preserving Epidemiological Modeling on Mobile Graphs. arXiv preprint arXiv:2206.00539 (2022)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2023-0021"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00176"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417872"},{"key":"e_1_3_2_1_22_1","volume-title":"Advances in Cryptology--ASIACRYPT 2014: 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, ROC, December 7--11","author":"Keller Marcel","year":"2014","unstructured":"Marcel Keller and Peter Scholl. 2014. Efficient, oblivious data structures for MPC. In Advances in Cryptology--ASIACRYPT 2014: 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, ROC, December 7--11, 2014, Proceedings, Part II 20. Springer, 506--525."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3670393"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735517"},{"key":"e_1_3_2_1_25_1","volume-title":"33th USENIX Security Symposium (USENIX Security 24)","author":"Lycklama Hidde","year":"2024","unstructured":"Hidde Lycklama, Alexander Viand, Nicolas K\u00fcchler, Christian Knabenhans, and Anwar Hithnawi. 2024. Holding secrets accountable: Auditing privacy-preserving machine learning. In 33th USENIX Security Symposium (USENIX Security 24). USENIX Association."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"volume-title":"Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security","author":"Mazloom Sahar","key":"e_1_3_2_1_27_1","unstructured":"Sahar Mazloom and S. Dov Gordon. 2018. Secure Computation with Differentially Private Access Patterns. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (Toronto, Canada) (CCS '18). Association for Computing Machinery, New York, NY, USA, 490--507."},{"volume-title":"29th USENIX Security Symposium (USENIX Security 20)","author":"Mazloom Sahar","key":"e_1_3_2_1_28_1","unstructured":"Sahar Mazloom, Phi Hung Le, Samuel Ranellucci, and S. Dov Gordon. 2020. Secure parallel computation on national scale volumes of data. In 29th USENIX Security Symposium (USENIX Security 20). USENIX Association, 2487--2504."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243760"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3423358"},{"key":"e_1_3_2_1_31_1","volume-title":"Advances in Cryptology -- EUROCRYPT","author":"Mohassel Payman","year":"2013","unstructured":"Payman Mohassel and Saeed Sadeghian. 2013. Howto Hide Circuits in MPC an Efficient Framework for Private Function Evaluation. In Advances in Cryptology -- EUROCRYPT 2013, Thomas Johansson and Phong Q. Nguyen (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 557--574."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_33"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.12"},{"key":"e_1_3_2_1_34_1","volume-title":"GraphSC: Parallel Secure Computation Made Easy. In 2015 IEEE Symposium on Security and Privacy. 377--394","author":"Nayak Kartik","year":"2015","unstructured":"Kartik Nayak, Xiao Shaun Wang, Stratis Ioannidis, Udi Weinsberg, Nina Taft, and Elaine Shi. 2015. GraphSC: Parallel Secure Computation Made Easy. In 2015 IEEE Symposium on Security and Privacy. 377--394."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68400-5_3"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417274"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP46215.2023.10179468"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32101-7_35"},{"key":"e_1_3_2_1_39_1","unstructured":"Connie Diaz De Teran. 2023. Collaboration Is Key in the Fight Against Anti-Money Laundering. https:\/\/www.paymentsjournal.com\/collaboration-is-key-in-the-fightagainst-anti-money-laundering\/ Accessed: 2025-05-01."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382751"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3670300"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","unstructured":"Zhenhua Zou Zhuotao Liu Jinyong Shan Qi Li Ke Xu and Mingwei Xu. 2024. CoGNN: Towards Secure and Efficient Collaborative Graph Learning (Artifacts). https:\/\/doi.org\/10.5281\/zenodo.11210094","DOI":"10.5281\/zenodo.11210094"},{"key":"e_1_3_2_1_43_1","unstructured":"Zhenhua Zou Zhuotao Liu Jinyong Shan Qi Li Ke Xu and Mingwei Xu. 2025. RingSG: Optimal Secure Vertex-Centric Computation for Collaborative Graph Processing. Cryptology ePrint Archive Paper 2025\/1209. https:\/\/eprint.iacr.org\/2025\/1209"},{"key":"e_1_3_2_1_44_1","unstructured":"David Lewis Zo\u00eb Newman Howard Cooper. 2022. Collaboration is key: how central banks are tackling money laundering. https:\/\/www.centralbanking.com\/centralbanks\/ governance\/7937741\/collaboration-is-key-how-central-banks-are-tacklingmoney-laundering Accessed: 2025-05-01."}],"event":{"name":"CCS '25: ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Taipei Taiwan","acronym":"CCS '25"},"container-title":["Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719027.3744824","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:11:08Z","timestamp":1766441468000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719027.3744824"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":44,"alternative-id":["10.1145\/3719027.3744824","10.1145\/3719027"],"URL":"https:\/\/doi.org\/10.1145\/3719027.3744824","relation":{},"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"2025-11-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}