{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:09:05Z","timestamp":1742915345605,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030236953"},{"type":"electronic","value":"9783030236960"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-23696-0_5","type":"book-chapter","created":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T23:23:13Z","timestamp":1562023393000},"page":"79-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An IND-CCA-Secure Code-Based Encryption Scheme Using Rank Metric"],"prefix":"10.1007","author":[{"given":"Hamad Al","family":"Shehhi","sequence":"first","affiliation":[]},{"given":"Emanuele","family":"Bellini","sequence":"additional","affiliation":[]},{"given":"Filipe","family":"Borba","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Caullery","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Manzano","sequence":"additional","affiliation":[]},{"given":"Victor","family":"Mateu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,29]]},"reference":[{"key":"5_CR1","unstructured":"Al Abdouli, A., et al.: Drankula, a McEliece-like rank metric based cryptosystem implementation. In: Proceedings of the 15th International Joint Conference on e-Business and Telecommunications, ICETE 2018, vol. 2, SECRYPT, pp. 230\u2013241 (2018)"},{"key":"5_CR2","unstructured":"Ambainis, A., Hamburg, M., Unruh, D.: Quantum security proofs using semi-classical oracles. Cryptology ePrint Archive, Report 2018\/904 (2018). https:\/\/eprint.iacr.org\/2018\/904"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Aragon, N., Gaborit, P., Hauteville, A., Tillich, J.: A new algorithm for solving the rank syndrome decoding problem. In: IEEE International Symposium on Information Theory, ISIT, pp. 2421\u20132425 (2018)","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BFb0055718","volume-title":"Advances in Cryptology \u2014 CRYPTO 1998","author":"M Bellare","year":"1998","unstructured":"Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 26\u201345. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055718"},{"key":"5_CR5","volume-title":"Post Quantum Cryptography","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D.J., Buchmann, J., Dahmen, E.: Post Quantum Cryptography, 1st edn. Springer, Heidelberg (2008)","edition":"1"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-25385-0_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Dagdelen, \u00d6., Fischlin, M., Lehmann, A., Schaffner, C., Zhandry, M.: Random oracles in a quantum world. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 41\u201369. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_3"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Coggia, D., Couvreur, A.: On the security of a Loidreau\u2019s rank metric code based encryption scheme. arXiv preprint arXiv:1903.02933 (2019)","DOI":"10.1007\/s10623-020-00781-4"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-79063-3_9","volume-title":"Post-Quantum Cryptography","author":"J Czajkowski","year":"2018","unstructured":"Czajkowski, J., Groot Bruinderink, L., H\u00fclsing, A., Schaffner, C., Unruh, D.: Post-quantum security of the sponge construction. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 185\u2013204. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_9"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography (extended abstract). In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pp. 542\u2013552 (1991)","DOI":"10.1145\/103418.103474"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-48405-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO 1999","author":"E Fujisaki","year":"1999","unstructured":"Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 537\u2013554. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_34"},{"issue":"1","key":"5_CR11","first-page":"3","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin, E.M.: Theory of codes with maximum rank distance. Probl. Inf. Transm. (English translation of Problemy Peredachi Informatsii) 21(1), 3\u201316 (1985)","journal-title":"Probl. Inf. Transm. (English translation of Problemy Peredachi Informatsii)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/3-540-46416-6_41","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1991","author":"EM Gabidulin","year":"1991","unstructured":"Gabidulin, E.M., Paramonov, A.V., Tretjakov, O.V.: Ideals over a non-commutative ring and their application in cryptology. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 482\u2013489. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_41"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-319-63697-9_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"P Gaborit","year":"2017","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 2017. LNCS, vol. 10403, pp. 194\u2013224. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_7"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Gadouleau, M., Yan, Z.: Complexity of decoding Gabidulin codes. In: 42nd Annual Conference on Information Sciences and Systems. CISS 2008, pp. 1081\u20131085 (2008)","DOI":"10.1109\/CISS.2008.4558679"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-319-70500-2_12","volume-title":"Theory of Cryptography","author":"D Hofheinz","year":"2017","unstructured":"Hofheinz, D., H\u00f6velmanns, K., Kiltz, E.: A modular analysis of the fujisaki-okamoto transformation. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 341\u2013371. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_12"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/11779360_4","volume-title":"Coding and Cryptography","author":"P Loidreau","year":"2006","unstructured":"Loidreau, P.: A welch\u2013berlekamp like algorithm for decoding gabidulin codes. In: Ytrehus, \u00d8. (ed.) WCC 2005. LNCS, vol. 3969, pp. 36\u201345. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11779360_4"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-59879-6_1","volume-title":"Post-Quantum Cryptography","author":"P Loidreau","year":"2017","unstructured":"Loidreau, P.: A new rank metric codes based encryption scheme. In: Lange, T., Takagi, T. (eds.) PQCrypto 2017. LNCS, vol. 10346, pp. 3\u201317. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_1"},{"key":"5_CR18","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. The Deep Space Network Progress Report, pp. 114\u2013116, January and February 1978"},{"key":"5_CR19","unstructured":"Mosca, M., Stebila, D.: Contributors: Open quantum safe (2017). https:\/\/openquantumsafe.org\/"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"NIST: Federal inf. process. stds. (nist fips) - 202 (2015). https:\/\/dx.doi.org\/10.6028\/NIST.FIPS.202","DOI":"10.6028\/NIST.FIPS.202"},{"key":"5_CR21","unstructured":"NIST: Submission requirements and evaluation criteria for the post-quantum cryptography standardization process (2016). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/call-for-proposals-final-dec-2016.pdf"},{"issue":"1\u20133","key":"5_CR22","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10623-008-9175-9","volume":"49","author":"R Nojima","year":"2008","unstructured":"Nojima, R., Imai, H., Kobara, K., Morozov, K.: Semantic security for the McEliece cryptosystem without random oracles. Des. Codes Crypt. 49(1\u20133), 289\u2013305 (2008)","journal-title":"Des. Codes Crypt."},{"issue":"2","key":"5_CR23","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":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-319-78372-7_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"T Saito","year":"2018","unstructured":"Saito, T., Xagawa, K., Yamakawa, T.: Tightly-secure key-encapsulation mechanism in the quantum random oracle model. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 520\u2013551. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_17"},{"issue":"6","key":"5_CR25","doi-asserted-by":"publisher","first-page":"46:1","DOI":"10.1145\/2817206","volume":"62","author":"D Unruh","year":"2015","unstructured":"Unruh, D.: Revocable quantum timed-release encryption. J. ACM 62(6), 46:1\u201346:76 (2015)","journal-title":"J. ACM"},{"key":"5_CR26","unstructured":"Wachter-Zeh, A.: Decoding of block and convolutional codes in rankmetric.Ph.D. thesis, Universit\u00e9 Rennes 1 (2013). https:\/\/tel.archives-ouvertes.fr\/tel-0105674"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23696-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:24:08Z","timestamp":1710260648000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-23696-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030236953","9783030236960"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23696-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"29 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AFRICACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in Africa","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rabat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africacrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/africacrypt2019.aui.ma\/index.php","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","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":"22","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":"42% - 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.5","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":"4.5","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)"}}]}}