{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:29Z","timestamp":1750220369194,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,15]],"date-time":"2021-11-15T00:00:00Z","timestamp":1636934400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,15]]},"DOI":"10.1145\/3474123.3486757","type":"proceedings-article","created":{"date-parts":[[2021,11,5]],"date-time":"2021-11-05T15:41:53Z","timestamp":1636126913000},"page":"21-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["ACCO"],"prefix":"10.1145","author":[{"given":"Xiaoqi","family":"Duan","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vipul","family":"Goyal","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University & NTT Research, Sunnyvale, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanjun","family":"Li","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antigoni","family":"Polychroniadou","sequence":"additional","affiliation":[{"name":"J.P. Morgan AI Research, New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yifan","family":"Song","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,11,15]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_2_3_1","volume-title":"Proceedings of the 12th International Conference on Music Information Retrieval (ISMIR","author":"Bertin-Mahieux Thierry","year":"2011","unstructured":"Thierry Bertin-Mahieux , Daniel P.W. Ellis , Brian Whitman , and Paul Lamere . 2011 . The Million Song Dataset . In Proceedings of the 12th International Conference on Music Information Retrieval (ISMIR 2011). Thierry Bertin-Mahieux, Daniel P.W. Ellis, Brian Whitman, and Paul Lamere. 2011. The Million Song Dataset. In Proceedings of the 12th International Conference on Music Information Retrieval (ISMIR 2011)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1885535.1885555"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32946-3_15"},{"key":"e_1_3_2_2_7_1","volume-title":"Advances in Cryptology - CRYPTO '87, A Conference on the Theory and Applications of Cryptographic Techniques, Santa Barbara, California, USA, August 16-20, 1987, Proceedings. 462","author":"Chaum David","year":"1987","unstructured":"David Chaum , Claude Cr\u00e9peau , and Ivan Damg\u00e5rd . 1987 . Multiparty Unconditionally Secure Protocols (Abstract) . In Advances in Cryptology - CRYPTO '87, A Conference on the Theory and Applications of Cryptographic Techniques, Santa Barbara, California, USA, August 16-20, 1987, Proceedings. 462 . https:\/\/doi.org\/10.1007\/3-540-48184-2_43 10.1007\/3-540-48184-2_43 David Chaum, Claude Cr\u00e9peau, and Ivan Damg\u00e5rd. 1987. Multiparty Unconditionally Secure Protocols (Abstract). In Advances in Cryptology - CRYPTO '87, A Conference on the Theory and Applications of Cryptographic Techniques, Santa Barbara, California, USA, August 16-20, 1987, Proceedings. 462. https:\/\/doi.org\/10.1007\/3-540-48184-2_43"},{"key":"e_1_3_2_2_8_1","volume-title":"Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. In Annual International Cryptology Conference. Springer, 34--64","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 Annual International Cryptology Conference. Springer, 34--64 . 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 Annual International Cryptology Conference. Springer, 34--64."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_15"},{"key":"e_1_3_2_2_11_1","volume-title":"ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation. In 22nd Annual Network and Distributed System Security Symposium, NDSS 2015","author":"Demmler Daniel","year":"2015","unstructured":"Daniel Demmler , Thomas Schneider , and Michael Zohner . 2015 . ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation. In 22nd Annual Network and Distributed System Security Symposium, NDSS 2015 , San Diego, California, USA , February 8-11, 2015. Daniel Demmler, Thomas Schneider, and Michael Zohner. 2015. ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation. In 22nd Annual Network and Distributed System Security Symposium, NDSS 2015, San Diego, California, USA, February 8-11, 2015."},{"key":"e_1_3_2_2_12_1","unstructured":"Dheeru Dua and Casey Graff. 2017. UCI Machine Learning Repository. (2017). http:\/\/archive.ics.uci.edu\/ml  Dheeru Dua and Casey Graff. 2017. UCI Machine Learning Repository. (2017). http:\/\/archive.ics.uci.edu\/ml"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_29"},{"key":"e_1_3_2_2_14_1","first-page":"265","article-title":"b. Calibrating Noise to Sensitivity in Private Data Analysis","volume":"3876","author":"Dwork Cynthia","year":"2006","unstructured":"Cynthia Dwork , Frank McSherry , Kobbi Nissim , and Adam Smith . 2006 b. Calibrating Noise to Sensitivity in Private Data Analysis . Theory of Cryptography , Vol. 3876 , 265 -- 284 . https:\/\/doi.org\/10.1007\/11681878_14 10.1007\/11681878_14 Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. 2006 b. Calibrating Noise to Sensitivity in Private Data Analysis. Theory of Cryptography, Vol. 3876, 265--284. https:\/\/doi.org\/10.1007\/11681878_14","journal-title":"Theory of Cryptography"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71677-8_22"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591861"},{"key":"e_1_3_2_2_17_1","volume-title":"Proceedings of the 19th Annual ACM Symposium on Theory of Computing","author":"Goldreich Oded","year":"1987","unstructured":"Oded Goldreich , Silvio Micali , and Avi Wigderson . 1987 . How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority . In Proceedings of the 19th Annual ACM Symposium on Theory of Computing , 1987, New York, New York, USA. 218--229. https:\/\/doi.org\/10.1145\/28395.28420 10.1145\/28395.28420 Oded Goldreich, Silvio Micali, and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA. 218--229. https:\/\/doi.org\/10.1145\/28395.28420"},{"key":"e_1_3_2_2_18_1","volume-title":"ATLAS: Efficient and Scalable MPC in\u00a0the Honest Majority Setting. In Advances in Cryptology -- CRYPTO","author":"Goyal Vipul","year":"2021","unstructured":"Vipul Goyal , Hanjun Li , Rafail Ostrovsky , Antigoni Polychroniadou , and Yifan Song . 2021 . ATLAS: Efficient and Scalable MPC in\u00a0the Honest Majority Setting. In Advances in Cryptology -- CRYPTO 2021, Tal Malkin and Chris Peikert (Eds.). Springer International Publishing , Cham, 244--274. Vipul Goyal, Hanjun Li, Rafail Ostrovsky, Antigoni Polychroniadou, and Yifan Song. 2021. ATLAS: Efficient and Scalable MPC in\u00a0the Honest Majority Setting. In Advances in Cryptology -- CRYPTO 2021, Tal Malkin and Chris Peikert (Eds.). Springer International Publishing, Cham, 244--274."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_22"},{"volume-title":"Towards Practical Differentially Private Convex Optimization. In 2019 IEEE Symposium on Security and Privacy (SP). 299--316","author":"Iyengar R.","key":"e_1_3_2_2_21_1","unstructured":"R. Iyengar , J. P. Near , D. Song , O. Thakkar , A. Thakurta , and L. Wang . 2019 . Towards Practical Differentially Private Convex Optimization. In 2019 IEEE Symposium on Security and Privacy (SP). 299--316 . R. Iyengar, J. P. Near, D. Song, O. Thakkar, A. Thakurta, and L. Wang. 2019. Towards Practical Differentially Private Convex Optimization. In 2019 IEEE Symposium on Security and Privacy (SP). 299--316."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243760"},{"volume-title":"SecureML: A System for Scalable Privacy-Preserving Machine Learning. In 2017 IEEE Symposium on Security and Privacy (SP). 19--38","author":"Mohassel P.","key":"e_1_3_2_2_23_1","unstructured":"P. Mohassel and Y. Zhang . 2017 . SecureML: A System for Scalable Privacy-Preserving Machine Learning. In 2017 IEEE Symposium on Security and Privacy (SP). 19--38 . P. Mohassel and Y. Zhang. 2017. SecureML: A System for Scalable Privacy-Preserving Machine Learning. In 2017 IEEE Symposium on Security and Privacy (SP). 19--38."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760564.1760595"},{"key":"e_1_3_2_2_25_1","volume-title":"BLAZE: Blazing Fast Privacy-Preserving Machine Learning. CoRR","author":"Patra Arpita","year":"2020","unstructured":"Arpita Patra and Ajith Suresh . 2020 . BLAZE: Blazing Fast Privacy-Preserving Machine Learning. CoRR , Vol. abs\/ 2005 .09042 (2020). arxiv: 2005.09042 https:\/\/arxiv.org\/abs\/2005.09042 Arpita Patra and Ajith Suresh. 2020. BLAZE: Blazing Fast Privacy-Preserving Machine Learning. CoRR, Vol. abs\/2005.09042 (2020). arxiv: 2005.09042 https:\/\/arxiv.org\/abs\/2005.09042"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196494.3196522"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_2_28_1","volume-title":"Proceedings of the Network and Distributed System Security Symposium, NDSS 2011","author":"Shi Elaine","year":"2011","unstructured":"Elaine Shi , T.-H. Hubert Chan , Eleanor Gilbert Rieffel , Richard Chow , and Dawn Song . 2011 . Privacy-Preserving Aggregation of Time-Series Data . In Proceedings of the Network and Distributed System Security Symposium, NDSS 2011 , San Diego, California, USA, 6th February - 9th February 2011. The Internet Society. https:\/\/www.ndss-symposium.org\/ndss2011\/privacy-preserving-aggregation-of-time-series-data Elaine Shi, T.-H. Hubert Chan, Eleanor Gilbert Rieffel, Richard Chow, and Dawn Song. 2011. Privacy-Preserving Aggregation of Time-Series Data. In Proceedings of the Network and Distributed System Security Symposium, NDSS 2011, San Diego, California, USA, 6th February - 9th February 2011. The Internet Society. https:\/\/www.ndss-symposium.org\/ndss2011\/privacy-preserving-aggregation-of-time-series-data"},{"key":"e_1_3_2_2_29_1","volume-title":"SecureNN: Efficient and Private Neural Network Training. In Privacy Enhancing Technologies Symposium. (PETS","author":"Wagh Sameer","year":"2019","unstructured":"Sameer Wagh , Divya Gupta , and Nishanth Chandran . 2019 . SecureNN: Efficient and Private Neural Network Training. In Privacy Enhancing Technologies Symposium. (PETS 2019). https:\/\/www.microsoft.com\/en-us\/research\/publication\/securenn-efficient-and-private-neural-network-training\/ Sameer Wagh, Divya Gupta, and Nishanth Chandran. 2019. SecureNN: Efficient and Private Neural Network Training. In Privacy Enhancing Technologies Symposium. (PETS 2019). https:\/\/www.microsoft.com\/en-us\/research\/publication\/securenn-efficient-and-private-neural-network-training\/"},{"key":"e_1_3_2_2_30_1","volume-title":"27th Annual Symposium on Foundations of Computer Science","author":"Chi-Chih Yao Andrew","year":"1986","unstructured":"Andrew Chi-Chih Yao . 1986 . How to Generate and Exchange Secrets (Extended Abstract) . In 27th Annual Symposium on Foundations of Computer Science , Toronto, Canada , 27-29 October 1986. 162--167. https:\/\/doi.org\/10.1109\/SFCS.1986.25 10.1109\/SFCS.1986.25 Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets (Extended Abstract). In 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27-29 October 1986. 162--167. https:\/\/doi.org\/10.1109\/SFCS.1986.25"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00045"}],"event":{"name":"CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Virtual Event Republic of Korea","acronym":"CCS '21"},"container-title":["Proceedings of the 2021 on Cloud Computing Security Workshop"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3474123.3486757","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3474123.3486757","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:35Z","timestamp":1750191455000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3474123.3486757"}},"subtitle":["Algebraic Computation with Comparison"],"short-title":[],"issued":{"date-parts":[[2021,11,15]]},"references-count":30,"alternative-id":["10.1145\/3474123.3486757","10.1145\/3474123"],"URL":"https:\/\/doi.org\/10.1145\/3474123.3486757","relation":{},"subject":[],"published":{"date-parts":[[2021,11,15]]},"assertion":[{"value":"2021-11-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}