{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:34:49Z","timestamp":1769297689486,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642276590","type":"print"},{"value":"9783642276606","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-27660-6_34","type":"book-chapter","created":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T15:14:28Z","timestamp":1326726868000},"page":"419-430","source":"Crossref","is-referenced-by-count":2,"title":["Complete Problem for Perfect Zero-Knowledge Quantum Proof"],"prefix":"10.1007","author":[{"given":"Jun","family":"Yan","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","unstructured":"Aharonov, D., Naveh, T.: Quantum NP - a survey (2002)"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511804090"},{"issue":"1","key":"34_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.4086\/toc.2010.v006a003","volume":"6","author":"A. Ben-Aroya","year":"2010","unstructured":"Ben-Aroya, A., Schwartz, O., Ta-Shma, A.: Quantum expanders: Motivation and construction. Theory of Computing\u00a06(1), 47\u201379 (2010)","journal-title":"Theory of Computing"},{"key":"34_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-540-78524-8_28","volume-title":"Theory of Cryptography","author":"A. Chailloux","year":"2008","unstructured":"Chailloux, A., Ciocan, D.F., Kerenidis, I., Vadhan, S.P.: Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 501\u2013534. Springer, Heidelberg (2008)"},{"key":"34_CR5","unstructured":"Damg\u00e5rd, I.B., Cramer, R.J.: On monotone function closure of perfect and statistical zero-knowledge. Technical report, Amsterdam, The Netherlands (1996)"},{"key":"34_CR6","unstructured":"Furer, M., Goldreich, O., Mansour, Y., Sipser, M., Zachos, S.: On completeness and soundness in interactive proof systems. In: Micali, S. (ed.) Randomness and Computation, Greenwich, Connecticut. Advances in Computing Research, vol.\u00a05, pp. 429\u2013442. JAI Press (1996)"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography, Basic Tools, vol.\u00a0I. Cambridge University Press (2001)","DOI":"10.1017\/CBO9780511546891"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Computational Complexity: A Conceptual Approach. Cambridge University Press (2008)","DOI":"10.1017\/CBO9780511804106"},{"key":"34_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/3-540-48405-1_30","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"O. Goldreich","year":"1999","unstructured":"Goldreich, O., Sahai, A., Vadhan, S.P.: Can Statistical Zero Knowledge be Made Non-Interactive? or on the Relationship of SZK and NISZK. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, p. 467. Springer, Heidelberg (1999)"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Vadhan, S.P.: Comparing entropies in statistical zero knowledge with applications to the structure of SZK. In: IEEE Conference on Computational Complexity, pp. 54\u201373 (1999)","DOI":"10.1109\/CCC.1999.766262"},{"issue":"1","key":"34_CR11","doi-asserted-by":"publisher","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.\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Kitaev, A.Y., Watrous, J.: Parallelization, amplification, and exponential time simulation of quantum interactive proof systems. In: STOC, pp. 608\u2013617 (2000)","DOI":"10.1145\/335305.335387"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Kitaev, A.Y., Shen, A.H., Vyalyi, M.N.: Classical and Quantum Computation. In: American Mathematical Society. Graduate Studies in Mathematics, vol.\u00a047. American Mathematical Society (2002)","DOI":"10.1090\/gsm\/047"},{"key":"34_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-540-78524-8_7","volume-title":"Theory of Cryptography","author":"H. Kobayashi","year":"2008","unstructured":"Kobayashi, H.: General Properties of Quantum Zero-Knowledge Proofs. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 107\u2013124. Springer, Heidelberg (2008), arXiv.org e-Print 0705.1129"},{"key":"34_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-540-24587-2_20","volume-title":"Algorithms and Computation","author":"H. Kobayashi","year":"2003","unstructured":"Kobayashi, H.: Non-Interactive Quantum Perfect and Statistical Zero-Knowledge. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 178\u2013188. Springer, Heidelberg (2003)"},{"key":"34_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-540-78524-8_6","volume-title":"Theory of Cryptography","author":"L. Malka","year":"2008","unstructured":"Malka, L.: How to Achieve Perfect Simulation and A Complete Problem for Non-Interactive Perfect Zero-Knowledge. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 89\u2013106. Springer, Heidelberg (2008)"},{"issue":"2","key":"34_CR17","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/s00037-005-0194-x","volume":"14","author":"C. Marriott","year":"2005","unstructured":"Marriott, C., Watrous, J.: Quantum Arthur-Merlin games. Computational Complexity\u00a014(2), 122\u2013152 (2005)","journal-title":"Computational Complexity"},{"key":"34_CR18","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum computation and Quantum Informatioin. Cambridge University Press (2000)"},{"issue":"2","key":"34_CR19","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/636865.636868","volume":"50","author":"A. Sahai","year":"2003","unstructured":"Sahai, A., Vadhan, S.P.: A complete problem for statistical zero knowledge. J. ACM\u00a050(2), 196\u2013249 (2003)","journal-title":"J. ACM"},{"key":"34_CR20","unstructured":"Santis, A.D., Crescenzo, G.D., Persiano, G., Yung, M.: On monotone formula closure of SZK. In: FOCS, pp. 454\u2013465 (1994)"},{"key":"34_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1007\/BFb0055102","volume-title":"Automata, Languages and Programming","author":"A. Santis De","year":"1998","unstructured":"De Santis, A., Di Crescenzo, G., Persiano, G., Yung, M.: Image Density is Complete for Non-Interactive-SZK (Extended Abstract). In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 784\u2013795. Springer, Heidelberg (1998)"},{"key":"34_CR22","unstructured":"Vadhan, S.: Ph.D Thesis: A Study of Statistical Zero-Knowledge Proofs (1999)"},{"key":"34_CR23","doi-asserted-by":"crossref","unstructured":"Watrous, J.: Succinct quantum proofs for properties of finite groups. In: FOCS, pp. 537\u2013546 (2000)","DOI":"10.1109\/SFCS.2000.892141"},{"key":"34_CR24","doi-asserted-by":"crossref","unstructured":"Watrous, J.: Limits on the power of quantum statistical zero-knowledge. In: FOCS, pp. 459\u2013468 (2002)","DOI":"10.1109\/SFCS.2002.1181970"},{"key":"34_CR25","unstructured":"Watrous, J.: Theory of Quantum Information. Online Lecture Notes (2008), http:\/\/www.cs.uwaterloo.ca\/~watrous\/798\/"},{"key":"34_CR26","doi-asserted-by":"crossref","unstructured":"Watrous, J.: Quantum computational complexity. In: Encyclopedia of Complexity and Systems Science, pp. 7174\u20137201 (2009)","DOI":"10.1007\/978-0-387-30440-3_428"},{"issue":"1","key":"34_CR27","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1137\/060670997","volume":"39","author":"J. Watrous","year":"2009","unstructured":"Watrous, J.: Zero-knowledge against quantum attacks. SIAM J. Comput.\u00a039(1), 25\u201358 (2009)","journal-title":"SIAM J. Comput."},{"key":"34_CR28","unstructured":"Yan, J.: Complete problem for perfect zero-knowledge quantum proof. Full version, http:\/\/lcs.ios.ac.cn\/~junyan\/Yan11_qpzk-SOFSEM12-final-full.pdf"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2012: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27660-6_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T21:49:12Z","timestamp":1742334552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27660-6_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642276590","9783642276606"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27660-6_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}