Stateless and Non-Interactive Order-Preserving Encryption for Outsourced Databases through Subtractive Homomorphism
Dongfang Zhao

TL;DR
This paper introduces a novel order-preserving encryption scheme that enables stateless clients and eliminates the need for interaction during queries by leveraging subtractive homomorphism, improving practicality for outsourced databases.
Contribution
It presents a new OPE scheme that functions with stateless clients and no interaction, utilizing subtractive homomorphism to reveal order information securely.
Findings
Supports stateless clients without local storage
Eliminates client-server interaction during queries
Leverages additive homomorphic encryption for order comparison
Abstract
Order-preserving encryption (OPE) has been extensively studied for more than two decades in the context of outsourced databases because OPE is a key enabling technique to allow the outsourced database servers to sort encrypted tuples in order to build indexes, complete range queries, and so forth. The state-of-the-art OPE schemes require (i) a stateful client -- implying that the client manages the local storage of some mapping between plaintexts and ciphertexts, and/or (ii) the interaction between the client and the server during the query. In production systems, however, the above assumptions do not always hold (not to mention performance overhead): In the first case, the storage requirement could exceed the capability of the client; In the second case, the clients may not be accessible when the server executes a query involving sort or comparison. This paper proposes a new OPE…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Complexity and Algorithms in Graphs · Optimization and Search Problems
