Verifiable Computation over Large Database with Incremental Updates

Verifiable Computation over Large Database with Incremental Updates
复制标题

通过增量更新对大型数据库进行可验证计算

DOI:
10.1109/tc.2015.2512870
复制
发表时间:
2016-10-01
影响因子:
3.7
通讯作者:
Lou, Wenjing
Lou, Wenjing
中科院分区:
计算机科学2区
文献类型:
--
作者:
Chen, Xiaofeng;Li, Jin;Lou, Wenjing

文献摘要

被引文献

相似文献

可验证数据库 (VDB) 的概念使资源受限的客户端能够安全地将非常大的数据库外包给不受信任的服务器,以便稍后可以检索数据库记录并通过分配新值来更新记录。此外,服务器篡改数据的任何尝试都会被客户端检测到。当数据库发生频繁而小的修改时,客户端必须随时重新计算并更新服务器上的加密版本(密文)。对于非常大的数据,资源有限的客户端从头开始执行这两个操作的成本极其昂贵。在本文中,我们形式化了具有增量更新的可验证数据库(Inc-VDB)的概念。此外,我们提出了一个通用的 Inc-VDB 框架,结合了矢量承诺原语和加密然后增量 MAC 模式。我们还提出了一种基于计算 Diffie-Hellman (CDH) 假设的具体 Inc-VDB 方案。此外,我们证明我们的结构可以实现所需的安全性能。
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.