Subject switching algorithms for access control in federated databases

Authors:
Jacqueline Yang;Duminda Wijesekera;Sushil Jajodia
Affiliations:
Center for Secure Information Systems, George Mason University, Fairfax, VA;Center for Secure Information Systems, George Mason University, Fairfax, VA;Center for Secure Information Systems, George Mason University, Fairfax, VA
Venue:
Das'01 Proceedings of the fifteenth annual working conference on Database and application security
Year:
2001

Citing 5
Cited 4

A federated architecture for information management

ACM Transactions on Information Systems (TOIS)
Federated database systems for managing distributed, heterogeneous, and autonomous databases

ACM Computing Surveys (CSUR) - Special issue on heterogeneous databases
Authorization specification and enforcement in federated database systems

Journal of Computer Security
Flexible support for multiple access control policies

ACM Transactions on Database Systems (TODS)
An Approach for Building Secure Database Federations

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases

Recent advances in access control models

Das'01 Proceedings of the fifteenth annual working conference on Database and application security
Orchestrating access control in peer data management systems

EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Secure collaboration in global design and supply chain environment: Problem analysis and literature review

Computers in Industry
Business Driven User Role Assignment: Nimble Adaptation of RBAC to Organizational Changes

International Journal of Information Security and Privacy

Quantified Score

Hi-index	0.00

Visualization

Abstract

Authentication in federated database systems present difficulties because the autonomously operated components may not know the identity of federation users. One proposed solution is subject switching, where the federation translates the federated users identity to that of an agreed upon component subject. This translation may be problematic, due to not having component subjects with the same accesses requested by federation users. Therefore, we propose using proximity measures between requested and provided accesses and present two policy neutral algorithms to find proximity minimizing matches between a federation subject and a collection of component subjects.