{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:41:05Z","timestamp":1775018465429,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540577669","type":"print"},{"value":"9783540483298","type":"electronic"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-48329-2_2","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T21:25:55Z","timestamp":1186349155000},"page":"13-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":217,"title":["A new identification scheme based on syndrome decoding"],"prefix":"10.1007","author":[{"given":"Jacques","family":"Stern","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"E. R. 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\u2013386.","DOI":"10.1109\/TIT.1978.1055873"},{"key":"2_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of EUROCODE 92","author":"F. Chabaud","year":"1992","unstructured":"F. Chabaud, Asymptotic analysis of probabilistic algorithms for finding short codewords, Proceedings of EUROCODE 92, Lecture Notes in Computer Science, to appear."},{"key":"2_CR3","unstructured":"M. J. Coster, A. Joux, B. A. LaMacchia, A. M. Odlyzko, C. P. Schnorr and J. Stern, Improved low-density subset sum algorithms, Computational Complexity, to appear."},{"key":"2_CR4","series-title":"Lect Notes Comput Sci","first-page":"181","volume-title":"Proceedings of Crypto 86","author":"A. Fiat","year":"1986","unstructured":"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\u2013187."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"U. Feige, A. Fiat and A. Shamir, Zero-knowledge proofs of identity, Proc, 19th ACM Symp. Theory of Computing, 210\u2013217, (1987) and J. Cryptology, 1 (1988), 77\u201395.","DOI":"10.1007\/BF02351717"},{"key":"2_CR6","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, 291\u2013304, (1985).","DOI":"10.1145\/22145.22178"},{"key":"2_CR7","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":"2_CR8","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"J. C. Lagarias","year":"1985","unstructured":"J. C. Lagarias and A. M. Odlyzko, Solving low-density subset sum problems, J. Assoc. Comp. Mach.\n                  32 (1985), 229\u2013246.","journal-title":"J. Assoc. Comp. Mach."},{"key":"2_CR9","volume-title":"The theory of error-correcting codes","author":"F. J. MacWilliams","year":"1977","unstructured":"F. J. MacWilliams and N. J. A. Sloane, The theory of error-correcting codes, North-Holland, Amsterdam-New-York-Oxford (1977)."},{"key":"2_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/0-387-34805-0_54","volume-title":"Proceedings of Crypto 89","author":"A. Shamir","year":"1989","unstructured":"A. Shamir, An efficient identification scheme based on permuted kernels, Proceedings of Crypto 89, Lecture Notes in Computer Science 435, 606\u2013609."},{"key":"2_CR11","series-title":"Lect Notes Comput Sci","first-page":"173","volume-title":"Proceedings of Eurocrypt 89","author":"J. Stern","year":"1989","unstructured":"J. Stern, An alternative to the Fiat-Shamir protocol, Proceedings of Eurocrypt 89, Lecture Notes in Computer Science 434, 173\u2013180."},{"key":"2_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0019850","volume-title":"Coding Theory and Applications","author":"J. Stern","year":"1989","unstructured":"J. Stern, A method for finding codewords of small weight, Coding Theory and Applications, Lecture Notes in Computer Science 388 (1989), 106\u2013113."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 93"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48329-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:55:42Z","timestamp":1558259742000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48329-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540577669","9783540483298"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-48329-2_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"13 July 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}