{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:04:57Z","timestamp":1766268297320,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031683930"},{"type":"electronic","value":"9783031683947"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68394-7_8","type":"book-chapter","created":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T09:02:27Z","timestamp":1723885347000},"page":"215-248","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["On Central Primitives for\u00a0Quantum Cryptography with\u00a0Classical Communication"],"prefix":"10.1007","author":[{"given":"Kai-Min","family":"Chung","sequence":"first","affiliation":[]},{"given":"Eli","family":"Goldin","sequence":"additional","affiliation":[]},{"given":"Matthew","family":"Gray","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,18]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"668","DOI":"10.22331\/q-2022-03-17-668","volume":"6","author":"D Aharonov","year":"2022","unstructured":"Aharonov, D., Ben-Or, M., Brand\u00e3o, F.G.S.L., Sattath, O.: The pursuit of uniqueness: extending valiant-vazirani theorem to the probabilistic and quantum settings. Quantum 6, 668 (2022)","journal-title":"Quantum"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Adcock, M., Cleve, R.: A quantum Goldreich-Levin theorem with cryptographic applications (2001)","DOI":"10.1007\/3-540-45841-7_26"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Austrin, P., Chung, H., Chung, K.-M., Fu, S., Lin, Y.-T., Mahmoody, M.: On\u00a0the\u00a0impossibility\u00a0of\u00a0key\u00a0agreements\u00a0from quantum random oracles. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part II, pp. 165\u2013194. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_6","DOI":"10.1007\/978-3-031-15979-4_6"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Ananth, P., Lin, Y.-T., Yuen, H.: Pseudorandom strings from pseudorandom quantum states. arXiv preprint arXiv:2306.05613 (2023)","DOI":"10.1007\/978-3-031-15802-5_8"},{"key":"8_CR5","unstructured":"Ananth, P., Lin, Y.-T., Yuen, H.: Pseudorandom strings from pseudorandom quantum states. Cryptology ePrint Archive, Paper 2023\/904 (2023. https:\/\/eprint.iacr.org\/2023\/904"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Ananth, P. Qian, L., Yuen, H.: Hyptography from pseudorandom quantum states. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, pp. 208\u2013236. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-15802-5_8"},{"key":"8_CR7","unstructured":"Barhoush, M., Behera, A., Ozer, L., Salvail, L., Sattath, O.: Signatures from pseudorandom states via $$\\bot $$-prfs (2024)"},{"key":"8_CR8","unstructured":"Brakerski, Z., Canetti, R., Qian, L.: On the computational hardness needed for quantum cryptography. Cryptology ePrint Archive, Paper 2022\/1181 (2022). https:\/\/eprint.iacr.org\/2022\/1181"},{"key":"8_CR9","unstructured":"Bouaziz-Ermann, S., Muguruza, G.: Quantum pseudorandomness cannot be shrunk in a black-box way. Cryptology ePrint Archive, Paper 2024\/291 (2024). https:\/\/eprint.iacr.org\/2024\/291"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Bostanci, J., Qian, L., Spooner, N., Yuen, H.: An efficient quantum parallel repetition theorem and applications (2023)","DOI":"10.1145\/3618260.3649603"},{"key":"8_CR11","unstructured":"Chen, Y.-H., Chung, K.-M., Vadhan, S.P., Wu, X., Lai , C.-Y.: Computational notions of quantum min-entropy (2017)"},{"key":"8_CR12","unstructured":"Cavalar, B., Goldin, E., Gray, M., Hall, P., Liu, Y., Pelecanos, A.: On the computational hardness of quantum one-wayness. arXiv preprint arXiv:2312.08363 (2023)"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Chung, K.-M., Lin, Y.-T., Mahmoody, M.: Black-box separations for non-interactive classical commitments in a quantum world. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, pp. 144\u2013172. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_6","DOI":"10.1007\/978-3-031-30545-0_6"},{"key":"8_CR14","unstructured":"Coladangelo, A., Mutreja, S.: On black-box separations of quantum digital signatures from pseudorandom states (2024)"},{"issue":"4","key":"8_CR15","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, STOC 1989, pp. 25\u201332. Association for Computing Machinery, New York (1989)","DOI":"10.1145\/73007.73010"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen message attack this research was supported by NSF grant MCS-80-06938, an IBM\/MIT faculty development award, and Darpa contract n00014-85-k-0125: extended abstract. In: Johnson, D.S., Nishizeki, T., Nozaki, A., Wilf, H.S. (eds.) Discrete Algorithms and Complexity, pp. 287\u2013310. Academic Press (1987)","DOI":"10.1016\/B978-0-12-386870-1.50022-8"},{"issue":"6","key":"8_CR18","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(90)90010-U","volume":"34","author":"O Goldreich","year":"1990","unstructured":"Goldreich, O.: A note on computational indistinguishability. Inf. Process. Lett. 34(6), 277\u2013281 (1990)","journal-title":"Inf. Process. Lett."},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"H\u00c5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","DOI":"10.1137\/S0097539793244708"},{"key":"8_CR20","doi-asserted-by":"publisher","unstructured":"Harnik, D., Kilian, J., Naor, M., Reingold, O., Rosen, A.: On robust combiners for oblivious transfer and other primitives. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 96\u2013113. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_6","DOI":"10.1007\/11426639_6"},{"key":"8_CR21","unstructured":"Hiroka, T., Kitagawa, F., Nishimaki, R., Yamakawa, T.: Robust combiners and universal constructions for quantum cryptography. Cryptology ePrint Archive, Paper 2023\/1772 (2023). https:\/\/eprint.iacr.org\/2023\/1772"},{"key":"8_CR22","unstructured":"Hhan, M., Morimae, T., Yamakawa, T.: Quantum public key encryption and commitments from the hardness of detecting superpositions to cryptography (2023)"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Haitner, I., Reingold, O., Vadhan, S.: Efficiency improvements in constructing pseudorandom generators from one-way functions. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing, STOC 2010, pp. 437\u2013446. Association for Computing Machinery, New York (2010)","DOI":"10.1145\/1806689.1806750"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography. In: 30th Annual Symposium on Foundations of Computer Science, pp. 230\u2013235 (1989)","DOI":"10.1109\/SFCS.1989.63483"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R.: A personal view of average-case complexity. In: Proceedings of Structure in Complexity Theory, Tenth Annual IEEE Conference, pp. 134\u2013147 (1995)","DOI":"10.1109\/SCT.1995.514853"},{"key":"8_CR26","unstructured":"Irani, S., Natarajan, A., Nirkhe, C., Rao, S., Yuen, H.: Quantum search-to-decision reductions and the state synthesis problem. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"8_CR27","unstructured":"Kitagawa, F., Nishimaki, R., Yamakaw, T.: Publicly verifiable deletion from minimal assumptions. Cryptology ePrint Archive, Paper 2023\/538 (2023). https:\/\/eprint.iacr.org\/2023\/538"},{"key":"8_CR28","unstructured":"Kretschmer, W.: Quantum pseudorandomness and classical complexity. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Khurana, D., Tomer, K.: Commitments from quantum one-wayness (2024)","DOI":"10.1145\/3618260.3649654"},{"key":"8_CR30","unstructured":"Lamport, L.: Constructing digital signatures from a one way function. Technical Report CSL-98, October 1979. This paper was published by IEEE in the Proceedings of HICSS-43 in January (2010)"},{"issue":"4","key":"8_CR31","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02579323","volume":"7","author":"LA Levin","year":"1987","unstructured":"Levin, L.A.: One way functions and pseudorandom generators. Combinatorica 7(4), 357\u2013363 (1987)","journal-title":"Combinatorica"},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Mazor, N., Pass, R.: Counting unpredictable bits: a simple PRG from one-way functions. Cryptology ePrint Archive, Paper 2023\/1451 (2023). https:\/\/eprint.iacr.org\/2023\/1451","DOI":"10.1007\/978-3-031-48615-9_7"},{"key":"8_CR33","unstructured":"Morimae, T., Yamakawa, T.: One-wayness in quantum cryptography. Cryptology ePrint Archive, Paper 2022\/1336 (2022). https:\/\/eprint.iacr.org\/2022\/1336"},{"key":"8_CR34","doi-asserted-by":"publisher","unstructured":"Morimae, T., Yamakawa, T.: Quantum commitments and signatures without one-way functions. In: Annual International Cryptology Conference, pp. 269\u2013295. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_10","DOI":"10.1007\/978-3-031-15802-5_10"},{"issue":"2","key":"8_CR35","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. J. Cryptol. 4(2), 151\u2013158 (1991)","journal-title":"J. Cryptol."},{"key":"8_CR36","doi-asserted-by":"crossref","unstructured":"Vadhan, S., Zheng, C.J.: Characterizing pseudoentropy and simplifying pseudorandom generator constructions. In: Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC 2012), pp. 817\u2013836. ACM (2012)","DOI":"10.1145\/2213977.2214051"},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and application of trapdoor functions. In: 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982), pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68394-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T20:12:48Z","timestamp":1732651968000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68394-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683930","9783031683947"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68394-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"18 August 2024","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}