An Efficient Delegatable Order-Revealing Encryption Scheme for Multi-User Range Queries
- 27 November 2024
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 13 (1) , 75-86
Abstract
To balance data confidentiality and availability, order-revealing encryption (ORE) has emerged as a pivotal primitive facilitating range queries on encrypted data. However, challenges arise in diverse user domains where data is encrypted with different keys, giving rise to the development of delegatable order-revealing encryption (DORE) schemes. Regrettably, existing DORE schemes are susceptible to authorization token forgery attacks and rely on computationally intensive bilinear pairings. This work proposes a novel solution to address these challenges. We first introduce a delegatable equality-revealing encryption scheme, enabling the comparison of ciphertexts encrypted by distinct secret keys through authorization tokens. Building upon this, we present a delegatable order-revealing encryption that leverages bitwise encryption. DORE supports efficient multiuser ciphertext comparison while robustly resisting authorization token forgery attacks. Significantly, our approach distinguishes itself by minimizing bilinear pairings. Experimental results highlight the efficacy of DORE, showcasing a notable speedup of 2.8× in encryption performance and 1.33× in comparison performance compared to previous DORE schemes, respectively.Keywords
Funding Information
- National Key Research and Development Program of China (2022YFB3102400)
- National Natural Science Foundation of China (62272350, 62172307)
- Fundamental Research Funds for the Central Universities (2042023KF0203)
This publication has 31 references indexed in Scilit:
- Efficient Multi-client Order-Revealing Encryption and Its Applications2021
- Boolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity2017
- Partially Homomorphic Encryption Schemes over Finite Fields2016
- Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation2015
- Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions2011
- Order-Preserving Symmetric Encryption2009
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles2008
- Deterministic and Efficiently Searchable Encryption2007
- Strongly Unforgeable Signatures Based on Computational Diffie-Hellman2006
- Linkable Ring Signatures: Security Models and New Schemes2005