Cryptology ePrint Archive: Report 2019/1278

An IND-CCA-Secure Code-Based EncryptionScheme Using Rank Metric

Hamad Al Shehhi and Emanuele Bellini and Filipe Borba and Florian Caullery and Marc Manzano and Victor Mateu

Abstract: The use of rank instead of Hamming metric has been proposed to address the main drawback of code-based cryptography: large key sizes. There exist several Key Encapsulation Mechanisms (KEM) and Public Key Encryption (PKE) schemes using rank metric including some submissions to the NIST call for standardization of Post-Quantum Cryptography. In this work, we present an IND-CCA PKE scheme based on the McEliece adaptation to rank metric proposed by Loidreau at PQC 2017. This IND-CCA PKE scheme based on rank metric does not use a hybrid construction KEM + symmetric encryption. Instead, we take advantage of the bigger message space obtained by the different parameters chosen in rank metric, being able to exchange multiple keys in one ciphertext. Our proposal is designed considering some specific properties of the random error generated during the encryption. We prove our proposal IND-CCA-secure in the QROM by using a security notion called disjoint simulatability introduced by Saito et al. in Eurocrypt 2018. Moreover, we provide security bounds by using the semi-oracles introduced by Ambainis et al.

Category / Keywords: cryptographic protocols / Post Quantum Cryptography, Code-based cryptography, Rank metric, IND-CCA, PKE, QROM

Original Publication (with minor differences): International Conference on Cryptology in Africa
DOI:
10.1007/978-3-030-23696-0_5

Date: received 4 Nov 2019

Contact author: eemanuele bellini at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20191105:082501 (All versions of this report)

Short URL: ia.cr/2019/1278


[ Cryptology ePrint archive ]