2009
DOI: 10.14778/1687627.1687718
|View full text |Cite
|
Sign up to set email alerts
|

Scalable verification for outsourced dynamic databases

Abstract: Query answers from servers operated by third parties need to be verified, as the third parties may not be trusted or their servers may be compromised. Most of the existing authentication methods construct validity proofs based on the Merkle hash tree (MHT). The MHT, however, imposes severe concurrency constraints that slow down data updates. We introduce a protocol, built upon signature aggregation, for checking the authenticity, completeness and freshness of query answers. The protocol offers the important pr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
83
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 94 publications
(83 citation statements)
references
References 29 publications
(52 reference statements)
0
83
0
Order By: Relevance
“…Signature aggregation has a smaller proof and is amenable to concurrent updates. Reference [14] constructs a signature aggregation protocol that provides freshness and guarantees authentication for the basic relational operators. Compared to the MHT approach, the signature aggregation makes it easier to guarantee isolation between tenants for they require signature of every record, but it needs to chain the searching attribute to protect the completeness, if there are multiple searching attribute it need lots of consecutive data records to check the completeness.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Signature aggregation has a smaller proof and is amenable to concurrent updates. Reference [14] constructs a signature aggregation protocol that provides freshness and guarantees authentication for the basic relational operators. Compared to the MHT approach, the signature aggregation makes it easier to guarantee isolation between tenants for they require signature of every record, but it needs to chain the searching attribute to protect the completeness, if there are multiple searching attribute it need lots of consecutive data records to check the completeness.…”
Section: Related Workmentioning
confidence: 99%
“…One is Merkle hash tree based approaches [8][9][10][11][12][13] the other is signature based [14][15][16][17][18]. And the MHT based approaches shows advantage over the signatures based, due to the efficiency of hashing computing compared to signature computing.…”
Section: Introductionmentioning
confidence: 99%
“…The authentication of data in an outsourced database is dealt with in [21], [22]. The service provider may forge the stored data due to the separation of data owner and the service provider (outsourced database).…”
Section: Other Related Work On Database Securitymentioning
confidence: 99%
“…Some type of security mechanism should be supported to prevent such forgery and provide assurance of the query result. This issue is orthogonal to the proposed work because our work is about privacy preservation on an encrypted database, while [21], [22] are about the authentication of data that are in clear plaintext. The manner in which to verify the query result in a database as a service model is dealt with in [13].…”
Section: Other Related Work On Database Securitymentioning
confidence: 99%
See 1 more Smart Citation