{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T16:50:14Z","timestamp":1755795014649,"version":"3.44.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032018779"},{"type":"electronic","value":"9783032018786"}],"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_9","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T18:08:50Z","timestamp":1755367730000},"page":"269-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Translating Between the\u00a0Common Haar Random State Model and\u00a0the\u00a0Unitary Model"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7975-8281","authenticated-orcid":false,"given":"Eli","family":"Goldin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7071-6272","authenticated-orcid":false,"given":"Mark","family":"Zhandry","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Ananth, P., Gulati, A., Lin, Y.-T.: Cryptography in the common Haar state model: feasibility results and separations. In: Boyle, E., Mahmoody, M. (eds.) TCC 2024. LNCS, vol. 15365, pp. 94\u2013125. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-78017-2_4","DOI":"10.1007\/978-3-031-78017-2_4"},{"key":"9_CR2","unstructured":"Ananth, P., Gulati, A., Lin, Y.-T.: A note on the common Haar state model. Cryptology ePrint Archive, Report 2024\/543 (2024)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-030-84242-0_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"J Bartusek","year":"2021","unstructured":"Bartusek, J., Coladangelo, A., Khurana, D., Ma, F.: One-way functions imply secure computation in a quantum world. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part I. LNCS, vol. 12825, pp. 467\u2013496. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_17"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Bostanci, J., Chen, B., Nehoran, B.: Oracle separation between quantum commitments and quantum one-wayness. In: Fehr, S., Fouque, PA. (eds.) EUROCRYPT 2025. LNCS, vol. 15607, pp. 3\u201322. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91098-2_1","DOI":"10.1007\/978-3-031-91098-2_1"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Behera, A., Malavolta, G., Morimae, T., Mour, T., Yamakawa, T.: A new world in the depths of Microcrypt: separating OWSGs and quantum money from QEFID. In: Fehr, S., Fouque, P.A. (eds.) EUROCRYPT 2025. LNCS, vol. 15607, pp. 23\u201352. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91098-2_2","DOI":"10.1007\/978-3-031-91098-2_2"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Badescu, C., O\u2019Donnell, R.: Improved quantum data analysis. In: Khuller, S., Williams, V.V. (eds.) 53rd Annual ACM Symposium on Theory of Computing, pp. 1398\u20131411, Virtual Event, Italy, 21\u201325 June 2021. ACM Press (2021)","DOI":"10.1145\/3406325.3451109"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Chen, B., Coladangelo, A., Sattath, O.: The power of a single Haar random state: constructing and separating quantum pseudorandomness. In: Fehr, S., Fouque, PA. (eds.) EUROCRYPT 2025. LNCS, vol. 15607, pp. 108\u2013137. Springer, Cham (2025)","DOI":"10.1007\/978-3-031-91098-2_5"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Cavalar, B., Goldin, E., Gray, M., Hall, P., Liu, Y., Pelecanos, A.: On the computational hardness of quantum one-wayness (2025)","DOI":"10.22331\/q-2025-03-27-1679"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-030-77886-6_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"AB Grilo","year":"2021","unstructured":"Grilo, A.B., Lin, H., Song, F., Vaikuntanathan, V.: Oblivious transfer is in MiniQCrypt. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 531\u2013561. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_18"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-540-70936-7_24","volume-title":"Theory of Cryptography","author":"Y Gertner","year":"2007","unstructured":"Gertner, Y., Malkin, T., Myers, S.: Towards a separation of semantic and CCA security for public key encryption. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 434\u2013455. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_24"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Gertner, Y., Malkin, T., Reingold, O.: On the impossibility of basing trapdoor functions on trapdoor predicates. In: 42nd Annual Symposium on Foundations of Computer Science, pp. 126\u2013135, Las Vegas, NV, USA, 14\u201317 October 2001. IEEE Computer Society Press (2001)","DOI":"10.1109\/SFCS.2001.959887"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: 21st Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, 15\u201317 May 1989, pp. 44\u201361. ACM Press (1989)","DOI":"10.1145\/73007.73012"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-319-96878-0_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"Z Ji","year":"2018","unstructured":"Ji, Z., Liu, Y.-K., Song, F.: Pseudorandom quantum states. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 126\u2013152. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_5"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Kretschmer, W., Qian, L., Sinha, M., Tal, A.: Quantum cryptography in algorithmica. In: Saha, B., Servedio, R.A. (eds.) 55th Annual ACM Symposium on Theory of Computing, Orlando, FL, USA, 20\u201323 June 2023, pp. 1589\u20131602 2023. ACM Press (2023)","DOI":"10.1145\/3564246.3585225"},{"key":"9_CR15","unstructured":"Kretschmer, W.: Quantum Pseudorandomness and classical complexity. In: Hsieh, M.-H. (ed.) 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, 2021, vol. 197, pp. 2:1\u20132:20. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Khurana, D., Tomer, K.: Founding quantum cryptography on quantum advantage, or, towards cryptography from $$\\sf \\#p$$-hardness (2024)","DOI":"10.1145\/3717823.3718145"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-54242-8_11","volume-title":"Theory of Cryptography","author":"M Mahmoody","year":"2014","unstructured":"Mahmoody, M., Maji, H.K., Prabhakaran, M.: On the power of public-key encryption in secure computation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 240\u2013264. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_11"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-24638-1_2","volume-title":"Theory of Cryptography","author":"U Maurer","year":"2004","unstructured":"Maurer, U., Renner, R., Holenstein, C.: Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 21\u201339. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_2"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Morimae, T., Yamakawa, T.: Quantum commitments and signatures without one-way functions. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0I. LNCS, vol. 13507, pp. 269\u2013295. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_10","DOI":"10.1007\/978-3-031-15802-5_10"},{"key":"9_CR20","unstructured":"Morimae, T., Yamakawa, T.: One-wayness in quantum cryptography. In: Magniez, F., Grilo, A.B. (eds.) 19th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, vol. 310, pp. 4:1\u20134:21. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-030-56877-1_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"L Rotem","year":"2020","unstructured":"Rotem, L., Segev, G.: Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 481\u2013509. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_17"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-20465-4_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"T Ristenpart","year":"2011","unstructured":"Ristenpart, T., Shacham, H., Shrimpton, T.: Careful with composition: limitations of the indifferentiability framework. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 487\u2013506. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_27"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-030-45727-3_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"L Rotem","year":"2020","unstructured":"Rotem, L., Segev, G., Shahaf, I.: Generic-group delay functions require hidden-order groups. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 155\u2013180. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_6"},{"key":"9_CR24","unstructured":"Watts, A.B., Bostanci, J.: Quantum event learning and gentle random measurements (2024)"},{"key":"9_CR25","unstructured":"Wilson, R.: Eigenvalues of the kneser graph; the Erd\u00f6s-Ko-rado theorem (2012)"},{"key":"9_CR26","unstructured":"Zhandry, M.: The space-time cost of purifying quantum computations. In: Guruswami, V. (ed.) ITCS 2024: 15th Innovations in Theoretical Computer Science Conference, Berkeley, CA, USA, 30 January\u20132 February 2024, vol. 287, pp. 102:1\u2013102:22. Leibniz International Proceedings in Informatics (LIPIcs) (2024)"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T18:09:04Z","timestamp":1755367744000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01878-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018779","9783032018786"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01878-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}}]}}