A zero knowledge identification scheme based on the q-ary SD problem

Abstract : At CRYPTO'93, Stern proposed a 3-pass code-based identification scheme with a cheating probability of 2/3. In this paper, we propose a 5-pass code-based protocol with a lower communication complexity, allowing an impersonator to succeed with only a probability of 1/2. Furthermore, we propose to use double-circulant construction in order to dramatically reduce the size of the public key. The proposed scheme is zero-knowledge and relies on an NP-complete coding theory problem (namely the q-ary Syndrome Decoding problem). The parameters we suggest for the instantiation of this scheme take into account a recent study of (a generalization of) Stern's information set decoding algorithm, applicable to linear codes over arbitrary fields Fq; the public data of our construction is then 4 Kbytes, whereas that of Stern's scheme is 15 Kbytes for the same level of security. This provides a very practical identification scheme which is especially attractive for light-weight cryptography.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [28 references]  Display  Hide  Download

https://hal.inria.fr/hal-00674249
Contributor : Pascal Véron <>
Submitted on : Tuesday, March 20, 2012 - 10:19:35 AM
Last modification on : Tuesday, December 4, 2018 - 7:42:05 PM
Document(s) archivé(s) le : Thursday, June 21, 2012 - 2:21:17 AM

File

zkqsd.pdf
Files produced by the author(s)

Identifiers

Citation

Pierre-Louis Cayrel, Pascal Véron, Sidi Mohamed El Yousfi Alaoui. A zero knowledge identification scheme based on the q-ary SD problem. Selected Areas in Cryptography, Aug 2010, Waterloo, Canada. pp.171-186, ⟨10.1007/978-3-642-19574-7_12⟩. ⟨hal-00674249⟩

Share

Metrics

Record views

339

Files downloads

524