{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T01:56:37Z","timestamp":1778291797382,"version":"3.51.4"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032018779","type":"print"},{"value":"9783032018786","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-032-01878-6_19","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T18:09:05Z","timestamp":1755367745000},"page":"575-607","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the\u00a0Power of\u00a0Oblivious State Preparation"],"prefix":"10.1007","author":[{"given":"James","family":"Bartusek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dakshita","family":"Khurana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/3-540-45841-7_26","volume-title":"STACS 2002","author":"M Adcock","year":"2002","unstructured":"Adcock, M., Cleve, R.: A quantum Goldreich-Levin theorem with cryptographic applications. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 323\u2013334. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45841-7_26"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-031-22318-1_10","volume-title":"Theory of Cryptography - TCC 2022","author":"N Alamati","year":"2022","unstructured":"Alamati, N., Malavolta, G., Rahimi, A.: Candidate trapdoor claw-free functions from group actions with applications to quantum protocols. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022. LNCS, vol. 13747, pp. 266\u2013293. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_10"},{"key":"19_CR3","unstructured":"Amer, O., et al.: Certified randomness implies secure classical position-verification. Cryptology ePrint Archive, Paper 2024\/1726 (2024)"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Arora, A.S., Bharti, K., Cojocaru, A., Coladangelo, A.: A computational test of contextuality and, even simpler proofs of quantumness. In: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1106\u20131125 (2024)","DOI":"10.1109\/FOCS61266.2024.00073"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-031-15979-4_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2022, Part II","author":"P Austrin","year":"2022","unstructured":"Austrin, P., Chung, H., Chung, K.M., Fu, S., Lin, Y.T., Mahmoody, M.: On the impossibility of key agreements from quantum random oracles. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13508, pp. 165\u2013194. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_6"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Bacho, K., Kulpe, A., Malavolta, G., Schmidt, S., Walter, M.: Compiled nonlocal games from any trapdoor claw-free function. Cryptology ePrint Archive, Paper 2024\/1829 (2024)","DOI":"10.1007\/978-3-032-01878-6_21"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-90459-3_1","volume-title":"Theory of Cryptography","author":"J Bartusek","year":"2021","unstructured":"Bartusek, J.: Secure quantum computation with classical communication. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13042, pp. 1\u201330. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_1"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-031-15979-4_7","volume-title":"Advances in Cryptology - CRYPTO 2022","author":"J Bartusek","year":"2022","unstructured":"Bartusek, J., et al.: Succinct classical verification of quantum computation. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13508, pp. 195\u2013211. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_7"},{"key":"19_CR9","unstructured":"Bartusek, J., Khurana, D.: On the power of oblivious state preparation. Cryptology ePrint Archive, Paper 2024\/1820 (2024)"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Bennett, C.H., DiVincenzo, D.P., Shor, P.W., Smolin, J.A., Terhal, B.M., Wootters, W.K.: Erratum: remote state preparation. Phys. Rev. Lett. 87, 077902 (2001). Phys. Rev. Lett. 88, 099902 (2002)","DOI":"10.1103\/PhysRevLett.88.099902"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Christiano, P., Mahadev, U., Vazirani, U.V., Vidick, T.: A cryptographic test of quantumness and certifiable randomness from a single quantum device. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 320\u2013331 (2018)","DOI":"10.1109\/FOCS.2018.00038"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-031-38554-4_6","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"Z Brakerski","year":"2023","unstructured":"Brakerski, Z., Gheorghiu, A., Kahanamoku-Meyer, G.D., Porat, E., Vidick, T.: Simple tests of quantumness also certify qubits. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14085, pp. 162\u2013191. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_6"},{"issue":"9","key":"19_CR13","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1139\/cjp-2015-0030","volume":"93","author":"A Broadbent","year":"2015","unstructured":"Broadbent, A.: Delegating private quantum computations. Can. J. Phys. 93(9), 941\u2013946 (2015)","journal-title":"Can. J. Phys."},{"key":"19_CR14","series-title":"LNCS","first-page":"17","volume-title":"TCC 2005","author":"R Canetti","year":"2005","unstructured":"Canetti, R., Halevi, S., Steiner, M.: Hardness amplification of weakly verifiable puzzles. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 17\u201333. Springer, Heidelberg (2005)"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/978-3-031-07082-2_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2022, Part III","author":"KM Chung","year":"2022","unstructured":"Chung, K.M., Lee, Y., Lin, H.H., Wu, X.: Constant-round blind classical verification of quantum sampling. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part III. LNCS, vol. 13277, pp. 707\u2013736. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_25"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/978-3-030-34578-5_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"A Cojocaru","year":"2019","unstructured":"Cojocaru, A., Colisson, L., Kashefi, E., Wallden, P.: QFactory: classically-instructed remote secret qubits preparation. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 615\u2013645. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_22"},{"issue":"1","key":"19_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.3390\/cryptography5010003","volume":"5","author":"A Cojocaru","year":"2021","unstructured":"Cojocaru, A., Colisson, L., Kashefi, E., Wallden, P.: On the possibility of classical client blind quantum computing. Cryptography 5(1), 3 (2021)","journal-title":"Cryptography"},{"key":"19_CR18","unstructured":"Cui, D., et al.: A computational tsirelson\u2019s theorem for the value of compiled XOR games. Cryptology ePrint Archive, Paper 2024\/348 (2024)"},{"key":"19_CR19","unstructured":"Dunjko, V., Kashefi, E.: Blind quantum computing with two almost identical states. arXiv, abs\/1604.01586 (2016)"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Ferracin, S., Kapourniotis, T., Datta, A.: Reducing resources for verification of quantum computations. Phys. Rev. A (2017)","DOI":"10.1103\/PhysRevA.98.022323"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Gertner, Y., Kannan, S., Malkin, T., Reingold, O., Viswanathan, M.: The relationship between public key encryption and oblivious transfer. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, FOCS \u201900, p. 325. IEEE Computer Society, USA (2000)","DOI":"10.1109\/SFCS.2000.892121"},{"key":"19_CR22","unstructured":"Gheorghiu, A., Metger, T., Poremba, A.: Quantum cryptography with classical communication: parallel remote state preparation for copy-protection, verification, and more. In: Etessami, K., Feige, U., Puppis, G. (eds.) 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), vol. 261. Leibniz International Proceedings in Informatics (LIPIcs), pp. 67:1\u201367:17, Dagstuhl, Germany. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"19_CR23","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 (2019)","DOI":"10.1109\/FOCS.2019.00066"},{"key":"19_CR24","unstructured":"Gunn, S., Kalai, Y.T., Natarajan, A., Villanyi, A.: Classical commitments to quantum states. Cryptology ePrint Archive, Paper 2024\/606 (2024)"},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-031-68382-4_8","volume-title":"Advances in Cryptology - CRYPTO 2024","author":"A Gupte","year":"2024","unstructured":"Gupte, A., Vaikuntanathan, V.: How to construct quantum FHE, generically. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14922, pp. 246\u2013279. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68382-4_8"},{"key":"19_CR26","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1038\/s41567-022-01643-7","volume":"18","author":"GD Kahanamoku-Meyer","year":"2021","unstructured":"Kahanamoku-Meyer, G.D., Choi, S., Vazirani, U.V., Yao, N.Y.: Classically verifiable quantum advantage from a computational bell test. Nat. Phys. 18, 918\u2013924 (2021)","journal-title":"Nat. Phys."},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Kalai, Y., Lombardi, A., Vaikuntanathan, V., Yang, L.: Quantum advantage from any non-local game. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, pp. 1617\u20131628. Association for Computing Machinery, New York, NY, USA (2023)","DOI":"10.1145\/3564246.3585164"},{"key":"19_CR28","unstructured":"Kulpe, A., Malavolta, G., Paddock, C., Schmidt, S., Walter, M.: A bound on the quantum value of all compiled nonlocal games. Cryptology ePrint Archive, Paper 2024\/1276 (2024)"},{"key":"19_CR29","unstructured":"Liu, J., Liu, Q., Qian, L.: Beating classical impossibility of position verification. In: Braverman, M. (ed.) 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), vol. 215, pp. 100:1\u2013100:11. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2022)"},{"key":"19_CR30","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 (2018)","DOI":"10.1109\/FOCS.2018.00039"},{"key":"19_CR31","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 (2018)","DOI":"10.1109\/FOCS.2018.00033"},{"key":"19_CR32","doi-asserted-by":"crossref","unstructured":"Metger, T., Natarajan, A., Zhang, T.: Succinct arguments for QMA from standard assumptions via compiled nonlocal games. In: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1193\u20131201 (2024)","DOI":"10.1109\/FOCS61266.2024.00078"},{"key":"19_CR33","doi-asserted-by":"publisher","first-page":"544","DOI":"10.22331\/q-2021-09-16-544","volume":"5","author":"T Metger","year":"2021","unstructured":"Metger, T., Vidick, T.: Self-testing of a single quantum device under computational assumptions. Quantum 5, 544 (2021)","journal-title":"Quantum"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Natarajan, A., Zhang, T.: Bounding the quantum value of compiled nonlocal games: from CHSH to BQP verification. In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1342\u20131348 (2023)","DOI":"10.1109\/FOCS57990.2023.00081"},{"key":"19_CR35","doi-asserted-by":"crossref","unstructured":"Radian, R., Sattath, O.: Semi-quantum money. In: Proceedings of the 1st ACM Conference on Advances in Financial Technologies, AFT \u201919, pp. 132\u2013146. Association for Computing Machinery, New York, NY, USA (2019)","DOI":"10.1145\/3318041.3355462"},{"key":"19_CR36","doi-asserted-by":"crossref","unstructured":"Reichardt, B.W., Unger, F., Vazirani, U.: A classical leash for a quantum system: command of quantum systems via rigidity of CHSH games. In: Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, ITCS \u201913, pp. 321\u2013322. Association for Computing Machinery, New York, NY, USA (2013)","DOI":"10.1145\/2422436.2422473"},{"key":"19_CR37","doi-asserted-by":"crossref","unstructured":"Shmueli, O.: Public-key quantum money with a classical bank. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, pp. 790\u2013803. Association for Computing Machinery, New York, NY, USA (2022)","DOI":"10.1145\/3519935.3519952"},{"issue":"5","key":"19_CR38","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"19_CR39","unstructured":"Vidick, T.: Interactions with quantum devices (course) (2020). http:\/\/users.cms.caltech.edu\/~vidick\/teaching\/fsmp\/fsmp.pdf"},{"key":"19_CR40","doi-asserted-by":"crossref","unstructured":"Yamakawa, T., Zhandry, M.: Verifiable quantum advantage without structure. J. ACM 71(3) (2024)","DOI":"10.1145\/3658665"},{"key":"19_CR41","doi-asserted-by":"crossref","unstructured":"Zhang, J.: Succinct blind quantum computation using a random oracle. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, pp. 1370\u20131383. Association for Computing Machinery, New York, NY, USA (2021)","DOI":"10.1145\/3406325.3451082"},{"key":"19_CR42","doi-asserted-by":"crossref","unstructured":"Zhang, J.: Classical verification of quantum computations in linear time. In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 46\u201357 (2022)","DOI":"10.1109\/FOCS54457.2022.00012"},{"key":"19_CR43","unstructured":"Zhang, J.: Formulations and constructions of remote state preparation with verifiability, with applications. In: Meka, R. (ed.) 16th Innovations in Theoretical Computer Science Conference (ITCS 2025). Leibniz International Proceedings in Informatics (LIPIcs), pp. 96:1\u201396:19. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2025)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01878-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T15:12:22Z","timestamp":1757430742000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01878-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018779","9783032018786"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01878-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}