2013
DOI: 10.1002/sec.938
|View full text |Cite
|
Sign up to set email alerts
|

Data integrity verification scheme with designated verifiers for dynamic outsourced databases

Abstract: In order to verify the integrity of the query results in outsourced database model, we first present a new authenticated data structure by combining skip lists with polynomial functions and accumulators and then construct a data integrity verification scheme for range query. Our scheme can verify the integrity of the query results with constant time verification and constant size proof and support dynamic maintenance with constant computational cost. Compared with that of previous schemes, the communication co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 30 publications
0
5
0
Order By: Relevance
“…We assume that the data owner wants to delete data d 5 , and the service provider returns VO for querying. In this instance, the VO for the data d 5 On the part of the server, the process of performing the update on the k-d TASL is similar to the general multi-dimensional skip list [33]. For example, insertions in the 2D TASL are rather simple, which starts at the head node: (i) if the gap size is less than L, the location of the new data insertion is determined and the minimum and maximum values of k 2 are updated as required; (ii) if the gap is the same size as L, the middle node is raised in this gap, which creates two gaps of size one and a new node in the middle.…”
Section: Dynamics Maintenancementioning
confidence: 98%
See 2 more Smart Citations
“…We assume that the data owner wants to delete data d 5 , and the service provider returns VO for querying. In this instance, the VO for the data d 5 On the part of the server, the process of performing the update on the k-d TASL is similar to the general multi-dimensional skip list [33]. For example, insertions in the 2D TASL are rather simple, which starts at the head node: (i) if the gap size is less than L, the location of the new data insertion is determined and the minimum and maximum values of k 2 are updated as required; (ii) if the gap is the same size as L, the middle node is raised in this gap, which creates two gaps of size one and a new node in the middle.…”
Section: Dynamics Maintenancementioning
confidence: 98%
“…In the Merkle tree approach, the space is linear, and the query and verification time are logarithmic in relation to the size of the authenticated dataset. Several variations of Merkle tree were proposed to improve performance, such as literatures [1–6]. There are a number of authentication techniques based on the skip list as well [7–10].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…In addition, BLS signatures spend less on communication and storage costs. Combined with the particularity of bilinear distribution encryption in elliptic curve encryption, the data integrity can be proved under the random oracle model [24].…”
Section: Blockchain-based Data Integrity Verification Modelmentioning
confidence: 99%
“…In the tripartite model, it is generally divided into three parts: user, cloud storage server, and trusted third party. e specific responsibilities of each part are as follows [17,18]:…”
Section: Data Integrity Verification Modelmentioning
confidence: 99%