{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T09:59:47Z","timestamp":1786960787670,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031305443","type":"print"},{"value":"9783031305450","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-30545-0_6","type":"book-chapter","created":{"date-parts":[[2023,4,15]],"date-time":"2023-04-15T10:02:10Z","timestamp":1681552930000},"page":"144-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Black-Box Separations for\u00a0Non-interactive Classical Commitments in\u00a0a\u00a0Quantum World"],"prefix":"10.1007","author":[{"given":"Kai-Min","family":"Chung","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yao-Ting","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammad","family":"Mahmoody","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,4,16]]},"reference":[{"key":"6_CR1","unstructured":"Aaronson, S., Ambainis, A.: The need for structure in quantum speedups. arXiv preprint arXiv:0911.0996 (2009)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-031-15979-4_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2022","author":"P Austrin","year":"2022","unstructured":"Austrin, P., Chung, H., Chung, K.M., Fu, S., Lin, Y.T., Mahmoody, M.: On the impossibility of key agreements from quantum random oracles. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13508, pp. 165\u2013194. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_6"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-030-64381-2_6","volume-title":"Theory of Cryptography","author":"G Alagic","year":"2020","unstructured":"Alagic, G., Childs, A.M., Grilo, A.B., Hung, S.-H.: Non-interactive classical verification of quantum computation. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12552, pp. 153\u2013180. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_6"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-031-15802-5_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2022","author":"P Ananth","year":"2022","unstructured":"Ananth, P., Qian, L., Yuen, H.: Cryptography from pseudorandom quantum states. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13507, pp. 208\u2013236. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_8"},{"key":"6_CR5","unstructured":"Bartusek, J.: Secure quantum computation with classical communication. Cryptology ePrint Archive, Report 2021\/964 (2021). https:\/\/ia.cr\/2021\/964"},{"key":"6_CR6","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"},{"issue":"5","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"CH Bennett","year":"1997","unstructured":"Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM J. Comput. 26(5), 1510\u20131523 (1997)","journal-title":"SIAM J. Comput."},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-42033-7_16","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"P Baecher","year":"2013","unstructured":"Baecher, P., Brzuska, C., Fischlin, M.: Notions of black-box reductions, revisited. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8269, pp. 296\u2013315. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42033-7_16"},{"key":"6_CR9","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":"6_CR10","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":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-25385-0_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Dagdelen, \u00d6., Fischlin, M., Lehmann, A., Schaffner, C., Zhandry, M.: Random oracles in a quantum world. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 41\u201369. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_3"},{"key":"6_CR12","unstructured":"Brakerski, Z., Koppula, V., Vazirani, U., Vidick, T.: Simpler proofs of quantumness. arXiv preprint arXiv:2005.04826 (2020)"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-03356-8_22","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"B Barak","year":"2009","unstructured":"Barak, B., Mahmoody-Ghidary, M.: Merkle puzzles are optimal \u2014 An $$O(n^2)$$-query attack on any key exchange from a random oracle. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 374\u2013390. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_22"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-540-45146-4_18","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"B Barak","year":"2003","unstructured":"Barak, B., Ong, S.J., Vadhan, S.: Derandomization in cryptography. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 299\u2013315. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_18"},{"key":"6_CR15","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. LNCS, vol. 12171, pp. 417\u2013440. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_15"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-030-64381-2_7","volume-title":"Theory of Cryptography","author":"N-H Chia","year":"2020","unstructured":"Chia, N.-H., Chung, K.-M., Yamakawa, T.: Classical verification of quantum computations with efficient verifier. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12552, pp. 181\u2013206. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_7"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-540-24638-1_21","volume-title":"Theory of Cryptography","author":"C Cr\u00e9peau","year":"2004","unstructured":"Cr\u00e9peau, C., Dumais, P., Mayers, D., Salvail, L.: Computational collapse of quantum state with application to oblivious transfer. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 374\u2013393. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_21"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Chung, K.M., Guo, S., Liu, Q., Qian, L.: Tight quantum time-space tradeoffs for function inversion. In: 61st Annual Symposium on Foundations of Computer Science, Durham, NC, USA, 16\u201319 November 2020, pp. 673\u2013684. IEEE Computer Society Press (2020)","DOI":"10.1109\/FOCS46700.2020.00068"},{"key":"6_CR19","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":"6_CR20","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.tcs.2020.11.013","volume":"855","author":"S Cao","year":"2021","unstructured":"Cao, S., Xue, R.: Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives. Theor. Comput. Sci. 855, 16\u201342 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR21","unstructured":"Dupuis, F., Lamontagne, P., Salvail, L.: Fiat-shamir for proofs lacks a proof even in the presence of shared entanglement. Cryptology ePrint Archive, Report 2022\/435 (2022). https:\/\/eprint.iacr.org\/2022\/435"},{"key":"6_CR22","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"},{"issue":"3","key":"6_CR23","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1137\/0149053","volume":"49","author":"DL Donoho","year":"1989","unstructured":"Donoho, D.L., Stark, P.B.: Uncertainty principles and signal recovery. SIAM J. Appl. Math. 49(3), 906\u2013931 (1989)","journal-title":"SIAM J. Appl. Math."},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: 21st Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, 15\u201317 May 1989, pp. 25\u201332. ACM Press (1989)","DOI":"10.1145\/73007.73010"},{"key":"6_CR25","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":"6_CR26","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Trevisan, L.: Lower bounds on the efficiency of generic cryptographic constructions. In: 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, USA, 12\u201314 November 2000, pp. 305\u2013313. IEEE Computer Society Press (2000)","DOI":"10.1109\/SFCS.2000.892119"},{"issue":"4","key":"6_CR27","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":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/978-3-030-34578-5_21","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"M Hhan","year":"2019","unstructured":"Hhan, M., Xagawa, K., Yamakawa, T.: Quantum random oracle model with auxiliary input. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 584\u2013614. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_21"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-64837-4_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"A Hosoyamada","year":"2020","unstructured":"Hosoyamada, A., Yamakawa, T.: Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 3\u201332. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_1"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography (extended abstract). In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, NC, USA, 30 October\u20131 November 1989, pp. 230\u2013235. IEEE Computer Society Press (1989)","DOI":"10.1109\/SFCS.1989.63483"},{"key":"6_CR31","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":"6_CR32","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":"6_CR33","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":"6_CR34","unstructured":"Koshiba,T., Odaira, T.: Non-interactive statistically-hiding quantum bit commitment from any quantum one-way function. arXiv preprint arXiv:1102.3441 (2011)"},{"key":"6_CR35","unstructured":"Kretschmer, W.: Quantum pseudorandomness and classical complexity. arXiv preprint arXiv:2103.09320 (2021)"},{"issue":"17","key":"6_CR36","doi-asserted-by":"publisher","first-page":"3410","DOI":"10.1103\/PhysRevLett.78.3410","volume":"78","author":"Hoi-Kwong Lo and Hoi Fung Chau","year":"1997","unstructured":"Hoi-Kwong Lo and Hoi Fung Chau: Is quantum bit commitment really possible? Phys. Rev. Lett. 78(17), 3410 (1997)","journal-title":"Phys. Rev. Lett."},{"key":"6_CR37","unstructured":"Lin, D., Quan, Y., Weng, J., Yan, J.: Quantum bit commitment with application in quantum zero-knowledge proof. Cryptology ePrint Archive, Report 2014\/791 (2014). https:\/\/eprint.iacr.org\/2014\/791"},{"key":"6_CR38","unstructured":"Lombardi, A., Schaeffer, L.: A note on key agreement and non-interactive commitments. Cryptology ePrint Archive, Report 2019\/279 (2019). https:\/\/eprint.iacr.org\/2019\/279"},{"key":"6_CR39","doi-asserted-by":"crossref","unstructured":"Mahadev, U.: Classical verification of quantum computations. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 259\u2013267. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00033"},{"issue":"17","key":"6_CR40","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(17), 3414 (1997)","journal-title":"Phys. Rev. Lett."},{"key":"6_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/978-3-642-19571-6_36","volume-title":"Theory of Cryptography","author":"T Matsuda","year":"2011","unstructured":"Matsuda, T., Matsuura, K.: On black-box separations among injective one-way functions. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 597\u2013614. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_36"},{"key":"6_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-642-32009-5_41","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"M Mahmoody","year":"2012","unstructured":"Mahmoody, M., Pass, R.: The curious case of non-interactive commitments \u2013 on the power of black-box vs. non-black-box use of primitives. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 701\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_41"},{"key":"6_CR43","doi-asserted-by":"crossref","unstructured":"Morimae, T., Yamakawa, T.: Quantum commitments without one-way functions. In: International Cryptology Conference CRYPTO (2022)","DOI":"10.1007\/978-3-031-15802-5_10"},{"issue":"11\u201312","key":"6_CR44","first-page":"901","volume":"15","author":"A Nayebi","year":"2015","unstructured":"Nayebi, A., Aaronson, S., Belovs, A., Trevisan, L.: Quantum lower bound for inverting a permutation with advice. Quant. Inf. Comput. 15(11\u201312), 901\u2013913 (2015)","journal-title":"Quant. Inf. Comput."},{"key":"6_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/0-387-34805-0_13","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"M Naor","year":"1990","unstructured":"Naor, M.: Bit commitment using pseudo-randomness. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 128\u2013136. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_13"},{"key":"6_CR46","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2010","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2010)"},{"issue":"2","key":"6_CR47","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","volume":"49","author":"N Nisan","year":"1994","unstructured":"Nisan, N., Wigderson, A.: Hardness vs randomness. J. Comput. Syst. Sci. 49(2), 149\u2013167 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24638-1_1","volume-title":"Theory of Cryptography","author":"O Reingold","year":"2004","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.: Notions of reducibility between cryptographic primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 1\u201320. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_1"},{"key":"6_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-29011-4_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Unruh","year":"2012","unstructured":"Unruh, D.: Quantum proofs of knowledge. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 135\u2013152. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_10"},{"key":"6_CR50","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. LNCS, vol. 10032, pp. 166\u2013195. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_6"},{"key":"6_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-662-49896-5_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"D Unruh","year":"2016","unstructured":"Unruh, D.: Computationally binding quantum commitments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 497\u2013527. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_18"},{"issue":"2","key":"6_CR52","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1090\/bull\/1715","volume":"58","author":"A Wigderson","year":"2021","unstructured":"Wigderson, A., Wigderson, Y.: The uncertainty principle: variations on a theme. Bull. Am. Math. Soc. 58(2), 225\u2013261 (2021)","journal-title":"Bull. Am. Math. Soc."},{"key":"6_CR53","unstructured":"Yan, J.: General properties of quantum bit commitments. Cryptology ePrint Archive, Paper 2020\/1488 (2020). https:\/\/eprint.iacr.org\/2020\/1488"},{"key":"6_CR54","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Theory and applications of trapdoor functions (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, pages 80\u201391, Chicago, Illinois, 3\u20135 November 1982. IEEE Computer Society Press (1982)","DOI":"10.1109\/SFCS.1982.45"},{"key":"6_CR55","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"},{"key":"6_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-030-26951-7_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"M Zhandry","year":"2019","unstructured":"Zhandry, M.: How to record quantum queries, and applications to quantum indifferentiability. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 239\u2013268. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_9"},{"key":"6_CR57","doi-asserted-by":"crossref","unstructured":"Zhang, J.: Succinct blind quantum computation using a random oracle. In STOC 2021: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, 21\u201325 June 2021, pp. 1370\u20131383 (2021)","DOI":"10.1145\/3406325.3451082"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30545-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:04:12Z","timestamp":1744754652000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30545-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031305443","9783031305450"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30545-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"16 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","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":"eurocrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"415","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":"109","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":"26% - 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","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":"16","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)"}}]}}