Movatterモバイル変換


[0]ホーム

URL:


IEICE Transactions on Information and Systems
Online ISSN : 1745-1361
Print ISSN : 0916-8532
Special Section on Trust, Security and Privacy for Pervasive Applications
Consistency Checking of Safety and Availability in Access Control
Ruixuan LIJianfeng LUZhengding LUXiaopu MA
Author information
  • Ruixuan LI

    College of Computer Science and Technology, Huazhong University of Science and Technology

  • Jianfeng LU

    College of Computer Science and Technology, Huazhong University of Science and Technology

  • Zhengding LU

    College of Computer Science and Technology, Huazhong University of Science and Technology

  • Xiaopu MA

    College of Computer Science and Technology, Huazhong University of Science and Technology

Corresponding author

ORCID
Keywords:access control,availability,consistency checking,safety,separation-of-duty
JOURNALFREE ACCESS

2010 Volume E93.DIssue 3Pages 491-502

DOIhttps://doi.org/10.1587/transinf.E93.D.491
Details
  • Published: March 01, 2010Received: July 03, 2009Available on J-STAGE: March 01, 2010Accepted: -Advance online publication: -Revised: -
Download PDF(283K)
Download citationRIS

(compatible with EndNote, Reference Manager, ProCite, RefWorks)

BIB TEX

(compatible with BibDesk, LaTeX)

Text
How to download citation
Contact us
Article overview
Share
Abstract
The safety and availability policies are very important in an access control system for ensuring security and success when performing a certain task. However, conflicts may arise between safety and availability policies due to their opposite focuses. In this paper, we address the problem of consistency checking for safety and availability policies, especially for the co-existence of static separation-of-duty (SSoD) policies with availability policies, which determines whether there exists an access control state that satisfies all of these policies. We present criteria for determining consistency with a number of special cases, and show that the general case and partial subcases of the problem are intractable (NP-hard) and in the Polynomial Hierarchy NPNP. We design an algorithm to efficiently solve the nontrivial size instances for the intractable cases of the problem. The running example shows the validity of the proposed algorithm. The investigation will help the security officer to specify reasonable access control policies when both safety and availability policies coexist.
References (17)
Related articles (0)
Figures (0)
Content from these authors
Supplementary material (0)
Result List ()
Cited by (3)
© 2010 The Institute of Electronics, Information and Communication Engineers
Previous articleNext article
Favorites & Alerts
Related articles

Recently viewed articles
    Announcements from publisher
    • Readers can also download the PDF fromhttps://search.ieice.org/iss/
    • PayPerView service
    • Please contact trans-d [a] ieice.org, if you want to unlock PDF security.
    Share this page
    feedback
    Top

    Register with J-STAGE for free!

    Register

    Already have an account? Sign inhere


    [8]ページ先頭

    ©2009-2025 Movatter.jp