|
Verifiable Database Supporting Range Query
|
Seyed Hossein Tahami *1   , Hamid Mala1 |
| 1- Faculty of Computer Engineering, University of Isfahan, Isfahan, Iran |
|
|
Abstract: (2209 Views) |
| In a verifiable database scheme (VDB), a client with limited storage resources securely outsources its very large and dynamic database to an untrusted server such that any attempt to tamper with the data, or even any unintentional changes to the data, can be detected by the client with high probability. The latest work in this area has tried to add the secure search feature of single keyword and multiple keywords. In this paper, we intend to add a range query to the features of this database. The scheme presented in this article provides the requirements of a secure search, namely the completeness of the search result, the proof of the empty search result, the lack of additional information leakage and the freshness of the search results, as well as the database with public verifiability. In the proposed scheme, the computational complexity of the client is not changed significantly compared with the previous scheme, but the computational and storage complexity of the server has increased which is justifiable by its rich resources. |
|
| Keywords: Verifiable database, Searchable encryption, Vector commitment, Cloud computing, Secure outsourcing |
|
|
Full-Text [PDF 1013 kb]
(1029 Downloads)
|
Type of Study: Research Article |
Subject:
Special
Received: 2023/10/21 | Accepted: 2024/02/29 | Published: 2024/02/29
|
|
|
|
|
|
