{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T11:04:05Z","timestamp":1777287845647,"version":"3.51.4"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031158018","type":"print"},{"value":"9783031158025","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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15802-5_9","type":"book-chapter","created":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T16:59:52Z","timestamp":1665507592000},"page":"239-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Certified Everlasting Zero-Knowledge Proof for\u00a0QMA"],"prefix":"10.1007","author":[{"given":"Taiga","family":"Hiroka","sequence":"first","affiliation":[]},{"given":"Tomoyuki","family":"Morimae","sequence":"additional","affiliation":[]},{"given":"Ryo","family":"Nishimaki","sequence":"additional","affiliation":[]},{"given":"Takashi","family":"Yamakawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,12]]},"reference":[{"key":"9_CR1","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"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Ambainis, A., Hamburg, M., Unruh, D.: Quantum security proofs using semi-classical oracles. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 269\u2013295. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_10","DOI":"10.1007\/978-3-030-26951-7_10"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Brakerski, Z.: Classical binding for quantum commitments. IACR Cryptol. ePrint Arch. 2021, 1001 (2021)","DOI":"10.1007\/978-3-030-90459-3_10"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-030-84242-0_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"J Bartusek","year":"2021","unstructured":"Bartusek, J., Coladangelo, A., Khurana, D., Ma, F.: On the round complexity of secure quantum computation. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 406\u2013435. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_15"},{"key":"9_CR5","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":"9_CR6","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Grilo, A.B.: QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge. In: 61st FOCS, pp. 196\u2013205. IEEE Computer Society Press (2020)","DOI":"10.1109\/FOCS46700.2020.00027"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-030-64381-2_4","volume-title":"Theory of Cryptography","author":"A Broadbent","year":"2020","unstructured":"Broadbent, A., Islam, R.: Quantum encryption with certified deletion. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12552, pp. 92\u2013122. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_4"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Ji, Z., Song, F., Watrous, J.: Zero-knowledge proof systems for QMA. In: Dinur, I. (ed.) 57th FOCS, pp. 31\u201340. IEEE Computer Society Press (2016)","DOI":"10.1109\/FOCS.2016.13"},{"key":"9_CR9","first-page":"421","volume":"2021","author":"J Bartusek","year":"2021","unstructured":"Bartusek, J., Malavolta, G.: Candidate obfuscation of null quantum circuits and witness encryption for QMA. IACR Cryptol. ePrint Arch. 2021, 421 (2021)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Shmueli, O.: Post-quantum zero knowledge in constant rounds. In: Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G., Chuzhoy, J. (eds.) 52nd ACM STOC, pp. 269\u2013279. ACM Press (2020)","DOI":"10.1145\/3357713.3384324"},{"key":"9_CR11","unstructured":"Brakerski, Z., Yuen, H.: Quantum garbled circuits. arXiv preprint arXiv:2006.01085 (2020)"},{"key":"9_CR12","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.: Interactive and noninteractive zero knowledge are equivalent in the help model. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 501\u2013534. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_28"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-540-24638-1_21","volume-title":"Theory of Cryptography","author":"C Cr\u00e9peau","year":"2004","unstructured":"Cr\u00e9peau, C., Dumais, P., Mayers, D., Salvail, L.: Computational collapse of quantum state with application to oblivious transfer. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 374\u2013393. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_21"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Chardouvelis, O., Malavolta, G.: The round complexity of quantum zero-knowledge. IACR Cryptol. ePrint Arch. (2021)","DOI":"10.1007\/978-3-030-90459-3_5"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Coladangelo, A., Vidick, T., Zhang, T.: Non-interactive zero-Knowledge arguments for QMA, with preprocessing. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 799\u2013828. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_28","DOI":"10.1007\/978-3-030-56877-1_28"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-540-74143-5_20","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"IB Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I.B., Fehr, S., Renner, R., Salvail, L., Schaffner, C.: A tight high-order entropic quantum uncertainty relation with applications. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 360\u2013378. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_20"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-540-28628-8_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"I Damg\u00e5rd","year":"2004","unstructured":"Damg\u00e5rd, I., Fehr, S., Salvail, L.: Zero-knowledge proofs and string commitments with standing quantum attacks. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 254\u2013272. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_16"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Fortnow, L.: The complexity of perfect zero-knowledge (extended abstract). In: Aho, A. (ed.) 19th ACM STOC, pp. 204\u2013209. ACM Press (1987)","DOI":"10.1145\/28395.28418"},{"key":"9_CR19","first-page":"621","volume":"2020","author":"J Fang","year":"2020","unstructured":"Fang, J., Unruh, D., Weng, J., Yan, J., Zhou, D.: How to base security on the perfect\/statistical binding property of quantum bit commitment? IACR Cryptol. ePrint Arch. 2020, 621 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"1","key":"9_CR20","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":"9_CR21","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Sahai, A., Vadhan, S.P.: Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge. In: 30th ACM STOC, pp. 399\u2013408. ACM Press (1998)","DOI":"10.1145\/276698.276852"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Grilo, A.B., Slofstra, W., Yuen, H.: Perfect zero knowledge for quantum multiprover interactive proofs. In: Zuckerman, D. (ed.) 60th FOCS, pp. 611\u2013635. IEEE Computer Society Press (2019)","DOI":"10.1109\/FOCS.2019.00044"},{"key":"9_CR23","first-page":"1315","volume":"2021","author":"T Hiroka","year":"2021","unstructured":"Hiroka, T., Morimae, T., Nishimaki, R., Yamakawa, T.: Certified everlasting zero-knowledge proof for QMA. IACR Cryptol. ePrint Arch. 2021, 1315 (2021)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"9_CR24","first-page":"617","volume":"2021","author":"T Hiroka","year":"2021","unstructured":"Hiroka, T., Morimae, T., Nishimaki, R., Yamakawa, T.: Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication. IACR Cryptol. ePrint Arch. 2021, 617 (2021)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"9_CR25","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. 2906, pp. 178\u2013188. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24587-2_20"},{"key":"9_CR26","doi-asserted-by":"publisher","first-page":"3410","DOI":"10.1103\/PhysRevLett.78.3410","volume":"78","author":"H-K Lo","year":"1997","unstructured":"Lo, H.-K., Chau, H.F.: Is quantum bit commitment really possible? Phys. Rev. Lett. 78, 3410\u20133413 (1997)","journal-title":"Phys. Rev. Lett."},{"key":"9_CR27","unstructured":"Lombardi, A., Schaeffer, L.: A note on key agreement and non-interactive commitments. Cryptology ePrint Archive, Report 2019\/279 (2019). https:\/\/eprint.iacr.org\/2019\/279"},{"key":"9_CR28","doi-asserted-by":"publisher","first-page":"3414","DOI":"10.1103\/PhysRevLett.78.3414","volume":"78","author":"D Mayers","year":"1997","unstructured":"Mayers, D.: Unconditionally secure quantum bit commitment is impossible. Phys. Rev. Lett. 78, 3414\u20133417 (1997)","journal-title":"Phys. Rev. Lett."},{"key":"9_CR29","unstructured":"Menda, S., Watrous, J.: Oracle separations for quantum statistical zero-knowledge. arXiv preprint arXiv:1801.08967 (2018)"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Morimae, T., Yamakawa, T.: Classically verifiable (dual-mode) NIZK for QMA with preprocessing. arXiv preprint arXiv:2102.09149 (2021)","DOI":"10.1007\/978-3-031-22972-5_21"},{"key":"9_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-030-84242-0_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"O Shmueli","year":"2021","unstructured":"Shmueli, O.: Multi-theorem designated-verifier NIZK for QMA. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 375\u2013405. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_14"},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-642-40084-1_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Unruh","year":"2013","unstructured":"Unruh, D.: Everlasting multi-party computation. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 380\u2013397. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_22"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Unruh, D.: Revocable quantum timed-release encryption. J. ACM 62(6), 49:1\u201349:76 (2015)","DOI":"10.1145\/2817206"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Watrous, J.: Limits on the power of quantum statistical zero-knowledge. In: 43rd FOCS, pp. 459\u2013470. IEEE Computer Society Press (2002)","DOI":"10.1109\/SFCS.2002.1181970"},{"issue":"1","key":"9_CR35","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."},{"key":"9_CR36","first-page":"1510","volume":"2020","author":"J Yan","year":"2020","unstructured":"Yan, J.: Quantum computationally predicate-binding commitment with application in quantum zero-knowledge argument for NP. IACR Cryptol. ePrint Arch. 2020, 1510 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"9_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-662-48971-0_47","volume-title":"Algorithms and Computation","author":"J Yan","year":"2015","unstructured":"Yan, J., Weng, J., Lin, D., Quan, Y.: Quantum bit commitment with application in quantum zero-knowledge proof (extended abstract). In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 555\u2013565. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48971-0_47"},{"key":"9_CR38","doi-asserted-by":"publisher","unstructured":"Zhandry, M.: How to record quantum queries, and applications to quantum indifferentiability. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 239\u2013268. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_9","DOI":"10.1007\/978-3-030-26951-7_9"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15802-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:06:17Z","timestamp":1760133977000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15802-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031158018","9783031158025"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15802-5_9","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":"12 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}