메뉴 건너뛰기




Volumn , Issue , 2007, Pages 445-455

Efficient policy analysis for administrative role based access control

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS ALGORITHMS; INPUT SIZE; PARAMETERIZED COMPLEXITY; POLICY ANALYSIS; POLYNOMIAL COMPLEXITY; REACHABILITY; ROLE-BASED ACCESS CONTROL;

EID: 77952403780     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1315245.1315300     Document Type: Conference Paper
Times cited : (98)

References (31)
  • 1
    • 77952396623 scopus 로고    scopus 로고
    • American National Standards Institute ANSI, International Committee for Information Technology Standards INCITS. Role-based access control. ANSI INCITS Standard 359-2004, Feb
    • American National Standards Institute (ANSI), International Committee for Information Technology Standards (INCITS). Role-based access control. ANSI INCITS Standard 359-2004, Feb. 2004.
    • (2004)
  • 6
    • 0000134883 scopus 로고
    • Fixed-parameter tractability and completeness I: Basic results
    • R. G. Downey and M. R. Fellows. Fixed-parameter tractability and completeness I: Basic results. SIAM Journal on Computing, 24 (4):873-921, 1995.
    • (1995) SIAM Journal on Computing , vol.24 , Issue.4 , pp. 873-921
    • Downey, R.G.1    Fellows, M.R.2
  • 19
    • 30544438141 scopus 로고    scopus 로고
    • Beyond proof-of-compliance: Security analysis in trust management
    • N. Li, J. C. Mitchell, and W. H. Winsborough. Beyond proof-of-compliance: Security analysis in trust management. Journal of the ACM, 52 (3):474-514, 2005.
    • (2005) Journal of the ACM , vol.52 , Issue.3 , pp. 474-514
    • Li, N.1    Mitchell, J.C.2    Winsborough, W.H.3
  • 21
    • 0016592810 scopus 로고
    • Reduction: A method of proving properties of parallel programs
    • R. J. Lipton. Reduction: A method of proving properties of parallel programs. Communications of the ACM, 18 (12):717-721, 1975.
    • (1975) Communications of the ACM , vol.18 , Issue.12 , pp. 717-721
    • Lipton, R.J.1
  • 22
    • 0017512599 scopus 로고
    • A linear time algorithm for deciding subject security
    • July
    • R. J. Lipton and L. Snyder. A linear time algorithm for deciding subject security. J. ACM, 24 (3):455-464, July 1977.
    • (1977) J. ACM , vol.24 , Issue.3 , pp. 455-464
    • Lipton, R.J.1    Snyder, L.2
  • 31
    • 77952398111 scopus 로고    scopus 로고
    • www.cs.stonybrook.edu/~stoller/ccs2007/.


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