{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T07:50:44Z","timestamp":1772265044846,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T00:00:00Z","timestamp":1768867200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T00:00:00Z","timestamp":1768867200000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s10623-025-01778-7","type":"journal-article","created":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T10:51:24Z","timestamp":1768906284000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["PAORE: public-key authenticated order-revealing encryption"],"prefix":"10.1007","volume":"94","author":[{"given":"Priyanka","family":"Dutta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Willy","family":"Susilo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fuchun","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dung Hoang","family":"Duong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,20]]},"reference":[{"key":"1778_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal S., Boneh D., Boyen X.: Efficient lattice (H) IBE in the standard model. In: EUROCRYPT 2010, pp. 553\u2013572. Springer (2010).","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"1778_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai M.: Generating hard instances of lattice problems. In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, pp. 99\u2013108 (1996).","DOI":"10.1145\/237814.237838"},{"key":"1778_CR3","unstructured":"Alwen J., Peikert C.: Generating shorter bases for hard random lattices. In: STACS 2009, pp. 75\u201386 (2009)."},{"key":"1778_CR4","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 (2024).","DOI":"10.1007\/978-3-031-54770-6_12"},{"key":"1778_CR5","doi-asserted-by":"crossref","unstructured":"Boneh D., Lewi K., Montgomery H., Raghunathan A.: Key homomorphic PRFs and their applications. In: CRYPTO, pp. 410\u2013428. Springer (2013).","DOI":"10.1007\/978-3-642-40041-4_23"},{"key":"1778_CR6","doi-asserted-by":"crossref","unstructured":"Boneh D., Lewi K., Raykova M., Sahai A., Zhandry M., Zimmerman J.: Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation. In: EUROCRYPT, pp. 563\u2013594. Springer (2015).","DOI":"10.1007\/978-3-662-46803-6_19"},{"key":"1778_CR7","doi-asserted-by":"crossref","unstructured":"Brakerski Z., Langlois A., Peikert C., Regev O., Stehl\u00e9 D.: Classical hardness of learning with errors. In: STOC 2013, pp. 575\u2013584 (2013).","DOI":"10.1145\/2488608.2488680"},{"key":"1778_CR8","doi-asserted-by":"crossref","unstructured":"Bun M., Zhandry M.: Order-revealing encryption and the hardness of private learning. In: Theory of Cryptography Conference, pp. 176\u2013206. Springer (2015).","DOI":"10.1007\/978-3-662-49096-9_8"},{"key":"1778_CR9","doi-asserted-by":"crossref","unstructured":"Cash D., Liu F.-H., O\u2019Neill A., Zhandry M., Zhang C.: Parameter-hiding order revealing encryption. In: Advances in Cryptology\u2013ASIACRYPT 2018: 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2\u20136, 2018, Proceedings, Part I 24, pp. 181\u2013210 (2018).","DOI":"10.1007\/978-3-030-03326-2_7"},{"key":"1778_CR10","doi-asserted-by":"crossref","unstructured":"Chenette N., Lewi K., Weis S.A., Wu D.J.: Practical order-revealing encryption with limited leakage. In: FSE, pp. 474\u2013493. Springer (2016).","DOI":"10.1007\/978-3-662-52993-5_24"},{"key":"1778_CR11","doi-asserted-by":"crossref","unstructured":"Deo A., Libert B., Nguyen K., Sanders O.: Lattice-based e-cash, revisited. In: ASIACRYPT, pp. 318\u2013348. Springer (2020).","DOI":"10.1007\/978-3-030-64834-3_11"},{"key":"1778_CR12","doi-asserted-by":"crossref","unstructured":"Ducas L., Micciancio D.: Improved short lattice signatures in the standard model. In: CRYPTO, pp. 335\u2013352 (2014).","DOI":"10.1007\/978-3-662-44371-2_19"},{"key":"1778_CR13","doi-asserted-by":"crossref","unstructured":"Durak F.B., DuBuisson T.M., Cash D.: What else is revealed by order-revealing encryption? In: CCS, pp. 1155\u20131166 (2016).","DOI":"10.1145\/2976749.2978379"},{"key":"1778_CR14","doi-asserted-by":"crossref","unstructured":"Gentry C., Peikert C., Vaikuntanathan V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC 2008, pp. 197\u2013206 (2008).","DOI":"10.1145\/1374376.1374407"},{"key":"1778_CR15","doi-asserted-by":"crossref","unstructured":"Grubbs P., Sekniqi K., Bindschaedler V., Naveed M., Ristenpart T.: Leakage-abuse attacks against order-revealing encryption. In: S &P, pp. 655\u2013672 (2017).","DOI":"10.1109\/SP.2017.44"},{"issue":"3","key":"1778_CR16","first-page":"1763","volume":"16","author":"C Hahn","year":"2022","unstructured":"Hahn C., Hur J.: Delegatable order-revealing encryption for reliable cross-database query. IEEE Trans. Serv. Comput. 16(3), 1763\u20131777 (2022).","journal-title":"IEEE Trans. Serv. Comput."},{"issue":"4","key":"1778_CR17","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":"1778_CR18","doi-asserted-by":"crossref","unstructured":"Jurado M., Palamidessi C., Smith G.: A formal information-theoretic leakage analysis of order-revealing encryption. In: CSF, pp. 1\u201316. IEEE (2021).","DOI":"10.1109\/CSF51468.2021.00046"},{"key":"1778_CR19","doi-asserted-by":"crossref","unstructured":"Lewi K., Wu D.J.: Order-revealing encryption: new constructions, applications, and lower bounds. In: CCS, pp. 1167\u20131178 (2016).","DOI":"10.1145\/2976749.2978376"},{"key":"1778_CR20","doi-asserted-by":"crossref","unstructured":"Li Y., Wang H., Zhao Y.: Delegatable order-revealing encryption. In: AsiaCCS, pp. 134\u2013147 (2019).","DOI":"10.1145\/3321705.3329829"},{"issue":"3","key":"1778_CR21","doi-asserted-by":"publisher","first-page":"1579","DOI":"10.1109\/TDSC.2020.3029845","volume":"19","author":"Z Liu","year":"2020","unstructured":"Liu Z., Lv S., Li J., Huang Y., Guo L., Yuan Y., Dong C.: ENCODEORE: reducing leakage and preserving practicality in order-revealing encryption. IEEE Trans. Depend. Secure Comput. 19(3), 1579\u20131591 (2020).","journal-title":"IEEE Trans. Depend. Secure Comput."},{"key":"1778_CR22","doi-asserted-by":"crossref","unstructured":"Lv C., Wang J., Sun S.-F., Wang Y., Qi S., Chen X.: Efficient multi-client order-revealing encryption and its applications. In: ESORICS, pp. 44\u201363. Springer (2021).","DOI":"10.1007\/978-3-030-88428-4_3"},{"key":"1778_CR23","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2023.3268652","author":"C Lv","year":"2023","unstructured":"Lv C., Wang J., Sun S.-F., Wang Y., Qi S., Chen X.: Towards practical multi-client order-revealing encryption: improvement and application. IEEE Trans. Depend. Secure Comput. (2023). https:\/\/doi.org\/10.1109\/TDSC.2023.3268652.","journal-title":"IEEE Trans. Depend. Secure Comput."},{"key":"1778_CR24","doi-asserted-by":"crossref","unstructured":"Micciancio D., Peikert C.: Hardness of SIS and LWE with small parameters. In: CRYPTO, pp. 21\u201339. Springer (2013).","DOI":"10.1007\/978-3-642-40041-4_2"},{"key":"1778_CR25","doi-asserted-by":"crossref","unstructured":"Micciancio D., Peikert C.: Trapdoors for lattices: Simpler, tighter, faster, smaller. In: EUROCRYPT 2012, pp. 700\u2013718. Springer (2012).","DOI":"10.1007\/978-3-642-29011-4_41"},{"issue":"1","key":"1778_CR26","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/S0097539705447360","volume":"37","author":"D Micciancio","year":"2007","unstructured":"Micciancio D., Regev O.: Worst-case to average-case reductions based on gaussian measures. SIAM J. Comput. 37(1), 267\u2013302 (2007).","journal-title":"SIAM J. Comput."},{"key":"1778_CR27","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. Cryptology ePrint Archive (2024).","DOI":"10.1007\/978-3-032-07891-9_17"},{"issue":"7","key":"1778_CR28","doi-asserted-by":"publisher","first-page":"9679","DOI":"10.1007\/s10586-024-04472-w","volume":"27","author":"JH Park","year":"2024","unstructured":"Park J.H., Rezaeifar Z., Hahn C.: Securing multi-client range queries over encrypted data. Clust. Comput. 27(7), 9679\u20139692 (2024).","journal-title":"Clust. Comput."},{"key":"1778_CR29","doi-asserted-by":"crossref","unstructured":"Peikert C., Rosen A.: Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In: TCC, pp. 145\u2013166. Springer (2006).","DOI":"10.1007\/11681878_8"},{"key":"1778_CR30","doi-asserted-by":"crossref","unstructured":"Popa R.A., Redfield C.M., Zeldovich N., Balakrishnan H.: CRYPTDB: protecting confidentiality with encrypted query processing. In: SOSP, pp. 85\u2013100 (2011).","DOI":"10.1145\/2043556.2043566"},{"key":"1778_CR31","doi-asserted-by":"crossref","unstructured":"Regev O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC 2005, pp. 84\u201393 (2005).","DOI":"10.1145\/1060590.1060603"},{"key":"1778_CR32","volume-title":"A Computational Introduction to Number Theory and Algebra","author":"V Shoup","year":"2009","unstructured":"Shoup V.: A Computational Introduction to Number Theory and Algebra. Cambridge University Press, Cambridge (2009)."},{"issue":"1","key":"1778_CR33","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TCC.2024.3506614","volume":"13","author":"J Xu","year":"2024","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. 13(1), 75\u201386 (2024).","journal-title":"IEEE Trans. Cloud Comput."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01778-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01778-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01778-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T04:49:10Z","timestamp":1772254150000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01778-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,20]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["1778"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01778-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,20]]},"assertion":[{"value":"1 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"28"}}