loading...
Exploiting Information Relationships for Access Control
Kauai Island, Hawaii March 08-March 12
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PERCOM.2005.19Third IEEE International Conference o ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Urs Hengartner, Carnegie Mellon University
Peter Steenkiste, Carnegie Mellon University
Pervasive computing environments offer a multitude of information services that provide potentially complex types of information. Therefore, when running access control for sensitive information, these environments need to take relationships between information into account. Other approaches to relationship-aware access control (e.g., based on Semantic Web rule engines) are often expensive and based on a centralized design. In this paper, we identify three types of information relationships (bundling-based, combination-based, and granularity-based) that are common and important in pervasive computing, and we integrate support for them in a distributed, certificate-based access control architecture. In our approach, access control is fully distributed while sophisticated rule engines can still be used to deal with more complex access control cases. To demonstrate the feasibility of our design, we give a complexity analysis of the architecture and a performance analysis of a prototype implementation.
Citation:
Urs Hengartner, Peter Steenkiste, "Exploiting Information Relationships for Access Control," percom, pp.269-278, Third IEEE International Conference on Pervasive Computing and Communications (PerCom'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.