{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T09:18:30Z","timestamp":1766049510828,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030648367"},{"type":"electronic","value":"9783030648374"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-64837-4_1","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T16:02:55Z","timestamp":1607184175000},"page":"3-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Finding Collisions in a Quantum World: Quantum Black-Box Separation of Collision-Resistance and One-Wayness"],"prefix":"10.1007","author":[{"given":"Akinori","family":"Hosoyamada","sequence":"first","affiliation":[]},{"given":"Takashi","family":"Yamakawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson, S.: Quantum copy-protection and quantum money. In: CCC 2009, Proceedings, pp. 229\u2013242 (2009)","DOI":"10.1109\/CCC.2009.42"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-319-49175-2_3","volume-title":"Information Theoretic Security","author":"G Alagic","year":"2016","unstructured":"Alagic, G., Broadbent, A., Fefferman, B., Gagliardoni, T., Schaffner, C., St. Jules, M.: Computational security of quantum encryption. In: Nascimento, A.C.A., Barreto, P. (eds.) ICITS 2016. LNCS, vol. 10015, pp. 47\u201371. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49175-2_3"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Christiano, P.: Quantum money from hidden subspaces. In: Karloff, H.J., Pitassi, T. (eds.) 44th ACM STOC, pp. 41\u201360. ACM Press (May 2012)","DOI":"10.1145\/2213977.2213983"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-319-78372-7_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"G Alagic","year":"2018","unstructured":"Alagic, G., Gagliardoni, T., Majenz, C.: Unforgeable quantum encryption. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 489\u2013519. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_16"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th ACM STOC, pp. 99\u2013108. ACM Press (May 1996)","DOI":"10.1145\/237814.237838"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Rosmanis, A., Unruh, D.: Quantum attacks on classical proof systems: the hardness of quantum rewinding. In: 55th FOCS, pp. 474\u2013483. IEEE Computer Society Press (October 2014)","DOI":"10.1109\/FOCS.2014.57"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Asharov, G., Segev, G.: Limits on the power of indistinguishability obfuscation and functional encryption. In: Guruswami, V. (ed.) 56th FOCS, pp. 191\u2013209. IEEE Computer Society Press (October 2015)","DOI":"10.1109\/FOCS.2015.21"},{"key":"1_CR8","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, India, pp. 175\u2013179 (1984)"},{"issue":"5","key":"1_CR9","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":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-030-36030-6_17","volume-title":"Theory of Cryptography","author":"N Bitansky","year":"2019","unstructured":"Bitansky, N., Degwekar, A.: On the complexity of collision resistant hash functions: new and old black-box separations. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 422\u2013450. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_17"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/978-3-662-48000-7_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"A Broadbent","year":"2015","unstructured":"Broadbent, A., Jeffery, S.: Quantum homomorphic encryption for circuits of low T-gate complexity. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 609\u2013629. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_30"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1038\/nature23461","volume":"549","author":"DJ Bernstein","year":"2017","unstructured":"Bernstein, D.J., Lange, T.: Post-quantum cryptography. Nature 549, 188\u2013194 (2017)","journal-title":"Nature"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th ACM STOC, pp. 575\u2013584. ACM Press (June 2013)","DOI":"10.1145\/2488608.2488680"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-96878-0_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"Z Brakerski","year":"2018","unstructured":"Brakerski, Z.: Quantum FHE (almost) as secure as\u00a0classical. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 67\u201395. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_3"},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10623-015-0157-4","volume":"78","author":"A Broadbent","year":"2016","unstructured":"Broadbent, A., Schaffner, C.: Quantum cryptography beyond quantum key distribution. Des. Codes Cryptogr. 78(1), 351\u2013382 (2016)","journal-title":"Des. Codes Cryptogr."},{"key":"1_CR16","unstructured":"Chia, N.-H., Hallgren, S., Song, F.: On basing one-way permutations on NP-hard problems under quantum reductions. CoRR arxiv:1804.10309 (2018)"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Chung, K.-M., Lin, H., Mahmoody, M., Pass, R.: On the power of nonuniformity in proofs of security. In: Kleinberg, R.D. (ed.) ITCS 2013, pp. 389\u2013400. ACM (January 2013)","DOI":"10.1145\/2422436.2422480"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/978-3-642-14623-7_35","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"A De","year":"2010","unstructured":"De, A., Trevisan, L., Tulsiani, M.: Time space tradeoffs for attacks against one-way functions and PRGs. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 649\u2013665. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_35"},{"key":"1_CR19","unstructured":"Gottesman, D., Chuang, I.: Quantum digital signatures. CoRR, abs\/quant-ph\/0105032 (2001)"},{"key":"1_CR20","unstructured":"Gennaro, R., Trevisan, L.: Lower bounds on the efficiency of generic cryptographic constructions. In: 41st FOCS, pp. 305\u2013313. IEEE Computer Society Press (November 2000)"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Haitner, I., Hoch, J.J., Reingold, O., Segev, G.: Finding collisions in interactive protocols - a tight lower bound on the round complexity of statistically-hiding commitments. In: 48th FOCS, pp. 669\u2013679. IEEE Computer Society Press (October 2007)","DOI":"10.1109\/FOCS.2007.7"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Holmgren, J., Lombardi, A.: Cryptographic hashing from strong one-way functions (or: one-way product functions and their applications). In: Thorup, M. (ed.) 59th FOCS, pp. 850\u2013858. IEEE Computer Society Press (October 2018)","DOI":"10.1109\/FOCS.2018.00085"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-28628-8_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"C-Y Hsiao","year":"2004","unstructured":"Hsiao, C.-Y., Reyzin, L.: Finding collisions on a public road, or do secure hash functions need secret coins? In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 92\u2013105. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_6"},{"key":"1_CR24","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":"1_CR25","unstructured":"Hosoyamada, A., Yamakawa, T.: Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness. IACR Cryptology ePrint Archive: Report 2018\/1066 (2018)"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: 21st ACM STOC, pp. 44\u201361. ACM Press (May 1989)","DOI":"10.1145\/73007.73012"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-25405-5_2","volume-title":"Post-Quantum Cryptography","author":"D Jao","year":"2011","unstructured":"Jao, D., De Feo, L.: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 19\u201334. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_2"},{"key":"1_CR28","volume-title":"Classical and Quantum Computation","author":"AY Kitaev","year":"2002","unstructured":"Kitaev, A.Y., Shen, A., Vyalyi, M.N., Vyalyi, M.N.: Classical and Quantum Computation, vol. 47. American Mathematical Society, Calgary (2002)"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Mahadev, U.: Classical homomorphic encryption for quantum circuits. In: Thorup, M. (ed.) 59th FOCS, pp. 332\u2013338. IEEE Computer Society Press (October 2018)","DOI":"10.1109\/FOCS.2018.00039"},{"key":"1_CR30","first-page":"114","volume":"44","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep. 44, 114\u2013116 (1978)","journal-title":"DSN Prog. Rep."},{"issue":"11&12","key":"1_CR31","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. Quantum Inf. Comput. 15(11&12), 901\u2013913 (2015)","journal-title":"Quantum Inf. Comput."},{"key":"1_CR32","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th, Anniversary edn. Cambridge University Press (2010)"},{"key":"1_CR33","unstructured":"NIST: Post-quantum cryptography standardization (2016). https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In: Mitzenmacher, M. (ed.) 41st ACM STOC, pp. 333\u2013342. ACM Press, May\/June 2009","DOI":"10.1145\/1536414.1536461"},{"key":"1_CR35","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 (May 2005)","DOI":"10.1145\/1060590.1060603"},{"key":"1_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-030-03807-6_16","volume-title":"Theory of Cryptography","author":"L Rotem","year":"2018","unstructured":"Rotem, L., Segev, G.: Injective trapdoor functions via derandomization: how strong is Rudich\u2019s black-box barrier? In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11239, pp. 421\u2013447. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_16"},{"key":"1_CR37","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":"1_CR38","unstructured":"Rudich, S.: Limits on the provable consequences of one-way functions. Ph.D. thesis, University of California, Berkeley (1988)"},{"key":"1_CR39","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 35th FOCS, pp. 124\u2013134. IEEE Computer Society Press (November 1994)"},{"key":"1_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/BFb0054137","volume-title":"Advances in Cryptology\u2014EUROCRYPT 1998","author":"DR Simon","year":"1998","unstructured":"Simon, D.R.: Finding collisions on a one-way street: can secure hash functions be based on general assumptions? In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 334\u2013345. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054137"},{"key":"1_CR41","doi-asserted-by":"publisher","first-page":"1759","DOI":"10.1098\/rsta.1998.0247","volume":"356","author":"U Vazirani","year":"1998","unstructured":"Vazirani, U.: On the power of quantum computation. Philos. Trans.-R. Soc. Lond. Ser. A Math. Phys. Eng. Sci. 356, 1759\u20131767 (1998)","journal-title":"Philos. Trans.-R. Soc. Lond. Ser. A Math. Phys. Eng. Sci."},{"issue":"1","key":"1_CR42","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1008908.1008920","volume":"15","author":"S Wiesner","year":"1983","unstructured":"Wiesner, S.: Conjugate coding. SIGACT News 15(1), 78\u201388 (1983)","journal-title":"SIGACT News"},{"key":"1_CR43","unstructured":"Yao, A.C.-C.: Quantum circuit complexity. In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3\u20135 November, 1993, pp. 352\u2013361 (1993)"},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-030-17659-4_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"M Zhandry","year":"2019","unstructured":"Zhandry, M.: Quantum lightning never strikes the same state twice. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 408\u2013438. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_14"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64837-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T18:26:20Z","timestamp":1710354380000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64837-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030648367","9783030648374"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64837-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 December 2020","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":"Daejeon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2020\/","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":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"316","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":"85","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":"27% - 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":"19","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":"The conference will take place virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","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"}]}}