Random Perturbation Order Preserving Distribution Encryption

Cloud computing services have to gain fast awareness by many organizations because of their cost-effectiveness, but they are faced with many security issues in protecting client business data in the current technological generation. Order-preserving encryption (OPE) is a very important technique for databases, and cloud storage encryption executes range queries efficiently, but regrettably, limited systems have stood to accomplish confirmable security. However, these schemes leak the distribution of repeated plaintext values. This paper presents a random perturbation distribution scheme (RPDS), which is secure and does not leak the distribution of repeated plaintext values. Our technology is based on Popa's mutable order preserving encoding (mOPE) and storage-aware order-preserving encoding (stOPE). We supported RPDS with an insertion algorithm in which we added a random bit value to handle a repeated plaintext value that stops the server from recognizing repeated values, and we developed a proof to show the correctness of its syntax. This paper suggests that the arbitrary collision probability and proof show that collisions can only occur with a lower probability in the RPDS. This paper presents a proof of the safety of the RPDS and its applicability, usability, and functionalities. Finally, we compared the RPDS with existing OPE schemes and provided an experimental result for the practicality of the RPDS.

Automated summary

Cloud computing services are gaining rapid attention from organizations due to cost-effectiveness, but face security challenges in protecting client data. Order-preserving encryption and cloud storage encryption are important techniques for database security, but commonly leak the distribution of repeated plaintext values. This paper introduces a random perturbation distribution scheme (RPDS) to securely handle repeated plaintext values without leaking their distribution.