{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T20:10:27Z","timestamp":1770754227035,"version":"3.50.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030643805","type":"print"},{"value":"9783030643812","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-64381-2_7","type":"book-chapter","created":{"date-parts":[[2020,12,12]],"date-time":"2020-12-12T18:04:25Z","timestamp":1607796265000},"page":"181-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Classical Verification of Quantum Computations with Efficient Verifier"],"prefix":"10.1007","author":[{"given":"Nai-Hui","family":"Chia","sequence":"first","affiliation":[]},{"given":"Kai-Min","family":"Chung","sequence":"additional","affiliation":[]},{"given":"Takashi","family":"Yamakawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,9]]},"reference":[{"key":"7_CR1","unstructured":"IBM quantum experience. https:\/\/quantum-computing.ibm.com\/docs\/. Accessed 22 May 2020"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-17653-2_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"S Agrawal","year":"2019","unstructured":"Agrawal, S.: Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 191\u2013225. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_7"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-030-45721-1_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"S Agrawal","year":"2020","unstructured":"Agrawal, S., Pellet-Mary, A.: Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 110\u2013140. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_5"},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/2491533.2491549","volume":"44","author":"D Aharonov","year":"2013","unstructured":"Aharonov, D., Arad, I., Vidick, T.: Guest column: the quantum PCP conjecture. SIGACT News 44(2), 47\u201379 (2013)","journal-title":"SIGACT News"},{"key":"7_CR5","unstructured":"Aharonov, D., Ben-Or, M., Eban, E., Mahadev, U.: Interactive proofs for quantum computations. arXiv:1704.04487 (2017)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Alagic, G., Childs, A.M., Grilo, A.B., Hung, S.-H.: Non-interactive classical verification of quantum computation. In: TCC 2020 (2020, to appear)","DOI":"10.1007\/978-3-030-64381-2_6"},{"issue":"7779","key":"7_CR7","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","volume":"574","author":"F Arute","year":"2019","unstructured":"Arute, F., et al.: Quantum supremacy using a programmable superconducting processor. Nature 574(7779), 505\u2013510 (2019)","journal-title":"Nature"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-030-34578-5_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"S Badrinarayanan","year":"2019","unstructured":"Badrinarayanan, S., Fernando, R., Koppula, V., Sahai, A., Waters, B.: Output compression, MPC, and iO for turing machines. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 342\u2013370. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_13"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Badrinarayanan, S., Kalai, Y.T., Khurana, D., Sahai, A., Wichs, D.: Succinct delegation for low-space non-deterministic computation. In: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) 50th ACM STOC, pp. 709\u2013721. ACM Press, June 2018","DOI":"10.1145\/3188745.3188924"},{"issue":"2","key":"7_CR10","doi-asserted-by":"publisher","first-page":"6:1","DOI":"10.1145\/2160158.2160159","volume":"59","author":"B Barak","year":"2012","unstructured":"Barak, B., et al.: On the (im)possibility of obfuscating programs. J. ACM 59(2), 6:1\u20136:48 (2012)","journal-title":"J. ACM"},{"key":"7_CR11","unstructured":"Bellare, M., Impagliazzo, R., Naor, M.: Does parallel repetition lower the error in computationally sound protocols? In: 38th FOCS, pp. 374\u2013383. IEEE Computer Society Press, October 1997"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-25385-0_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Dagdelen, \u00d6., Fischlin, M., Lehmann, A., Schaffner, C., Zhandry, M.: Random oracles in a quantum world. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 41\u201369. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_3"},{"key":"7_CR13","unstructured":"Brakerski, Z., D\u00f6ttling, N., Garg, S., Malavolta, G.: Factoring and pairings are not necessary for iO: Circular-secure LWE suffices. IACR Cryptol. ePrint Arch., 2020:1024 (2020)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Holmgren, J., Kalai, Y.T.: Non-interactive delegation and batch NP verification from standard computational assumptions. In: Hatami, H., McKenzie, P., King, V. (eds.) 49th ACM STOC, pp. 474\u2013482. ACM Press, June 2017","DOI":"10.1145\/3055399.3055497"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Fitzsimons, J., Kashefi, E.: Universal blind quantum computation. In: 50th FOCS, pp. 517\u2013526. IEEE Computer Society Press, October 2009","DOI":"10.1109\/FOCS.2009.36"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Canetti, R., et al.: Fiat-Shamir: from practice to theory. In: Charikar, M., Cohen, E. (eds.) 51st ACM STOC, pp. 1082\u20131090. ACM Press, June 2019","DOI":"10.1145\/3313276.3316380"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-36033-7_1","volume-title":"Theory of Cryptography","author":"A Chiesa","year":"2019","unstructured":"Chiesa, A., Manohar, P., Spooner, N.: Succinct arguments in the quantum random oracle model. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11892, pp. 1\u201329. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_1"},{"key":"7_CR18","unstructured":"Chung, K.-M., Lee, Y., Lin, H.-H., Wu, X.: Constant-round blind classical verification of quantum sampling (2020, in submission)"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-030-26951-7_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"J Don","year":"2019","unstructured":"Don, J., Fehr, S., Majenz, C., Schaffner, C.: Security of the Fiat-Shamir transformation in the quantum random-oracle model. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 356\u2013383. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_13"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"issue":"1","key":"7_CR21","doi-asserted-by":"publisher","first-page":"012303","DOI":"10.1103\/PhysRevA.96.012303","volume":"96","author":"JF Fitzsimons","year":"2017","unstructured":"Fitzsimons, J.F., Kashef, E.: Unconditionally verifiable blind quantum computation. Phys. Rev. A 96(1), 012303 (2017)","journal-title":"Phys. Rev. A"},{"issue":"3","key":"7_CR22","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1137\/14095772X","volume":"45","author":"S Garg","year":"2016","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. SIAM J. Comput. 45(3), 882\u2013929 (2016)","journal-title":"SIAM J. Comput."},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) 41st ACM STOC, pp. 169\u2013178. ACM Press, May\/June 2009","DOI":"10.1145\/1536414.1536440"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Gheorghiu, A., Vidick, T.: Computationally-secure and composable remote state preparation. In: 60th FOCS, pp. 1024\u20131033. IEEE Computer Society Press (2019)","DOI":"10.1109\/FOCS.2019.00066"},{"issue":"4","key":"7_CR25","doi-asserted-by":"publisher","first-page":"27:1","DOI":"10.1145\/2699436","volume":"62","author":"S Goldwasser","year":"2015","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. J. ACM 62(4), 27:1\u201327:64 (2015)","journal-title":"J. ACM"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Holmgren, J., Rothblum, R.: Delegating computations with (almost) minimal time and space overhead. In: Thorup, M. (ed.) 59th FOCS, pp. 124\u2013135. IEEE Computer Society Press, October 2018","DOI":"10.1109\/FOCS.2018.00021"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Kalai, Y.T., Paneth, O., Yang, L.: How to delegate computations publicly. In: Charikar, M., Cohen, E. (eds.) 51st ACM STOC, pp. 1115\u20131124. ACM Press, June 2019","DOI":"10.1145\/3313276.3316411"},{"key":"7_CR28","unstructured":"Kalai, Y.T., Raz, R., Rothblum, R.D.: Delegation for bounded space. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th ACM STOC, pp. 565\u2013574. ACM Press, June 2013"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Kalai, Y.T., Raz, R., Rothblum, R.D.: How to delegate computations: the power of no-signaling proofs. In: Shmoys, D.B. (ed.) 46th ACM STOC, pp. 485\u2013494. ACM Press, May\/June 2014","DOI":"10.1145\/2591796.2591809"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: 24th ACM STOC, pp. 723\u2013732. ACM Press, May 1992","DOI":"10.1145\/129712.129782"},{"key":"7_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-030-26951-7_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"Q Liu","year":"2019","unstructured":"Liu, Q., Zhandry, M.: Revisiting post-quantum Fiat-Shamir. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 326\u2013355. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_12"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Mahadev, U.: Classical verification of quantum computations. In: Thorup, M. (ed.) 59th FOCS, pp. 259\u2013267. IEEE Computer Society Press, October 2018","DOI":"10.1109\/FOCS.2018.00033"},{"issue":"2","key":"7_CR33","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\u2013Merlin games. Comput. Complex. 14(2), 122\u2013152 (2005). https:\/\/doi.org\/10.1007\/s00037-005-0194-x","journal-title":"Comput. Complex."},{"issue":"4","key":"7_CR34","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539795284959","volume":"30","author":"S Micali","year":"2000","unstructured":"Micali, S.: Computationally sound proofs. SIAM J. Comput. 30(4), 1253\u20131298 (2000)","journal-title":"SIAM J. Comput."},{"key":"7_CR35","doi-asserted-by":"publisher","first-page":"040501","DOI":"10.1103\/PhysRevLett.120.040501","volume":"120","author":"T Morimae","year":"2018","unstructured":"Morimae, T., Fitzsimons, J.F.: Post hoc verification with a single prover. Phys. Rev. Lett. 120, 040501 (2018)","journal-title":"Phys. Rev. Lett."},{"key":"7_CR36","doi-asserted-by":"crossref","unstructured":"Nagaj, D., Wocjan, P., Zhang, Y.: Fast amplification of QMA. arXiv:0904.1549 (2009)","DOI":"10.26421\/QIC9.11-12-8"},{"key":"7_CR37","unstructured":"NIST: Post-quantum cryptography standardization. https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography. Accessed 21 Sep 2020"},{"issue":"4","key":"7_CR38","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1561\/0400000074","volume":"10","author":"C Peikert","year":"2016","unstructured":"Peikert, C.: A decade of lattice cryptography. Found. Trends Theor. Comput. Sci. 10(4), 283\u2013424 (2016)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"7_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-540-70936-7_5","volume-title":"Theory of Cryptography","author":"K Pietrzak","year":"2007","unstructured":"Pietrzak, K., Wikstr\u00f6m, D.: Parallel repetition of computationally sound protocols revisited. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 86\u2013102. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_5"},{"issue":"6","key":"7_CR40","doi-asserted-by":"publisher","first-page":"34:1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 34:1\u201334:40 (2009)","journal-title":"J. ACM"},{"issue":"7746","key":"7_CR41","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1038\/nature12035","volume":"496","author":"BW Reichardt","year":"2013","unstructured":"Reichardt, B.W., Unger, F., Vazirani, U.: Classical command of quantum systems. Nature 496(7746), 456 (2013)","journal-title":"Nature"},{"key":"7_CR42","doi-asserted-by":"crossref","unstructured":"Reingold, O., Rothblum, G.N., Rothblum, R.D.: Constant-round interactive proofs for delegating computation. In: Wichs, D., Mansour, Y. (eds.) 48th ACM STOC, pp. 49\u201362. ACM Press, June 2016","DOI":"10.1145\/2897518.2897652"},{"issue":"2","key":"7_CR43","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s00037-010-0291-3","volume":"19","author":"GN Rothblum","year":"2010","unstructured":"Rothblum, G.N., Vadhan, S.P.: Are PCPs inherent in efficient arguments? Comput. Complex. 19(2), 265\u2013304 (2010)","journal-title":"Comput. Complex."},{"key":"7_CR44","unstructured":"Wee, H., Wichs, D.: Candidate obfuscation via oblivious LWE sampling. IACR Cryptol. ePrint Arch., 2020:1042 (2020)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64381-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T01:08:08Z","timestamp":1702343288000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64381-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030643805","9783030643812"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64381-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"167","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":"71","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":"43% - 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":"4","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":"17","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":"Due to the Corona pandemic this event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","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"}]}}