Journal
IEEE ACCESS
Volume 10, Issue -, Pages 102009-102018Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2022.3208958
Keywords
Encryption; Servers; Databases; Predictive models; Costs; Binary search trees; Outsourcing; Cloud computing; Order-preserving encryption; ciphertext update; cloud security; database encryption
Categories
Funding
- Research Grants from Daegu Catholic University in 2022
Ask authors/readers for more resources
This research proposes a more efficient ciphertext update algorithm for mutable OPE schemes, reducing the number of updates by considering the input pattern of encrypted data without sacrificing security.
Order-preserving encryption (OPE) produces ciphertexts that preserve the numerical order of plaintexts. Many researchers have focused on designing ideally-secure OPE schemes. This security notion, known as IND-OCPA, has been shown to be achievable by the mutability of ciphertexts and interaction between a database server and a client. This implies that the ciphertexts stored on the server can be updated. Unfortunately, existing update algorithms of mutable OPE schemes are designed to generate ciphertexts uniformly regardless of the distribution of the plaintexts. This leads to inefficiency that requires frequent ciphertext updates for a certain input data pattern (e.g., sequential data). In this paper, we propose a more efficient ciphertext update algorithm that is suitable for mutable OPE schemes. This algorithm makes it possible to reduce the number of updates by considering the input pattern of encrypted data without loss of security. Our experimental results show that, when applied to existing mutable OPE schemes, our update algorithm delivers significantly improved performance on a variety of datasets.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available