{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T01:04:36Z","timestamp":1765933476164,"version":"3.48.0"},"publisher-location":"Singapore","reference-count":33,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819987290"},{"type":"electronic","value":"9789819987306"}],"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-981-99-8730-6_11","type":"book-chapter","created":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T07:02:04Z","timestamp":1702796524000},"page":"339-368","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On the\u00a0(Im)possibility of\u00a0Time-Lock Puzzles in\u00a0the\u00a0Quantum Random Oracle Model"],"prefix":"10.1007","author":[{"given":"Abtin","family":"Afshar","sequence":"first","affiliation":[]},{"given":"Kai-Min","family":"Chung","sequence":"additional","affiliation":[]},{"given":"Yao-Ching","family":"Hsieh","sequence":"additional","affiliation":[]},{"given":"Yao-Ting","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Mohammad","family":"Mahmoody","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,18]]},"reference":[{"key":"11_CR1","unstructured":"Scott Aaronson and Andris Ambainis. The need for structure in quantum speedups, 2014"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Per Austrin, Hao Chung, Kai-Min Chung, Shiuan Fu, Yao-Ting Lin, and Mohammad Mahmoody. On the impossibility of key agreements from quantum random oracles. In Advances in Cryptology-CRYPTO 2022: 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15\u201318, 2022, Proceedings, Part II, pages 165\u2013194. Springer, 2022","DOI":"10.1007\/978-3-031-15979-4_6"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Andris Ambainis, Mike Hamburg, and Dominique Unruh. Quantum security proofs using semi-classical oracles. In Advances in Cryptology-CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2019, Proceedings, Part II 39, pages 269\u2013295. Springer, 2019","DOI":"10.1007\/978-3-030-26951-7_10"},{"key":"11_CR4","unstructured":"Prabhanjan Ananth, Zihan Hu, and Henry Yuen. On the (im)plausibility of public-key quantum money from collision-resistant hash functions. Cryptology ePrint Archive, Paper 2023\/069, 2023. https:\/\/eprint.iacr.org\/2023\/069"},{"key":"11_CR5","unstructured":"Prabhanjan Ananth and Fatih Kaleoglu. A note on copy-protection from random oracles. arXiv preprint arXiv:2208.12884, 2022"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Dan Boneh, Joseph Bonneau, Benedikt B\u00fcnz, and Ben Fisch. Verifiable delay functions. In Advances in Cryptology-CRYPTO 2018: 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19\u201323, 2018, Proceedings, Part I, pages 757\u2013788. Springer, 2018","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Charles H Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani. Strengths and weaknesses of quantum computing. SIAM journal on Computing, 26(5), 1510\u20131523, 1997","DOI":"10.1137\/S0097539796300933"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Dan Boneh, \u00d6zg\u00fcr Dagdelen, Marc Fischlin, Anja Lehmann, Christian Schaffner, and Mark Zhandry. Random oracles in a quantum world. In Dong Hoon Lee and Xiaoyun Wang, editors, Advances in Cryptology - ASIACRYPT 2011, volume 7073 of Lecture Notes in Computer Science, pages 41\u201369. Springer, Heidelberg, December 2011","DOI":"10.1007\/978-3-642-25385-0_3"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Manuel Blum and Russell Impagliazzo. Generic oracles and oracle classes. In 28th Annual Symposium on Foundations of Computer Science (sfcs 1987), pages 118\u2013126. IEEE, 1987","DOI":"10.1109\/SFCS.1987.30"},{"key":"11_CR10","unstructured":"Jeremiah Blocki, Seunghoon Lee, and Samson Zhou. On the security of proofs of sequential work in a post-quantum world. In 2nd Conference on Information-Theoretic Cryptography, page 1, 2021"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-44598-6_15","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"D Boneh","year":"2000","unstructured":"Boneh, D., Naor, M.: Timed commitments. In: Bellare, M. (ed.) Advances in Cryptology - CRYPTO 2000. Lecture Notes in Computer Science, vol. 1880, pp. 236\u2013254. Springer, Heidelberg (2000)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Mihir Bellare and Phillip Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Dorothy E. Denning, Raymond Pyle, Ravi Ganesan, Ravi S. Sandhu, and Victoria Ashby, editors, ACM CCS 93: 1st Conference on Computer and Communications Security, pages 62\u201373. ACM Press, November 1993","DOI":"10.1145\/168588.168596"},{"key":"11_CR13","series-title":"Part II, volume 12697 of Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-030-77886-6_21","volume-title":"Advances in Cryptology - EUROCRYPT 2021","author":"K-M Chung","year":"2021","unstructured":"Chung, K.-M., Fehr, S., Huang, Y.-H., Liao, T.-N.: On the compressed-oracle technique, and post-quantum security of proofs of sequential work. In: Canteaut, A., Standaert, F.-X. (eds.) Advances in Cryptology - EUROCRYPT 2021. Part II, volume 12697 of Lecture Notes in Computer Science, pp. 598\u2013629. Springer, Heidelberg (2021)"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Bram Cohen and Krzysztof Pietrzak. Simple proofs of sequential work. In Jesper Buus Nielsen and Vincent Rijmen, editors, Advances in Cryptology - EUROCRYPT 2018, Part II, volume 10821 of Lecture Notes in Computer Science, pages 451\u2013467. Springer, Heidelberg, April \/ May 2018","DOI":"10.1007\/978-3-319-78375-8_15"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"O. Goldreich and L. A. Levin. A hard-core predicate for all one-way functions. In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, STOC \u201989, page 25\u201332, New York, NY, USA, 1989. Association for Computing Machinery","DOI":"10.1145\/73007.73010"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Juris Hartmanis and Lane A. Hemaspaandra. One-way functions, robustness, and the non-isomorphism of np-complete sets. In Symposium on Computation Theory, 1987","DOI":"10.1109\/PSCT.1987.10319267"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Iftach Haitner, Noam Mazor, Jad Silbak, and Eliad Tsfadia. On the complexity of two-party differential privacy. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pages 1392\u20131405, 2022","DOI":"10.1145\/3519935.3519982"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Akinori Hosoyamada and Takashi Yamakawa. Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness. In Advances in Cryptology-ASIACRYPT 2020: 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7\u201311, 2020, Proceedings, Part I 26, pages 3\u201332. Springer, 2020","DOI":"10.1007\/978-3-030-64837-4_1"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Samuel Jaques, Hart Montgomery, Razvan Rosie, and Arnab Roy. Time-release cryptography from minimal circuit assumptions. In Progress in Cryptology-INDOCRYPT 2021: 22nd International Conference on Cryptology in India, Jaipur, India, December 12\u201315, 2021, Proceedings 22, pages 584\u2013606. Springer, 2021","DOI":"10.1007\/978-3-030-92518-5_26"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Huijia Lin, Rafael Pass, and Pratik Soni. Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles. In Chris Umans, editor, 58th Annual Symposium on Foundations of Computer Science, pages 576\u2013587. IEEE Computer Society Press, October 2017","DOI":"10.1109\/FOCS.2017.59"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Arjen K Lenstra and Benjamin Wesolowski. Trustworthy public randomness with sloth, unicorn, and trx. International Journal of Applied Cryptography, 3(4), 330\u2013343, 2017","DOI":"10.1504\/IJACT.2017.089354"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-22792-9_3","volume-title":"Advances in Cryptology - CRYPTO 2011","author":"M Mahmoody","year":"2011","unstructured":"Mahmoody, M., Moran, T., Vadhan, S.P.: Time-lock puzzles in the random oracle model. In: Rogaway, P. (ed.) Advances in Cryptology - CRYPTO 2011. Lecture Notes in Computer Science, vol. 6841, pp. 39\u201350. Springer, Heidelberg (2011)"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Mohammad Mahmoody, Tal Moran, and Salil P. Vadhan. Publicly verifiable proofs of sequential work. In Robert D. Kleinberg, editor, ITCS 2013: 4th Innovations in Theoretical Computer Science, pages 373\u2013388. Association for Computing Machinery, January 2013","DOI":"10.1145\/2422436.2422479"},{"key":"11_CR24","unstructured":"Mohammad Mahmoody, Caleb Smith, and David J. Wu. Can verifiable delay functions be based on random oracles? In Artur Czumaj, Anuj Dawar, and Emanuela Merelli, editors, ICALP 2020: 47th International Colloquium on Automata, Languages and Programming, volume 168 of LIPIcs, pages 83:1\u201383:17. Schloss Dagstuhl, July 2020"},{"key":"11_CR25","unstructured":"Michael A Nielsen and Isaac L Chuang. Quantum computation and quantum information. Cambridge University Press, 2010"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Noam Nisan. Crew prams and decision trees. In Proceedings of the twenty-first annual ACM symposium on Theory of computing, pages 327\u2013335, 1989","DOI":"10.1145\/73007.73038"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Ryan O\u2019Donnell, Michael Saks, Oded Schramm, and Rocco A Servedio. Every decision tree has an influential variable. In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201905), pages 31\u201339. IEEE, 2005","DOI":"10.1109\/SFCS.2005.34"},{"key":"11_CR28","unstructured":"Krzysztof Pietrzak. Simple verifiable delay functions. In Avrim Blum, editor, ITCS 2019: 10th Innovations in Theoretical Computer Science Conference, volume 124, pages 60:1\u201360:15. LIPIcs, January 2019"},{"key":"11_CR29","unstructured":"Ronald L Rivest, Adi Shamir, and David A Wagner. Time-lock puzzles and timed-release crypto. Massachusetts Institute of Technology. Laboratory for Computer Science, 1996"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"G\u00e1bor Tardos. Query complexity, or why is it difficult to separate $${\\sf NP}^{A}\\cap {\\sf coNP}^{A}$$ from $${\\sf P}^{A}$$ by random oracles $${A}$$? Combinatorica, 9:385\u2013392, 1989","DOI":"10.1007\/BF02125350"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-55220-5_8","volume-title":"Advances in Cryptology - EUROCRYPT 2014","author":"D Unruh","year":"2014","unstructured":"Unruh, D.: Revocable quantum timed-release encryption. In: Nguyen, P.Q., Oswald, E. (eds.) Advances in Cryptology - EUROCRYPT 2014. Lecture Notes in Computer Science, vol. 8441, pp. 129\u2013146. Springer, Heidelberg (2014)"},{"key":"11_CR32","series-title":"Part III, volume 11478 of Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-030-17659-4_13","volume-title":"Advances in Cryptology - EUROCRYPT 2019","author":"B Wesolowski","year":"2019","unstructured":"Wesolowski, B.: Efficient verifiable delay functions. In: Ishai, Y., Rijmen, V. (eds.) Advances in Cryptology - EUROCRYPT 2019. Part III, volume 11478 of Lecture Notes in Computer Science, pp. 379\u2013407. Springer, Heidelberg (2019)"},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"Mark Zhandry. Secure identity-based encryption in the quantum random oracle model. In 32nd Annual International Cryptology Conference, CRYPTO 2012, pages 758\u2013775, 2012","DOI":"10.1007\/978-3-642-32009-5_44"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8730-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T01:02:53Z","timestamp":1765933373000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8730-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819987290","9789819987306"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8730-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.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":"375","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":"106","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":"28% - 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":"12","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}