ACM Home Page
Please provide us with feedback. Feedback
Safety in discretionary access control for logic-based publish-subscribe systems
Full text PdfPdf (522 KB)
Source
Symposium on Access Control Models and Technologies archive
Proceedings of the 14th ACM symposium on Access control models and technologies table of contents
Stresa, Italy
SESSION: Security analysis and verification table of contents
Pages 3-12  
Year of Publication: 2009
ISBN:978-1-60558-537-6
Authors
Kazuhiro Minami  University of Illinois at Urbana-Champaign, Urbana, IL, USA
Nikita Borisov  University of Illinois at Urbana-Champaign, Urbana, IL, USA
Carl A. Gunter  University of Illinois at Urbana-Champaign, Urbana, IL, Uae
Sponsors
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 60,   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/1542207.1542211
What is a DOI?

ABSTRACT

Publish-subscribe (pub-sub) systems are useful for many applications, including pervasive environments. In the latter context, however, great care must be taken to preserve the privacy of sensitive information, such as users' location and activities. Traditional access control schemes provide at best a partial solution, since they do not capture potential inference regarding sensitive data that a subscriber may make. We propose a logic-based pub-sub system, where inference rules are used to both derive high-level events for use in applications as well as specify potentially harmful inferences that could be made regarding data. We provide a formal definition of safety in such a system that captures the possibility of indirect information flows. We show that the safety problem is co-NP-complete; however, problems of realistic size can be reduced to a satisfiability problem that can be efficiently decided by a SAT solver.


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
Sat4j: Bringing the power of sat technology to the java platform, http://www.sat4j.org/.
2
 
3
Guanling Chen, Ming Li, and David Kotz. Design and implementation of a large-scale context fusion network. In Proceedings of the International Conference on Mobile and Ubiquitous Systems: Networking and Services, pages 246--255, August 2004.
 
4
 
5
6
7
 
8
 
9
 
10
 
11
 
12
 
13
Shwetak N. Patel, Thomas Robertson, Julie A. Kientz1, Matthew S. Reynolds1, and Gregory D. Abowd. At the flick of a switch: Detecting and classifying unique electrical events on the residential power line. In Proceedings of the international conference on Ubiquitous computing, pages 271--288, New York, NY, USA, 2007. ACM.
 
14
 
15
 
16
 
17
 
18
David Sutherland. A model of information. In Proceedings of the National Computer Security Conference, pages 175--183, September 1986.
 
19
William H. Winsborough and Ninghui Li. Safety in automated trust negotiation. In Proceedings of the 2004 IEEE Symposium on Security and Privacy, pages 147--160. IEEE Computer Society, May 2004.
 
20

Collaborative Colleagues:
Kazuhiro Minami: colleagues
Nikita Borisov: colleagues
Carl A. Gunter: colleagues