A new identification scheme based on syndrome decoding

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

Volumn 773 LNCS, Issue , 1994, Pages 13-21

  Stern, Jacques ^a  

^a ÉCOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR CORRECTION; PUBLIC KEY CRYPTOGRAPHY;

ARITHMETIC OPERATIONS; ERROR CORRECTING CODE; FIAT-SHAMIR SCHEME; IDENTIFICATION PROTOCOL; IDENTIFICATION SCHEME; LINEAR ERROR-CORRECTING CODES; PERMUTED KERNEL PROBLEM; ZERO KNOWLEDGE PROOF;

DECODING;

EID: 84955595109     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48329-2_2     Document Type: Conference Paper

References (12)

1. E. E. Berlekamp, R. J. Mc Eliece and H. C. A. Van Tilborg. On the inherent intractability of certain coding problems, IEEE Trans. Inform. Theory, (1978) 384-386.
2. F. Chabaud, Asymptotic analysis of probabilistic algorithms for finding short codewords, Proceedings of EUROCODE 92, Lecture Notes in Computer Science, to appear.
3. M. J. Coster, A. Joux, B. A. LaMacchia, A. M. Odlyzko, C. P. Schnorr and J. Stem, Improved low-density subset sum algorithms, Computational Complexity, to appear.
4. A. Fiat and A. Shamir, How to prove yourself: Practical solutions to identification and signature problems, Proceedings of Crypto 86, Lecture Notes in Computer Science 263, 181-187.
5. U. Feige, A. Fiat and A. Shamir, Zero-knowledge proofs of identity, Proc. 19th ACM Symp. Theory of Computing, 210-217, (1987) and J. Cryptology, 1 (1988), 77-95.
6. S. Goldwasser, S. Micali and C. Rackoff, The knowledge complexity of interactive proof systems, Proc. 17th ACM Symp. Theory of Computing, 291-304, (1985).
7. J. S. Leon, A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Trans. Inform. Theory, IT-34(5): 1354-1359.
8. J. C. Lagarias and A. M. Odlyzko, Solving low-density subset sum problems, J. Assoc. Comp. Mach. 32 (1985), 229-246.
9. F. J. MacWilliams and N. J. A. Sloane, The theory of error-correcting codes, North-Holland, Amsterdam-New-York-Oxford (1977).
10. A. Shamir, An efficient identification scheme based on permuted kernels, Proceedings of Crypto 89, Lecture Notes in Computer Science 435, 606-609.
11. J. Stern, An alternative to the Fiat-Shamir protocol, Proceedings of Eurocrypt 89, Lecture Notes in Computer Science 434, 173-180.
12. J. Stern, A method for finding codewords of small weight, Coding Theory and Applications, Lecture Notes in Computer Science 388 (1989), 106-113.