메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 133-138

Policy analysis for administrative role based access control

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; SECURITY OF DATA; USER INTERFACES;

EID: 33947695249     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSFW.2006.22     Document Type: Conference Paper
Times cited : (75)

References (30)
  • 1
    • 21144450607 scopus 로고    scopus 로고
    • International Committee for Information Technology Standards (INCITS). Role-based access control
    • American National Standards Institute ANSI, Feb
    • American National Standards Institute (ANSI), International Committee for Information Technology Standards (INCITS). Role-based access control. ANSI INCITS Standard 359-2904, Feb. 2004.
    • (2004) ANSI INCITS Standard 359-2904
  • 2
    • 4243434006 scopus 로고
    • Parallel non-binary planning in polynomial time
    • C. Bäckström and I. Klein. Parallel non-binary planning in polynomial time. In Proc. IJCAI '91, pages 268-273, 1991.
    • (1991) Proc. IJCAI '91 , pp. 268-273
    • Bäckström, C.1    Klein, I.2
  • 3
    • 0029405902 scopus 로고
    • Complexity results for SAS+ planning
    • C. Bäckström and B. Nebel. Complexity results for SAS+ planning. Computational Intelligence, 11(4):625-656, 1995.
    • (1995) Computational Intelligence , vol.11 , Issue.4 , pp. 625-656
    • Bäckström, C.1    Nebel, B.2
  • 6
    • 0028498153 scopus 로고
    • The computational complexity of prepositional STRIPS planning
    • T. Bylander. The computational complexity of prepositional STRIPS planning. Artificial Intelligence, 69(1-2):165-204, 1994.
    • (1994) Artificial Intelligence , vol.69 , Issue.1-2 , pp. 165-204
    • Bylander, T.1
  • 18
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • Plenum
    • R. M. Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations, pages 85-103. Plenum, 1972.
    • (1972) Complexity of Computer Computations , pp. 85-103
    • Karp, R.M.1
  • 21
    • 30544438141 scopus 로고    scopus 로고
    • Beyond proof-of-compliance: Security analysis in trust management
    • To appear
    • N. Li, J. C. Mitchell, and W. H. Winsborough. Beyond proof-of-compliance: Security analysis in trust management. Journal of the ACM, 2005. To appear.
    • (2005) Journal of the ACM
    • Li, N.1    Mitchell, J.C.2    Winsborough, W.H.3
  • 23
    • 0017512599 scopus 로고
    • A linear time algorithm for deciding subject security
    • R. J. Lipton and L. Snyder. A linear time algorithm for deciding subject security. J. ACM, 24(3):455-464, 1977.
    • (1977) J. ACM , vol.24 , Issue.3 , pp. 455-464
    • Lipton, R.J.1    Snyder, L.2
  • 24
    • 0023999796 scopus 로고
    • The schematic protection model: Its definition and analysis for acyclic attenuating schemes
    • R. Sandhu. The schematic protection model: its definition and analysis for acyclic attenuating schemes. Journal of the ACM, 35(2):404-432, 1988.
    • (1988) Journal of the ACM , vol.35 , Issue.2 , pp. 404-432
    • Sandhu, R.1
  • 26
    • 0001549660 scopus 로고    scopus 로고
    • The ARBAC97 model for role-based administration of roles
    • R. Sandhu, V. Bhamidipati, and Q. Munawer. The ARBAC97 model for role-based administration of roles. ACM Trans. Inf. Syst. Secur., 2(1):105-135, 1999.
    • (1999) ACM Trans. Inf. Syst. Secur , vol.2 , Issue.1 , pp. 105-135
    • Sandhu, R.1    Bhamidipati, V.2    Munawer, Q.3
  • 28
    • 33947682238 scopus 로고    scopus 로고
    • Policy analysis for administrative role-based access control
    • Technical report, Stony Brook University, Available from
    • A. Sasturkar, P. Yang, S. D. Stoller, and C. R. Ramakrishnan. Policy analysis for administrative role-based access control. Technical report, Stony Brook University, 2006. Available from http://www.cs.sunysb.edu/~stoller/arbac. html.
    • (2006)
    • Sasturkar, A.1    Yang, P.2    Stoller, S.D.3    Ramakrishnan, C.R.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.