Trusted products evaluation

In data publishing, the owner delegates the role of satisfying user queries to a third-party publisher. As the publisher may be untrusted or susceptible to attacks, it could produce incorrect query results. In this paper, we introduce a scheme for users to verify that their query results are complete (i.e., no qualifying tuples are omitted) and authentic (i.e., all the result values originated from the owner). The scheme supports range selection on key and non-key attributes, project as well as join queries on relational databases. Moreover, the proposed scheme complies with access control policies, is computationally secure, and can be implemented efficiently.

show abstract

“…Those issues have been studied extensively (e.g. [9], [19], [25]) and are complementary to this work.…”

Section: System and Threat Modelsmentioning

confidence: 99%

Verifying completeness of relational query results in data publishing

Pang

Jain

Ramamritham

et al. 2005

Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data

215

203

View full text Add to dashboard Cite

show abstract

“…Different management standards exist, including TCSEC/Orange Book, GMITS, CobiT, IT Protection Manual, BS7799, GASSP, SSE-CMM, ITSEC (1990), CTCPEC, FC, CC, TNI, NCSC, EPL, TDI (see Abrams & Podell 1995, Chokhani 1992, Eloff & Solms 2000a. Some of these are more computer system-than organization oriented, such as the Common Criteria and the Orange Book, and are labelled as technical (Overbeek 1995).…”

Section: Normative Standardsmentioning

confidence: 99%

Information security management standards: Problems and solutions

Siponen

Willison

2009

Information & Management

243

113

View full text Add to dashboard Cite

show abstract

“…Those issues have been studied extensively (e.g., Chokani [1992], Neuman and Tso [1994], Sandhu and · 9: 7 Samarati [1994]). Any query answer verification mechanism must not compromise the access control policy.…”

Section: System and Threat Modelsmentioning

confidence: 99%

Verifying Completeness of Relational Query Answers from Online Servers

Pang

Tan

2008

ACM Trans. Inf. Syst. Secur.

View full text Add to dashboard Cite

The number of successful attacks on the Internet shows that it is very difficult to guarantee the security of online servers over extended periods of time. A breached server that is not detected in time may return incorrect query answers to users. In this article, we introduce authentication schemes for users to verify that their query answers from an online server are complete (i.e., no qualifying tuples are omitted) and authentic (i.e., all the result values are legitimate). We introduce a scheme that supports range selection, projection as well as primary key-foreign key join queries on relational databases. We also present authentication schemes for single-and multi-attribute range aggregate queries. The schemes complement access control mechanisms that rewrite queries dynamically, and are computationally secure. We have implemented the proposed schemes, and experiment results showed that they are practical and feasible schemes with low overheads.

show abstract

Trusted products evaluation

Cited by 42 publications

References 13 publications

Verifying completeness of relational query results in data publishing

Verifying completeness of relational query results in data publishing

Information security management standards: Problems and solutions

Verifying Completeness of Relational Query Answers from Online Servers

Contact Info

Product

Resources

About