{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T21:43:33Z","timestamp":1772142213111,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1007\/s002000050053","type":"journal-article","created":{"date-parts":[[2002,8,25]],"date-time":"2002-08-25T03:30:30Z","timestamp":1030246230000},"page":"57-69","source":"Crossref","is-referenced-by-count":74,"title":["Improved identification schemes based on error-correcting codes"],"prefix":"10.1007","volume":"8","author":[{"given":"Pascal","family":"V\u00e9ron","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"60080057200_CR1","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. Proceedings of the 1st ACM Conference Comput. Commun. Security, 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"60080057200_CR2","unstructured":"Berlekamp, E. R.: Algebraic Coding Theory, McGraw-Hill Book Company, 1968"},{"key":"60080057200_CR3","doi-asserted-by":"crossref","unstructured":"Berlekamp, E. R., Mc Eliece, R. J., Van Tilborg, H. C. A.: On the inherent intractability of certain coding problems. IEEE Trans. Inform. Theory, 384\u2013386 (1978)","DOI":"10.1109\/TIT.1978.1055873"},{"key":"60080057200_CR4","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1109\/TIT.1982.1056591","volume":"6","author":"E. R. Berlekamp","year":"1982","unstructured":"Berlekamp, E. R.: Bit-Serial Reed-Solomon Encoders. IEEE Trans. Inform. Theory, vol IT-28, 6, 869\u2013874 (1982)","journal-title":"IEEE Trans. Inform. Theory, vol IT-28"},{"key":"60080057200_CR5","unstructured":"Canteaut, A., Chabanne, H.: A further improvement of the workfactor in an attempt at breaking Mc Eliece\u2019s cryptosystem. Proceedings of Eurocode\u201994, 163\u2013167"},{"key":"60080057200_CR6","first-page":"131","volume-title":"Lecture Notes in Computer Science","author":"F. Chabaud","year":"1995","unstructured":"Chabaud, F.: On the Security of Some Cryptosystems Based On Error-Correcting Codes, Eurocrypt\u201994. Lecture Notes in Computer Science Vol. 950, pp. 131\u2013139. Berlin, Heidelberg, New York: Springer 1995"},{"key":"60080057200_CR7","doi-asserted-by":"crossref","unstructured":"Fiat, A., Shamir, A.: How To Prove Yourself: Practical Solutions to Identification and Signatures Problems. Advances in Cryptology, Crypto\u201986, Lecture Notes in Computer Science Vol. 263, pp. 186\u2013194. Berlin, Hiedelberg, New York: Springer","DOI":"10.1007\/3-540-47721-7_12"},{"key":"60080057200_CR8","doi-asserted-by":"crossref","unstructured":"Feige, U., Fiat, A., Shamir, A.: Zero-knowledge proofs of identify. Proc. 19th ACM Symp. Theory of Computing, 210\u2013217 (1987)","DOI":"10.1145\/28395.28419"},{"key":"60080057200_CR9","doi-asserted-by":"crossref","unstructured":"Girault, M.: A (non-practical) three-pass identification protocol using coding theory, Advances in Cryptology, Auscrypt\u201990, Lecture Notes in Computer Science Vol. 453, pp. 265\u2013272. Berlin, Heidelberg, New York: Springer","DOI":"10.1007\/BFb0030367"},{"key":"60080057200_CR10","first-page":"202","volume-title":"Lecture Notes in Computer Science","author":"M. Girault","year":"1994","unstructured":"Girault, M., Stern, J.: On the length of cryptographic hash-values used in identification schemes. Crypto\u201994, Lecture Notes in Computer Science Vol. 839, pp. 202\u2013215 Berlin, Heidelberg, New York: Springer 1994"},{"key":"60080057200_CR11","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali S., Rackoff, C.: The knowledge complexity of interactive proof systems. Proc. 17th ACM Symp. Theory Computing, 291\u2013304 (1985)","DOI":"10.1145\/22145.22178"},{"key":"60080057200_CR12","first-page":"91","volume-title":"Lecture Notes in Computer Science","author":"S. Harari","year":"1988","unstructured":"Harari, S. A New Authentication Algorithm, Proceedings of Coding Theory and Applications, Lecture Notes in Computer Science Vol. 388, pp. 91\u2013105, Berlin, Heidelberg, New York: Springer 1988"},{"key":"60080057200_CR13","doi-asserted-by":"crossref","unstructured":"Leon, J. S.: A probabilistic algorithm for computing minimum weights of large error-correcting codes, IEEE Trans. Inform. Theory, IT-34(5): 1354\u20131359","DOI":"10.1109\/18.21270"},{"key":"60080057200_CR14","volume-title":"The Theory of error-correcting codes","author":"F. J. MacWilliams","year":"1977","unstructured":"MacWilliams, F. J., Sloane, N. J. A.: The Theory of error-correcting codes, North-Holland, Amsterdam-New-York-Oxford, 1977"},{"key":"60080057200_CR15","unstructured":"Pointcheval, D.: Neural Networks and their cryptographic applications. Proc. Eurocode\u201994, 183\u2013193"},{"key":"60080057200_CR16","doi-asserted-by":"crossref","unstructured":"Shamir, A.: An efficient identification scheme based on permuted kernels. Proc. Crypto\u201989, Lecture Notes in Computer Science Vol. 435, pp. 606\u2013609, Berlin, Heidelberg, New York: Springer","DOI":"10.1007\/0-387-34805-0_54"},{"key":"60080057200_CR17","unstructured":"Stern, J.: A method for finding codewords of small weight. Coding Theory and Applications. Lecture Notes in Computer Science Vol. 434, pp. 173\u2013180. Berlin, Heidelberg, New York: Springer"},{"key":"60080057200_CR18","first-page":"13","volume-title":"Lecture Notes in Computer Science","author":"J. Stern","year":"1994","unstructured":"Stern, J.: A new identification scheme based on syndrome decoding, Crypto\u201993, Lecture Notes in Computer Science Vol. 773, pp. 13\u201321, Berlin, Heidelberg, New York: Springer 1994"},{"key":"60080057200_CR19","first-page":"164","volume-title":"Lecture Notes in Computer Science","author":"J. Stern","year":"1994","unstructured":"Stern, J.: Designing identification schemes with keys of short size. Crypto\u201994, Lecture Notes in Computer Science Vol. 839, pp. 164\u2013173, Berlin, Heidelberg, New York: Springer 1994"},{"key":"60080057200_CR20","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1090\/S0002-9939-1958-0094332-2","volume":"9","author":"N. Zierler","year":"1958","unstructured":"Zierler, N.: On the Theorem of Gleason and Marsh. Proc. Am. Math. Soc., 9: 236\u2013237, Math. Rev., 20: 851, 1958","journal-title":"Proc. Am. Math. Soc."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s002000050053.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s002000050053\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s002000050053","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T11:26:33Z","timestamp":1578396393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s002000050053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["60080057200"],"URL":"https:\/\/doi.org\/10.1007\/s002000050053","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}