{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T16:03:19Z","timestamp":1780588999012,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"The National Key Research and Development Program of China","award":["2022YFB3102500"],"award-info":[{"award-number":["2022YFB3102500"]}]},{"name":"The Major Programs of the National Social Science Foundation of China","award":["22&ZD147"],"award-info":[{"award-number":["22&ZD147"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1145\/3779208.3805966","type":"proceedings-article","created":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T15:21:58Z","timestamp":1780586518000},"page":"35-51","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Concretely Efficient Correlated Oblivious Permutation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-0696-3008","authenticated-orcid":false,"given":"Feng","family":"Han","sequence":"first","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-3522-340X","authenticated-orcid":false,"given":"Xiao","family":"Lan","sequence":"additional","affiliation":[{"name":"Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1466-7418","authenticated-orcid":false,"given":"Weiran","family":"Liu","sequence":"additional","affiliation":[{"name":"Alibaba Group, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-8102-6568","authenticated-orcid":false,"given":"Lei","family":"Zhang","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7909-3753","authenticated-orcid":false,"given":"Hao","family":"Ren","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-2028-0780","authenticated-orcid":false,"given":"Lin","family":"Qu","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4095-4506","authenticated-orcid":false,"given":"Yuan","family":"Hong","sequence":"additional","affiliation":[{"name":"University of Connecticut, Storrs, Connecticut, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3690359"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68397-8_9"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3670280"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516738"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626402000999"},{"key":"e_1_3_2_1_6_1","volume-title":"Advances in Cryptology (CRYPTO","author":"Beaver Donald","year":"1991","unstructured":"Donald Beaver. 1991. Efficient multiparty protocols using circuit randomization. In Advances in Cryptology (CRYPTO 1991). Springer, 420\u2013432."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1964.tb04103.x"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03810-6_25"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15979-4_21"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354255"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_12"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626497000292"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64840-4_12"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22174-8_3"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84252-9_17"},{"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.1007\/978-3-030-84259-8_18"},{"key":"e_1_3_2_1_18_1","volume-title":"Clarion: Anonymous communication from multiparty shuffling protocols. Cryptology ePrint Archive","author":"Eskandarian Saba","year":"2021","unstructured":"Saba Eskandarian and Dan Boneh. 2021. Clarion: Anonymous communication from multiparty shuffling protocols. Cryptology ePrint Archive (2021)."},{"key":"e_1_3_2_1_19_1","volume-title":"Multiparty Shuffle: Linear Online Phase is Almost for Free. Cryptology ePrint Archive","author":"Gao Jiacheng","year":"2024","unstructured":"Jiacheng Gao, Yuan Zhang, and Sheng Zhong. 2024. Multiparty Shuffle: Linear Online Phase is Almost for Free. Cryptology ePrint Archive (2024)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75248-4_21"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/6490.6503"},{"key":"e_1_3_2_1_22_1","volume-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT","author":"Guo Xiaojie","year":"2023","unstructured":"Xiaojie Guo, Kang Yang, Xiao Wang, Wenhao Zhang, Xiang Xie, Jiang Zhang, and Zheli Liu. 2023. Half-tree: Halving the cost of tree expansion in cot and dpf. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2024). Springer, 330\u2013362."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"e_1_3_2_1_24_1","volume-title":"31st USENIX Security Symposium (USENIX Security","author":"Jia Yanxue","year":"2022","unstructured":"Yanxue Jia, Shi-Feng Sun, Hong-Sheng Zhou, Jiajun Du, and Dawu Gu. 2022. Shuffle-based private set union: Faster and more secure. In 31st USENIX Security Symposium (USENIX Security 2022). 2947\u20132964."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/3698900.3699262"},{"key":"e_1_3_2_1_26_1","volume-title":"27th USENIX security symposium (USENIX Security","author":"Juvekar Chiraag","year":"2018","unstructured":"Chiraag Juvekar, Vinod Vaikuntanathan, and Anantha Chandrakasan. 2018. {GAZELLE}: A low latency framework for secure neural network inference. In 27th USENIX security symposium (USENIX Security 2018). 1651\u20131669."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47989-6_35"},{"key":"e_1_3_2_1_28_1","volume-title":"Hyung Tae Lee, and Yongha Son","author":"Kim Jiseung","year":"2024","unstructured":"Jiseung Kim, Hyung Tae Lee, and Yongha Son. 2024. Revisiting shuffle-based private set unions with reduced communication. Cryptology ePrint Archive (2024)."},{"key":"e_1_3_2_1_29_1","volume-title":"How to simulate it-a tutorial on the simulation proof technique. Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich","author":"Lindell Yehuda","year":"2017","unstructured":"Yehuda Lindell. 2017. How to simulate it-a tutorial on the simulation proof technique. Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich (2017), 277\u2013346."},{"key":"e_1_3_2_1_30_1","volume-title":"iPrivJoin: An ID-private data join framework for privacy-preserving machine learning","author":"Liu Yang","year":"2023","unstructured":"Yang Liu, Bingsheng Zhang, Yuxiang Ma, Zhuo Ma, and Zecheng Wu. 2023. iPrivJoin: An ID-private data join framework for privacy-preserving machine learning. IEEE Transactions on Information Forensics and Security (TIFS 2023) 18 (2023), 4300\u20134312."},{"key":"e_1_3_2_1_31_1","volume-title":"Secure machine learning over relational data. arXiv preprint arXiv:2109.14806","author":"Luo Qiyao","year":"2021","unstructured":"Qiyao Luo, Yilei Wang, Zhenghang Ren, Ke Yi, Kai Chen, and Xiao Wang. 2021. Secure machine learning over relational data. arXiv preprint arXiv:2109.14806 (2021)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3423358"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_33"},{"key":"e_1_3_2_1_34_1","volume-title":"12th Annual Symposium on Discrete Algorithms (SODA","volume":"1","author":"Naor Moni","year":"2001","unstructured":"Moni Naor and Benny Pinkas. 2001. Efficient oblivious transfer protocols. In 12th Annual Symposium on Discrete Algorithms (SODA 2021), Vol. 1. 448\u2013457."},{"key":"e_1_3_2_1_35_1","volume-title":"Efficient permutation correlations and batched random access for two-party computation. Cryptology ePrint Archive","author":"Peceny Stanislav","year":"2024","unstructured":"Stanislav Peceny, Srinivasan Raghuraman, Peter Rindal, and Harshal Shah. 2024. Efficient permutation correlations and batched random access for two-party computation. Cryptology ePrint Archive (2024)."},{"key":"e_1_3_2_1_36_1","volume-title":"MapComp: A secure view-based collaborative analytics framework for join-group-aggregation. arXiv preprint arXiv:2408.01246","author":"Peng Xinyu","year":"2024","unstructured":"Xinyu Peng, Feng Han, Li Peng, Weiran Liu, Zheng Yan, Kai Kang, Xinyuan Zhang, Guoxing Wei, Jianling Sun, and Jinfei Liu. 2024. MapComp: A secure view-based collaborative analytics framework for join-group-aggregation. arXiv preprint arXiv:2408.01246 (2024)."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38551-3_19"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623133"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3363228"},{"key":"e_1_3_2_1_40_1","volume-title":"Secret-shared shuffle with malicious security. NDSS","author":"Song Xiangfu","year":"2024","unstructured":"Xiangfu Song, Dong Yin, Jianli Bai, Changyu Dong, and Ee-Chien Chang. 2024. Secret-shared shuffle with malicious security. NDSS (2024)."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/321439.321449"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452808"},{"key":"e_1_3_2_1_43_1","unstructured":"Qiuhong Anna Wei. 2024. Malicious secure oblivious shuffling from Bene\u0161 network. (2024)."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417276"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382751"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/3620237.3620257"}],"event":{"name":"ASIA CCS '26: ACM Asia Conference on Computer and Communications Security","location":"Bangalore India","acronym":"ASIA CCS '26","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3779208.3805966","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T15:34:23Z","timestamp":1780587263000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3779208.3805966"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":46,"alternative-id":["10.1145\/3779208.3805966","10.1145\/3779208"],"URL":"https:\/\/doi.org\/10.1145\/3779208.3805966","relation":{},"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"2026-06-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}