{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T01:26:54Z","timestamp":1775179614881,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":64,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"3IA C\u00f4te d?Azur","award":["ANR19-P3IA-0002"],"award-info":[{"award-number":["ANR19-P3IA-0002"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1145\/3634737.3657022","type":"proceedings-article","created":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T11:51:38Z","timestamp":1719575498000},"page":"257-273","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Nomadic: Normalising Maliciously-Secure Distance with Cosine Similarity for Two-Party Biometric Authentication"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2438-4080","authenticated-orcid":false,"given":"Nan","family":"Cheng","sequence":"first","affiliation":[{"name":"University of St. Gallen, St. Gallen, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0269-9495","authenticated-orcid":false,"given":"Melek","family":"\u00d6nen","sequence":"additional","affiliation":[{"name":"EURECOM, Sophia Antipolis, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7073-0258","authenticated-orcid":false,"given":"Aikaterini","family":"Mitrokotsa","sequence":"additional","affiliation":[{"name":"University of St. Gallen, St. Gallen, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8208-9667","authenticated-orcid":false,"given":"Ouba\u00efda","family":"Chouchane","sequence":"additional","affiliation":[{"name":"EURECOM, Sophia Antipolis, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2883-0324","authenticated-orcid":false,"given":"Massimiliano","family":"Todisco","sequence":"additional","affiliation":[{"name":"EURECOM, Sophia Antipolis, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4079-4127","authenticated-orcid":false,"given":"Alberto","family":"Ibarrondo","sequence":"additional","affiliation":[{"name":"Copper.co, Sophia Antipolis, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Advances in Cryptology-EUROCRYPT 2017: 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"Agrawal Shashank","year":"2017","unstructured":"Shashank Agrawal and David J Wu. 2017. Functional encryption: deterministic to randomized functions from simple assumptions. In Advances in Cryptology-EUROCRYPT 2017: 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30--May 4, 2017, Proceedings, Part II 36. Springer, 30--61."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978331"},{"key":"e_1_3_2_1_3_1","volume-title":"Topics in Cryptology-CT-RSA 2019: The Cryptographers' Track at the RSA Conference","author":"Barbosa Manuel","year":"2019","unstructured":"Manuel Barbosa, Dario Catalano, Azam Soleimanian, and Bogdan Warinschi. 2019. Efficient function-hiding functional encryption: From inner-products to orthogonality. In Topics in Cryptology-CT-RSA 2019: The Cryptographers' Track at the RSA Conference 2019, San Francisco, CA, USA, March 4--8, 2019, Proceedings. Springer, 127--148."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-bmt.2018.5138"},{"key":"e_1_3_2_1_5_1","volume-title":"Advances in Cryptology --- CRYPTO '91","author":"Beaver Donald","unstructured":"Donald Beaver. 1992. Efficient Multiparty Protocols Using Circuit Randomization. In Advances in Cryptology --- CRYPTO '91, Joan Feigenbaum (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 420--432."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100287"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-21568-2_26"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/BTAS.2018.8698601"},{"key":"e_1_3_2_1_9_1","volume-title":"Theory of Cryptography: 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28--30, 2011. Proceedings 8. Springer, 253--273","author":"Boneh Dan","year":"2011","unstructured":"Dan Boneh, Amit Sahai, and Brent Waters. 2011. Functional encryption: Definitions and challenges. In Theory of Cryptography: 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28--30, 2011. Proceedings 8. Springer, 253--273."},{"key":"e_1_3_2_1_10_1","volume-title":"Advances in Cryptology-EUROCRYPT 2021: 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, October 17--21","author":"Boyle Elette","year":"2021","unstructured":"Elette Boyle, Nishanth Chandran, Niv Gilboa, Divya Gupta, Yuval Ishai, Nishant Kumar, and Mayank Rathee. 2021. Function secret sharing for mixed-mode and fixed-point secure computation. In Advances in Cryptology-EUROCRYPT 2021: 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, October 17--21, 2021, Proceedings, Part II. Springer, 871--900."},{"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.1007\/978-3-030-36030-6_14"},{"key":"e_1_3_2_1_13_1","volume-title":"Theory of Cryptography Conference. Springer, 341--371","author":"Boyle Elette","year":"2019","unstructured":"Elette Boyle, Niv Gilboa, and Yuval Ishai. 2019. Secure computation with pre-processing via function secret sharing. In Theory of Cryptography Conference. Springer, 341--371."},{"key":"e_1_3_2_1_14_1","volume-title":"FLASH: Fast and robust framework for privacy-preserving machine learning. Cryptology ePrint Archive","author":"Byali Megha","year":"2019","unstructured":"Megha Byali, Harsh Chaudhari, Arpita Patra, and Ajith Suresh. 2019. FLASH: Fast and robust framework for privacy-preserving machine learning. Cryptology ePrint Archive (2019)."},{"key":"e_1_3_2_1_15_1","volume-title":"31st USENIX Security Symposium (USENIX Security 22)","author":"Chandran Nishanth","year":"2022","unstructured":"Nishanth Chandran, Divya Gupta, Sai Lakshmi Bhavana Obbattu, and Akash Shah. 2022. {SIMC}:{ML} Inference Secure Against Malicious Clients at {Semi-Honest} Cost. In 31st USENIX Security Symposium (USENIX Security 22). 1361--1378."},{"key":"e_1_3_2_1_16_1","volume-title":"Trident: Efficient 4pc framework for privacy preserving machine learning. arXiv preprint arXiv:1912.02631","author":"Chaudhari Harsh","year":"2019","unstructured":"Harsh Chaudhari, Rahul Rachuri, and Ajith Suresh. 2019. Trident: Efficient 4pc framework for privacy preserving machine learning. arXiv preprint arXiv:1912.02631 (2019)."},{"key":"e_1_3_2_1_17_1","unstructured":"Nan Cheng. 2023. CondEval. https:\/\/github.com\/nann-cheng\/CondEval."},{"key":"e_1_3_2_1_18_1","volume-title":"Hun Hee Lee, and Keewoo Lee","author":"Cheon Jung Hee","year":"2019","unstructured":"Jung Hee Cheon, Dongwoo Kim, Duhyeong Kim, Hun Hee Lee, and Keewoo Lee. 2019. Numerical method for comparison on homomorphically encrypted numbers. In Advances in Cryptology-ASIACRYPT 2019: 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8--12, 2019, Proceedings, Part II. Springer, 415--445."},{"key":"e_1_3_2_1_19_1","volume-title":"Voxceleb2: Deep speaker recognition. arXiv preprint arXiv:1806.05622","author":"Chung Joon Son","year":"2018","unstructured":"Joon Son Chung, Arsha Nagrani, and Andrew Zisserman. 2018. Voxceleb2: Deep speaker recognition. arXiv preprint arXiv:1806.05622 (2018)."},{"key":"e_1_3_2_1_20_1","volume-title":"Annual International Cryptology Conference. Springer, 769--798","author":"Cramer Ronald","year":"2018","unstructured":"Ronald Cramer, Ivan Damg\u00e5rd, Daniel Escudero, Peter Scholl, and Chaoping Xing. 2018. SPDZ2k: efficient MPC mod 2k for dishonest majority. In Annual International Cryptology Conference. Springer, 769--798."},{"key":"e_1_3_2_1_21_1","volume-title":"30th USENIX Security Symposium (USENIX Security 21)","author":"Dalskov Anders","year":"2021","unstructured":"Anders Dalskov, Daniel Escudero, and Marcel Keller. 2021. Fantastic four:{Honest-Majority} {Four-Party} secure computation with malicious security. In 30th USENIX Security Symposium (USENIX Security 21). 2183--2200."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"e_1_3_2_1_23_1","volume-title":"Public-Key Cryptography-PKC 2016: 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Taipei, Taiwan, March 6--9","author":"Datta Pratish","year":"2016","unstructured":"Pratish Datta, Ratna Dutta, and Sourav Mukhopadhyay. 2016. Functional encryption for inner product with full function privacy. In Public-Key Cryptography-PKC 2016: 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Taipei, Taiwan, March 6--9, 2016, Proceedings, Part I. Springer, 164--195."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Daniel Demmler Thomas Schneider and Michael Zohner. 2015. ABY-A framework for efficient mixed-protocol secure two-party computation.. In NDSS.","DOI":"10.14722\/ndss.2015.23113"},{"key":"e_1_3_2_1_25_1","volume-title":"Ecapatdnn: Emphasized channel attention, propagation and aggregation in tdnn based speaker verification. arXiv preprint arXiv:2005.07143","author":"Desplanques Brecht","year":"2020","unstructured":"Brecht Desplanques, Jenthe Thienpondt, and Kris Demuynck. 2020. Ecapatdnn: Emphasized channel attention, propagation and aggregation in tdnn based speaker verification. arXiv preprint arXiv:2005.07143 (2020)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.3390\/sym13050894"},{"key":"e_1_3_2_1_27_1","volume-title":"Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive","author":"Fan Junfeng","year":"2012","unstructured":"Junfeng Fan and Frederik Vercauteren. 2012. Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive (2012)."},{"key":"e_1_3_2_1_28_1","unstructured":"Craig Gentry. 2009. A fully homomorphic encryption scheme. Stanford university."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Oded Goldreich Silvio Micali and Avi Wigderson. 2019. How to play any mental game or a completeness theorem for protocols with honest majority. In Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali. 307--328.","DOI":"10.1145\/3335741.3335755"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2022-0109"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TST.2016.7536716"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3577923.3583656"},{"key":"e_1_3_2_1_33_1","volume-title":"Proceedings on Privacy Enhancing Technologies","author":"Ibarrondo Alberto","year":"2023","unstructured":"Alberto Ibarrondo, Herv\u00e9 Chabanne, and Melek \u00d6nen. 2023. Funshade: Function Secret Sharing for Two-Party Secure Thresholded Distance Evaluation. Proceedings on Privacy Enhancing Technologies (2023)."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2021-0046"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/8869418"},{"key":"e_1_3_2_1_36_1","first-page":"4961","article-title":"Crypten: Secure multi-party computation meets machine learning","volume":"34","author":"Knott Brian","year":"2021","unstructured":"Brian Knott, Shobha Venkataraman, Awni Hannun, Shubho Sengupta, Mark Ibrahim, and Laurens van der Maaten. 2021. Crypten: Secure multi-party computation meets machine learning. Advances in Neural Information Processing Systems 34 (2021), 4961--4973.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2017.7953152"},{"key":"e_1_3_2_1_38_1","volume-title":"30th USENIX Security Symposium (USENIX Security 21)","author":"Koti Nishat","year":"2021","unstructured":"Nishat Koti, Mahak Pancholi, Arpita Patra, and Ajith Suresh. 2021. {SWIFT}: Super-fast and robust {Privacy-Preserving} machine learning. In 30th USENIX Security Symposium (USENIX Security 21). 2651--2668."},{"key":"e_1_3_2_1_39_1","volume-title":"Tetrad: Actively secure 4pc for secure training and inference. arXiv preprint arXiv:2106.02850","author":"Koti Nishat","year":"2021","unstructured":"Nishat Koti, Arpita Patra, Rahul Rachuri, and Ajith Suresh. 2021. Tetrad: Actively secure 4pc for secure training and inference. arXiv preprint arXiv:2106.02850 (2021)."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00092"},{"key":"e_1_3_2_1_41_1","volume-title":"30th USENIX Security Symposium (USENIX Security 21)","author":"Lehmkuhl Ryan","year":"2021","unstructured":"Ryan Lehmkuhl, Pratyush Mishra, Akshayaram Srinivasan, and Raluca Ada Popa. 2021. Muse: Secure inference resilient to malicious clients. In 30th USENIX Security Symposium (USENIX Security 21). 2201--2218."},{"key":"e_1_3_2_1_42_1","volume-title":"32nd USENIX Security Symposium (USENIX Security 23)","author":"Li Yun","year":"2023","unstructured":"Yun Li, Yufei Duan, Zhicong Huang, Cheng Hong, Chao Zhang, and Yifan Song. 2023. Efficient {3PC} for Binary Circuits with Application to {Maliciously-Secure} {DNN} Inference. In 32nd USENIX Security Symposium (USENIX Security 23). 5377--5394."},{"key":"e_1_3_2_1_43_1","volume-title":"2021 2nd International Conference on Electronics, Communications and Information Technology (CECIT). IEEE, 848--853","author":"Lu Shaofeng","year":"2021","unstructured":"Shaofeng Lu, Cheng Li, Xinyi Feng, Yuefeng Lu, Yulong Hu, and Wenxi Li. 2021. Privacy-preserving Hamming distance Protocol and Its Applications. In 2021 2nd International Conference on Electronics, Communications and Information Technology (CECIT). IEEE, 848--853."},{"key":"e_1_3_2_1_44_1","volume-title":"Proceedings of the Nineteenth ACM Symp. on Theory of Computing, STOC. ACM, 218--229","author":"Micali Silvio","year":"1987","unstructured":"Silvio Micali, Oded Goldreich, and Avi Wigderson. 1987. How to play any mental game. In Proceedings of the Nineteenth ACM Symp. on Theory of Computing, STOC. ACM, 218--229."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243760"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-020-08680-5"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"A. Nagrani J. S. Chung and A. Zisserman. 2017. VoxCeleb: a large-scale speaker identification dataset. In INTERSPEECH.","DOI":"10.21437\/Interspeech.2017-950"},{"key":"e_1_3_2_1_48_1","volume-title":"Privacy-preserving speaker recognition with cohort score normalisation. arXiv preprint arXiv:1907.03454","author":"Nautsch Andreas","year":"2019","unstructured":"Andreas Nautsch, Jose Patino, Amos Treiber, Themos Stafylakis, Petr Mizera, Massimiliano Todisco, Thomas Schneider, and Nicholas Evans. 2019. Privacy-preserving speaker recognition with cohort score normalisation. arXiv preprint arXiv:1907.03454 (2019)."},{"key":"e_1_3_2_1_49_1","volume-title":"30th USENIX Security Symposium (USENIX Security 21)","author":"Patra Arpita","year":"2021","unstructured":"Arpita Patra, Thomas Schneider, Ajith Suresh, and Hossein Yalame. 2021. {ABY2.0}: Improved {Mixed-Protocol} Secure {Two-Party} Computation. In 30th USENIX Security Symposium (USENIX Security 21). 2165--2182."},{"key":"e_1_3_2_1_50_1","volume-title":"BLAZE: blazing fast privacy-preserving machine learning. arXiv preprint arXiv:2005.09042","author":"Patra Arpita","year":"2020","unstructured":"Arpita Patra and Ajith Suresh. 2020. BLAZE: blazing fast privacy-preserving machine learning. arXiv preprint arXiv:2005.09042 (2020)."},{"key":"e_1_3_2_1_51_1","volume-title":"Privacy-preserving similarity calculation of speaker features using fully homomorphic encryption. arXiv preprint arXiv:2202.07994","author":"Rahulamathavan Yogachandran","year":"2022","unstructured":"Yogachandran Rahulamathavan. 2022. Privacy-preserving similarity calculation of speaker features using fully homomorphic encryption. arXiv preprint arXiv:2202.07994 (2022)."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1109\/JIOT.2020.3014686","article-title":"Scalar product lattice computation for efficient privacy-preserving systems","volume":"8","author":"Rahulamathavan Yogachandran","year":"2020","unstructured":"Yogachandran Rahulamathavan, Safak Dogan, Xiyu Shi, Rongxing Lu, Muttukrishnan Rajarajan, and Ahmet Kondoz. 2020. Scalar product lattice computation for efficient privacy-preserving systems. IEEE Internet of Things Journal 8, 3 (2020), 1417--1427.","journal-title":"IEEE Internet of Things Journal"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417274"},{"key":"e_1_3_2_1_54_1","volume-title":"Ariann: Low-interaction privacy-preserving deep learning via function secret sharing. arXiv preprint arXiv:2006.04593","author":"Ryffel Th\u00e9o","year":"2020","unstructured":"Th\u00e9o Ryffel, Pierre Tholoniat, David Pointcheval, and Francis Bach. 2020. Ariann: Low-interaction privacy-preserving deep learning via function secret sharing. arXiv preprint arXiv:2006.04593 (2020)."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2022-0015"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1049\/cje.2021.07.018"},{"key":"e_1_3_2_1_58_1","volume-title":"Musan: A music, speech, and noise corpus. arXiv preprint arXiv:1510.08484","author":"Snyder David","year":"2015","unstructured":"David Snyder, Guoguo Chen, and Daniel Povey. 2015. Musan: A music, speech, and noise corpus. arXiv preprint arXiv:1510.08484 (2015)."},{"key":"e_1_3_2_1_59_1","volume-title":"Information Security: 19th International Conference, ISC 2016, Honolulu, HI, USA, September 3--6, 2016. Proceedings 19","author":"Tomida Junichi","year":"2016","unstructured":"Junichi Tomida, Masayuki Abe, and Tatsuaki Okamoto. 2016. Efficient functional encryption for inner-product values with full-hiding security. In Information Security: 19th International Conference, ISC 2016, Honolulu, HI, USA, September 3--6, 2016. Proceedings 19. Springer, 408--425."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.specom.2019.09.004"},{"key":"e_1_3_2_1_61_1","volume-title":"Privacy Preserving n-Party Scalar Product Protocol","author":"Daalen Florian Van","year":"2023","unstructured":"Florian Van Daalen, Lianne Ippel, Andre Dekker, and Inigo Bermejo. 2023. Privacy Preserving n-Party Scalar Product Protocol. IEEE Transactions on Parallel and Distributed Systems (2023)."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1109\/TIFS.2014.2370255","article-title":"A framework for secure computations with two non-colluding servers and multiple clients, applied to recommendations","volume":"10","author":"Veugen Thijs","year":"2014","unstructured":"Thijs Veugen, Robbert de Haan, Ronald Cramer, and Frank Muller. 2014. A framework for secure computations with two non-colluding servers and multiple clients, applied to recommendations. IEEE Transactions on Information Forensics and Security 10, 3 (2014), 445--457.","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2021-0011"},{"key":"e_1_3_2_1_64_1","volume-title":"27th annual symposium on foundations of computer science (Sfcs","author":"Chi-Chih Yao Andrew","year":"1986","unstructured":"Andrew Chi-Chih Yao. 1986. How to generate and exchange secrets. In 27th annual symposium on foundations of computer science (Sfcs 1986). IEEE, 162--167."}],"event":{"name":"ASIA CCS '24: 19th ACM Asia Conference on Computer and Communications Security","location":"Singapore Singapore","acronym":"ASIA CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 19th ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3634737.3657022","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:44:07Z","timestamp":1750290247000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3634737.3657022"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":64,"alternative-id":["10.1145\/3634737.3657022","10.1145\/3634737"],"URL":"https:\/\/doi.org\/10.1145\/3634737.3657022","relation":{},"subject":[],"published":{"date-parts":[[2024,7]]},"assertion":[{"value":"2024-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}