{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:31Z","timestamp":1725664231464},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540606932"},{"type":"electronic","value":"9783540492801"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60693-9_28","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:53:57Z","timestamp":1330289637000},"page":"264-269","source":"Crossref","is-referenced-by-count":4,"title":["Cryptanalysis of Harari's identification scheme"],"prefix":"10.1007","author":[{"given":"Pascal","family":"V\u00e9ron","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"E.R. Berlekamp, R.J. Mc Eliece & H.C.A. Van Tilborg: On the inherent intractability of certain coding problems, IEEE Trans. Inform. Theory, (1978) 384\u2013386","DOI":"10.1109\/TIT.1978.1055873"},{"key":"28_CR2","unstructured":"A. Canteaut & H. Chabanne: A further improvement of the work factor in an attempt at breaking Mc Eliece's cryptosystem, Proceedings of Eurocode'94, (1994) 163\u2013167"},{"key":"28_CR3","unstructured":"F. Chabaud: On the Security Of Some Cryptosystems Based On Error-Correcting Codes, Pre-proceedings of Eurocrypt'94, (1994) 127\u2013135"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"U. Feige, A. Fiat & A. Shamir: Zero-knowledge proofs of identity, Proc. 19th ACM Symp. Theory of Computing, (1987), 210\u2013217","DOI":"10.1145\/28395.28419"},{"key":"28_CR5","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume":"263","author":"A. Fiat","year":"1986","unstructured":"A. Fiat, A. Shamir: How To Prove Yourself: Practical Solutions to Identification and Signatures Problems, Advances in Cryptology, Crypto'86, Lecture Notes in Computer Science 263, (1986) 186\u2013194","journal-title":"Lecture Notes in Computer Science"},{"key":"28_CR6","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BFb0030367","volume":"453","author":"M. Girault","year":"1990","unstructured":"M. Girault: A (non-practical) three-pass identification protocol using coding theory, Advances in Cryptology, Auscrypt'90, Lecture Notes in Computer Science 453, (1990) 265\u2013272","journal-title":"Lecture Notes in Computer Science"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali and C. Rackoff: The knowledge complexity of interactive proof systems, Proc. 17th ACM Symp. Theory of Computing, (1985), 291\u2013304","DOI":"10.1145\/22145.22178"},{"key":"28_CR8","first-page":"123","volume":"330","author":"L.C. Guillou","year":"1988","unstructured":"L.C. Guillou and J.-J. Quisquater: A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory, Advances in Cryptology, Eurocrypt'88, 330, (1988) 123\u2013128","journal-title":"Advances in Cryptology, Eurocrypt'88"},{"key":"28_CR9","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BFb0019849","volume":"388","author":"S. Harari","year":"1988","unstructured":"S. Harari: A New Authentication Algorithm, Proceedings of Coding Theory and Applications, Lecture Notes in Computer Science 388, (1988) 91\u2013105","journal-title":"Lecture Notes in Computer Science"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"J.S. Leon: 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":"28_CR11","volume-title":"The Theory of error-correcting codes","author":"F.J. MacWilliams","year":"1977","unstructured":"F.J. MacWilliams & N.J.A. Sloane: The Theory of error-correcting codes, North-Holland, Amsterdam-New-York-Oxford, 1977"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"C.P. Schnorr: Efficient signature generation by smart cards, Journal of Cryptology,:4, (1991) 161\u2013174","journal-title":"Journal of Cryptology"},{"key":"28_CR13","unstructured":"J. Stern: A method for finding codewords of small weight, Coding Theory and Applications, Lecture Notes in Computer Science 434, 173\u2013180"},{"key":"28_CR14","unstructured":"J. Stern: A new identification scheme based on syndrome decoding, Crypto'93, Lecture Notes in Computer Science 773, Springer-Verlag (1994) 13\u201321"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60693-9_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:01:33Z","timestamp":1605646893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60693-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540606932","9783540492801"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-60693-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}