ACM Home Page
Please provide us with feedback. Feedback
Assessing query privileges via safe and efficient permission composition
Full text PdfPdf (1.14 MB)
Source
Conference on Computer and Communications Security archive
Proceedings of the 15th ACM conference on Computer and communications security table of contents
Alexandria, Virginia, USA
SESSION: Access control table of contents
Pages 311-322  
Year of Publication: 2008
ISBN:978-1-59593-810-7
Authors
Sabrina De Capitani di Vimercati  Universita' di Milano, Crema (CR), Italy
Sara Foresti  Universita' di Milano, Crema (CR), Italy
Sushil Jajodia  George Mason University, Fairfax, VA, USA
Stefano Paraboschi  Universita' di Bergamo, Dalmine (BG), Italy
Pierangela Samarati  Universita' di Milano, Crema (CR), Italy
Sponsors
ACM: Association for Computing Machinery
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 24,   Downloads (12 Months): 149,   Citation Count: 0
Additional Information:

abstract   references   index terms   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/1455770.1455810
What is a DOI?

ABSTRACT

We propose an approach for the selective enforcement of access control restrictions in, possibly distributed, large data collections based on two basic concepts: i) flexible authorizations identify, in a declarative way, the data that can be released, and ii) queries are checked for execution not with respect to individual authorizations but rather evaluating whether the information release they (directly or indirectly) entail is allowed by the authorizations. Our solution is based on the definition of query profiles capturing the information content of a query and builds on a graph-based modeling of database schema, authorizations, and queries. Access control is then effectively modeled and efficiently executed in terms of graph coloring and composition and on traversal of graph paths. We then provide a polynomial composition algorithm for determining if a query is authorized.


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
2
 
3
P. Atzeni, S. Ceri, S. Paraboschi, and R. Torlone. Database Systems -- Concepts, Languages and Architectures. McGraw-Hill Book Company, 1999.
4
 
5
A. Cali' and D. Martinenghi. Querying data under access limitations. In Proc. of ICDE 2008, Cancun, Mexico, April 2008.
 
6
S. Dawson, S. De Capitani di Vimercati, P. Lincoln, and P. Samarati. Maximizing sharing of protected information. Journal of Computer and System Sciences, 64(3):496--541, May 2002.
 
7
 
8
A. Deutsch, B. Ludascher, and A. Nash. Rewriting queries using views with access patterns under integrity constraints. In Proc. of ICDT 2005, Edinburgh, UK, January 2005.
9
10
11
 
12
13
 
14
 
15
A. Nash and A. Deutsch. Privacy in GLAV information integration. In Proc. of ICDT 2007, Barcelona, Spain, January 2007.
16
 
17
A. Rosenthal and E. Sciore. View security as the basis for data warehouse security. In Proc. of DMDW'2000, Stockholm, Sweden, June 2000.
 
18

Collaborative Colleagues:
Sabrina De Capitani di Vimercati: colleagues
Sara Foresti: colleagues
Sushil Jajodia: colleagues
Stefano Paraboschi: colleagues
Pierangela Samarati: colleagues