{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:42:47Z","timestamp":1781077367132,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":59,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["101019547"],"award-info":[{"award-number":["101019547"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,19]]},"DOI":"10.1145\/3719027.3765194","type":"proceedings-article","created":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T23:42:02Z","timestamp":1763854922000},"page":"394-408","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Encrypted Matrix-Vector Products from Secret Dual Codes"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8300-1820","authenticated-orcid":false,"given":"Fabrice","family":"Benhamouda","sequence":"first","affiliation":[{"name":"Amazon Web Services, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-0955-1883","authenticated-orcid":false,"given":"Caicai","family":"Chen","sequence":"additional","affiliation":[{"name":"Bocconi University, Milan, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3432-7899","authenticated-orcid":false,"given":"Shai","family":"Halevi","sequence":"additional","affiliation":[{"name":"Amazon Web Services, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4096-6305","authenticated-orcid":false,"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel and Amazon Web Services, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3130-1888","authenticated-orcid":false,"given":"Hugo","family":"Krawczyk","sequence":"additional","affiliation":[{"name":"Amazon Web Services, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-5164-0315","authenticated-orcid":false,"given":"Tamer","family":"Mour","sequence":"additional","affiliation":[{"name":"Bocconi University, Milan, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1386-605X","authenticated-orcid":false,"given":"Tal","family":"Rabin","sequence":"additional","affiliation":[{"name":"Amazon Web Services, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3021-7150","authenticated-orcid":false,"given":"Alon","family":"Rosen","sequence":"additional","affiliation":[{"name":"Bocconi University, Milan, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,11,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3046675"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22006-7_34"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.661107"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Fabrice Benhamouda Caicai Chen Shai Halevi Yuval Ishai Hugo Krawczyk Tamer Mour Tal Rabin and Alon Rosen. 2025. Encrypted Matrix-Vector Products from Secret Dual Codes. Cryptology ePrint Archive Paper 2025\/858. https:\/\/eprint.iacr.org\/2025\/858","DOI":"10.1145\/3719027.3765194"},{"key":"e_1_3_2_1_5_1","unstructured":"Daniel J. Bernstein. [n.d.]. The Transposition Principle. https:\/\/cr.yp.to\/transposition.html. Accessed: 2025-05-06."},{"key":"e_1_3_2_1_6_1","volume-title":"A note on the permuted puzzles toy conjecture. arXiv preprint arXiv:2108.07885","author":"Blackwell Keller","year":"2021","unstructured":"Keller Blackwell and Mary Wootters. 2021. A note on the permuted puzzles toy conjecture. arXiv preprint arXiv:2108.07885 (2021)."},{"key":"e_1_3_2_1_7_1","unstructured":"Remco Bloemen Daniel Kales Philipp Sippl and Roman Walch. 2024. Large-Scale MPC: Scaling Private Iris Code Uniqueness Checks to Millions of Users. IACR Cryptol. ePrint Arch. (2024) 705. https:\/\/eprint.iacr.org\/2024\/705"},{"key":"e_1_3_2_1_8_1","volume-title":"Lipton","author":"Blum Avrim","year":"1994","unstructured":"Avrim Blum, Merrick Furst, Michael Kearns, and Richard J. Lipton. 1994. Cryptographic Primitives Based on Hard Learning Problems. In Advances in Cryptology -- CRYPTO' 93, Douglas R. Stinson (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 278-291."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03184936"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243868"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15979-4_21"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_14"},{"key":"e_1_3_2_1_14_1","volume-title":"On the security of doubly efficient PIR. Cryptology ePrint Archive","author":"Boyle Elette","year":"2021","unstructured":"Elette Boyle, Justin Holmgren, Fermi Ma, and Mor Weiss. 2021. On the security of doubly efficient PIR. Cryptology ePrint Archive (2021)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-36033-7_18"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70503-3_22"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-36033-7_16"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2502.13060"},{"key":"e_1_3_2_1_19_1","volume-title":"Blaze: Fast SNARKs from Interleaved RAA Codes. IACR Cryptol. ePrint Arch.","author":"Brehm Martijn","year":"2024","unstructured":"Martijn Brehm, Binyi Chen, Ben Fisch, Nicolas Resch, Ron D. Rothblum, and Hadas Zeilberger. 2024. Blaze: Fast SNARKs from Interleaved RAA Codes. IACR Cryptol. ePrint Arch. (2024), 1609. https:\/\/eprint.iacr.org\/2024\/1609"},{"key":"e_1_3_2_1_20_1","volume-title":"Linear time encodable binary code achieving GV bound with linear time encodable dual achieving GV bound. arXiv preprint arXiv:2509.07639","author":"Brehm Martijn","year":"2025","unstructured":"Martijn Brehm and Nicolas Resch. 2025. Linear time encodable binary code achieving GV bound with linear time encodable dual achieving GV bound. arXiv preprint arXiv:2509.07639 (2025). https:\/\/arxiv.org\/abs\/2509.07639"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30589-4_14"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70503-3_23"},{"key":"e_1_3_2_1_23_1","volume-title":"Algorithmic Learning Theory, 16-19 March 2021, Virtual Conference, Worldwide (Proceedings of Machine Learning Research","volume":"504","author":"Chen Aidao","year":"2021","unstructured":"Aidao Chen, Anindya De, and Aravindan Vijayaraghavan. 2021. Learning a mixture of two subspaces over finite fields. In Algorithmic Learning Theory, 16-19 March 2021, Virtual Conference, Worldwide (Proceedings of Machine Learning Research, Vol. 132), Vitaly Feldman, Katrina Ligett, and Sivan Sabato (Eds.). PMLR, 481-504. http:\/\/proceedings.mlr.press\/v132\/chen21a.html"},{"key":"e_1_3_2_1_24_1","unstructured":"Caicai Chen Yuval Ishai Tamer Mour and Alon Rosen. 2025. Secret-Key PIR from Random Linear Codes. Cryptology ePrint Archive Paper 2025\/646. https:\/\/eprint.iacr.org\/2025\/646"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492461"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.71"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_27"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180417"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.56553\/POPETS-2023-0022"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_10"},{"key":"e_1_3_2_1_32_1","first-page":"201","volume-title":"Proc. 36th Annual Allerton Conference on Communication, Control, and Computing","author":"Divsalar Daniel","unstructured":"Daniel Divsalar, Hui Jin, and Robert J. McEliece. 1998. Coding Theorems for ''Turbo-Like'' Codes. In Proc. 36th Annual Allerton Conference on Communication, Control, and Computing. Monticello, IL, USA, 201-210."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536498"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_1"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2554797.2554815"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP54263.2024.00116"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3670391"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-36033-7_17"},{"key":"e_1_3_2_1_39_1","volume-title":"Foundations of Cryptography","author":"Goldreich Oded","unstructured":"Oded Goldreich. 2001. Foundations of Cryptography: Volume 1, Basic Tools. Cambridge University Press, Cambridge, UK."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595333"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3690281"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3600006.3613134"},{"key":"e_1_3_2_1_43_1","volume-title":"One Server for the Price of Two: Simple and Fast Single-Server Private Information Retrieval. In 32nd USENIX Security Symposium, USENIX Security 2023","author":"Henzinger Alexandra","year":"2023","unstructured":"Alexandra Henzinger, Matthew M. Hong, Henry Corrigan-Gibbs, Sarah Meiklejohn, and Vinod Vaikuntanathan. 2023b. One Server for the Price of Two: Simple and Fast Single-Server Private Information Retrieval. In 32nd USENIX Security Symposium, USENIX Security 2023, Anaheim, CA, USA, August 9-11, 2023, Joseph A. Calandrino and Carmela Troncoso (Eds.). USENIX Association, 3889-3905. https:\/\/www.usenix.org\/conference\/usenixsecurity23\/presentation\/henzinger"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34047-5_20"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_24"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.25"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374438"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_18"},{"key":"e_1_3_2_1_49_1","unstructured":"Vladimir Kolesnikov Stanislav Peceny Srinivasan Raghuraman and Peter Rindal. 2025. Stationary Syndrome Decoding for Improved PCGs. IACR Cryptol. ePrint Arch. (2025) 295. https:\/\/eprint.iacr.org\/2025\/295"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646125"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585175"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-58751-1_6"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"e_1_3_2_1_54_1","volume-title":"Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption. In Advances in Cryptology - EUROCRYPT '88 (Lecture Notes in Computer Science","volume":"453","author":"Matsumoto Tsutomu","year":"1988","unstructured":"Tsutomu Matsumoto and Hideki Imai. 1988. Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption. In Advances in Cryptology - EUROCRYPT '88 (Lecture Notes in Computer Science, Vol. 330), Christof G. G\u00fcnther (Ed.). Springer, Davos, Switzerland, 419-453."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2804444"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301312"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2000.848445"},{"key":"e_1_3_2_1_58_1","volume-title":"Authentication protocol using trapdoored matrices. Master's thesis","author":"Sotiraki Aikaterini","unstructured":"Aikaterini Sotiraki. 2016. Authentication protocol using trapdoored matrices. Master's thesis. Massachusetts Institute of Technology."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2502.13065"}],"event":{"name":"CCS '25: ACM SIGSAC Conference on Computer and Communications Security","location":"Taipei Taiwan","acronym":"CCS '25","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"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.3765194","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:30:59Z","timestamp":1766442659000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719027.3765194"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":59,"alternative-id":["10.1145\/3719027.3765194","10.1145\/3719027"],"URL":"https:\/\/doi.org\/10.1145\/3719027.3765194","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"}}]}}