{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:01:41Z","timestamp":1777964501375,"version":"3.51.4"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030778859","type":"print"},{"value":"9783030778866","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-77886-6_22","type":"book-chapter","created":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T23:06:10Z","timestamp":1623798370000},"page":"630-660","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Classical Proofs of Quantum Knowledge"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Vidick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tina","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,16]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Christiano, P.: Quantum money from hidden subspaces. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing (2012)","DOI":"10.1145\/2213977.2213983"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Farhi, E., Gosset, D., Hassidim, A., Kelner, J., Lutomirski, A.: Quantum money. Commun. ACM 55(8), 84\u201392 (2012)","DOI":"10.1145\/2240236.2240258"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Badertscher, C., et al.: Security limitations of classical-client delegated quantum computing. arXiv preprint arXiv:2007.01668 (2020)","DOI":"10.1007\/978-3-030-64834-3_23"},{"key":"22_CR4","unstructured":"Ben-David, S., Sattath, O.: Quantum tokens for digital signatures. arXiv preprint arXiv:1609.09047 (2016)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/3-540-48071-4_28","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"M Bellare","year":"1993","unstructured":"Bellare, M., Goldreich, O.: On defining proofs of knowledge. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 390\u2013420. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_28"},{"key":"22_CR6","unstructured":"Broadbent, A., Grilo, A.B.: Zero-knowledge for QMA from locally simulatable proofs. arXiv preprint arXiv:1911.07782 (2019)"},{"key":"22_CR7","first-page":"662","volume":"2019","author":"C Badertscher","year":"2019","unstructured":"Badertscher, C., Jost, D., Maurer, U.: Agree-and-prove: generalized proofs of knowledge and applications. IACR Cryptol. ePrint Arch. 2019, 662 (2019)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11818175_5","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"M Chase","year":"2006","unstructured":"Chase, M., Lysyanskaya, A.: On signatures of knowledge. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 78\u201396. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_5"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Coladangelo, A., Vidick, T., Zhang, T.: Non-interactive zero-knowledge arguments for QMA, with preprocessing. arXiv preprint arXiv:1911.07546 (2019)","DOI":"10.1007\/978-3-030-56877-1_28"},{"issue":"2","key":"22_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U Feige","year":"1988","unstructured":"Feige, U., Fiat, A., Shamir, A.: Zero-knowledge proofs of identity. J. Cryptol. 1(2), 77\u201394 (1988)","journal-title":"J. Cryptol."},{"issue":"1","key":"22_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. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Gheorghiu, A., Vidick, T.: Computationally-secure and composable remote state preparation. In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1024\u20131033. IEEE (2019)","DOI":"10.1109\/FOCS.2019.00066"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Haah, J., Harrow, A.W., Ji, Z., Wu, X., Yu, N.: Sample-optimal tomography of quantum states. IEEE Trans. Inf. Theory 63(9), 5628\u20135641 (2017)","DOI":"10.1109\/TIT.2017.2719044"},{"issue":"3","key":"22_CR14","first-page":"258","volume":"3","author":"J Kempe","year":"2003","unstructured":"Kempe, J., Regev, O.: 3-local Hamiltonian is QMA-complete. Quantum Inf. Comput. 3(3), 258\u2013264 (2003)","journal-title":"Quantum Inf. Comput."},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Kitaev, A.Y., Shen, A., Vyalyi, M.N., Vyalyi, M.N.: Classical and quantum computation. Number 47. American Mathematical Soc. (2002)","DOI":"10.1090\/gsm\/047"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Mahadev, U.: Classical homomorphic encryption for quantum circuits. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 332\u2013338. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00039"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Mahadev, U.: Classical verification of quantum computations. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 259\u2013267, October 2018","DOI":"10.1109\/FOCS.2018.00033"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Mahadev, U.: Classical verification of quantum computations. arXiv preprint arXiv:1804.01082 (2018)","DOI":"10.1109\/FOCS.2018.00033"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Metger, T., Vidick, T.: Self-testing of a single quantum device under computational assumptions. arXiv preprint arXiv:2001.09161 (2020)","DOI":"10.22331\/q-2021-09-16-544"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-35656-8_4","volume-title":"Theory of Quantum Computation, Communication, and Cryptography","author":"A Molina","year":"2013","unstructured":"Molina, A., Vidick, T., Watrous, J.: Optimal counterfeiting attacks and generalizations for Wiesner\u2019s quantum money. In: Iwama, K., Kawano, Y., Murao, M. (eds.) TQC 2012. LNCS, vol. 7582, pp. 45\u201364. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35656-8_4"},{"key":"22_CR21","unstructured":"Natarajan, A., Vidick, T.: Robust self-testing of many-qubit states. arXiv e-prints, page arXiv:1610.03574, October 2016"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Claus Schnorr and Markus Jakobsson. Security of signed ElGamal encryption. In International Conference on the Theory and Application of Cryptology and Information Security, volume 1976, pages 73\u201389, 12 2000","DOI":"10.1007\/3-540-44448-3_7"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Tompa, M., Woll, H.: Random self-reducibility and zero knowledge interactive proofs of possession of information. In: 28th Annual Symposium on Foundations of Computer Science (sfcs 1987), pp. 472\u2013482. IEEE (1987)","DOI":"10.1109\/SFCS.1987.49"},{"key":"22_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-29011-4_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Unruh","year":"2012","unstructured":"Unruh, D.: Quantum proofs of knowledge. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 135\u2013152. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_10"},{"key":"22_CR25","doi-asserted-by":"publisher","first-page":"266","DOI":"10.22331\/q-2020-05-14-266","volume":"4","author":"T Vidick","year":"2020","unstructured":"Vidick, T., Zhang, T.: Classical zero-knowledge arguments for quantum computations. Quantum 4, 266 (2020)","journal-title":"Quantum"},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"Vidick, T., Zhang, T.: Classical proofs of quantum knowledge (2021)","DOI":"10.1007\/978-3-030-77886-6_22"},{"issue":"1","key":"22_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. 39(1), 25\u201358 (2009)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"22_CR28","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1008908.1008920","volume":"15","author":"S Wiesner","year":"1983","unstructured":"Wiesner, S.: Conjugate coding. ACM SIGACT News 15(1), 78\u201388 (1983)","journal-title":"ACM SIGACT News"},{"key":"22_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-030-17659-4_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"M Zhandry","year":"2019","unstructured":"Zhandry, M.: Quantum lightning never strikes the same state twice. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 408\u2013438. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_14"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77886-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T00:09:05Z","timestamp":1718496545000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77886-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030778859","9783030778866"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77886-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"16 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zagreb","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"400","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"at least 3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}