{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:47:31Z","timestamp":1764175651939,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"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_2","type":"book-chapter","created":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T09:02:27Z","timestamp":1723885347000},"page":"38-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Unconditionally Secure Quantum Commitments with\u00a0Preprocessing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1112-8822","authenticated-orcid":false,"given":"Luowen","family":"Qian","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,18]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Ananth, P., Qian, L., Yuen, H.: Cryptography from Pseudorandom Quantum States. In: Advances in Cryptology - CRYPTO 2022, pp. 208\u2013236 (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_8, (cit. on pp. 1, 15, 19)","DOI":"10.1007\/978-3-031-15802-5_8"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Bartusek, J., Coladangelo, A., Khurana, D., Ma, F.: One-way functions imply secure computation in a quantum world. In: Advances in Cryptology - CRYPTO 2021, pp. 467\u2013496 (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_17, (cit. on pp. 5, 6, 17, 19, 20)","DOI":"10.1007\/978-3-030-84242-0_17"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Canetti, R., Qian, L.: On the computational hardness needed for quantum cryptography. In: 14th Innovations in Theoretical Computer Science Conference (ITCS 2023). Vol. 251, pp. 24:1\u201324:21 (2023). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2023.24, (cit. on pp. 1, 2, 4, 15)","DOI":"10.4230\/LIPIcs.ITCS.2023.24"},{"key":"2_CR4","unstructured":"Bostanci, J., Efron, Y., Metger, T., Poremba, A., Qian, L., Yuen, H.: Unitary Complexity and the Uhlmann Transformation Problem (2023). arXiv: 2306.13073, (cit. on p. 1)"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 103\u2013112 (1988). https:\/\/doi.org\/10.1145\/62212.62222, (cit. on p. 8)","DOI":"10.1145\/62212.62222"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Bartusek, J., Khurana, D.: Cryptography with certified deletion. In: Advances in Cryptology - CRYPTO 2023, pp. 192\u2013223 (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_7, (cit. on p. 5)","DOI":"10.1007\/978-3-031-38554-4_7"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Brakerski, Z.: Black-Hole Radiation Decoding Is Quantum Cryptography. In: Advances in Cryptology - CRYPTO 2023, pp. 37\u201365 (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_2, (cit. on p. 1)","DOI":"10.1007\/978-3-031-38554-4_2"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Chung, K.-M., Guo, S., Liu, Q., Qian, L.: Tight quantum time-space tradeoffs for function inversion. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 673\u2013684 (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00068, (cit. on pp. 6, 20)","DOI":"10.1109\/FOCS46700.2020.00068"},{"key":"2_CR9","unstructured":"Chung, K.-M., Guo, S., Liu, Q., Qian, L.: Tight Quantum Time-Space Tradeoffs for Function Inversion (2020). arXiv: 2006.05650v2, (cit. on p. 21)"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Chailloux, A., Kerenidis, I., Rosgen, B.: Quantum commitments from complexity assumptions. In: Computational Complexity, vol. 25, no. 1, pp. 103\u2013151 (2016). https:\/\/doi.org\/10.1007\/s00037-015-0116-5, (cit. on pp. 2, 7)","DOI":"10.1007\/s00037-015-0116-5"},{"key":"2_CR11","unstructured":"Colbeck, R.: Quantum And Relativistic Protocols For Secure Multi-Party Computation. PhD thesis. Trinity College, University of Cambridge (2006). arXiv: 0911.3814 (cit. on p. 4)"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"De, A., Trevisan, L., Tulsiani, M.: Time space tradeoffs for attacks against one-way functions and PRGs. In: Advances in Cryptology - CRYPTO 2010, pp. 649\u2013665 (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_35, (cit. on p. 5)","DOI":"10.1007\/978-3-642-14623-7_35"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Fang, J., Unruh, D., Yan, J., Zhou, D.: How to base security on the perfect\/statistical binding property of quantum bit commitment?\u201d In: 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Vol. 248, pp. 26:1\u201326:12 (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2022.26, (cit. on pp. 16, 17)","DOI":"10.4230\/LIPIcs.ISAAC.2022.26"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Krawczyk, H.: Sparse pseudorandom distributions. In: Random Structures & Algorithms, vol. 3, no. 2, pp. 163\u2013174 (1992). https:\/\/doi.org\/10.1002\/rsa.3240030206, (cit. on pp. 5, 6)","DOI":"10.1002\/rsa.3240030206"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Goldreich, O.: A note on computational indistinguishability. In: Information Processing Letters, vol. 34, no. 6, pp. 277\u2013281 (1990). https:\/\/doi.org\/10.1016\/0020-0190(90)90010-U, (cit. on p. 1)","DOI":"10.1016\/0020-0190(90)90010-U"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Guan, J., Zhandary, M.: Simple Schemes in the Bounded Storage Model. In: Advances in Cryptology - EUROCRYPT 2019, pp. 500\u2013524 (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_17, (cit. on p. 8)","DOI":"10.1007\/978-3-030-17659-4_17"},{"key":"2_CR17","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1109\/SFCS.1989.63483, (cit. on pp. 1, 3)","DOI":"10.1109\/SFCS.1989.63483"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Kent, A.: Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes. In: Physical Review Letters, vol. 109, pp. 130501 (2012). https:\/\/doi.org\/10.1103\/PhysRevLett.109.130501, (cit. on p. 4)","DOI":"10.1103\/PhysRevLett.109.130501"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Kent, A.: Unconditionally Secure Bit Commitment. In: Physical Review Letters, vol. 83, pp. 1447\u20131450 (1999). https:\/\/doi.org\/10.1103\/PhysRevLett.83.1447, (cit. on p. 4)","DOI":"10.1103\/PhysRevLett.83.1447"},{"key":"2_CR20","doi-asserted-by":"publisher","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, pp. 1589\u20131602 (2023). https:\/\/doi.org\/10.1145\/3564246.3585225, (cit. on p. 1)","DOI":"10.1145\/3564246.3585225"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Kretschmer, W.: Quantum pseudorandomness and classical complexity. In: 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021), Vol. 197, pp. 2:1\u20132:20 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.TQC.2021.2, (cit. on p. 1)","DOI":"10.4230\/LIPIcs.TQC.2021.2"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Lo, H.-K., Chau, H.F.: Is quantum bit commitment really possible? In: Physical Review Letters, vol. 78, pp. 3410\u20133413 (1997). https:\/\/doi.org\/10.1103\/PhysRevLett.78.3410, (cit. on p. 1)","DOI":"10.1103\/PhysRevLett.78.3410"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Liu, Q.: Non-uniformity and quantum advice in the quantum random oracle model. In: Advances in Cryptology - EUROCRYPT 2023, pp. 117\u2013143 (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_5, (cit. on pp. 6, 20, 21)","DOI":"10.1007\/978-3-031-30545-0_5"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Lloyd, S.: Ultimate physical limits to computation. In: Nature, vol. 406, no. 6799, pp. 1047\u20131054 (2000). https:\/\/doi.org\/10.1038\/35023282, (cit. on p. 4)","DOI":"10.1038\/35023282"},{"key":"2_CR25","unstructured":"Lombardi, A., Ma, F., Wright, J.: A one-query lower bound for unitary synthesis and breaking quantum cryptography (2023). arXiv: 2310.08870 (cit. on pp. 1, 5)"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Mayers, D.: Unconditionally Secure Quantum Bit Commitment is Impossible. In: Physical Review Letters, vol. 78, pp. 3414\u20133417 (1997). https:\/\/doi.org\/10.1103\/PhysRevLett.78.3414, (cit. on p. 1)","DOI":"10.1103\/PhysRevLett.78.3414"},{"key":"2_CR27","unstructured":"Morimae, T., Nehoran, B., Yamakawa, T.: Unconditionally Secure Commitments with Quantum Auxiliary Inputs (manuscript) (2023) (cit. on pp. 5, 6, 11)"},{"key":"2_CR28","doi-asserted-by":"publisher","unstructured":"Morimae, T., Yamakawa, T.: Quantum commitments and signatures without one-way functions. In: Advances in Cryptology - CRYPTO 2022, pp. 269\u2013295 (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_10, (cit. on pp. 1, 17)","DOI":"10.1007\/978-3-031-15802-5_10"},{"key":"2_CR29","doi-asserted-by":"publisher","unstructured":"Naor, M.: Bit commitment using pseudorandomness. In: Journal of Cryptology, vol. 4, no. 2, pp. 151\u2013158 (1991). https:\/\/doi.org\/10.1007\/BF00196774, (cit. on p. 8)","DOI":"10.1007\/BF00196774"},{"key":"2_CR30","doi-asserted-by":"publisher","unstructured":"Nehoran, B., Zhandry, M.: A computational separation between quantum no-cloning and no-telegraphing. In: 15th Innovations in Theoretical Computer Science Conference (ITCS 2024), Vol. 287, pp. 82:1\u201382:23 (2024). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2024.82, (cit. on p. 5)","DOI":"10.4230\/LIPIcs.ITCS.2024.82"},{"key":"2_CR31","doi-asserted-by":"publisher","unstructured":"Ostrovsky, R., Wigderson, A.: One-way functions are essential for non-trivial zero-knowledge. In: The 2nd Israel Symposium on Theory and Computing Systems, pp. 3\u201317 (1993). https:\/\/doi.org\/10.1109\/ISTCS.1993.253489, (cit. on pp. 1, 2)","DOI":"10.1109\/ISTCS.1993.253489"},{"key":"2_CR32","doi-asserted-by":"publisher","unstructured":"Pass, R., Shelat, A.: Unconditional characterizations of non-interactive zero-knowledge. In: Advances in Cryptology - CRYPTO 2005, pp. 118\u2013134 (2005). https:\/\/doi.org\/10.1007\/11535218_8, (cit. on p. 4)","DOI":"10.1007\/11535218_8"},{"key":"2_CR33","doi-asserted-by":"publisher","unstructured":"Raz, R.: Quantum information and the PCP theorem. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201905), pp. 459\u2013468 (2005). https:\/\/doi.org\/10.1109\/SFCS.2005.62, (cit. on p. 3)","DOI":"10.1109\/SFCS.2005.62"},{"key":"2_CR34","unstructured":"Rudolph, T.: The Laws of Physics and Cryptographic Security (2002). arXiv: quant-ph\/0202143, (cit. on p. 4)"},{"key":"2_CR35","doi-asserted-by":"publisher","unstructured":"Watrous, J.: Zero-Knowledge against Quantum Attacks. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 296\u2013305 (2006). https:\/\/doi.org\/10.1145\/1132516.1132560, (cit. on p. 19)","DOI":"10.1145\/1132516.1132560"},{"key":"2_CR36","doi-asserted-by":"publisher","unstructured":"Yan, J.: General Properties of Quantum Bit Commitments (Extended Abstract). In: Advances in Cryptology - ASIACRYPT 2022, pp. 628\u2013657 (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_22, (cit. on pp. 1, 15)","DOI":"10.1007\/978-3-031-22972-5_22"},{"key":"2_CR37","doi-asserted-by":"publisher","unstructured":"Chi-Chih Yao, A.: Protocols for secure computations. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 160\u2013164 (1982). https:\/\/doi.org\/10.1109\/SFCS.1982.88, (cit. on p. 4)","DOI":"10.1109\/SFCS.1982.88"},{"key":"2_CR38","doi-asserted-by":"publisher","unstructured":"Zhandry, M.: How to Record Quantum Queries, and Applications to Quantum Indifferentiability. In: Advances in Cryptology - CRYPTO 2019, pp. 239\u2013268 (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_9, (cit. on p. 9)","DOI":"10.1007\/978-3-030-26951-7_9"}],"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_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T09:02:58Z","timestamp":1723885378000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68394-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683930","9783031683947"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68394-7_2","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"}}]}}