{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T22:25:51Z","timestamp":1780352751276,"version":"3.54.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032078902","type":"print"},{"value":"9783032078919","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:00:00Z","timestamp":1760659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:00:00Z","timestamp":1760659200000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-07891-9_17","type":"book-chapter","created":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:24:03Z","timestamp":1760610243000},"page":"321-340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["UTRA: Universal Token Reusability Attack and\u00a0Token Unforgeable Delegatable Order-Revealing Encryption"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-4124-2164","authenticated-orcid":false,"given":"Jaehwan","family":"Park","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0435-4394","authenticated-orcid":false,"given":"Hyeonbum","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4823-4194","authenticated-orcid":false,"given":"Junbeom","family":"Hur","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0547-5702","authenticated-orcid":false,"given":"Jae Hong","family":"Seo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9033-990X","authenticated-orcid":false,"given":"Doowon","family":"Kim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,10,17]]},"reference":[{"key":"17_CR1","unstructured":"Amazon employee. https:\/\/explodingtopics.com\/blog\/amazon-employees. Accessed 30 May 2024"},{"key":"17_CR2","unstructured":"Google employee. https:\/\/seo.ai\/blog\/how-many-people-work-at-google. Accessed 30 May 2024"},{"key":"17_CR3","unstructured":"IBM employee. https:\/\/stockanalysis.com\/stocks\/ibm\/employees\/. Accessed 30 May 2024"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Kiernan, J., Srikant, R., Xu, Y.: Order preserving encryption for numeric data. In: Proceedings of the 2004 ACM SIGMOD International Conference on Management of data, pp. 563\u2013574 (2004)","DOI":"10.1145\/1007568.1007632"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Berger, R., D\u00f6rre, F., Koch, A.: Two-party decision tree training from updatable order-revealing encryption. In: International Conference on Applied Cryptography and Network Security, pp. 288\u2013317. Springer (2024)","DOI":"10.1007\/978-3-031-54770-6_12"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-01001-9_13","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"A Boldyreva","year":"2009","unstructured":"Boldyreva, A., Chenette, N., Lee, Y., O\u2019Neill, A.: Order-preserving symmetric encryption. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 224\u2013241. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_13"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. J. Cryptol. 17, 297\u2013319 (2004)","journal-title":"J. Cryptol."},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-030-03326-2_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"D Cash","year":"2018","unstructured":"Cash, D., Liu, F.-H., O\u2019Neill, A., Zhandry, M., Zhang, C.: Parameter-hiding order revealing encryption. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11272, pp. 181\u2013210. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_7"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Challita, S., Zalila, F., Gourdin, C., Merle, P.: A precise model for google cloud platform. In: 2018 IEEE International Conference on Cloud Engineering (IC2E), pp. 177\u2013183. IEEE (2018)","DOI":"10.1109\/IC2E.2018.00041"},{"issue":"4","key":"17_CR10","doi-asserted-by":"publisher","first-page":"2672","DOI":"10.1109\/TSC.2023.3249411","volume":"16","author":"Z Chen","year":"2023","unstructured":"Chen, Z., Nie, J., Li, Z., Susilo, W., Ge, C.: Geometric searchable encryption for privacy-preserving location-based services. IEEE Trans. Serv. Comput. 16(4), 2672\u20132684 (2023)","journal-title":"IEEE Trans. Serv. Comput."},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-662-52993-5_24","volume-title":"Fast Software Encryption","author":"N Chenette","year":"2016","unstructured":"Chenette, N., Lewi, K., Weis, S.A., Wu, D.J.: Practical order-revealing encryption with limited leakage. In: Peyrin, T. (ed.) FSE 2016. LNCS, vol. 9783, pp. 474\u2013493. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-52993-5_24"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-030-64834-3_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"JH Cheon","year":"2020","unstructured":"Cheon, J.H., Kim, D., Kim, D.: Efficient homomorphic comparison methods with optimal complexity. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 221\u2013256. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_8"},{"issue":"1","key":"17_CR13","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1109\/TIFS.2015.2483486","volume":"11","author":"JH Cheon","year":"2015","unstructured":"Cheon, J.H., Kim, M., Kim, M.: Optimized search-and-compute circuits and their application to query evaluation on encrypted data. IEEE Trans. Inf. Forensics Secur. 11(1), 188\u2013199 (2015)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Hahn, C., Hur, J.: Delegatable order-revealing encryption for reliable cross-database query. IEEE Trans. Serv. Comput. (2022)","DOI":"10.1109\/TSC.2022.3192551"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Kerschbaum, F., Schr\u00f6pfer, A.: Optimal average-complexity ideal-security order-preserving encryption. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, pp. 275\u2013286 (2014)","DOI":"10.1145\/2660267.2660277"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Li, Y., Wang, H., Zhao, Y.: Delegatable order-revealing encryption. In: Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security, pp. 134\u2013147 (2019)","DOI":"10.1145\/3321705.3329829"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-030-88428-4_3","volume-title":"Computer Security \u2013 ESORICS 2021","author":"C Lv","year":"2021","unstructured":"Lv, C., Wang, J., Sun, S.-F., Wang, Y., Qi, S., Chen, X.: Efficient multi-client order-revealing encryption and its applications. In: Bertino, E., Shulman, H., Waidner, M. (eds.) ESORICS 2021. LNCS, vol. 12973, pp. 44\u201363. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88428-4_3"},{"key":"17_CR18","unstructured":"Lynn, B.: Pairing-based cryptography library. https:\/\/crypto.stanford.edu\/pbc\/ (2006)"},{"issue":"1","key":"17_CR19","first-page":"22","volume":"105","author":"S Mathew","year":"2014","unstructured":"Mathew, S., Varia, J.: Overview of amazon web services. Amazon Whitepapers 105(1), 22 (2014)","journal-title":"Amazon Whitepapers"},{"issue":"5","key":"17_CR20","doi-asserted-by":"publisher","first-page":"3650","DOI":"10.1109\/TMC.2023.3277702","volume":"23","author":"Y Miao","year":"2023","unstructured":"Miao, Y., et al.: Time-controllable keyword search scheme with efficient revocation in mobile e-health cloud. IEEE Trans. Mob. Comput. 23(5), 3650\u20133665 (2023)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"17_CR21","unstructured":"MISHRA, A.: Faang- complete stock data. https:\/\/www.kaggle.com\/datasets\/aayushmishra1512\/faang-complete-stock-data (2020). Accessed 30 May 2024"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Park, J.H., Rezaeifar, Z., Hahn, C.: Securing multi-client range queries over encrypted data. Cluster Comput., 1\u201314 (2024)","DOI":"10.1007\/s10586-024-04472-w"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Park, J., Lee, H., Hur, J., Seo, J.H., Kim, D.: UTRA: universe token reusability attack and verifiable delegatable order-revealing encryption. Cryptol. ePrint Arch. (2024)","DOI":"10.1007\/978-3-032-07891-9_17"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Popa, R.A., Li, F.H., Zeldovich, N.: An ideal-security protocol for order-preserving encoding. In: 2013 IEEE Symposium on Security and Privacy, pp. 463\u2013477. IEEE (2013)","DOI":"10.1109\/SP.2013.38"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Qiao, H., Peng, C., Feng, Q., Luo, M., He, D.: Ciphertext range query scheme against agent transfer and permission extension attacks for cloud computing. IEEE Internet Things J. (2024)","DOI":"10.1109\/JIOT.2024.3360141"},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Roche, D.S., Apon, D., Choi, S.G., Yerukhimovich, A.: Pope: partial order preserving encoding. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 1131\u20131142 (2016)","DOI":"10.1145\/2976749.2978345"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Advances in Cryptology\u2014CRYPTO\u201989 Proceedings 9, pp. 239\u2013252. Springer (1990)","DOI":"10.1007\/0-387-34805-0_22"},{"issue":"6","key":"17_CR28","doi-asserted-by":"publisher","first-page":"2861","DOI":"10.1109\/TDSC.2020.2967740","volume":"18","author":"BHM Tan","year":"2020","unstructured":"Tan, B.H.M., Lee, H.T., Wang, H., Ren, S., Aung, K.M.M.: Efficient private comparison queries over encrypted databases using fully homomorphic encryption with finite fields. IEEE Trans. Dependable Secure Comput. 18(6), 2861\u20132874 (2020)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"17_CR29","unstructured":"United Nations: World population prospects - population division - united nations. https:\/\/population.un.org\/wpp\/ (2022). Accessed 30 May 2024"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Xiao, J., et al.: Cloak: hiding retrieval information in blockchain systems via distributed query requests. IEEE Trans. Serv. Comput. (2024)","DOI":"10.1109\/TSC.2024.3411450"},{"key":"17_CR31","doi-asserted-by":"crossref","unstructured":"Xu, J., Peng, C., Li, R., Fu, J., Luo, M.: An efficient delegatable order-revealing encryption scheme for multi-user range queries. IEEE Trans. Cloud Comput. (2024)","DOI":"10.1109\/TCC.2024.3506614"},{"key":"17_CR32","doi-asserted-by":"crossref","unstructured":"Xu, Y., Cheng, H., Liu, X., Jiang, C., Zhang, X., Wang, M.: PCSE: privacy-preserving collaborative searchable encryption for group data sharing in cloud computing. IEEE Trans. Mobile Comput. (2025)","DOI":"10.1109\/TMC.2025.3526232"},{"issue":"3","key":"17_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3548657","volume":"6","author":"P Yu","year":"2022","unstructured":"Yu, P., Ni, W., Liu, R.P., Zhang, Z., Zhang, H., Wen, Q.: Efficient encrypted range query on cloud platforms. ACM Trans. Cyber-Phys. Syst. (TCPS) 6(3), 1\u201323 (2022)","journal-title":"ACM Trans. Cyber-Phys. Syst. (TCPS)"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-07891-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T02:20:47Z","timestamp":1779848447000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-07891-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,17]]},"ISBN":["9783032078902","9783032078919"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-07891-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,17]]},"assertion":[{"value":"17 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.esorics2025.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}