ACM Home Page
Please provide us with feedback. Feedback
Extending query rewriting techniques for fine-grained access control
Full text PdfPdf (173 KB)
Source International Conference on Management of Data archive
Proceedings of the 2004 ACM SIGMOD international conference on Management of data table of contents
Paris, France
SESSION: Research sessions: security and privacy table of contents
Pages: 551 - 562  
Year of Publication: 2004
ISBN:1-58113-859-8
Authors
Shariq Rizvi  University of California, Berkeley
Alberto Mendelzon  University of Toronto
S. Sudarshan  Indian Institute of Technology, Bombay
Prasan Roy  IBM Indian Research Laboratory
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 22,   Downloads (12 Months): 124,   Citation Count: 30
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1007568.1007631
What is a DOI?

ABSTRACT

Current day database applications, with large numbers of users, require fine-grained access control mechanisms, at the level of individual tuples, not just entire relations/views, to control which parts of the data can be accessed by each user. Fine-grained access control is often enforced in the application code, which has numerous drawbacks; these can be avoided by specifying/enforcing access control at the database level. We present a novel fine-grained access control model based on authorization views that allows "authorization-transparent" querying; that is, user queries can be phrased in terms of the database relations, and are valid if they can be answered using only the information contained in these authorization views. We extend earlier work on authorization-transparent querying by introducing a new notion of validity, conditional validity. We give a powerful set of inference rules to check for query validity. We demonstrate the practicality of our techniques by describing how an existing query optimizer can be extended to perform access control checks by incorporating these inference rules.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
The Virtual Private Database in Oracle9ir2: An Oracle Technical White Paper http://otn.oracle.com/deploy/security/oracle9ir2/pdf/vpd9ir2twp.pdf.
2
 
3
 
4
 
5
 
6
7
8
 
9
D. Denning. Commutative filters for reducing inference threats in multilevel database systems. In IEEE Symp. on Security and Privacy, pages 134--146, 1985.
10
11
12
 
13
 
14
 
15
16
17
18
 
19
 
20
 
21
 
22
A. Rosenthal and E. Sciore. View security as the basis for data warehouse security. In Intl. Workshop on Design and Management of Data Warehouses (DMDW), 2000.
 
23
A. Rosenthal and E. Sciore. Administering permissions for distributed data: Factoring and automated inference. In IFIP 11.3 Working Conf. in Database Security, 2001.
 
24
25
 
26
27
28

CITED BY  30
Collaborative Colleagues:
Shariq Rizvi: colleagues
Alberto Mendelzon: colleagues
S. Sudarshan: colleagues
Prasan Roy: colleagues