{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T13:28:41Z","timestamp":1773754121255,"version":"3.50.1"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031158018","type":"print"},{"value":"9783031158025","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-15802-5_10","type":"book-chapter","created":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T16:59:52Z","timestamp":1665507592000},"page":"269-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":69,"title":["Quantum Commitments and\u00a0Signatures Without One-Way Functions"],"prefix":"10.1007","author":[{"given":"Tomoyuki","family":"Morimae","sequence":"first","affiliation":[]},{"given":"Takashi","family":"Yamakawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,12]]},"reference":[{"key":"10_CR1","first-page":"1663","volume":"2021","author":"P Ananth","year":"2021","unstructured":"Ananth, P., Qian, L., Yuen, H.: Cryptography from pseudorandom quantum states. IACR Cryptol. ePrint Arch. 2021, 1663 (2021)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"10_CR2","unstructured":"Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. In: IEEE International Conference on Computers Systems and Signal Processing, pp. 175\u2013179. IEEE (1984)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-030-90459-3_10","volume-title":"Theory of Cryptography","author":"N Bitansky","year":"2021","unstructured":"Bitansky, N., Brakerski, Z.: Classical binding for quantum commitments. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13042, pp. 273\u2013298. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_10"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-46766-1_29","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"CH Bennett","year":"1992","unstructured":"Bennett, C.H., Brassard, G., Cr\u00e9peau, C., Skubiszewska, M.-H.: Practical quantum oblivious transfer. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 351\u2013366. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_29"},{"key":"10_CR5","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. LNCS, vol. 12825, pp. 467\u2013496. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_17"},{"key":"10_CR6","unstructured":"Blum, M.: Coin flipping by telephone. In: CRYPTO 1981, volume ECE Report 82\u201304, pp. 11\u201315 (1981)"},{"key":"10_CR7","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, Part I. LNCS, vol. 11891, pp. 229\u2013250. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_10"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-030-56880-1_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"Z Brakerski","year":"2020","unstructured":"Brakerski, Z., Shmueli, O.: Scalable pseudorandom quantum states. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 417\u2013440. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_15"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions (extended abstract). In: 29th FOCS, pp. 42\u201352 (1988)","DOI":"10.1109\/SFCS.1988.21920"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-44987-6_5","volume-title":"Advances in Cryptology \u2014 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). https:\/\/doi.org\/10.1007\/3-540-44987-6_5"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-642-03356-8_24","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"I Damg\u00e5rd","year":"2009","unstructured":"Damg\u00e5rd, I., Fehr, S., Lunemann, C., Salvail, L., Schaffner, C.: Improving the security of quantum protocols via commit-and-open. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 408\u2013427. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_24"},{"issue":"6","key":"10_CR12","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":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-45539-6_21","volume-title":"Advances in Cryptology \u2014 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). https:\/\/doi.org\/10.1007\/3-540-45539-6_21"},{"key":"10_CR14","unstructured":"Doliskani, J.: Efficient quantum public-key encryption from learning with errors. arXiv:2105.12790 (2021)"},{"key":"10_CR15","unstructured":"Fang, J., Unruh, D., Yan, J., Zhou, D.: How to base security on the perfect\/statistical binding property of quantum bit commitment? Cryptology ePrint Archive: Report 2020\/621 (2020)"},{"key":"10_CR16","unstructured":"Gottesman, D., Chuang, I.L.: Quantum digital signatures. arXiv:quant-ph\/0105032 (2001)"},{"key":"10_CR17","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"},{"issue":"4","key":"10_CR18","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":"10_CR19","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography (extended abstract). In: 30th FOCS, pp. 230\u2013235 (1989)","DOI":"10.1109\/SFCS.1989.63483"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions (extended abstracts). In: 21st ACM STOC, pp. 12\u201324 (1989)","DOI":"10.1145\/73007.73009"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/0-387-34799-2_2","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 88","author":"R Impagliazzo","year":"1990","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 8\u201326. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_2"},{"key":"10_CR22","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, Part III. LNCS, vol. 10993, pp. 126\u2013152. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_5"},{"issue":"3","key":"10_CR23","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/s00145-011-9103-4","volume":"25","author":"A Kawachi","year":"2011","unstructured":"Kawachi, A., Koshiba, T., Nishimura, H., Yamakami, T.: Computational indistinguishability between quantum states and its cryptographic application. J. Cryptol. 25(3), 528\u2013555 (2011). https:\/\/doi.org\/10.1007\/s00145-011-9103-4","journal-title":"J. Cryptol."},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-10698-9_4","volume-title":"Theory of Quantum Computation, Communication, and Cryptography","author":"T Koshiba","year":"2009","unstructured":"Koshiba, T., Odaira, T.: Statistically-hiding quantum bit commitment from approximable-preimage-size quantum one-way function. In: Childs, A., Mosca, M. (eds.) TQC 2009. LNCS, vol. 5906, pp. 33\u201346. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10698-9_4"},{"key":"10_CR25","unstructured":"Koshiba, T., Odaira, T.: Non-interactive statistically-hiding quantum bit commitment from any quantum one-way function. arXiv:1102.3441 (2011)"},{"key":"10_CR26","unstructured":"Kretschmer, W.: Quantum pseudorandomness and classical complexity. In: TQC 2021 (2021)"},{"key":"10_CR27","doi-asserted-by":"publisher","first-page":"3410","DOI":"10.1103\/PhysRevLett.78.3410","volume":"78","author":"H-K Lo","year":"1997","unstructured":"Lo, H.-K., Chau, H.F.: Is quantum bit commitment really possible? Phys. Rev. Lett. 78, 3410\u20133413 (1997)","journal-title":"Phys. Rev. Lett."},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Luby, M., Rackoff, C.: Pseudo-random permutation generators and cryptographic composition. In: 18th ACM STOC, pp. 356\u2013363 (1986)","DOI":"10.1145\/12130.12167"},{"key":"10_CR29","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":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/0-387-34805-0_21","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"RC Merkle","year":"1990","unstructured":"Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 218\u2013238. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_21"},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41"},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Mayers, D., Salvail, L.: Quantum oblivious transfer is secure against all individual measurements. In: Proceedings Workshop on Physics and Computation, PhysComp 1994, pp. 69\u201377. IEEE (1994)","DOI":"10.1109\/PHYCMP.1994.363696"},{"issue":"2","key":"10_CR33","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). https:\/\/doi.org\/10.1007\/BF00196774","journal-title":"J. Cryptol."},{"key":"10_CR34","doi-asserted-by":"publisher","first-page":"012304","DOI":"10.1103\/PhysRevA.67.012304","volume":"67","author":"A Nayak","year":"2003","unstructured":"Nayak, A., Shor, P.: Bit-commitment-based quantum coin flipping. Phys. Rev. A 67, 012304 (2003)","journal-title":"Phys. Rev. A"},{"key":"10_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-662-53890-6_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"D Unruh","year":"2016","unstructured":"Unruh, D.: Collapse-binding quantum commitments without random oracles. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016, Part II. LNCS, vol. 10032, pp. 166\u2013195. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_6"},{"key":"10_CR36","unstructured":"Yan, J.: General properties of quantum bit commitments. Cryptology ePrint Archive: Report 2020\/1488 (2020)"},{"key":"10_CR37","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Security of quantum protocols against coherent measurements. In: 27th ACM STOC, pp. 67\u201375 (1995)","DOI":"10.1145\/225058.225085"},{"key":"10_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-662-48971-0_47","volume-title":"Algorithms and Computation","author":"J Yan","year":"2015","unstructured":"Yan, J., Weng, J., Lin, D., Quan, Y.: Quantum bit commitment with application in quantum zero-knowledge proof (extended abstract). In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 555\u2013565. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48971-0_47"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15802-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:06:32Z","timestamp":1760133992000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15802-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031158018","9783031158025"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15802-5_10","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":"12 October 2022","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}