Skip to main content

A (non-practical) three-pass identification protocol using coding theory

  • Section 7 Zero-Knowledge Protocols
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 453))

Abstract

At EUROCRYPT'89, Stern has presented an identification scheme whose security is based on general linear decoding problem, which is NP-hard. The number of passes of the protocol he designed is five. In this paper, we propose an alternative protocol which works with only three passes and is much simpler to describe (that is the good news) but which is not practical (the bad news).

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. Bibliography

  1. E.R. Berlekamp, R.J. McEliece and H.C.A. van Tilborg, "On the inherent intractability of certain coding problems", IEEE Trans. Inform. Theory, vol.IT-24, pp. 384–386, May 1978.

    Google Scholar 

  2. J.L. Duras and M. Girault, "Etude et implémentation d'algorithmes d'authentification basés sur les codes correcteurs d'erreurs", Technical report, SEPT, 1989.

    Google Scholar 

  3. A. Fiat and A. Shamir, "How to prove yourself: Practical solutions to identification and signature problems", Proc. of CRYPTO '86.

    Google Scholar 

  4. M. Girault, "Other protocols for Shamir's identification scheme", in preparation.

    Google Scholar 

  5. S. Harari, "Un algorithme d'authentification sans transfert d'information", Proc. of Trois journées sur le codage, Toulon, France, 1988.

    Google Scholar 

  6. R. J. Mac Eliece, "A public-key cryptosystem based on algebraic coding theory", DSN Progress Report, Jet Propulsion Laboratory, CA, Jan. & Feb. 1978, pp. 42–44.

    Google Scholar 

  7. A. Shamir, "An efficient identification scheme based on permuted kernels", extended abstract presented at CRYPTO'89 rump session, Proc. to appear.

    Google Scholar 

  8. J. Stern, "An alternative to the Fiat-Shamir protocol", EUROCRYPT'89, Proc. to appear.

    Google Scholar 

  9. J. Stern, "A method for finding codewords of small weight", Proc. of Trois journées sur le codage, Toulon, France, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jennifer Seberry Josef Pieprzyk

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Girault, M. (1990). A (non-practical) three-pass identification protocol using coding theory. In: Seberry, J., Pieprzyk, J. (eds) Advances in Cryptology — AUSCRYPT '90. AUSCRYPT 1990. Lecture Notes in Computer Science, vol 453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030367

Download citation

  • DOI: https://doi.org/10.1007/BFb0030367

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53000-8

  • Online ISBN: 978-3-540-46297-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics