{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:59:08Z","timestamp":1649206748295},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T00:00:00Z","timestamp":1101859200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. & Technol."],"published-print":{"date-parts":[[2004,12]]},"DOI":"10.1007\/bf02973457","type":"journal-article","created":{"date-parts":[[2008,10,14]],"date-time":"2008-10-14T20:49:33Z","timestamp":1224017373000},"page":"936-941","source":"Crossref","is-referenced-by-count":0,"title":["Memorizable interactive proof and zero-knowledge proof systems"],"prefix":"10.1007","volume":"19","author":[{"given":"Ning","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia-Wei","family":"Rong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,10,11]]},"reference":[{"key":"BF02973457_CR1","doi-asserted-by":"crossref","unstructured":"Goldwasser S, Micali S, Rackoff C. The knowledge complexity of interactive proof-systems (extended abstract). InProceedings of ACM Symposium on Theory of Computing (STOC), 1985, pp.291\u2013304.","DOI":"10.1145\/22145.22178"},{"issue":"6","key":"BF02973457_CR2","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1007\/BF02960765","volume":"17","author":"D Zheng","year":"2002","unstructured":"Zheng D, Chen K, You J. Multiparty authentication services and key agreement protocols with semi-trusted third party.Journal of Computer Science and Technology, 2002, 17(6): 749\u2013756.","journal-title":"Journal of Computer Science and Technology"},{"issue":"4","key":"BF02973457_CR3","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/BF02943285","volume":"17","author":"D Liu","year":"2002","unstructured":"Liu D, Li X, Bai Y. An attack-finding algorithm for security protocols.Journal of Computer Science and Technology, 2002, 17(4): 450\u2013463.","journal-title":"Journal of Computer Science and Technology"},{"issue":"1","key":"BF02973457_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O Goldreich","year":"1994","unstructured":"Goldreich O, Oren Y. Definitions and properties of zero-knowledge proof systems.Journal of Cryptology, 1994, 7(1): 1\u201332.","journal-title":"Journal of Cryptology"},{"key":"BF02973457_CR5","doi-asserted-by":"crossref","unstructured":"Goldreich O. Modern cryptography, probabilistic proofs and pseudorandomness.Algorithms and Combinatorics Series (Vol.17), Springer, 1998.","DOI":"10.1007\/978-3-662-12521-2"},{"issue":"3","key":"BF02973457_CR6","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O Goldreich","year":"1991","unstructured":"Goldreich O, Micall S, Wigderson A. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems.Journal of ACM, 1991, 38(3): 691\u2013729.","journal-title":"Journal of ACM"},{"key":"BF02973457_CR7","unstructured":"Goldreich O. Introduction to Complexity Theory\u2014 Lecture Notes, 1999. Available at http:\/\/www.wisdom. weizmann.ac.il\/\u223coded\/."},{"key":"BF02973457_CR8","doi-asserted-by":"crossref","unstructured":"Goldreich O. Foundations of Cryptography\u2014Basic Tools.Cambridge University Press, 2001.","DOI":"10.1017\/CBO9780511546891"},{"key":"BF02973457_CR9","doi-asserted-by":"crossref","unstructured":"Fortnow L. The complexity of perfect zero-knowledge. InProceedings of ACM Symposium on Theory of Computing (STOC), 1987, pp.204\u2013209.","DOI":"10.1145\/28395.28418"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02973457.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02973457\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02973457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T23:31:31Z","timestamp":1558567891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02973457"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2004,12]]}},"alternative-id":["BF02973457"],"URL":"https:\/\/doi.org\/10.1007\/bf02973457","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,12]]}}}