{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T17:14:11Z","timestamp":1778087651624,"version":"3.51.4"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253293","type":"print"},{"value":"9783032253309","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-25330-9_13","type":"book-chapter","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:40:44Z","timestamp":1778085644000},"page":"366-391","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Oblivious Ciphertext Compression via\u00a0Linear Codes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0489-5134","authenticated-orcid":false,"given":"Pascal","family":"Giorgi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2057-5429","authenticated-orcid":false,"given":"Bruno","family":"Grenet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7325-5261","authenticated-orcid":false,"given":"Mark","family":"Simkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,7]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Angel, S., Chen, H., Laine, K., Setty, S.T.V.: PIR with compressed queries and amortized query processing. In: 2018 IEEE Symposium on Security and Privacy, pp. 962\u2013979, San Francisco, CA, USA, May 21\u201323 (2018). IEEE Computer Society Press. https:\/\/doi.org\/10.1109\/SP.2018.00062","DOI":"10.1109\/SP.2018.00062"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Akavia, A., Feldman, D., Shaul, H.: Secure search on encrypted data via multi-ring sketch. In: Lie, D., Mannan, M., Backes, M., Wang, X., eds, ACM CCS 2018: 25th Conference on Computer and Communications Security, pp. 985\u20131001, Toronto, ON, Canada (2018). ACM Press. https:\/\/doi.org\/10.1145\/3243734.3243810","DOI":"10.1145\/3243734.3243810"},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.2478\/popets-2019-0038","volume":"2019","author":"A Akavia","year":"2019","unstructured":"Akavia, A., Gentry, C., Halevi, S., Leibovich, M.: Setup-free secure search on encrypted data: faster and post-processing free. Proc. Priv. Enhancing Technol. 2019(3), 87\u2013107 (2019)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Berlekamp, E.R.: Factoring polynomials over large finite fields. Math. Comput. 24(111), 713\u2013735 (1970). https:\/\/doi.org\/10.1090\/S0025-5718-1970-0276200-X","DOI":"10.1090\/S0025-5718-1970-0276200-X"},{"key":"13_CR5","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing. In: Oswald, E., Fischlin, M., eds, Advances in Cryptology \u2013 EUROCRYPT 2015, Part II, volume 9057 of Lecture Notes in Computer Science, pages 337\u2013367, Sofia, Bulgaria (2015). Springer, Heidelberg, Germany. https:\/\/doi.org\/10.1007\/978-3-662-46803-6_12","DOI":"10.1007\/978-3-662-46803-6_12"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Beimel, A., Ishai, Y., Malkin, T.: Reducing the servers computation in private information retrieval: PIR with preprocessing. In: Bellare, M., ed, Advances in Cryptology \u2013 CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science, pages 55\u201373, Santa Barbara, CA, USA (2000). Springer, Heidelberg, Germany. https:\/\/doi.org\/10.1007\/3-540-44598-6_4","DOI":"10.1007\/3-540-44598-6_4"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Bostan, A., Lecerf, G., Schost, E.: Tellegen\u2019s principle into practice. In: Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation, ISSAC \u201903, pp. 37\u201344, New York, NY, USA (2003). ACM. https:\/\/doi.org\/10.1145\/860854.860870","DOI":"10.1145\/860854.860870"},{"key":"13_CR8","unstructured":"Bienstock, A., Patel, S., Seo, J.Y., Yeo, K.: Batch PIR and labeled PSI with oblivious ciphertext compression. In: Calandrino, J.A., Troncoso, C., eds, 33nd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, pp. 301\u2013318 (2024). USENIX Association, 2023"},{"issue":"4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/j.jco.2004.09.009","volume":"21","author":"A Bostan","year":"2005","unstructured":"Bostan, A., Schost, E.: Polynomial evaluation and interpolation on special sets of points. J. Complex. 21(4), 420\u2013446 (2005). https:\/\/doi.org\/10.1016\/j.jco.2004.09.009","journal-title":"J. Complex."},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Choi, S.G., Dachman-Soled, D., Gordon, S.D., Liu, L., Yerukhimovich, A.: Compressed oblivious encoding for homomorphically encrypted search. In: Vigna, G., Shi, E., eds, ACM CCS 2021: 28th Conference on Computer and Communications Security, pp. 2277\u20132291, Virtual Event, Republic of Korea (2021). ACM Press. https:\/\/doi.org\/10.1145\/3460120.3484792","DOI":"10.1145\/3460120.3484792"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: 36th Annual Symposium on Foundations of Computer Science, pp. 41\u201350, Milwaukee, Wisconsin (1995). IEEE Computer Society Press. https:\/\/doi.org\/10.1109\/SFCS.1995.492461","DOI":"10.1109\/SFCS.1995.492461"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Cantor, D.G., Kaltofen, E.: On fast multiplication of polynomials over arbitrary algebras. Acta Informatica 28(7), 693\u2013701 (1991)","DOI":"10.1007\/BF01178683"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Kim, M., Kim, M.: Optimized search-and compute circuits and their application to query evaluation on encrypted data. IEEE Trans. Inf. Forensics Secur. 11(1), 188\u2013 199 (2016). https:\/\/doi.org\/10.1109\/TIFS.2015.2483486","DOI":"10.1109\/TIFS.2015.2483486"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Coxon, N.: Fast transforms over finite fields of characteristic two. J. Symb. Comput. 104, 824\u2013854 (2021). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0747717120301127. https:\/\/doi.org\/10.1016\/j.jsc.2020.10.002","DOI":"10.1016\/j.jsc.2020.10.002"},{"key":"13_CR15","unstructured":"Fleischhacker, N., Larsen, K.G., Obremski, M., Simkin, M.: Invertible Bloom lookup tables with less memory and randomness. In: Chan, T.M., Fischer, J., Iacono, J., Herman, G., eds, 32nd Annual European Symposium on Algorithms, ESA 2024, September 2-4, 2024, Royal Holloway, London, United Kingdom, volume 308 of LIPIcs, pp. 54:1\u201354:17. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik (2024)"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Fleischhacker, N., Larsen, K.G., Simkin, M.: How to compress encrypted data. In: Hazay, C., Stam, M., eds, Advances in Cryptology \u2013 EUROCRYPT 2023, Part I, volume 14004 of Lecture Notes in Computer Science, pp. 551\u2013577, Lyon, France (2023). Springer, Heidelberg, Germany. https:\/\/doi.org\/10.1007\/978-3-031-30545-0_19","DOI":"10.1007\/978-3-031-30545-0_19"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Forney, G.: On decoding BCH codes. IEEE Trans. Inf. Theory 11(4), 549\u2013557 (1965). https:\/\/doi.org\/10.1109\/TIT.1965.1053825","DOI":"10.1109\/TIT.1965.1053825"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A Fully Homomorphic Encryption Scheme. PhD thesis, Stanford, CA, USA (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Gilboa, N., Ishai, Y.: Distributed point functions and their applications. In: Nguyen, P.Q., Oswald, E., eds, Advances in Cryptology \u2013 EUROCRYPT 2014, volume 8441 of Lecture Notes in Computer Science, pages 640\u2013658, Copenhagen, Denmark (2014). Springer, Heidelberg, Germany. https:\/\/doi.org\/10.1007\/978-3-642-55220-5_35","DOI":"10.1007\/978-3-642-55220-5_35"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Lin, S.-J., Al-Naffouri, T.Y., Han, Y.S.: FFT algorithm for binary extension finite fields and its application to Reed-Solomon codes. IEEE Trans. Inf. Theory 62(10), 5343\u20135358 (2016). https:\/\/doi.org\/10.1109\/TIT.2016.2600417","DOI":"10.1109\/TIT.2016.2600417"},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"Lin, S-J., Chung, W-H., Han, Y.S.: Novel polynomial basis and its application to Reed-Solomon erasure codes. In: Proceedings of the 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, FOCS \u201914, pp. 316\u2013325, USA (2014). IEEE Computer Society. https:\/\/doi.org\/10.1109\/FOCS.2014.41","DOI":"10.1109\/FOCS.2014.41"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Liu, Z., Tromer, E.: Oblivious message retrieval. In: Dodis, Y., Shrimpton, T., eds, Advances in Cryptology \u2013 CRYPTO 2022, Part I, volume 13507 of Lecture Notes in Computer Science, pp. 753\u2013 783, Santa Barbara, CA, USA (2022). Springer, Heidelberg, Germany. https:\/\/doi.org\/10.1007\/978-3-031-15802-5_26","DOI":"10.1007\/978-3-031-15802-5_26"},{"key":"13_CR23","unstructured":"Liu, Z., Tromer, E., Wang, Y.: PerfOMR: oblivious message retrieval with reduced communication and computation. In: 33rd USENIX Security Symposium (USENIX Security 24), pages 3169\u20133186, Philadelphia, PA, August 2024. USENIX Association. https:\/\/www.usenix.org\/ conference\/usenixsecurity24\/presentation\/liu-zeyu"},{"issue":"2","key":"13_CR24","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/0209024","volume":"9","author":"M Rabin","year":"1980","unstructured":"Rabin, M.: Probabilistic algorithms in finite fields. SIAM J. Comput. 9(2), 273\u2013280 (1980). https:\/\/doi.org\/10.1137\/0209024","journal-title":"SIAM J. Comput."},{"key":"13_CR25","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. In: DeMillo, R.A., Lipton, R.J., Dobkin, D.P., Jones, A.K., eds, Foundations of secure computation, pp. 169\u2013179. Academic Press (1978)"},{"key":"13_CR26","unstructured":"Roth, R.M.: Introduction to Coding Theory. Cambridge University Press, Cambridge, UK; New York (2006)"},{"key":"13_CR27","unstructured":"Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, 3rd edition (2013)"},{"key":"13_CR28","doi-asserted-by":"publisher","unstructured":"Wen, R., Yu, Y., Xie, X., Zhang, Y.: LEAF: a faster secure search algorithm via localization, extraction, and reconstruction. In: Ligatti, J., Ou, X., Katz, J., Vigna, G., eds, ACM CCS 2020: 27th Conference on Computer and Communications Security, pp. 1219\u20131232, Virtual Event, USA (2020). ACM Press. https:\/\/doi.org\/10.1145\/3372297.3417237","DOI":"10.1145\/3372297.3417237"},{"key":"13_CR29","doi-asserted-by":"publisher","unstructured":"Yasuda, M., Shimoyama, T., Kogure, J., Yokoyama, K., Koshiba, T.: Secure pattern matching using somewhat homomorphic encryption. In: Juel, A., Parno, B., eds, CCSW 2013: The ACM Cloud Computing Security Workshop, pages 65\u201376, Berlin, Germany (2013). ACM Press. https:\/\/doi.org\/10.1145\/2517488.2517497","DOI":"10.1145\/2517488.2517497"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25330-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:40:50Z","timestamp":1778085650000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25330-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253293","9783032253309"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25330-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}