{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T05:59:31Z","timestamp":1780466371472,"version":"3.54.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031223174","type":"print"},{"value":"9783031223181","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-22318-1_9","type":"book-chapter","created":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T03:04:30Z","timestamp":1671591870000},"page":"237-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Pseudorandom (Function-Like) Quantum State Generators: New Definitions and\u00a0Applications"],"prefix":"10.1007","author":[{"given":"Prabhanjan","family":"Ananth","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aditya","family":"Gulati","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luowen","family":"Qian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Henry","family":"Yuen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,12,21]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Emerson, J.: Quantum t-designs: t-wise independence in the quantum world. In: 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 13\u201316 June 2007, San Diego, California, USA, pp. 129\u2013140. IEEE Computer Society (2007)","DOI":"10.1109\/CCC.2007.26"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Ananth, P., Qian, L., Yuen, H.: Cryptography from pseudorandom quantum states. In: Annual International Cryptology Conference 2022, pp. 208\u2013236. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-15802-5_8"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-030-36030-6_10","volume-title":"Theory of Cryptography","author":"Z Brakerski","year":"2019","unstructured":"Brakerski, Z., Shmueli, O.: (Pseudo) random quantum states with binary phase. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 229\u2013250. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_10"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Shmueli, O.: Scalable pseudorandom quantum states. In: Micciancio, D., Ristenpart, T., (eds.), Advances in Cryptology - CRYPTO 2020\u201340th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17\u201321, 2020, Proceedings, Part II LNCS, vol. 12171, pp. 417\u2013440. Springer (2020)","DOI":"10.1007\/978-3-030-56880-1_15"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s00220-016-2706-8","volume":"346","author":"FGSL Brand\u00e3o","year":"2016","unstructured":"Brand\u00e3o, F.G.S.L., Harrow, A.W., Horodecki, M.: Local random quantum circuits are approximate polynomial-designs. Commun. Math. Phys. 346(2), 397\u2013434 (2016). https:\/\/doi.org\/10.1007\/s00220-016-2706-8","journal-title":"Commun. Math. Phys."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Dankert, C., Cleve, R., Emerson, J., Livine, E.: Exact and approximate unitary 2-designs and their application to fidelity estimation. Phys. Rev. 80, 012304 (2009)","DOI":"10.1103\/PhysRevA.80.012304"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Gavinsky, D.: Quantum money with classical verification. In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26\u201329, 2012, pp. 42\u201352. IEEE Computer Society (2012)","DOI":"10.1109\/CCC.2012.10"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792\u2013807 (1986)","DOI":"10.1145\/6490.6503"},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Huang, H.Y., Kueng, R., Preskill, J.: Predicting many properties of a quantum system from very few measurements. Nat. Phys. 16(10), 1050\u20131057 (2020)","DOI":"10.1038\/s41567-020-0932-7"},{"key":"9_CR11","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_CR12","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, July 5\u20138, 2021, Virtual Conference, vol. 197 of LIPIcs, pp. 2:1\u20132:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Lo, H.K., Chau, H.F.: Is quantum bit commitment really possible? Phys. Rev. Lett. 78, 3410\u20133413 (1997)","DOI":"10.1103\/PhysRevLett.78.3410"},{"key":"9_CR14","unstructured":"Lowe, A.: Learning quantum states without entangled measurements. Master\u2019s thesis (2021)"},{"key":"9_CR15","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_CR16","doi-asserted-by":"crossref","unstructured":"Morimae, T., Yamakawa, T.: Quantum commitments and signatures without one-way functions. In: CRYPTO (2022)","DOI":"10.1007\/978-3-031-15802-5_10"},{"key":"9_CR17","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press (2010)"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Roy, A., Scott, A.J.: Unitary designs and codes. Des. Codes Cryptography, 53(1), 13\u201331 (2009)","DOI":"10.1007\/s10623-009-9290-2"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Zhandry, M.: How to construct quantum random functions. In: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20\u201323, 2012, pp. 679\u2013687. IEEE Computer Society (2012)","DOI":"10.1109\/FOCS.2012.37"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Zhandry, M.: Secure identity-based encryption in the quantum random oracle model. In: Reihaneh, S.-N., Canetti, R., (eds.), Advances in Cryptology - CRYPTO 2012\u201332nd Annual Cryptology Conference, Santa Barbara, CA, USA, 19\u201323 August 2012. Proceedings, LNCS, vol. 7417, pp. 758\u2013775. Springer (2012)","DOI":"10.1007\/978-3-642-32009-5_44"}],"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-031-22318-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:01:54Z","timestamp":1766278914000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22318-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031223174","9783031223181"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22318-1_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":"21 December 2022","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":"Chicago, IL","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":"7 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2022\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"139","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":"60","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":"3.1","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":"9.9","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}