메뉴 건너뛰기




Volumn 4266 LNCS, Issue , 2006, Pages 405-420

The complexity of discretionary access control

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION THEORY; POLYNOMIALS; PROBLEM SOLVING;

EID: 33845263495     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11908739_29     Document Type: Conference Paper
Times cited : (11)

References (10)
  • 7
    • 85032484015 scopus 로고
    • The complexity of graph problems for succinctly represented graphs
    • Proc. of Graph-Theoretic Concepts in Computer Science
    • Antonio Lozano and José L. Balcazár. The complexity of graph problems for succinctly represented graphs. In Proc. of Graph-Theoretic Concepts in Computer Science, volume 441 of Lecture Notes in Computer Science, pages 277-285, 1990.
    • (1990) Lecture Notes in Computer Science , vol.441 , pp. 277-285
    • Lozano, A.1    Balcazár, J.L.2
  • 8
    • 84884311106 scopus 로고    scopus 로고
    • Configuring role-based access control to enforce mandatory and discretionary access control policies
    • Sylvia Osborn, Ravi Sandhu, and Qamar Munawer. Configuring role-based access control to enforce mandatory and discretionary access control policies. ACM Transactions on Information and System Security (TISSEC), 3(2):85-106, 2000.
    • (2000) ACM Transactions on Information and System Security (TISSEC) , vol.3 , Issue.2 , pp. 85-106
    • Osborn, S.1    Sandhu, R.2    Munawer, Q.3
  • 10
    • 3543115068 scopus 로고    scopus 로고
    • A layered design of discretionary access controls with decidable properties
    • Jon A. Solworth and Robert H. Sloan. A layered design of discretionary access controls with decidable properties. In Proc. IEEE Symp. Security and Privacy, pages 56-67, 2004.
    • (2004) Proc. IEEE Symp. Security and Privacy , pp. 56-67
    • Solworth, J.A.1    Sloan, R.H.2


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