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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 453 LNCS, Issue , 1990, Pages 265-272

  Girault, Marc ^a  

^a Service d’Etudes communes des Postes et Télécommunications ^*  (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING;

CODING THEORY; IDENTIFICATION PROTOCOL; IDENTIFICATION SCHEME; LINEAR DECODING; NP-HARD; THREE-PASS;

CRYPTOGRAPHY;

EID: 85015223738     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0030367     Document Type: Conference Paper

References (9)

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.
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.
3. A. Fiat and A. Shamir, “How to prove yourself: Practical solutions to identification and signature problems”, Proc. of CRYPTO ‘86.
4. M. Girault, “Other protocols for Shamir’s identification scheme”, in preparation.
5. S. Harari, “Un algorithme d’authentification sans transfert d’information”, Proc. of Trois journées sur le codage, Toulon, France, 1988.
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.
7. A. Shamir, “An efficient identification scheme based on permuted kernels”, extended abstract presented at CRYPTO’89 rump session, Proc. to appear.
8. J. Stern, “An alternative to the Fiat-Shamir protocol”, EUROCRYPT’89, Proc. to appear.
9. J. Stern, “A method for finding codewords of small weight”, Proc. of Trois journées sur le codage, Toulon, France, 1988.