{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T01:32:03Z","timestamp":1774661523612,"version":"3.50.1"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031070815","type":"print"},{"value":"9783031070822","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-07082-2_25","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T00:09:51Z","timestamp":1653696591000},"page":"707-736","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Constant-Round Blind Classical Verification of\u00a0Quantum Sampling"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3356-369X","authenticated-orcid":false,"given":"Kai-Min","family":"Chung","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3742-3296","authenticated-orcid":false,"given":"Yi","family":"Lee","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5126-0174","authenticated-orcid":false,"given":"Han-Hsuan","family":"Lin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8877-9802","authenticated-orcid":false,"given":"Xiaodi","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,25]]},"reference":[{"key":"25_CR1","unstructured":"Aaronson, S.: The aaronson \\$25.00 prize. http:\/\/www.scottaaronson.com\/blog\/?p=284"},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00224-013-9527-3","volume":"55","author":"S Aaronson","year":"2013","unstructured":"Aaronson, S.: The equivalence of sampling and searching. Theory Comput. Syst. 55(2), 281\u2013298 (2013)","journal-title":"Theory Comput. Syst."},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Arkhipov, A.: The computational complexity of linear optics. In: Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, STOC 2011, New York, NY, USA, pp. 333\u2013342. Association for Computing Machinery (2011)","DOI":"10.1145\/1993636.1993682"},{"key":"25_CR4","unstructured":"Aharonov, D., Ben-Or, M., Eban, E., Mahadev, U.: Interactive proofs for quantum computations. arXiv:1704.04487 (2017)"},{"issue":"4","key":"25_CR5","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1137\/080734479","volume":"50","author":"D Aharonov","year":"2008","unstructured":"Aharonov, D., Van Dam, W., Kempe, J., Landau, Z., Lloyd, S., Regev, O.: Adiabatic quantum computation is equivalent to standard quantum computation. SIAM Rev. 50(4), 755\u2013787 (2008)","journal-title":"SIAM Rev."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Alagic, G., Dulek, Y., Schaffner, C., Speelman, F.: Quantum fully homomorphic encryption with verification (2017)","DOI":"10.1007\/978-3-319-70694-8_16"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-030-64381-2_6","volume-title":"Theory of Cryptography","author":"G Alagic","year":"2020","unstructured":"Alagic, G., Childs, A.M., Grilo, A.B., Hung, S.-H.: Non-interactive classical verification of quantum computation. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12552, pp. 153\u2013180. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_6"},{"issue":"7779","key":"25_CR8","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","volume":"574","author":"F Arute","year":"2019","unstructured":"Arute, F., Arya, K., Babbush, R., et al.: Quantum supremacy using a programmable superconducting processor. Nature 574(7779), 505\u2013510 (2019)","journal-title":"Nature"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Bartusek, J.: Secure quantum computation with classical communication (2021)","DOI":"10.1007\/978-3-030-90459-3_1"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Bellare, M., Impagliazzo, R., Naor, M.: Does parallel repetition lower the error in computationally sound protocols? In: 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, Miami Beach, Florida, USA, 19\u201322 October 1997, pp. 374\u2013383 (1997)","DOI":"10.1109\/SFCS.1997.646126"},{"key":"25_CR11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.78.012352","volume":"78","author":"JD Biamonte","year":"2008","unstructured":"Biamonte, J.D., Love, P.J.: Realizable Hamiltonians for universal adiabatic quantum computers. Phys. Rev. A 78, 012352 (2008)","journal-title":"Phys. Rev. A"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-96878-0_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"Z Brakerski","year":"2018","unstructured":"Brakerski, Z.: Quantum FHE (almost) as secure as\u00a0classical. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 67\u201395. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_3"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Fitzsimons, J., Kashefi, E.: Universal blind quantum computation. In: 2009 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 517\u2013526 (2009)","DOI":"10.1109\/FOCS.2009.36"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-030-90459-3_6","volume-title":"Theory of Cryptography","author":"O Chardouvelis","year":"2021","unstructured":"Chardouvelis, O., D\u00f6ttling, N., Malavolta, G.: Rate-1 quantum fully homomorphic encryption. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13042, pp. 149\u2013176. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_6"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-030-64381-2_7","volume-title":"Theory of Cryptography","author":"N-H Chia","year":"2020","unstructured":"Chia, N.-H., Chung, K.-M., Yamakawa, T.: Classical verification of quantum computations with efficient verifier. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12552, pp. 181\u2013206. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_7"},{"key":"25_CR16","unstructured":"Chung, K.-M.: Efficient parallel repetition theorems with applications to security amplification. PhD thesis, Harvard University (2011)"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Chung, K.-M., Lee, Y., Lin, H.-H., Wu, X.: Constant-round blind classical verification of quantum sampling (2021)","DOI":"10.1007\/978-3-031-07082-2_25"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-030-17659-4_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"A Coladangelo","year":"2019","unstructured":"Coladangelo, A., Grilo, A.B., Jeffery, S., Vidick, T.: Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 247\u2013277. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_9"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Gottesman, D., Smith, A.: Secure multi-party quantum computation. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing - STOC 2002. ACM Press (2002)","DOI":"10.1145\/509907.510000"},{"key":"25_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1007\/978-3-642-32009-5_46","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"F Dupuis","year":"2012","unstructured":"Dupuis, F., Nielsen, J.B., Salvail, L.: Actively secure two-party evaluation of any quantum operation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 794\u2013811. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_46"},{"key":"25_CR21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.120.040501","volume":"120","author":"JF Fitzsimons","year":"2018","unstructured":"Fitzsimons, J.F., Hajdu\u0161ek, M., Morimae, T.: Post hoc verification of quantum computation. Phys. Rev. Lett. 120, 040501 (2018)","journal-title":"Phys. Rev. Lett."},{"key":"25_CR22","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.96.012303","volume":"96","author":"JF Fitzsimons","year":"2017","unstructured":"Fitzsimons, J.F., Kashefi, E.: Unconditionally verifiable blind quantum computation. Phys. Rev. A 96, 012303 (2017)","journal-title":"Phys. Rev. A"},{"issue":"8","key":"25_CR23","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/17\/8\/083040","volume":"17","author":"A Gheorghiu","year":"2015","unstructured":"Gheorghiu, A., Kashefi, E., Wallden, P.: Robustness and device independence of verifiable blind quantum computing. New J. Phys. 17(8), 083040 (2015)","journal-title":"New J. Phys."},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Gheorghiu, A., Vidick, T.: Computationally-secure and composable remote state preparation. In: FOCS, pp. 1024\u20131033 (2019)","DOI":"10.1109\/FOCS.2019.00066"},{"key":"25_CR25","unstructured":"Hajdu\u0161ek, M., P\u00e9rez-Delgado, C.A., Fitzsimons, J.F.: Device-independent verifiable blind quantum computation. arXiv e-prints, arXiv:1502.02563, February 2015"},{"issue":"22","key":"25_CR26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.115.220502","volume":"115","author":"M Hayashi","year":"2015","unstructured":"Hayashi, M., Morimae, T.: Verifiable measurement-only blind quantum computing with stabilizer testing. Phys. Rev. Lett. 115(22), 220502 (2015)","journal-title":"Phys. Rev. Lett."},{"issue":"5","key":"25_CR27","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1137\/S0097539704445226","volume":"35","author":"J Kempe","year":"2006","unstructured":"Kempe, J., Kitaev, A., Regev, O.: The complexity of the local Hamiltonian problem. SIAM J. Comput. 35(5), 1070\u20131097 (2006)","journal-title":"SIAM J. Comput."},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"Kitaev, A.Y., Shen, A., Vyalyi, M.N.: Classical and Quantum Computation. Graduate Studies in Mathematics. American Mathematical Society (2002)","DOI":"10.1090\/gsm\/047"},{"key":"25_CR29","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) (2018)","DOI":"10.1109\/FOCS.2018.00039"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"Mahadev, U.: Classical verification of quantum computations. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) (2018)","DOI":"10.1109\/FOCS.2018.00033"},{"issue":"2","key":"25_CR31","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. Comput. Complex. 14(2), 122\u2013152 (2005). https:\/\/doi.org\/10.1007\/s00037-005-0194-x","journal-title":"Comput. Complex."},{"key":"25_CR32","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.93.022326","volume":"93","author":"T Morimae","year":"2016","unstructured":"Morimae, T., Nagaj, D., Schuch, N.: Quantum proofs can be verified using only single-qubit measurements. Phys. Rev. A 93, 022326 (2016)","journal-title":"Phys. Rev. A"},{"issue":"1","key":"25_CR33","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/s00145-010-9090-x","volume":"25","author":"K Pietrzak","year":"2012","unstructured":"Pietrzak, K., Wikstr\u00f6m, D.: Parallel repetition of computationally sound protocols revisited. J. Cryptol. 25(1), 116\u2013135 (2012)","journal-title":"J. Cryptol."},{"key":"25_CR34","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 34:1\u201334:40 (2009)","DOI":"10.1145\/1568318.1568324"},{"issue":"7746","key":"25_CR35","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":"25_CR36","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1098\/rspa.2008.0443","volume":"465","author":"D Shepherd","year":"2009","unstructured":"Shepherd, D., Bremner, M.J.: Temporally unstructured quantum computation. Proc. R. Soc. A. 465, 1413\u20131439 (2009)","journal-title":"Proc. R. Soc. A."},{"key":"25_CR37","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134 (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"2","key":"25_CR38","volume":"8","author":"Y Takeuchi","year":"2018","unstructured":"Takeuchi, Y., Morimae, T.: Verification of many-qubit states. Phys. Rev. X 8(2), 021060 (2018)","journal-title":"Phys. Rev. X"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-07082-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T22:03:20Z","timestamp":1748383400000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-07082-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031070815","9783031070822"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-07082-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 May 2022","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":"Trondheim","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2022\/","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":"372","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":"85","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":"23% - 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":"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":"18","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":"Peer review was double-blind with rebuttal.","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)"}}]}}