.png){kind=icon}
Return
Verifiable Computation over Large Database with Incremental Updates
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2015.2512870.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The notion of verifiable database (VDB) enables a resource-constrained client to securely outsource a very large database to an untrusted server so that it could later retrieve a database record and update a record by assigning a new value. Also, any attempt by the server to tamper with the data will be detected by the client. When the database undergoes frequent while small modifications, the client must re-compute and update the encrypted version (ciphertext) on the server at all times. For very large data, it is extremely expensive for the resources-constrained client to perform both operations from scratch. In this paper, we formalize the notion of verifiable database with incremental updates (Inc-VDB). Besides, we propose a general Inc-VDB framework by incorporating the primitive of vector commitment and the encrypt-then-incremental MAC mode of encryption. We also present a concrete Inc-VDB scheme based on the computational Diffie-Hellman (CDH) assumption. Furthermore, we prove that our construction can achieve the desired security properties.
Keywords:
Verifiable database
incremental cryptography
outsourcing computations
vector commitment
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K
Organization
Cited Papers
.png){kind=icon}
Nonlinear optical properties of lutetium bisphthalocyanine and its application for an optical switch
PREAI
ShareSaveShareSave
ShareSaveShareSaveA Prediction Modeling Framework: Toward Integration of Noisy Manufacturing Data and Product Design
PREAI
ShareSave
View more