Handbook of Database Security
DOI: 10.1007/978-0-387-48533-1_5
|View full text |Cite
|
Sign up to set email alerts
|

Authenticated Index Structures for Outsourced Databases

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
19
0

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(19 citation statements)
references
References 25 publications
0
19
0
Order By: Relevance
“…These existing techniques can be mainly divided into two groups: tree-based techniques and signature-based techniques. Among the existing tree-based techniques, the best one is proposed by Li et.al [4] , which introduce a fiction embedded Merkle B+ Tree structure and obtain integrity of the query result with simple hash operations. However, the communication complexity of [4] is linear to the number of tuples and attributes associated with the query results, which extent its performance for queries results with large ranges.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…These existing techniques can be mainly divided into two groups: tree-based techniques and signature-based techniques. Among the existing tree-based techniques, the best one is proposed by Li et.al [4] , which introduce a fiction embedded Merkle B+ Tree structure and obtain integrity of the query result with simple hash operations. However, the communication complexity of [4] is linear to the number of tuples and attributes associated with the query results, which extent its performance for queries results with large ranges.…”
Section: Related Workmentioning
confidence: 99%
“…Among the existing tree-based techniques, the best one is proposed by Li et.al [4] , which introduce a fiction embedded Merkle B+ Tree structure and obtain integrity of the query result with simple hash operations. However, the communication complexity of [4] is linear to the number of tuples and attributes associated with the query results, which extent its performance for queries results with large ranges. Another concern about data integrity is the issue of storage integrity on outsourced data, which permits the data user to verify the integrity of his own data files stored on untrusted server without retrieving it.…”
Section: Related Workmentioning
confidence: 99%
“…The VB-tree only guarantees the correctness of the query results. Li et al [32] proposed Merkle B-Tree (MBT) to support disk-based query authentication. To response a range query, the CSP performs two depth-first traversals to find the leftmost and rightmost records of query results and build the verification object (VO).…”
Section: Related Workmentioning
confidence: 99%
“…However, VN-Auth increases the storage overhead of the data owner, and it can only handle point object query. MR-tree is developed on the basis of Merkle hash tree [11] and R*-tree [12]. It computes the digests from the leaf node to the root node, and the data owner signed the digest of root node with a private key.…”
Section: Outsourced Spatial Database Query Authenticationmentioning
confidence: 99%