{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T09:44:03Z","timestamp":1769075043863,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T00:00:00Z","timestamp":1736121600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T00:00:00Z","timestamp":1736121600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"crossref","award":["ANR-22-PETQ-0008 PQ-TLS"],"award-info":[{"award-number":["ANR-22-PETQ-0008 PQ-TLS"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s10623-024-01555-y","type":"journal-article","created":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T13:41:38Z","timestamp":1736170898000},"page":"1645-1669","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Somewhat homomorphic encryption based on random codes"],"prefix":"10.1007","volume":"93","author":[{"given":"Carlos","family":"Aguilar-Melchor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Dyseryn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Gaborit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,6]]},"reference":[{"key":"1555_CR1","unstructured":"Aguilar Melchor, C., Aragon, N., Bettaieb, S., Bidoux, L., Blazy, O., Deneuville, J.C., Gaborit, P., Z\u00e9mor, G., Couvreur, A., Hauteville, A.: RQC. Technical report, National Institute of Standards and Technology (2019). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-2-submissions."},{"key":"1555_CR2","doi-asserted-by":"crossref","unstructured":"Aguilar-Melchor, C., Aragon, N., Dyseryn, V., Gaborit, P., Z\u00e9mor, G.: LRPC codes with multiple syndromes: near ideal-size KEMs without ideals. In: International Conference on Post-Quantum Cryptography, pp. 45\u201368. Springer (2022)","DOI":"10.1007\/978-3-031-17234-2_3"},{"key":"1555_CR3","doi-asserted-by":"crossref","unstructured":"Alekhnovich, M.: More on average case vs approximation complexity. In: 44th FOCS, IEEE Computer Society Press. pp. 298\u2013307 (2003)","DOI":"10.1109\/SFCS.2003.1238204"},{"key":"1555_CR4","unstructured":"Aragon, N., Blazy, O., Deneuville, J.C., Gaborit, P., Hauteville, A., Ruatta, O., Tillich, J.P., Z\u00e9mor, G., Aguilar Melchor, C., Bettaieb, S., Bidoux, L., Bardet, M., Otmani, A.: ROLLO. Technical report, National Institute of Standards and Technology (2019). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/post-quantum-cryptography-standardization\/round-2-submissions."},{"key":"1555_CR5","doi-asserted-by":"crossref","unstructured":"Aragon, N., Blazy, O., Gaborit, P., Hauteville, A., Z\u00e9mor, G.: Durandal: A rank metric based signature scheme. In Ishai, Y., Rijmen, V., eds.: EUROCRYPT\u00a02019, Part\u00a0III. Volume 11478 of LNCS., pp. 728\u2013758. Springer, Heidelberg (2019)","DOI":"10.1007\/978-3-030-17659-4_25"},{"key":"1555_CR6","unstructured":"Aragon, N., Dyseryn, V., Gaborit, P., Loidreau, P., Renner, J., Wachter-Zeh, A.: LowMS: a new rank metric code-based KEM without ideal structure. Cryptology ePrint Archive, Report 2022\/1596 (2022). https:\/\/eprint.iacr.org\/2022\/1596."},{"issue":"12","key":"1555_CR7","doi-asserted-by":"publisher","first-page":"7697","DOI":"10.1109\/TIT.2019.2933535","volume":"65","author":"N Aragon","year":"2019","unstructured":"Aragon N., Gaborit P., Hauteville A., Ruatta O., Z\u00e9mor G.: Low rank parity check codes: new decoding algorithms and applications to cryptography. IEEE Trans. Inf. Theory 65(12), 7697\u20137717 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1555_CR8","doi-asserted-by":"crossref","unstructured":"Aragon N., Gaborit P., Hauteville A., Tillich, J.P.: A new algorithm for solving the rank syndrome decoding problem. In,: IEEE International Symposium on Information Theory, ISIT 2018, Vail, CO, USA, June 17\u201322, 2018. IEEE 2018, 2421\u20132425 (2018).","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"1555_CR9","doi-asserted-by":"crossref","unstructured":"Armknecht, F., Augot, D., Perret, L., Sadeghi, A.R.: On constructing homomorphic encryption schemes from coding theory. In: IMA International Conference on Cryptography and Coding, pp. 23\u201340. Springer (2011)","DOI":"10.1007\/978-3-642-25516-8_3"},{"key":"1555_CR10","doi-asserted-by":"crossref","unstructured":"Bardet, M., Bros, M., Cabarcas, D., Gaborit, P., Perlner, R.A., Smith-Tone, D., Tillich, J.P., Verbel, J.A.: Improvements of algebraic attacks for solving the rank decoding and MinRank problems. In: ASIACRYPT\u00a02020, Part\u00a0I. LNCS, pp. 507\u2013536. Springer, Heidelberg (2020)","DOI":"10.1007\/978-3-030-64837-4_17"},{"key":"1555_CR11","unstructured":"Bidoux, L., Chi-Dom\u00ednguez, J.J., Feneuil, T., Gaborit, P., Joux, A., Rivain, M., Vin\u00e7otte, A.: RYDE: A digital signature scheme based on rank-syndrome-decoding problem with MPCitH paradigm. arXiv preprint arXiv:2307.08726 (2023)"},{"key":"1555_CR12","unstructured":"Bogdanov, A., Lee, C.H.: Homomorphic encryption from codes. Cryptology ePrint Archive, Report 2011\/622 (2011). https:\/\/eprint.iacr.org\/2011\/622."},{"key":"1555_CR13","doi-asserted-by":"crossref","unstructured":"Boneh, D., Goh, E.J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Theory of Cryptography: Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005. Proceedings 2, pp. 325\u2013341. Springer (2005)","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"1555_CR14","doi-asserted-by":"crossref","unstructured":"Brakerski, Z.: When homomorphism becomes a liability. In Sahai, A., ed.: TCC\u00a02013. Volume 7785 of LNCS., pp. 143\u2013161. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-36594-2_9"},{"key":"1555_CR15","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In Rogaway, P., ed.: CRYPTO\u00a02011. Volume 6841 of LNCS., pp. 505\u2013524. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-22792-9_29"},{"issue":"1","key":"1555_CR16","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2020","unstructured":"Chillotti I., Gama N., Georgieva M., Izabach\u00e8ne M.: TFHE: fast fully homomorphic encryption over the torus. J. Cryptol. 33(1), 34\u201391 (2020).","journal-title":"J. Cryptol."},{"key":"1555_CR17","unstructured":"Cho, J., Kim, Y.S., No, J.S.: Homomorphic computation in reed-muller codes. Cryptology ePrint Archive, Report 2020\/565 (2020). https:\/\/eprint.iacr.org\/2020\/565."},{"key":"1555_CR18","doi-asserted-by":"crossref","unstructured":"Debris-Alazard, T., Tillich, J.P.: Two attacks on rank metric code-based schemes: RankSign and an IBE scheme. In Peyrin, T., Galbraith, S., eds.: ASIACRYPT\u00a02018, Part\u00a0I. Volume 11272 of LNCS., pp. 62\u201392. Springer, Heidelberg (2018)","DOI":"10.1007\/978-3-030-03326-2_3"},{"key":"1555_CR19","doi-asserted-by":"crossref","unstructured":"Ducas, L., Micciancio, D.: FHEW: Bootstrapping homomorphic encryption in less than a second. In Oswald, E., Fischlin, M., eds.: EUROCRYPT\u00a02015, Part\u00a0I. Volume 9056 of LNCS., pp. 617\u2013640. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-662-46800-5_24"},{"issue":"4","key":"1555_CR20","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1555_CR21","doi-asserted-by":"crossref","unstructured":"Gaborit, P., Hauteville, A., Phan, D.H., Tillich, J.P.: Identity-based encryption from codes with rank metric. In Katz, J., Shacham, H., (eds.: CRYPTO\u00a02017, Part\u00a0III. Volume 10403 of LNCS., pp. 194\u2013224. Springer, Heidelberg (2017)","DOI":"10.1007\/978-3-319-63697-9_7"},{"issue":"2","key":"1555_CR22","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1109\/TIT.2015.2511786","volume":"62","author":"P Gaborit","year":"2016","unstructured":"Gaborit P., Ruatta O., Schrek J.: On the complexity of the rank syndrome decoding problem. IEEE Trans. Inf. Theory 62(2), 1006\u20131019 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1555_CR23","unstructured":"Gauthier, V., Otmani, A., Tillich, J.P.: A distinguisher-based attack of a homomorphic encryption scheme relying on reed-solomon codes. Cryptology ePrint Archive, Report 2012\/168 (2012). https:\/\/eprint.iacr.org\/2012\/168."},{"key":"1555_CR24","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the forty-first annual ACM symposium on Theory of computing, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"1555_CR25","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption and how to play mental poker keeping secret all partial information. In: 14th ACM STOC, ACM Press, pp. 365\u2013377 (1982)","DOI":"10.1145\/800070.802212"},{"key":"1555_CR26","doi-asserted-by":"crossref","unstructured":"Hauteville, A., Tillich, J.P.: New algorithms for decoding in the rank metric and an attack on the LRPC cryptosystem (2015). arXiv:1504.05431.","DOI":"10.1109\/ISIT.2015.7282956"},{"key":"1555_CR27","unstructured":"Loidreau, P., Overbeck, R.: Decoding rank errors beyond the error-correction capability. In: Proceedings of the Tenth International Workshop on Algebraic and Combinatorial Coding Theory, ACCT-10, pp. 168\u2013190 (2006)"},{"issue":"2","key":"1555_CR28","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-007-9003-9","volume":"21","author":"R Overbeck","year":"2008","unstructured":"Overbeck R.: Structural attacks for public key cryptosystems based on Gabidulin codes. J. Cryptol. 21(2), 280\u2013301 (2008).","journal-title":"J. Cryptol."},{"key":"1555_CR29","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In Stern, J., (ed.) EUROCRYPT\u201999. Volume 1592 of LNCS., pp. 223\u2013238. Springer, Heidelberg (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"issue":"11","key":"1555_CR30","first-page":"169","volume":"4","author":"RL Rivest","year":"1978","unstructured":"Rivest R.L., Adleman L., Dertouzos M.L.: On data banks and privacy homomorphisms. Found. Secur. Comput. 4(11), 169\u2013180 (1978).","journal-title":"Found. Secur. Comput."},{"key":"1555_CR31","doi-asserted-by":"crossref","unstructured":"Sendrier, N.: Decoding one out of many. In: Post-quantum cryptography\u00a02011. Volume 7071 of LNCS, pp. 51\u201367 (2011)","DOI":"10.1007\/978-3-642-25405-5_4"},{"key":"1555_CR32","doi-asserted-by":"crossref","unstructured":"Sidelnikov, V.M., Shestakov, S.O.: On insecurity of cryptosystems based on generalized Reed-Solomon codes (1992)","DOI":"10.1515\/dma.1992.2.4.439"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01555-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01555-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01555-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:02:24Z","timestamp":1750305744000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01555-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,6]]},"references-count":32,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["1555"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01555-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,6]]},"assertion":[{"value":"5 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}