{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T06:55:15Z","timestamp":1649141715986},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,3,1]],"date-time":"2008-03-01T00:00:00Z","timestamp":1204329600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Ser. F-Inf. Sci."],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s11432-008-0013-5","type":"journal-article","created":{"date-parts":[[2008,2,1]],"date-time":"2008-02-01T14:11:18Z","timestamp":1201875078000},"page":"273-282","source":"Crossref","is-referenced-by-count":2,"title":["Existence of 3-round zero-knowledge proof systems for NP"],"prefix":"10.1007","volume":"51","author":[{"given":"HongDa","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser S, Micali S, Rackoff C. The knowledge complexity of interactive proof systems. SIAM J Comput, 1989, 18(1): 186\u2013208","journal-title":"SIAM J Comput"},{"issue":"3","key":"13_CR2","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich O, Micali S, Wigderson A. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. J ACM, 1991, 38(3): 691\u2013729","journal-title":"J ACM"},{"key":"13_CR3","first-page":"526","volume-title":"Proceedings of CRYPTO\u201989","author":"U. Feige","year":"1989","unstructured":"Feige U, Shamir A. Zero knowledge proofs of knowledge in two rounds. In: Proceedings of CRYPTO\u201989. Berlin: Springer-Verlag, 1989. 526\u2013545"},{"key":"13_CR4","first-page":"192","volume-title":"Proceedings of EUROCRYPT\u201989","author":"G. Brassard","year":"1989","unstructured":"Brassard G, Crepeau C, Yuong M. Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds. In: Proceedings of EUROCRYPT\u201989. Berlin: Springer-Verlag, 1989. 192\u2013195"},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(91)90259-5","volume":"84","author":"G. Brassard","year":"1991","unstructured":"Brassard G, Crepeau C, Yung M. Constant-round perfect zero-knowledge computationally convincing protocols. Theo Comput Sci, 1991, 84: 23\u201354","journal-title":"Theo Comput Sci"},{"issue":"3","key":"13_CR6","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O. Goldreich","year":"1996","unstructured":"Goldreich O, Kahan A. How to construct constant-round zero-knowledge proof system for NP. J Crypto, 1996, 9(3): 167\u2013189","journal-title":"J Crypto"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Prabhakaran M, Rosen A, Sahai A. Concurrent \u017dero knowledge with logarithmic round-complexity. In: 43rd FOCS, IEEE Computer Society, 2002. 366\u2013375","DOI":"10.1109\/SFCS.2002.1181961"},{"key":"13_CR8","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/978-3-540-24638-1_11","volume-title":"First Theory of Cryptography Conference (TCC)","author":"A. Rosen","year":"2004","unstructured":"Rosen A. A note on constant-round zero-knowledge proofs for NP. In: First Theory of Cryptography Conference (TCC), LNCS 2951. Berlin: Spring-Verlag, 2004. 191\u2013202"},{"issue":"1","key":"13_CR9","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. J Crypto, 1994, 7(1): 1\u201332","journal-title":"J Crypto"},{"issue":"1","key":"13_CR10","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s001459900009","volume":"9","author":"M. Bellare","year":"1996","unstructured":"Bellare M, Yung M. Certifying permutations: Non-interactive zero-knowledge based on anu trapdoor permutation. J Crypto, 1996, 9(1): 149\u2013166","journal-title":"J Crypto"},{"key":"13_CR11","series-title":"LNCS","first-page":"280","volume-title":"EUROCRPT\u2019 97","author":"M. Bellare","year":"1997","unstructured":"Bellare M, Jakobsson M, Yung M. Round-optimal zero-knowledge arguments base on any one-way function. In: EUROCRPT\u2019 97, LNCS. Berlin: Spring-Verlag, 1997, 1233: 280\u2013305"},{"issue":"1","key":"13_CR12","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O. Goldreich","year":"1996","unstructured":"Goldreich O, Krawczyk H. On the composition of zero-knowledge proof systems. SIAM J Comput, 1996, 25(1): 169\u2013192","journal-title":"SIAM J Comput"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Hada S, Tanaka T. On the existence of 3-round zero-knowledge protocol. http:\/\/eprint.iacr.org\/1999\/009","DOI":"10.1007\/BFb0055744"},{"key":"13_CR14","unstructured":"Lepinski M. On the existence of 3-round zero-knowledge proofs. Thesis for the degree of master. Massachusetts Institute of Technology, 2002. http:\/\/citeseer.ist.psu.edu\/lepinski01existence.html"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Bellare M, Palacio A. The knowledge-of-exponent assumptions and 3-round zero-knowledge protocol. http:\/\/eprint.iacr.org\/ 2003","DOI":"10.1007\/978-3-540-28628-8_17"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Barak B. How to go beyond the black-box simulation barrier. In: 42th Annual Syposium on Foundation of Computing Sci, IEEE Computer Society, 2001. 106\u2013115","DOI":"10.1109\/SFCS.2001.959885"},{"key":"13_CR17","unstructured":"Barak B. Non-black-box techniques in cryptography. Thesis for the Ph. D. Degree. Weizmann Institute of Science, 2004, 53\u2013102 http:\/\/www.math.ias.edu\/boaz\/index.html"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Barak B, Lindell Y, Vadhan S. Lower bounds for non-black-box zero knowledge. In: 44th Annual IEEE Symposium Foundations of Computer Science. IEEE Computer Society, 2003. 384\u2013393","DOI":"10.1109\/SFCS.2003.1238212"},{"key":"13_CR19","first-page":"547","volume-title":"Proceedings of Crypto\u201989","author":"M. Bellare","year":"1989","unstructured":"Bellare M, Micali S. Non-interactive oblivious transfer and applications. In: Proceedings of Crypto\u201989. Berlin: Springer-Verlag, 1989. 547\u2013559"},{"key":"13_CR20","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography-Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich O. Foundations of Cryptography-Basic Tools. Cambridge: Cambridge University Press, 2001"},{"key":"13_CR21","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"Third Algorithmic Number Theory Symposium","author":"D. Boneh","year":"1998","unstructured":"Boneh D. The decision Diffie-Hellman problem. In: Third Algorithmic Number Theory Symposium, LNCS 1423. Berlin: Springer-Verlag, 1998. 48\u201363"}],"container-title":["Science in China Series F: Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-008-0013-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-008-0013-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-008-0013-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T15:35:54Z","timestamp":1559403354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-008-0013-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["13"],"URL":"https:\/\/doi.org\/10.1007\/s11432-008-0013-5","relation":{},"ISSN":["1009-2757","1862-2836"],"issn-type":[{"value":"1009-2757","type":"print"},{"value":"1862-2836","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3]]}}}