{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:06:43Z","timestamp":1754161603151,"version":"3.41.2"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1023\/a:1008237708202","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T08:47:34Z","timestamp":1040546854000},"page":"13-37","source":"Crossref","is-referenced-by-count":1,"title":["A General Zero-Knowledge Scheme"],"prefix":"10.1007","volume":"12","author":[{"given":"Mike","family":"Burmester","sequence":"first","affiliation":[]},{"given":"Yvo G.","family":"Desmedt","sequence":"additional","affiliation":[]},{"given":"Fred","family":"Piper","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Walker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"136844_CR1","doi-asserted-by":"crossref","unstructured":"L. Babai, Trading group theory for randomness, Proceedings of the seventh ACM Symp. Theory of Computing STOC, (1985) pp. 421\u2013429.","DOI":"10.1145\/22145.22192"},{"key":"136844_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare and O. Goldreich, On defining proofs of knowledge, Advances in Cryptology, Proceedings of Crypto '92 (E. F. Brickell, ed.), Lecture Notes in Computer Science, Springer-Verlag, 740 (1993) pp. 390\u2013420.","DOI":"10.1007\/3-540-48071-4_28"},{"key":"136844_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare, S. Micali and R. Ostrovsky, Perfect zero-knowledge in constant rounds, Proceedings of the twenty second ACM Symp. Theory of Computing STOC, (1990) pp. 482\u2013493.","DOI":"10.1145\/100216.100283"},{"key":"136844_CR4","unstructured":"T. Beth, A Fiat-Shamir-like authentication protocol for the El-Gamal-scheme, Advances in Cryptology, Proceedings of Eurocrypt 88 (C. G. G\u00fcnther, ed.), Lecture Notes in Computer Science, Springer-Verlag, 330 (1988) pp. 77\u201384."},{"key":"136844_CR5","unstructured":"M. Blum, How to prove a theorem so no one else can claim it, Proceedings of the International Congress of Mathematicians, (1987) pp. 1444\u20131451."},{"issue":"2","key":"136844_CR6","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum and C. Cr\u00e9peau, Minimum disclosure proofs of knowledge, Journal of Computer and System Sciences, Vol. 37,No. 2 (1988) pp. 156\u2013189.","journal-title":"Journal of Computer and System Sciences"},{"key":"136844_CR7","doi-asserted-by":"crossref","unstructured":"G. Brassard and C. Cr\u00e9peau, Sorting out zero-knowledge, Advances in Cryptology, Proceedings of Eurocrypt 89 (J.-J. Quisquater and J. Vandewalle, eds.), Lecture Notes in Computer Science, Springer-Verlag, 434 (1990) pp. 181\u2013191.","DOI":"10.1007\/3-540-46885-4_20"},{"issue":"1","key":"136844_CR8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1093\/comjnl\/35.1.21","volume":"35","author":"M. Burmester","year":"1992","unstructured":"M. Burmester, Y. Desmedt and T. Beth, Efficient zero-knowledge identification schemes for smart cards, The Computer Journal, Vol. 35,No. 1 (1992) pp. 21\u201329.","journal-title":"The Computer Journal"},{"issue":"2","key":"136844_CR9","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0020-0190(92)90094-C","volume":"42","author":"M. Burmester","year":"1992","unstructured":"M. Burmester, An almost-constant round interactive zero-knowledge proof, Information Processing Letters, Vol. 42,No. 2 (1992) pp. 81\u201387.","journal-title":"Information Processing Letters"},{"key":"136844_CR10","doi-asserted-by":"crossref","unstructured":"M. V. D. Burmester, Y. Desmedt, F. Piper and M. Walker, A general zero-knowledge scheme, Advances in Cryptology, Proceedings of Eurocrypt 89 (J.-J. Quisquater and J. Vandewalle, eds.), Lecture Notes in Computer Science, Springer-Verlag, 434 (1990) pp. 122\u2013133.","DOI":"10.1007\/3-540-46885-4_15"},{"key":"136844_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/3-540-39118-5_13","volume-title":"Proceedings of Eurocrypt 87","author":"D. Chaum","year":"1988","unstructured":"D. Chaum, J.-H. Evertse, and J. van de Graaf, An improved protocol for demonstrating possession of discrete logarithms and some generalizations, Advances in Cryptology, Proceedings of Eurocrypt 87 (D. Chaum and W. L. Price, eds.), Lecture Notes in Computer Science, Springer-Verlag, Berlin, 304 (1988) pp. 127\u2013141."},{"key":"136844_CR12","doi-asserted-by":"crossref","unstructured":"D. Chaum, J.-H. Evertse, J. van de Graaf and R. Peralta, Demonstrating possession of a discrete logarithm without revealing it, Advances in Cryptology, Proceedings of Crypto 86 (A. Odlyzko, ed.), Lecture Notes in Computer Science, Springer-Verlag, 263 (1987) pp. 200\u2013212.","DOI":"10.1007\/3-540-47721-7_14"},{"key":"136844_CR13","doi-asserted-by":"crossref","unstructured":"Y. Desmedt, Subliminal-free authentication and signature, Advances in Cryptology, Proceedings of Eurocrypt 88 (C. G. G\u00fcnther ed.), Lecture Notes in Computer Science, Springer-Verlag, 330 (1988) pp. 23\u201333.","DOI":"10.1007\/3-540-45961-8_3"},{"issue":"2","key":"136844_CR14","doi-asserted-by":"crossref","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, Vol. 1,No. 2 (1988) 77\u201394.","journal-title":"Journal of Cryptology"},{"key":"136844_CR15","doi-asserted-by":"crossref","unstructured":"A. Fiat and A. Shamir, How to prove yourself: Practical solutions to identification and signature problems, Advances in Cryptology, Proceedings of Crypto 86 (A. Odlyzko, ed.), Lecture Notes in Computer Science, Springer-Verlag, 263 (1987) pp. 186\u2013194.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"136844_CR16","doi-asserted-by":"crossref","unstructured":"L. Fortnow, The complexity of perfect zero-knowledge, Proceedings of the Nineteenth ACM Symp. Theory of Computing STOC, (1987) pp. 204\u2013209.","DOI":"10.1145\/28395.28418"},{"issue":"1","key":"136844_CR17","first-page":"691","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"O. Goldreich, S. Micali and A. Wigderson, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, Journal of the ACM, Vol. 38,No. 1 (1991) pp. 691\u2013729.","journal-title":"Journal of the ACM"},{"issue":"1","key":"136844_CR18","doi-asserted-by":"crossref","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. Comput., Vol. 18,No. 1 (1989) pp. 186\u2013208.","journal-title":"SIAM J. Comput."},{"key":"136844_CR19","doi-asserted-by":"crossref","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, Proceedings of Eurocrypt 88 (C. G. G\u00fcnther, ed.), Lecture Notes in Computer Science, Springer-Verlag, 330 (1988) pp. 123\u2013128.","DOI":"10.1007\/3-540-45961-8_11"},{"key":"136844_CR20","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, and M. Yung, Direct minimum-knowledge computations, Advances in Cryptology, Proceedings of Crypto '87 (C. Pomerance, ed.), Lecture Notes in Computer Science, Springer-Verlag, 293 (1988) pp. 40\u201351.","DOI":"10.1007\/3-540-48184-2_4"},{"key":"136844_CR21","unstructured":"A. Shamir, The search for provably secure identification schemes, Proceedings of the International Congress of Mathematicians, (1987) pp. 1488\u20131495."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008237708202.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008237708202\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008237708202.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:58:32Z","timestamp":1753761512000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008237708202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["136844"],"URL":"https:\/\/doi.org\/10.1023\/a:1008237708202","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}