Authorization enforcement in distributed query evaluation

We present a simple, yet powerful, approach for the specification and enforcement of authorizations regulating data release among data holders collaborating in a distributed computation, to ensure that query processing discloses only data whose release has been explicitly authorized. Data disclosure is captured by means of profiles, associated with each data computation, that describe the information carried by a base or a derived (i.e., computed by a query) relation. We present an algorithm that, given a query plan, determines whether it can be safely executed and produces a safe execution strategy for it. For each operation in a safe query plan, the algorithm determines the server(s) responsible for the execution, based on the entailed information flows, considering different strategies for the execution of joins. Finally, we discuss the architecture of a distributed database system based on the proposed model, illustrating possible design choices and their impact.

[1]  Sabrina De Capitani di Vimercati,et al.  Access Control: Policies, Models, and Mechanisms , 2000, FOSAD.

[2]  Dean Daniels,et al.  Optimization of Nested Queries in a Distributed Relational Database , 1984, VLDB.

[3]  Ahmed K. Elmagarmid,et al.  Transaction Optimization Techniques , 1997, Advanced Transaction Models and Architectures.

[4]  Ioana Manolescu,et al.  Query optimization in the presence of limited access patterns , 1999, SIGMOD '99.

[5]  Eugene Wong,et al.  Query processing in a system for distributed databases (SDD-1) , 1981, TODS.

[6]  Vijayalakshmi Atluri,et al.  Privacy-preserving semantic interoperation and access control of heterogeneous databases , 2006, ASIACCS '06.

[7]  Sushil Jajodia,et al.  Assessing query privileges via safe and efficient permission composition , 2008, CCS.

[8]  Pierangela Samarati,et al.  Providing Security and Interoperation of Heterogeneous Systems , 2004, Distributed and Parallel Databases.

[9]  Alin Deutsch,et al.  Privacy in GLAV Information Integration , 2007, ICDT.

[10]  Georg Gottlob,et al.  Data exchange: computing cores in polynomial time , 2006, PODS '06.

[11]  Donald Kossmann,et al.  The state of the art in distributed query processing , 2000, CSUR.

[12]  Vijayalakshmi Atluri,et al.  A Credential-Based Approach for Facilitating Automatic Resource Sharing Among Ad-Hoc Dynamic Coalitions , 2005, DBSec.

[13]  N. Meyers,et al.  H = W. , 1964, Proceedings of the National Academy of Sciences of the United States of America.

[14]  Elisa Bertino,et al.  Views and Security in Distributed Database Management Systems , 1988, EDBT.

[15]  Sushil Jajodia,et al.  Controlled Information Sharing in Collaborative Distributed Query Processing , 2008, 2008 The 28th International Conference on Distributed Computing Systems.

[16]  Sabrina De Capitani di Vimercati,et al.  An Authorization Model for Federated Systems , 1996, ESORICS.

[17]  Clement T. Yu,et al.  Distributed query processing , 1984, CSUR.

[18]  Stefano Ceri,et al.  Distributed Databases: Principles and Systems , 1984 .

[19]  Murat Kantarcioglu,et al.  Sovereign Joins , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[20]  Andrea Calì,et al.  Querying Data under Access Limitations , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[21]  Chen Li,et al.  Computing complete answers to queries in the presence of limited access patterns , 2003, The VLDB Journal.

[22]  Philip S. Yu,et al.  On Optimal Site Assignment for Relations in the Distributed Database Environment , 1989, IEEE Trans. Software Eng..

[23]  Yu-Chi Ho,et al.  A methodology for interpreting tree queries into optimal semi-join expressions , 1980, SIGMOD '80.

[24]  Alfred V. Aho,et al.  The theory of joins in relational data bases , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[25]  Patricia G. Selinger,et al.  Access path selection in a relational database management system , 1979, SIGMOD '79.

[26]  Alin Deutsch,et al.  Rewriting queries using views with access patterns under integrity constraints , 2005, Theor. Comput. Sci..