{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:27:25Z","timestamp":1766442445640,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":61,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,19]]},"DOI":"10.1145\/3719027.3765050","type":"proceedings-article","created":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T23:37:25Z","timestamp":1763854645000},"page":"3679-3693","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Correlation-Aware Secure Sorting and Permutation for Iterative Two-Party Graph Analysis"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-0279-0539","authenticated-orcid":false,"given":"Yunyi","family":"Chen","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China and Ant Group, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6643-4405","authenticated-orcid":false,"given":"Jiping","family":"Yu","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China and Ant Group, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2370-5372","authenticated-orcid":false,"given":"Kun","family":"Chen","sequence":"additional","affiliation":[{"name":"Ant Group, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6962-643X","authenticated-orcid":false,"given":"Xiaoyu","family":"Fan","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China and Ant Group, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3880-308X","authenticated-orcid":false,"given":"Xiaowei","family":"Zhu","sequence":"additional","affiliation":[{"name":"Ant Group, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4281-1018","authenticated-orcid":false,"given":"Wenguang","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Computer Science and SIGS, Tsinghua University, Bejing and Shenzhen, China and Ant Group, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2025,11,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2021-0010"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_9"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1465482.1465560"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484560"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516738"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978410"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237996"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100287"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.39"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/p10008"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4337\/9781035304998.00010"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/3625054.3625067"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64840-4_12"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23113"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/508171.508174"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1021\/acs.jcim.5b00036"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462078"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/6490.6503"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","unstructured":"Oded Goldreich Silvio Micali and Avi Wigderson. 2019. How to play any mental game or a completeness theorem for protocols with honest majority. ACM 307\u2013328. https:\/\/doi.org\/10.1145\/3335741.3335755","DOI":"10.1145\/3335741.3335755"},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation (OSDI'12)","author":"Gonzalez Joseph E.","year":"2012","unstructured":"Joseph E. Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012. PowerGraph: distributed graph-parallel computation on natural graphs. In Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation (OSDI'12). USENIX Association, 17\u201330."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00016"},{"key":"e_1_3_2_1_26_1","unstructured":"Koki Hamada Dai Ikarashi Koji Chida and Katsumi Takahashi. 2014. Oblivious Radix Sort: An Efficient Sorting Algorithm for Practical Secure Multi-party Computation. Cryptology ePrint Archive Paper 2014\/121. https:\/\/eprint.iacr.org\/2014\/121"},{"key":"e_1_3_2_1_27_1","volume-title":"Information Security and Cryptology - ICISC","author":"Hamada Koki","year":"2012","unstructured":"Koki Hamada, Ryo Kikuchi, Dai Ikarashi, Koji Chida, and Katsumi Takahashi. 2013. Practically Efficient Multi-party Sorting Protocols from Comparison Sort Algorithms. In Information Security and Cryptology - ICISC 2012. Springer Berlin Heidelberg, 202-216."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.2307\/2346830"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2019.05.020"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503246"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3411501.3419433"},{"key":"e_1_3_2_1_32_1","unstructured":"Intel Corporation. 2023. Intel\u00ae 64 and IA-32 Architectures Software Developer's Manual: Volume 2A Instruction Set Reference A\u2013L. https:\/\/www.intel.com\/content\/www\/us\/en\/developer\/articles\/technical\/intel-sdm.html"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"e_1_3_2_1_34_1","unstructured":"Donald Ervin Knuth. 1997. The Art of Computer Programming. Pearson Education."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3670393"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2022.24058"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321705.3329803"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1868447.1868466"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/nstsi.2011.6111993"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243851"},{"volume-title":"Proceedings of the 29th USENIX Conference on Security Symposium (SEC'20)","author":"Mazloom Sahar","key":"e_1_3_2_1_42_1","unstructured":"Sahar Mazloom, Phi Hung Le, Samuel Ranellucci, and S. Dov Gordon. 2020. Secure parallel computation on national scale volumes of data. In Proceedings of the 29th USENIX Conference on Security Symposium (SEC'20). USENIX Association, Article 140, 18 pages."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54970-4_2"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/365411.365502"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.30"},{"key":"e_1_3_2_1_46_1","volume-title":"Smart, and Stephen C. Williams","author":"Pinkas Benny","year":"2009","unstructured":"Benny Pinkas, Thomas Schneider, Nigel P. Smart, and Stephen C. Williams. 2009. Secure Two-Party Computation Is Practical. In Advances in Cryptology - ASIACRYPT 2009. Springer Berlin Heidelberg, 250-267."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/3746405.3746424"},{"key":"e_1_3_2_1_48_1","unstructured":"Michael O. Rabin. 2005. How To Exchange Secrets with Oblivious Transfer. Cryptology ePrint Archive Paper 2005\/187. https:\/\/eprint.iacr.org\/2005\/187"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32101-7_35"},{"volume-title":"What is social network analysis?","author":"Scott John","key":"e_1_3_2_1_50_1","unstructured":"John Scott. 2012. What is social network analysis?, Bloomsbury Academic."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.32"},{"key":"e_1_3_2_1_52_1","volume-title":"Yuji Watanabe, Pablo Loyola, Daniel Klyashtorny, Heiko Ludwig, and Kumar Bhaskaran.","author":"Suzumura Toyotaro","year":"2019","unstructured":"Toyotaro Suzumura, Yi Zhou, Natahalie Baracaldo, Guangnan Ye, Keith Houck, Ryo Kawahara, Ali Anwar, Lucia Larise Stavarache, Yuji Watanabe, Pablo Loyola, Daniel Klyashtorny, Heiko Ludwig, and Kumar Bhaskaran. 2019. Towards Federated Graph Learning for Collaborative Financial Crimes Detection. arXiv:1909.12946 [cs, q-fin] https:\/\/arxiv.org\/abs\/1909.12946"},{"key":"e_1_3_2_1_53_1","unstructured":"Johan Ugander Brian Karrer Lars Backstrom and Cameron Marlow. 2011. The Anatomy of the Facebook Social Graph. arXiv:1111.4503 [cs.SI] https:\/\/arxiv.org\/abs\/1111.4503"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/321439.321449"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3271888"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3201392"},{"key":"e_1_3_2_1_57_1","unstructured":"Xiao Wang Alex J. Malozemoff and Jonathan Katz. 2016. EMP-toolkit: Efficient MultiParty computation toolkit. https:\/\/github.com\/emp-toolkit."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"e_1_3_2_1_59_1","unstructured":"Samee Zahur and David Evans. 2015. Obliv-C: A Language for Extensible Data-Oblivious Computation. Cryptology ePrint Archive Paper 2015\/1153. https:\/\/eprint.iacr.org\/2015\/1153"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_8"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/SACI.2015.7208254"}],"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.3765050","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:24:48Z","timestamp":1766442288000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719027.3765050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":61,"alternative-id":["10.1145\/3719027.3765050","10.1145\/3719027"],"URL":"https:\/\/doi.org\/10.1145\/3719027.3765050","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"}}]}}