Technical Program

Paper Detail

Paper Title Improved Veron Identification and Signature Schemes in the Rank Metric
Paper IdentifierTH1.R7.1
Authors Emanuele Bellini, Florian Caullery, Darkmatter LLC, United Arab Emirates; Philippe Gaborit, Université de Limoges, France; Marc Manzano, Victor Mateu, Darkmatter LLC, United Arab Emirates
Session Post-Quantum Cryptography I
Location Bièvre, Level 5
Session Time Thursday, 11 July, 09:50 - 11:10
Presentation Time Thursday, 11 July, 09:50 - 10:10
Manuscript  Click here to download the manuscript
Abstract It is notably challenging to design an efficient and secure signature scheme based on error-correcting codes. An approach to build such signature schemes is to derive it from an identification protocol through the Fiat-Shamir transform. All such protocols based on codes must be run several rounds, since each run of the protocol allows a cheating probability of either 2/3 or 1/2. The resulting signature size is proportional to the number of rounds, thus making the 1/2 cheating probability version more attractive. We present a signature scheme based on double circulant codes in the rank metric, derived from an identification protocol with cheating probability of 2/3. We reduced this probability to almost 1/2 to obtain the smallest signature among code-based signature schemes based on the Fiat-Shamir paradigm, around 22 KBytes for 128 bit security level. Furthermore, among all code-based signature schemes, our proposal has the lowest value of signature plus public key size, and the smallest secret and public key sizes. We provide a security proof in the Random Oracle Model, implementation performances, and a comparison with the parameters of similar signature schemes.