Verifying Completeness of Relational Query Answers from Online Servers

Pang, HweeHwa; Tan, Kian-Lee

doi:10.1145/1330332.1330337

Cited by 40 publications

(16 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This technique significantly reduces the verified proof size, but incurs central processing unit (CPU) overhead because of the embedded information. The recent work of Pang and Tan [32] addressed an efficient authentication scheme for multi-attribute range aggregate queries. In this scheme, a multi-dimensional structure that maintains partial aggregates at the internal nodes of the structure is used.…”

Section: Iet Information Securitymentioning

confidence: 99%

Authenticating multi‐dimensional query results in outsourced database

Wang

Yue

2016

IET Information Security

View full text Add to dashboard Cite

In the outsourced database model, the third-party server provides query services to users on behalf of the data owner. However, the service provider may be unreliable or susceptible to attacks. The service provider can also produce inauthentic or incomplete query results. An authentication scheme for multi-dimensional data is proposed in the present study to investigate this problem. The authors introduce a new concept of tower head node based on the kdimensional skip list and use it to construct a new authenticated data structure. This structure supports both multidimensional range query and dynamic maintenance. They also show how to verify the authenticity and completeness of query results on multi-dimensional datasets in the outsourced database model. Moreover, this structure can be fully outsourced, thus the service provider can perform the entire maintenance, which is crucial for users with limited computational resources. The proof of security and the evaluation of experiment demonstrate that the scheme is secure and outperforms previous schemes in terms of the construction cost, proof size, query time, verification time and update cost.

show abstract

Section: Iet Information Securitymentioning

confidence: 99%

Authenticating multi‐dimensional query results in outsourced database

Wang

Yue

2016

IET Information Security

View full text Add to dashboard Cite

show abstract

“…In some tree based schemes join processing is achieved in rather a straight forward way [26,35,14,29], which leads to significant increase in the size of the query responses and also the stored data in the server side. In [28] a special tree structure called authenticated aggregation B tree was specifically designed to handle aggregation queries, other tree based schemes cannot handle aggregation queries as a part of the scheme.…”

Section: Type Of Queriesmentioning

confidence: 99%

RDAS: A Symmetric Key Scheme for Authenticated Query Processing in Outsourced Databases

Rodríguez-Henríquez

Chakraborty

2013

Security and Trust Management

View full text Add to dashboard Cite

Abstract. In this paper we address the problem of authenticated query processing in outsourced databases. An authenticated query processing mechanism allows a client to verify the validity of the query responses that it gets from an un-trusted and remote server, who stores the client's database on its behalf. We introduce a general framework called RDAS for the problem of authenticated query processing, and define the security goals for this task in line with concrete provable security. We propose several schemes which enable a client to verify both the completeness and correctness of the query responses of a server. All the schemes follow the proposed framework and are provably secure in terms of the proposed security definition. The novelty of the proposed schemes is that they use bitmap indexes as a main component for providing authentication. Bitmap indexes have recently seen lot of applications for accelerated query processing and many commercial databases implement such indexes. Bitmaps have not been previously used for a security goal. We show that the proposed schemes can match in both functionality and efficiency compared to the existing schemes. We also implement the schemes on a real database and provide extensive experimental studies on the schemes.

show abstract

“…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]. It employs the aggregate signature and Merkle hash chain to show the correctness of the result of the range query.…”

Section: Other Related Work On Database Securitymentioning

confidence: 99%

Address Permutation for Privacy-Preserving Searchable Symmetric Encryption

Choi¹

2012

ETRI J

View full text Add to dashboard Cite

This paper proposes a privacy-preserving database encryption scheme that provides access pattern hiding against a service provider. The proposed scheme uses a session key to permute indices of database records each time they are accessed. The proposed scheme can achieve access pattern hiding in situations in which an adversary cannot access the inside of the database directly, by separating the entity with an index table and data table and permuting

show abstract

Verifying Completeness of Relational Query Answers from Online Servers

Cited by 40 publications

References 36 publications

Authenticating multi‐dimensional query results in outsourced database

Authenticating multi‐dimensional query results in outsourced database

RDAS: A Symmetric Key Scheme for Authenticated Query Processing in Outsourced Databases

Address Permutation for Privacy-Preserving Searchable Symmetric Encryption

Contact Info

Product

Resources

About