Abstract
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 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.
Highlights
Database outsourcing to the public cloud server is greatly increasing the development of large-scale data storage, processing, and distribution, but many organizations are worried about the confidentiality of their data
Popa et al 2013 [1] proposed “Mutable Order Preserving Encoding and Storage-Aware OrderPreserving Encoding” and suggested that an adversary can only know the order of values stored in the application
The server cannot determine the number of values that are the same as those in Storage-Aware OrderPreserving Encoding (stOPE) and Mutable Order Preserving Encoding (mOPE)
Summary
Database outsourcing to the public cloud server is greatly increasing the development of large-scale data storage, processing, and distribution, but many organizations are worried about the confidentiality of their data. Popa et al 2013 [1] proposed “Mutable Order Preserving Encoding (mOPE) and Storage-Aware OrderPreserving Encoding (stOPE)” and suggested that an adversary can only know the order of values stored in the application Their schemes work by creating a balanced tree that holds all the encoded data on a server. When multiple inputs of similar plaintext values are inserted, the server does not create a new node for each, but its count increases whenever the same value is added and stores the value in the same node with a counter assigned to it This process causes the schemes to leak a digit regarding the circulation of repeated plaintext data, which can enable an adversary to gain knowledge of the distribution of repeated values based on the location and magnitude of the node by performing node calculations to initiate a repeated plaintext attack to hack the system.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
