{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:19:09Z","timestamp":1725488349467},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540629757"},{"type":"electronic","value":"9783540690535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-69053-0_7","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:24:05Z","timestamp":1186363445000},"page":"75-87","source":"Crossref","is-referenced-by-count":7,"title":["Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation"],"prefix":"10.1007","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[]},{"given":"Ivan","family":"Damg\u00e5rd","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"7_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/0-387-34799-2_23","volume-title":"Proceedings of Crypto\u2019 88","author":"M. Abadi","year":"1990","unstructured":"M. Abadi, E. Allender, A. Broder, J. Feigenbaum and L. Hemachandra: On Generating Solved Instances of Computational Problems, Proceedings of Crypto\u2019 88, Springer Verlag LNCS, vol. 403, pp. 297\u2013310."},{"key":"7_CR2","first-page":"254","volume":"36","author":"L. Babai","year":"1988","unstructured":"L. Babai and S. Moran: Arthur-Merlin Games: A Randomized Proof System and a Hierarchy of Complexity Classes, JCSS, vol. 36, pp. 254\u2013276, 1988.","journal-title":"JCSS"},{"key":"7_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/3-540-48071-4_28","volume-title":"Proceedings of Crypto\u2019 92","author":"M. Bellare","year":"1993","unstructured":"M. Bellare and O. Goldreich: On Defining Proofs of Knowledge, Proceedings of Crypto\u2019 92, Springer Verlag LNCS, vol. 740, pp. 390\u2013420."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF00196726","volume":"4","author":"S. Bengio","year":"1991","unstructured":"S. Bengio, G. Brassard, Y. Desmedt, C. Goutier and J.J. Quisquater: Secure Implementation of Identification Systems, Journal of Cryptology, 1991 (4): 175\u2013183.","journal-title":"Journal of Cryptology"},{"key":"7_CR5","unstructured":"D. Chaum: Provers Can Limit the Number of Verifiers, unpublished."},{"key":"7_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/3-540-44750-4_24","volume-title":"Proceedings of Crypto\u2019 95","author":"R. Cramer","year":"1995","unstructured":"R. Cramer and I. Damg\u00e5rd: Secure Signature Schemes based on Interactive Protocols, Proceedings of Crypto\u2019 95, Springer Verlag LNCS, vol. 963, pp. 297\u2013310."},{"key":"7_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Proceedings of Crypto\u2019 94","author":"R. Cramer","year":"1994","unstructured":"R. Cramer, I. Damg\u00e5rd and B. Schoenmakers: Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols, Proceedings of Crypto\u2019 94, Springer verlag LNCS, vol. 839, pp. 174\u2013187."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"D. Dolev, C. Dwork and M. Naor: Non-malleable cryptography, Proceedings of STOC\u2019 91, pp. 542\u2013552.","DOI":"10.1145\/103418.103474"},{"key":"7_CR9","series-title":"Lect Notes Comput Sci","first-page":"186","volume-title":"Proceedings of Crypto\u2019 86","author":"A. Fiat","year":"1987","unstructured":"A. Fiat and A. Shamir: How to Prove Yourself: Practical Solutions to Identification and Signature Problems, Proceedings of Crypto\u2019 86, Springer Verlag LNCS, vol. 263, pp. 186\u2013194"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"U. Feige, A. Shamir: Witness Indistinguishable and Witness Hiding Protocols, Proceedings of STOC\u2019 90, pp. 416\u2013426.","DOI":"10.1145\/100216.100272"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"U. Feige, A. Fiat and A. Shamir: Zero-Knowledge Proofs of Identity, Journal of Cryptology 1 (1988) 77\u201394.","journal-title":"Journal of Cryptology"},{"key":"7_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/0-387-34805-0_46","volume-title":"Proceedings of Crypto\u2019 89","author":"U. Feige","year":"1990","unstructured":"U. Feige and A. Shamir: Zero-Knowledge Proofs of Knowledge in Two Rounds, Proceedings of Crypto\u2019 89, Springer Verlag LNCS, vol. 435, pp. 526\u2013544."},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali and C. Rackoff: The Knowledge Complexity of Interactive Proof Systems, SIAM J. Computing, Vol. 18, pp. 186\u2013208, 1989.","journal-title":"SIAM J. Computing"},{"key":"7_CR14","unstructured":"Efficient Identification Schemes Secure against Impersonation and Man-in-the-Middle Attacks, preprint, October 1995."},{"key":"7_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-45961-8_11","volume-title":"Proceedings of Eurocrypt\u2019 88","author":"L. Guillou","year":"1988","unstructured":"L. Guillou, J.J. Quisquater: A Practical Zero-Knowledge Protocol fitted to Security Microprocessor Minimizing both Transmission and Memory, Proceedings of Eurocrypt\u2019 88, Springer Verlag LNCS, vol. 330, pp. 123\u2013128."},{"key":"7_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-68339-9_13","volume-title":"Proc. of Eurocrypt\u2019 96","author":"M. Jacobson","year":"1996","unstructured":"M. Jacobson, R. Impagliazzo and K. Sako: Designated Verifier Proofs and their Applications, Proc. of Eurocrypt\u2019 96, Springer Verlag LNCS, vol. 1070, pp. 143\u2013154."},{"key":"7_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-48071-4_3","volume-title":"Proceedings of Crypto\u2019 92","author":"T. Okamoto","year":"1993","unstructured":"T. Okamoto: Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes, Proceedings of Crypto\u2019 92, Springer Verlag LNCS, vol. 740, pp. 31\u201353."},{"issue":"3","key":"7_CR18","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(3): 161\u2013174, 1991.","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69053-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,20]],"date-time":"2019-02-20T23:18:00Z","timestamp":1550704680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69053-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540629757","9783540690535"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-69053-0_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1997]]}}}