{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:48:15Z","timestamp":1781077695425,"version":"3.54.1"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031780165","type":"print"},{"value":"9783031780172","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T00:00:00Z","timestamp":1732752000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T00:00:00Z","timestamp":1732752000000},"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-031-78017-2_5","type":"book-chapter","created":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T23:48:33Z","timestamp":1732751313000},"page":"126-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Robust Combiners and\u00a0Universal Constructions for\u00a0Quantum Cryptography"],"prefix":"10.1007","author":[{"given":"Taiga","family":"Hiroka","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fuyuki","family":"Kitagawa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ryo","family":"Nishimaki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takashi","family":"Yamakawa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,11,28]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson, S.: Shadow tomography of quantum states. In: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) 50th ACM STOC, pp. 325\u2013338. ACM Press (2018)","DOI":"10.1145\/3188745.3188802"},{"key":"5_CR2","series-title":"Part I, volume 11891 of LNCS","first-page":"199","volume-title":"TCC 2019","author":"P Ananth","year":"2019","unstructured":"Ananth, P., Badrinarayanan, S., Jain, A., Manohar, N., Sahai, A.: From FE combiners to secure MPC and back. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. Part I, volume 11891 of LNCS, pp. 199\u2013228. Springer, Heidelberg (2019)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Christiano, P.: Quantum money from hidden subspaces. In: STOC, pp. 41\u201360. ACM (2012)","DOI":"10.1145\/2213977.2213983"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Ananth, P., Gulati, A., Qian, L., Yuen, H.: Pseudorandom (function-like) quantum state generators: new definitions and\u00a0applications. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022, Part I, pp. 237\u2013265. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-22318-1_9"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Ananth, P., Jain, A., Naor, M., Sahai, A., Yogev, E.: Universal constructions and robust combiners for indistinguishability obfuscation and witness encryption. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, Part II, vol. 9815, pp. 491\u2013520. Springer, Heidelberg (2016)","DOI":"10.1007\/978-3-662-53008-5_17"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Ananth, P., Jain, A., Sahai, A.: Robust transforming combiners from indistinguishability obfuscation to functional encryption. In: EUROCRYPT (1), pp. 91\u2013121. Springer (2017)","DOI":"10.1007\/978-3-319-56620-7_4"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Ananth, P., Kaleoglu, F.: Unclonable encryption, revisited. In: Nissim, K., Waters, B. (eds.) Theory of Cryptography, pp. 299\u2013329. Springer, Cham (2021)","DOI":"10.1007\/978-3-030-90459-3_11"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Ananth, P., Kaleoglu, F., Li, X., Liu, Q., Zhandry, M.: On the feasibility of unclonable encryption, and more. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022, pp. 212\u2013241. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-15979-4_8"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Ananth, P., Qian, L., Yuen, H.: Cryptography from pseudorandom quantum states. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022, pp. 208\u2013236. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-15802-5_8"},{"key":"5_CR10","unstructured":"Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. In: Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing, p. 175 (1984)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Bartusek, J., Coladangelo, A., Khurana, D., Ma, F.: On the round complexity of secure quantum computation. In: Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021. LNCS, Part\u00a0I, vol. 12825, pp. 406\u2013435. Springer, Heidelberg (2021)","DOI":"10.1007\/978-3-030-84242-0_15"},{"key":"5_CR12","unstructured":"Brakerski, Z., Canetti, R., Qian, L.: On the computational hardness needed for quantum cryptography. In: Kalai, Y.T. (ed.) 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, 10\u201313 January 2023, MIT, Cambridge. LIPIcs, vol. 251, pp. 24:1\u201324:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"5_CR13","unstructured":"Broadbent, A., Lord, S.: Uncloneable quantum encryption via oracles. In: Flammia, S.T. (ed.) 15th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2020, 9\u201312 June 2020, Riga. LIPIcs, vol. 158, pp. 4:1\u20134:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Yuen, H.: Quantum garbled circuits. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, pp. 804\u2013817. Association for Computing Machinery, New York (2022)","DOI":"10.1145\/3519935.3520073"},{"key":"5_CR15","series-title":"LNCS","first-page":"150","volume-title":"TCC 2005","author":"R Canetti","year":"2005","unstructured":"Canetti, R., Halevi, S., Katz, J.: Adaptively-secure, non-interactive public-key encryption. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 150\u2013168. Springer, Heidelberg (2005)"},{"key":"5_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-44987-6_5","volume-title":"EUROCRYPT 2001","author":"C Cr\u00e9peau","year":"2001","unstructured":"Cr\u00e9peau, C., L\u00e9gar\u00e9, F., Salvail, L.: How to convert the flavor of a quantum bit commitment. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 60\u201377. Springer, Heidelberg (2001)"},{"key":"5_CR17","unstructured":"Cao, S., Xue, R.: On constructing one-way quantum state generators, and more. Cryptology ePrint Archive, Paper 2022\/1323 (2022). https:\/\/eprint.iacr.org\/2022\/1323"},{"issue":"6","key":"5_CR18","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-45539-6_21","volume-title":"EUROCRYPT 2000","author":"P Dumais","year":"2000","unstructured":"Dumais, P., Mayers, D., Salvail, L.: Perfectly concealing quantum bit commitment from any quantum one-way permutation. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 300\u2013315. Springer, Heidelberg (2000)"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31, 469\u2013472 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Farhi, E., Gosset, D., Hassidim, A., Lutomirski, A., Shor, P.W.: Quantum money from knots. In: Goldwasser, S. (ed.) ITCS 2012, pp. 276\u2013289. ACM (2012)","DOI":"10.1145\/2090236.2090260"},{"key":"5_CR22","doi-asserted-by":"crossref","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, Part II, vol. 12697, pp. 531\u2013561. Springer, Heidelberg (2021)","DOI":"10.1007\/978-3-030-77886-6_18"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Tauman\u00a0Kalai, Y.: Cryptographic assumptions: a position paper. In: Kushilevitz, E., Malkin, T. (eds.) Theory of Cryptography, pp. 505\u2013522. Springer, Heidelberg (2016)","DOI":"10.1007\/978-3-662-49096-9_21"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Herzberg, A.: On tolerant cryptographic constructions. In: Menezes, A. (ed.) Topics in Cryptology \u2013 CT-RSA 2005, pp. 172\u2013190. Springer, Heidelberg (2005)","DOI":"10.1007\/978-3-540-30574-3_13"},{"key":"5_CR25","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/11426639_6","volume-title":"EUROCRYPT 2005","author":"D Harnik","year":"2005","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)"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Hiroka, T., Morimae, T., Nishimaki, R., Yamakawa, T.: Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication. In: Tibouchi, M., Wang, H. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2021, pp. 606\u2013636. Springer, Cham (2021)","DOI":"10.1007\/978-3-030-92062-3_21"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Hhan, M., Morimae, T., Yamakawa, T.: From the hardness of detecting superpositions to cryptography: quantum public key encryption and commitments. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2023, pp. 639\u2013667. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-30545-0_22"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Ji, Z., Liu, Y.-K., Song, F.: Pseudorandom quantum states. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, Part III, vol. 10993, pp. 126\u2013152. Springer, Heidelberg (2018)","DOI":"10.1007\/978-3-319-96878-0_5"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Jain, A., Manohar, N., Sahai, A.: Combiners for functional encryption, unconditionally. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, Part I, vol. 12105, pp. 141\u2013168. Springer, Heidelberg (2020)","DOI":"10.1007\/978-3-030-45721-1_6"},{"key":"5_CR30","unstructured":"Kane, D.M.: Quantum money from modular forms. arXiv preprint arXiv:1809.05925 (2018)"},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Kitagawa, F., Nishimaki, R., Tanaka, K., Yamakawa, T.: Adaptively secure and succinct functional encryption: improving security and efficiency, simultaneously. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, Part III, vol. 11694, pp. 521\u2013551. Springer, Heidelberg (2019)","DOI":"10.1007\/978-3-030-26954-8_17"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Kretschmer, W., Qian, L., Sinha, M., Tal, A.: Quantum cryptography in algorithmica. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, pp. 1589\u20131602. Association for Computing Machinery, New York (2023)","DOI":"10.1145\/3564246.3585225"},{"key":"5_CR33","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), vol. 197, pp. 2:1\u20132:20. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2021)"},{"key":"5_CR34","unstructured":"Kane, D.M., Sharif, S., Silverberg, A.: Quantum money from quaternion algebras (2022)"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Khurana, D., Tomer, K.: Commitments from quantum one-wayness (2023)","DOI":"10.1145\/3618260.3649654"},{"key":"5_CR36","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":"5_CR37","doi-asserted-by":"crossref","unstructured":"Levin, L.A.: One-way functions and pseudorandom generators. In: 17th ACM STOC, pp. 363\u2013365. ACM Press (1985)","DOI":"10.1145\/22145.22185"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Liu, J., Montgomery, H., Zhandry, M.: Another round of breaking and making quantum money: In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2023, pp. 611\u2013638. Springer, , Cham (2023)","DOI":"10.1007\/978-3-031-30545-0_21"},{"key":"5_CR39","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":"5_CR40","unstructured":"Morimae, T., Yamakawa, T.: One-wayness in quantum cryptography. Cryptology ePrint Archive, Paper 2022\/1336 (2022). https:\/\/eprint.iacr.org\/2022\/1336"},{"key":"5_CR41","doi-asserted-by":"crossref","unstructured":"Morimae, T., Yamakawa, T.: Quantum commitments and signatures without one-way functions. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022, pp. 269\u2013295. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-15802-5_10"},{"key":"5_CR42","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) 37th ACM STOC, pp. 84\u201393. ACM Press (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"5_CR43","doi-asserted-by":"crossref","unstructured":"Waters, B., Wichs, D.: Universal amplification of KDM security: from 1-key circular to multi-key KDM. Cryptology ePrint Archive, Paper 2023\/1058 (2023). https:\/\/eprint.iacr.org\/2023\/1058","DOI":"10.1007\/978-3-031-38545-2_22"},{"key":"5_CR44","doi-asserted-by":"crossref","unstructured":"Yan, J.: General properties of quantum bit commitments (extended abstract). In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2022, pp. 628\u2013657. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-22972-5_22"},{"key":"5_CR45","doi-asserted-by":"crossref","unstructured":"Zhandry, M.: Quantum lightning never strikes the same state twice. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. Part III, volume 11478 of LNCS, pp. 408\u2013438. Springer, Heidelberg (2019)","DOI":"10.1007\/978-3-030-17659-4_14"},{"key":"5_CR46","unstructured":"Zhandry, M.: Quantum minimalism (talk) (2023). https:\/\/www.youtube.com\/watch?v=7cqnrASfjco&ab_channel=SimonsInstitute"},{"key":"5_CR47","first-page":"1097","volume":"2023","author":"M Zhandry","year":"2023","unstructured":"Zhandry, M.: Quantum money from abelian group actions. IACR Cryptol. ePrint Arch. 2023, 1097 (2023)","journal-title":"IACR Cryptol. ePrint Arch."}],"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-78017-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T00:16:17Z","timestamp":1732752977000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78017-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,28]]},"ISBN":["9783031780165","9783031780172"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78017-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,28]]},"assertion":[{"value":"28 November 2024","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":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}