{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:28:05Z","timestamp":1778128085381,"version":"3.51.4"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031305443","type":"print"},{"value":"9783031305450","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-30545-0_19","type":"book-chapter","created":{"date-parts":[[2023,4,15]],"date-time":"2023-04-15T10:02:10Z","timestamp":1681552930000},"page":"551-577","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["How to\u00a0Compress Encrypted Data"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2770-5444","authenticated-orcid":false,"given":"Nils","family":"Fleischhacker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8841-5929","authenticated-orcid":false,"given":"Kasper Green","family":"Larsen","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":[[2023,4,16]]},"reference":[{"key":"19_CR1","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. ACM Press, Toronto (2018). https:\/\/doi.org\/10.1145\/3243734.3243810","DOI":"10.1145\/3243734.3243810"},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Tiwari, P.: A deterministic algorithm for sparse multivariate polynominal interpolation (extended abstract). In: 20th Annual ACM Symposium on Theory of Computing, pp. 301\u2013309. ACM Press, Chicago (1988). https:\/\/doi.org\/10.1145\/62212.62241","DOI":"10.1145\/62212.62241"},{"key":"19_CR3","doi-asserted-by":"publisher","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506\u2013522. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_30","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"19_CR4","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Halevi, S.: Packed ciphertexts in LWE-based homomorphic encryption. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 1\u201313. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_1","DOI":"10.1007\/978-3-642-36362-7_1"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"EJ Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E.J., Romberg, J., Tao, T.: Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2), 489\u2013509 (2006). https:\/\/doi.org\/10.1109\/TIT.2005.862083","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1109\/TIFS.2015.2483486","volume":"11","author":"JH Cheon","year":"2016","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. Forens. Secur. 11(1), 188\u2013199 (2016). https:\/\/doi.org\/10.1109\/TIFS.2015.2483486","journal-title":"IEEE Trans. Inf. Forens. Secur."},{"key":"19_CR7","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Kim, M., Lauter, K.: Homomorphic computation of edit distance. In: Brenner, M., Christin, N., Johnson, B., Rohloff, K. (eds.) FC 2015. LNCS, vol. 8976, pp. 194\u2013212. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48051-9_15","DOI":"10.1007\/978-3-662-48051-9_15"},{"key":"19_CR8","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. ACM Press, Virtual Event (2021). https:\/\/doi.org\/10.1145\/3460120.3484792","DOI":"10.1145\/3460120.3484792"},{"issue":"90","key":"19_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"JW Cooley","year":"1965","unstructured":"Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19(90), 297\u2013301 (1965)","journal-title":"Math. Comput."},{"key":"19_CR10","doi-asserted-by":"publisher","unstructured":"Corrigan-Gibbs, H., Kogan, D.: Private information retrieval with sublinear online time. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 44\u201375. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_3","DOI":"10.1007\/978-3-030-45721-1_3"},{"issue":"4","key":"19_CR11","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006). https:\/\/doi.org\/10.1109\/TIT.2006.871582","journal-title":"IEEE Trans. Inf. Theory"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A Fully Homomorphic Encryption Scheme. Ph.D. thesis, Stanford, CA, USA (2009)","DOI":"10.1145\/1536414.1536440"},{"issue":"6","key":"19_CR13","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1109\/JPROC.2010.2045092","volume":"98","author":"A Gilbert","year":"2010","unstructured":"Gilbert, A., Indyk, P.: Sparse recovery using sparse matrices. Proc. IEEE 98(6), 937\u2013947 (2010). https:\/\/doi.org\/10.1109\/JPROC.2010.2045092","journal-title":"Proc. IEEE"},{"key":"19_CR14","doi-asserted-by":"publisher","unstructured":"Goodrich, M.T., Mitzenmacher, M.: Invertible bloom lookup tables. In: 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 792\u2013799. IEEE Computer Society Press (2011). https:\/\/doi.org\/10.1109\/Allerton.2011.6120248","DOI":"10.1109\/Allerton.2011.6120248"},{"key":"19_CR15","doi-asserted-by":"publisher","unstructured":"Huang, Q.L., Gao, X.S.: Revisit sparse polynomial interpolation based on randomized kronecker substitution. In: England, M., Koepf, W., Sadykov, T.M., Seiler, W.M., Vorozhtsov, E.V. (eds.) CASC 2019: 21st International Workshop on Computer Algebra in Scientific Computing, vol. 11661, pp. 215\u2013235. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-26831-2_15","DOI":"10.1007\/978-3-030-26831-2_15"},{"key":"19_CR16","doi-asserted-by":"publisher","unstructured":"Johnson, M., Wagner, D., Ramchandran, K.: On compressing encrypted data without the encryption key. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 491\u2013504. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_27","DOI":"10.1007\/978-3-540-24638-1_27"},{"key":"19_CR17","doi-asserted-by":"publisher","unstructured":"Klinc, D., Hazay, C., Jagmohan, A., Krawczyk, H., Rabin, T.: On compression of data encrypted with block ciphers. In: Storer, J.A., Marcellin, M.W. (eds.) DCC 2009: 19th Data Compression Conference. pp. 213\u2013222. IEEE Computer Society Press, Snowbird (2009). https:\/\/doi.org\/10.1109\/DCC.2009.71","DOI":"10.1109\/DCC.2009.71"},{"key":"19_CR18","doi-asserted-by":"publisher","unstructured":"Lauter, K., L\u00f3pez-Alt, A., Naehrig, M.: Private computation on encrypted genomic data. In: Aranha, D.F., Menezes, A. (eds.) LATINCRYPT 2014. LNCS, vol. 8895, pp. 3\u201327. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16295-9_1","DOI":"10.1007\/978-3-319-16295-9_1"},{"key":"19_CR19","doi-asserted-by":"publisher","unstructured":"Liu, Z., Tromer, E.: Oblivious message retrieval. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology - CRYPTO 2022, Part I. LNCS, vol. 13507, pp. 753\u2013783. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_26","DOI":"10.1007\/978-3-031-15802-5_26"},{"key":"19_CR20","doi-asserted-by":"publisher","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 554\u2013571. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_31","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"19_CR21","unstructured":"de Prony, G.: Essai exp\u00e9rimental et analytique sur les lois de la dilatabilit\u00e9 des fluides \u00e9lastiques et sur celles de la force expansive de la vapeur de l\u2019eau et de la vapeur de l\u2019alcool \u00e0 diff\u00e9rentes temp\u00e9ratures. J. l\u2019\u00c9cole Polytech. 1(22), 24\u201376 (1795)"},{"key":"19_CR22","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":"19_CR23","doi-asserted-by":"crossref","unstructured":"Shanks, D.: Class number, a theory of factorization, and genera. In: Lewis, D.J. (ed.) 1969 Number Theory Institute. Proceedings of Symposia in Pure Mathematics, vol. 20, pp. 415\u2013440. American Mathematical Society (1971)","DOI":"10.1090\/pspum\/020\/0316385"},{"issue":"4","key":"19_CR24","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1109\/TIT.1973.1055037","volume":"19","author":"D Slepian","year":"1973","unstructured":"Slepian, D., Wolf, J.: Noiseless coding of correlated information sources. IEEE Trans. Inf. Theory 19(4), 471\u2013480 (1973). https:\/\/doi.org\/10.1109\/TIT.1973.1055037","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"19_CR25","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10623-012-9720-4","volume":"71","author":"NP Smart","year":"2012","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic SIMD operations. Designs Codes Cryptogr. 71(1), 57\u201381 (2012). https:\/\/doi.org\/10.1007\/s10623-012-9720-4","journal-title":"Designs Codes Cryptogr."},{"key":"19_CR26","doi-asserted-by":"publisher","unstructured":"Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: 2000 IEEE Symposium on Security and Privacy, pp. 44\u201355. IEEE Computer Society Press, Oakland (2000). https:\/\/doi.org\/10.1109\/SECPRI.2000.848445","DOI":"10.1109\/SECPRI.2000.848445"},{"key":"19_CR27","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, pp. 65\u201376. ACM Press, Berlin (2013). https:\/\/doi.org\/10.1145\/2517488.2517497","DOI":"10.1145\/2517488.2517497"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30545-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:04:11Z","timestamp":1744754651000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30545-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031305443","9783031305450"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30545-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"16 April 2023","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":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"415","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"109","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}