A (non-practical) three-pass identification protocol using coding theory-Reference-Cited by-同舟云学术

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

Published: Issue: Volume: Page:265-272
ISSN:
Container-title:Advances in Cryptology — AUSCRYPT '90
language:
Short-container-title:

Author:

Girault Marc

Publisher

Springer-Verlag

Link

http://link.springer.com/content/pdf/10.1007/BFb0030367.pdf

Reference9 articles.

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.

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hardness estimates of the code equivalence problem in the rank metric;Designs, Codes and Cryptography;2024-01-08

2. Lossy Cryptography from Code-Based Assumptions;Lecture Notes in Computer Science;2024

3. A Search-to-Decision Reduction for the Permutation Code Equivalence Problem;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25

4. Computational Hardness of the Permuted Kernel and Subcode Equivalence Problems;IEEE Transactions on Information Theory;2023

5. Not Enough LESS: An Improved Algorithm for Solving Code Equivalence Problems over $$\mathbb {F}_q$$;Selected Areas in Cryptography;2021