A zero knowledge identification scheme based on the q-ary SD problem
Saved in:
| Title: | A zero knowledge identification scheme based on the q-ary SD problem |
|---|---|
| Authors: | Cayrel, Pierre-Louis, Véron, Pascal, El Yousfi Alaoui, Sidi Mohamed |
| Contributors: | Laboratoire Hubert Curien (LabHC), Institut d'Optique Graduate School (IOGS)-Université Jean Monnet - Saint-Étienne (UJM)-Centre National de la Recherche Scientifique (CNRS), Institut de Mathématiques de Toulon - EA 2134 (IMATH), Université de Toulon (UTLN), Center for Advanced Security Research Darmstadt Darmstadt (CASED), Technische Universität Darmstadt - Technical University of Darmstadt (TU Darmstadt) |
| Source: | Selected Areas in Cryptography ; https://inria.hal.science/hal-00674249 ; Selected Areas in Cryptography, Aug 2010, Waterloo, Canada. pp.171-186, ⟨10.1007/978-3-642-19574-7_12⟩ |
| Publisher Information: | CCSD Springer |
| Publication Year: | 2010 |
| Collection: | Université de Lyon: HAL |
| Subject Terms: | ACM: E.: Data/E.4: CODING AND INFORMATION THEORY, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR] |
| Subject Geographic: | Waterloo |
| Time: | Waterloo, Canada |
| Description: | International audience ; 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 object |
| Language: | English |
| DOI: | 10.1007/978-3-642-19574-7_12 |
| Availability: | https://inria.hal.science/hal-00674249 https://inria.hal.science/hal-00674249v1/document https://inria.hal.science/hal-00674249v1/file/zkqsd.pdf https://doi.org/10.1007/978-3-642-19574-7_12 |
| Rights: | info:eu-repo/semantics/OpenAccess |
| Accession Number: | edsbas.421E4A03 |
| Database: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | International audience ; 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. |
|---|---|
| DOI: | 10.1007/978-3-642-19574-7_12 |