2018
DOI: 10.1109/tifs.2017.2758746
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Verifiable Databases With Insertion/Deletion Operations From Delegating Polynomial Functions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
21
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 24 publications
(21 citation statements)
references
References 46 publications
0
21
0
Order By: Relevance
“…Reference [38] proposed a new publicly verifiable data deletion scheme. This scheme achieves fine-grained assured deletion of cloud data with the help of the Merkle sum hash tree [39]. Reference [40] proposed a verifiable database scheme for insertion/deletion operations by incorporating vector commitment and designed a new primitive for fine-grained data deletion-Merkle interval hash tree (MIHT).…”
Section: Related Workmentioning
confidence: 99%
“…Reference [38] proposed a new publicly verifiable data deletion scheme. This scheme achieves fine-grained assured deletion of cloud data with the help of the Merkle sum hash tree [39]. Reference [40] proposed a verifiable database scheme for insertion/deletion operations by incorporating vector commitment and designed a new primitive for fine-grained data deletion-Merkle interval hash tree (MIHT).…”
Section: Related Workmentioning
confidence: 99%
“…Nevertheless, this scheme has a linearly increasing number of levels in hierarchical commitment when the client continually inserts data in the same index of the database. Later, Miao et al 23 constructed a new VDB scheme that supports all updating operations by using the primitive of Merkle sum hash tree. However, it is only private verifiable.…”
Section: Related Workmentioning
confidence: 99%
“…Merkle sum hash tree (MSHT) was first proposed by Miao et al, 43 which can be viewed as an extension of the MHT. 44 Different from the MHT, MSHT can support dynamic data insertion and deletion.…”
Section: Preliminariesmentioning
confidence: 99%