{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T18:00:08Z","timestamp":1773511208323,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ERC Project NTSC","award":["742754"],"award-info":[{"award-number":["742754"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3559389","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"653-666","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Fast Fully Secure Multi-Party Computation over Any Ring with Two-Thirds Honest Majority"],"prefix":"10.1145","author":[{"given":"Anders","family":"Dalskov","sequence":"first","affiliation":[{"name":"Partisia, Aarhus, Denmark"}]},{"given":"Daniel","family":"Escudero","sequence":"additional","affiliation":[{"name":"J.P. Morgan AI Research, New York, NY, USA"}]},{"given":"Ariel","family":"Nof","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.102.3.65"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-36030-6_19"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Mark Abspoel Anders P. K. Dalskov Daniel Escudero and Ariel Nof. 2021. An efficient passive-to-active compiler for honest-majority MPC over rings. In ACNS.  Mark Abspoel Anders P. K. Dalskov Daniel Escudero and Ariel Nof. 2021. An efficient passive-to-active compiler for honest-majority MPC over rings. In ACNS.","DOI":"10.1007\/978-3-030-78375-4_6"},{"key":"e_1_3_2_1_4_1","unstructured":"Alessandro N. Baccarini Marina Blanton and Chen Yuan. 2020. Multi-Party Replicated Secret Sharing over a Ring with Applications to Privacy-Preserving Machine Learning. IACR Cryptol. ePrint Arch. (2020).  Alessandro N. Baccarini Marina Blanton and Chen Yuan. 2020. Multi-Party Replicated Secret Sharing over a Ring with Applications to Privacy-Preserving Machine Learning. IACR Cryptol. ePrint Arch. (2020)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Assi Barak Martin Hirt Lior Koskas and Yehuda Lindell. 2018. An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants. In ACM CCS.  Assi Barak Martin Hirt Lior Koskas and Yehuda Lindell. 2018. An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants. In ACM CCS.","DOI":"10.1145\/3243734.3243801"},{"key":"e_1_3_2_1_6_1","unstructured":"Zuzana Beerliov\u00e1-Trub\u00edniov\u00e1 and Martin Hirt. 2008a. Perfectly-Secure MPC with Linear Communication Complexity. In TCC.  Zuzana Beerliov\u00e1-Trub\u00edniov\u00e1 and Martin Hirt. 2008a. Perfectly-Secure MPC with Linear Communication Complexity. In TCC."},{"key":"e_1_3_2_1_7_1","unstructured":"Zuzana Beerliov\u00e1-Trub\u00edniov\u00e1 and Martin Hirt. 2008b. Perfectly-Secure MPC with Linear Communication Complexity. In TCC.  Zuzana Beerliov\u00e1-Trub\u00edniov\u00e1 and Martin Hirt. 2008b. Perfectly-Secure MPC with Linear Communication Complexity. In TCC."},{"key":"e_1_3_2_1_8_1","volume-title":"ACM Symposium on Theory of Computing.","author":"Ben-Or Michael","year":"1988","unstructured":"Michael Ben-Or , Shafi Goldwasser , and Avi Wigderson . 1988 . Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) . In ACM Symposium on Theory of Computing. Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In ACM Symposium on Theory of Computing."},{"key":"e_1_3_2_1_9_1","volume-title":"Wu","author":"Berger Bonnie","year":"2018","unstructured":"Bonnie Berger , Cho Hyunghoon , and David J . Wu . 2018 . Secure genome-wide association analysis using multiparty computation. Nature biotechnology, Vol. 36 , 6 (2018), 547. Bonnie Berger, Cho Hyunghoon, and David J. Wu. 2018. Secure genome-wide association analysis using multiparty computation. Nature biotechnology, Vol. 36, 6 (2018), 547."},{"key":"e_1_3_2_1_10_1","volume-title":"Perry","author":"Berman Piotr","year":"1992","unstructured":"Piotr Berman , Juan A. Garay , and Kenneth J . Perry . 1992 . Bit optimal distributed consensus. In Computer science. 313--321. Piotr Berman, Juan A. Garay, and Kenneth J. Perry. 1992. Bit optimal distributed consensus. In Computer science. 313--321."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Dan Bogdanov Riivo Talviste and Jan Willemson. 2012. Deploying Secure Multi-Party Computation for Financial Data Analysis - (Short Paper). In Financial Cryptography and Data Security FC.  Dan Bogdanov Riivo Talviste and Jan Willemson. 2012. Deploying Secure Multi-Party Computation for Financial Data Analysis - (Short Paper). In Financial Cryptography and Data Security FC.","DOI":"10.1007\/978-3-642-32946-3_5"},{"key":"e_1_3_2_1_12_1","volume-title":"Ivan Damg\u00e5rd, Martin Geisler, Thomas P. Jakobsen, Mikkel Kr\u00f8igaard, Janus Dam Nielsen, Jesper Buus Nielsen, Kurt Nielsen, Jakob Pagter, Michael I. Schwartzbach, and Tomas Toft.","author":"Bogetoft Peter","year":"2009","unstructured":"Peter Bogetoft , Dan Lund Christensen , Ivan Damg\u00e5rd, Martin Geisler, Thomas P. Jakobsen, Mikkel Kr\u00f8igaard, Janus Dam Nielsen, Jesper Buus Nielsen, Kurt Nielsen, Jakob Pagter, Michael I. Schwartzbach, and Tomas Toft. 2009 . Secure Multiparty Computation Goes Live. In Financial Cryptography and Data Security FC. Peter Bogetoft, Dan Lund Christensen, Ivan Damg\u00e5rd, Martin Geisler, Thomas P. Jakobsen, Mikkel Kr\u00f8igaard, Janus Dam Nielsen, Jesper Buus Nielsen, Kurt Nielsen, Jakob Pagter, Michael I. Schwartzbach, and Tomas Toft. 2009. Secure Multiparty Computation Goes Live. In Financial Cryptography and Data Security FC."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Dan Boneh Elette Boyle Henry Corrigan-Gibbs Niv Gilboa and Yuval Ishai. 2019a. Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs. In CRYPTO.  Dan Boneh Elette Boyle Henry Corrigan-Gibbs Niv Gilboa and Yuval Ishai. 2019a. Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs. In CRYPTO.","DOI":"10.1007\/978-3-030-26954-8_3"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Dan Boneh Elette Boyle Henry Corrigan-Gibbs Niv Gilboa and Yuval Ishai. 2019b. Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs. In CRYPTO.  Dan Boneh Elette Boyle Henry Corrigan-Gibbs Niv Gilboa and Yuval Ishai. 2019b. Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs. In CRYPTO.","DOI":"10.1007\/978-3-030-26954-8_3"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Niv Gilboa Yuval Ishai and Ariel Nof. 2019. Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs. In ACM CCS.  Elette Boyle Niv Gilboa Yuval Ishai and Ariel Nof. 2019. Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs. In ACM CCS.","DOI":"10.1145\/3319535.3363227"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Niv Gilboa Yuval Ishai and Ariel Nof. 2020. Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs. In ASIACRYPT.  Elette Boyle Niv Gilboa Yuval Ishai and Ariel Nof. 2020. Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs. In ASIACRYPT.","DOI":"10.1007\/978-3-030-64840-4_9"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_1_18_1","volume-title":"Claude Cr\u00e9 peau, and Ivan Damg\u00e5rd","author":"Chaum David","year":"1988","unstructured":"David Chaum , Claude Cr\u00e9 peau, and Ivan Damg\u00e5rd . 1988 . Multiparty Unconditionally Secure Protocols (Extended Abstract). In ACM STOC. David Chaum, Claude Cr\u00e9 peau, and Ivan Damg\u00e5rd. 1988. Multiparty Unconditionally Secure Protocols (Extended Abstract). In ACM STOC."},{"key":"e_1_3_2_1_19_1","article-title":"Extreme cryptography paves way to personalized medicine","volume":"519","author":"Hayden Erika Check","year":"2015","unstructured":"Erika Check Hayden . 2015 . Extreme cryptography paves way to personalized medicine . Nature News , Vol. 519 , 7544 (2015), 400. Erika Check Hayden. 2015. Extreme cryptography paves way to personalized medicine. Nature News, Vol. 519, 7544 (2015), 400.","journal-title":"Nature News"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Jung Hee Cheon Dongwoo Kim and Keewoo Lee. 2021. MHz2k: MPC from HE over mathbb {Z}_2 ^ k with New Packing Simpler Reshare and Better ZKP. In CRYPTO.  Jung Hee Cheon Dongwoo Kim and Keewoo Lee. 2021. MHz2k: MPC from HE over mathbb {Z}_2 ^ k with New Packing Simpler Reshare and Better ZKP. In CRYPTO.","DOI":"10.1007\/978-3-030-84245-1_15"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","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 CRYPTO.  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 CRYPTO.","DOI":"10.1007\/978-3-319-96878-0_2"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Arka Rai Choudhuri Aarushi Goel Matthew Green Abhishek Jain and Gabriel Kaptchuk. 2021. Fluid MPC: Secure Multiparty Computation with Dynamic Participants. In CRYPTO.  Arka Rai Choudhuri Aarushi Goel Matthew Green Abhishek Jain and Gabriel Kaptchuk. 2021. Fluid MPC: Secure Multiparty Computation with Dynamic Participants. In CRYPTO.","DOI":"10.1007\/978-3-030-84245-1_4"},{"key":"e_1_3_2_1_23_1","volume-title":"Modular Construction of Nearly Optimal Byzantine Agreement Protocols. In ACM Symposium on Principles of Distributed Computing.","author":"Brian","unstructured":"Brian A. Coan and Jennifer L. Welch. 1989 . Modular Construction of Nearly Optimal Byzantine Agreement Protocols. In ACM Symposium on Principles of Distributed Computing. Brian A. Coan and Jennifer L. Welch. 1989. Modular Construction of Nearly Optimal Byzantine Agreement Protocols. In ACM Symposium on Principles of Distributed Computing."},{"key":"e_1_3_2_1_24_1","unstructured":"Ronald Cramer Ivan Damg\u00e5rd Daniel Escudero Peter Scholl and Chaoping Xing. 2018. SPDZ2k: Efficient MPC mod 2k for Dishonest Majority. In CRYPTO.  Ronald Cramer Ivan Damg\u00e5rd Daniel Escudero Peter Scholl and Chaoping Xing. 2018. SPDZ2k: Efficient MPC mod 2k for Dishonest Majority. In CRYPTO."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Ronald Cramer Ivan Damg\u00e5rd and Yuval Ishai. 2005. Share Conversion Pseudorandom Secret-Sharing and Applications to Secure Computation. In TCC.  Ronald Cramer Ivan Damg\u00e5rd and Yuval Ishai. 2005. Share Conversion Pseudorandom Secret-Sharing and Applications to Secure Computation. In TCC.","DOI":"10.1007\/978-3-540-30576-7_19"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Ronald Cramer Serge Fehr Yuval Ishai and Eyal Kushilevitz. 2003. Efficient Multi-party Computation over Rings. In EUROCRYPT.  Ronald Cramer Serge Fehr Yuval Ishai and Eyal Kushilevitz. 2003. Efficient Multi-party Computation over Rings. In EUROCRYPT.","DOI":"10.1007\/3-540-39200-9_37"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2020-0077"},{"key":"e_1_3_2_1_28_1","volume-title":"Fantastic Four: Honest-Majority Four-Party Secure Computation With Malicious Security. In USENIX.","author":"Dalskov Anders P. K.","year":"2021","unstructured":"Anders P. K. Dalskov , Daniel Escudero , and Marcel Keller . 2021 . Fantastic Four: Honest-Majority Four-Party Secure Computation With Malicious Security. In USENIX. Anders P. K. Dalskov, Daniel Escudero, and Marcel Keller. 2021. Fantastic Four: Honest-Majority Four-Party Secure Computation With Malicious Security. In USENIX."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00078"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd and Jesper Buus Nielsen. 2007. Scalable and Unconditionally Secure Multiparty Computation. In CRYPTO.  Ivan Damg\u00e5rd and Jesper Buus Nielsen. 2007. Scalable and Unconditionally Secure Multiparty Computation. In CRYPTO.","DOI":"10.1007\/11818175_30"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Daniel Escudero and Eduardo Soria-Vazquez. 2021. Efficient Information-Theoretic Multi-party Computation over Non-commutative Rings. In CRYPTO.  Daniel Escudero and Eduardo Soria-Vazquez. 2021. Efficient Information-Theoretic Multi-party Computation over Non-commutative Rings. In CRYPTO.","DOI":"10.1007\/978-3-030-84245-1_12"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Jun Furukawa and Yehuda Lindell. 2019. Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest. In ACM CCS.  Jun Furukawa and Yehuda Lindell. 2019. Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest. In ACM CCS.","DOI":"10.1145\/3319535.3339811"},{"key":"e_1_3_2_1_34_1","volume-title":"The Foundations of Cryptography -","author":"Goldreich Oded","unstructured":"Oded Goldreich . 2004. The Foundations of Cryptography - Volume 2 , Basic Applications. Cambridge University Press . Oded Goldreich. 2004. The Foundations of Cryptography - Volume 2, Basic Applications. Cambridge University Press."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","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 ACM STOC.  Oded Goldreich Silvio Micali and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In ACM STOC.","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"S. Dov Gordon Samuel Ranellucci and Xiao Wang. 2018. Secure Computation with Low Communication from Cross-Checking. In ASIACRYPT.  S. Dov Gordon Samuel Ranellucci and Xiao Wang. 2018. Secure Computation with Low Communication from Cross-Checking. In ASIACRYPT.","DOI":"10.1007\/978-3-030-03332-3_3"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Vipul Goyal Yanyi Liu and Yifan Song. 2019. Communication-Efficient Unconditional MPC with Guaranteed Output Delivery. In CRYPTO.  Vipul Goyal Yanyi Liu and Yifan Song. 2019. Communication-Efficient Unconditional MPC with Guaranteed Output Delivery. In CRYPTO.","DOI":"10.1007\/978-3-030-26951-7_4"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Vipul Goyal Yifan Song and Chenzhi Zhu. 2020. Guaranteed Output Delivery Comes Free in Honest Majority MPC. In CRYPTO.  Vipul Goyal Yifan Song and Chenzhi Zhu. 2020. Guaranteed Output Delivery Comes Free in Honest Majority MPC. In CRYPTO.","DOI":"10.1007\/978-3-030-56880-1_22"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Brett Hemenway Steve Lu Rafail Ostrovsky and William Welser IV. 2016. High-Precision Secure Computation of Satellite Collision Probabilities. In SCN.  Brett Hemenway Steve Lu Rafail Ostrovsky and William Welser IV. 2016. High-Precision Secure Computation of Satellite Collision Probabilities. In SCN.","DOI":"10.1007\/978-3-319-44618-9_9"},{"key":"e_1_3_2_1_40_1","volume-title":"Secret sharing scheme realizing general access structure. Electronics and Communications in Japan","author":"Ito Mitsuru","year":"1989","unstructured":"Mitsuru Ito , Akira Saito , and Takao Nishizeki . 1989. Secret sharing scheme realizing general access structure. Electronics and Communications in Japan ( 1989 ). Mitsuru Ito, Akira Saito, and Takao Nishizeki. 1989. Secret sharing scheme realizing general access structure. Electronics and Communications in Japan (1989)."},{"key":"e_1_3_2_1_41_1","volume-title":"SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. In USENIX.","author":"Koti Nishat","year":"2021","unstructured":"Nishat Koti , Mahak Pancholi , Arpita Patra , and Ajith Suresh . 2021 a. SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. In USENIX. Nishat Koti, Mahak Pancholi, Arpita Patra, and Ajith Suresh. 2021a. SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. In USENIX."},{"key":"e_1_3_2_1_42_1","volume-title":"Tetrad: Actively Secure 4PC for Secure Training and Inference. Cryptology ePrint Archive, Report 2021\/755. https:\/\/ia.cr\/2021\/755. To appear at NDSS","author":"Koti Nishat","year":"2021","unstructured":"Nishat Koti , Arpita Patra , Rahul Rachuri , and Ajith Suresh . 2021 b. Tetrad: Actively Secure 4PC for Secure Training and Inference. Cryptology ePrint Archive, Report 2021\/755. https:\/\/ia.cr\/2021\/755. To appear at NDSS 2022. Nishat Koti, Arpita Patra, Rahul Rachuri, and Ajith Suresh. 2021b. Tetrad: Actively Secure 4PC for Secure Training and Inference. Cryptology ePrint Archive, Report 2021\/755. https:\/\/ia.cr\/2021\/755. To appear at NDSS 2022."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/090755886"},{"key":"e_1_3_2_1_44_1","volume-title":"Smart, and Frederik Vercauteren","author":"Orsini Emmanuela","year":"2020","unstructured":"Emmanuela Orsini , Nigel P. Smart, and Frederik Vercauteren . 2020 . Overdrive2k: Efficient Secure MPC over mathbb {Z}_2^ ktextdollar from Somewhat Homomorphic Encryption. In CT-RSA. Emmanuela Orsini, Nigel P. Smart, and Frederik Vercauteren. 2020. Overdrive2k: Efficient Secure MPC over mathbb {Z}_2^ ktextdollar from Somewhat Homomorphic Encryption. In CT-RSA."},{"key":"e_1_3_2_1_45_1","volume-title":"Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In ACM Symposium on Theory of Computing.","author":"Rabin Tal","year":"1989","unstructured":"Tal Rabin and Michael Ben-Or . 1989 . Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In ACM Symposium on Theory of Computing. Tal Rabin and Michael Ben-Or. 1989. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority. In ACM Symposium on Theory of Computing."},{"key":"e_1_3_2_1_46_1","volume-title":"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 Symposium on Foundations of Computer Science. Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets (Extended Abstract). In Symposium on Foundations of Computer Science."}],"event":{"name":"CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security","location":"Los Angeles CA USA","acronym":"CCS '22","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3559389","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3559389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:50:57Z","timestamp":1750182657000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3559389"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":46,"alternative-id":["10.1145\/3548606.3559389","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3559389","relation":{},"subject":[],"published":{"date-parts":[[2022,11,7]]},"assertion":[{"value":"2022-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}