Name
Title | ||
|---|---|---|
Practical Query-based Order Revealing Encryption from Symmetric Searchable Encryption |
Abstract | ||
|---|---|---|
In the 2010s, there has been significant interest in developing methods, such as searchable encryption for exact matching and order-preserving/-revealing encryption for range search, to perform search on encrypted data. However, the symmetric searchable encryption method has been steadily used not only in databases but also in full-text search engine because of its quick performance and high security against intruders and system administrators. Contrarily, order-preserving/-revealing encryption is rarely employed in practice: almost all related schemes suffer from inference attacks, and some schemes are secure but impractical because they require exponential storage size or communication complexity. In this study, we define the new security models based on order-revealing encryption (ORE) for performing range search, and explain that previous techniques are not satisfied with our weak security model. We present two generic constructions of ORE using the searchable encryption method. Our constructions offer practical performance such as the storage size of O(nb) and computation complexity of O(n
<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup>
), where the plaintext space is a set of n-bit binaries and b denotes the block size of the ciphertext generated via searchable encryption. The first construction gives the comparison result to the server, and the security considers a weak security model. The second construction hides the comparison result from the server, and only the secret-key owner can recover it. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/AsiaJCIS50894.2020.00015 | 2020 15th Asia Joint Conference on Information Security (AsiaJCIS) |
Keywords | DocType | ISSN |
order-preserving/-revealing encryption,searchable encryption,range search,encrypted database,encrypted full-text search engine | Conference | 2374-0205 |
ISBN | Citations | PageRank |
978-1-7281-9923-8 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Masayuki Yoshino | 1 | 21 | 7.43 |
| Ken Naganuma | 2 | 9 | 3.59 |
| Noboru Kunihiro | 3 | 425 | 45.72 |
| Hisayoshi Sato | 4 | 13 | 4.83 |