메뉴 건너뛰기




Volumn 54, Issue 8, 2009, Pages 1961-1966

Modifying security policies for the satisfaction of intransitive non-interference

Author keywords

Formal verification; Infimal super language; Intransitive non interference; Maximal sub language; Observability; Security policies

Indexed keywords

FORMAL VERIFICATION; INFIMAL SUPER-LANGUAGE; INTRANSITIVE NON-INTERFERENCE; MAXIMAL SUB-LANGUAGE; SECURITY POLICIES;

EID: 68949196207     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2009.2023961     Document Type: Article
Times cited : (6)

References (21)
  • 1
    • 0003400251 scopus 로고
    • Secure Computer System: Unified Exposition and Multics Interpretation Mitre Corp, Bedford, MA
    • Tech. Rep. MTR-2997
    • D. Bell and L. LaPadula, Secure Computer System: Unified Exposition and Multics Interpretation Mitre Corp, Bedford, MA, Tech. Rep. MTR-2997, 1976.
    • (1976)
    • Bell, D.1    LaPadula, L.2
  • 2
    • 21344432090 scopus 로고    scopus 로고
    • Characterizing intransitive non-interference in security policies with observability
    • Jun
    • N. B. Hadj-Alouane, S. Lafrance, F. Lin, J. Mullins, and M. Yeddes, "Characterizing intransitive non-interference in security policies with observability," IEEE Trans. Automat. Control, vol. 50, no. 6, pp. 920-925, Jun. 2005.
    • (2005) IEEE Trans. Automat. Control , vol.50 , Issue.6 , pp. 920-925
    • Hadj-Alouane, N.B.1    Lafrance, S.2    Lin, F.3    Mullins, J.4    Yeddes, M.5
  • 5
    • 0013409602 scopus 로고
    • Supremal and maximal sublanguages arising in supervisor synthesis problem with partial observation
    • H. Cho and S. I. Marcus, "Supremal and maximal sublanguages arising in supervisor synthesis problem with partial observation," Math. Syst. Theory, vol. 22, pp. 177-211, 1989.
    • (1989) Math. Syst. Theory , vol.22 , pp. 177-211
    • Cho, H.1    Marcus, S.I.2
  • 7
    • 84974776068 scopus 로고
    • A classification of security properties for process algebras
    • R. Focardi and R. Gorrieri, "A classification of security properties for process algebras," J. Comput. Security, vol. 3, no. 1, pp. 5-33, 1995.
    • (1995) J. Comput. Security , vol.3 , Issue.1 , pp. 5-33
    • Focardi, R.1    Gorrieri, R.2
  • 10
    • 0023292228 scopus 로고
    • An experience using two covert channel analysis techniques on a real system design
    • Feb
    • J. T. Haigh, R. A. Kemmerer, J. McHugh, and W. D. Young, "An experience using two covert channel analysis techniques on a real system design," IEEE Trans. Software Eng., vol. SE-13, no. 2, pp. 157-168, Feb. 1987.
    • (1987) IEEE Trans. Software Eng , vol.SE-13 , Issue.2 , pp. 157-168
    • Haigh, J.T.1    Kemmerer, R.A.2    McHugh, J.3    Young, W.D.4
  • 11
    • 0023995784 scopus 로고
    • On observability of discrete-event systems
    • F. Lin and W. M. Wonham, "On observability of discrete-event systems," Inform. Sci., vol. 44, pp. 173-198, 1988.
    • (1988) Inform. Sci , vol.44 , pp. 173-198
    • Lin, F.1    Wonham, W.M.2
  • 12
    • 0002426876 scopus 로고    scopus 로고
    • A general theory of composition for a class of possibilistic properties
    • Jan
    • J. McLean, "A general theory of composition for a class of possibilistic properties," IEEE Trans. Software Eng., vol. 22, no. 1, pp. 53-66, Jan. 1996.
    • (1996) IEEE Trans. Software Eng , vol.22 , Issue.1 , pp. 53-66
    • McLean, J.1
  • 13
    • 0042361083 scopus 로고    scopus 로고
    • Nondeterministic admissible interference
    • J. Mullins, "Nondeterministic admissible interference," J. Universal Comput. Sci., vol. 6, no. 11, pp. 1054-1070, 2000.
    • (2000) J. Universal Comput. Sci , vol.6 , Issue.11 , pp. 1054-1070
    • Mullins, J.1
  • 14
    • 21344442637 scopus 로고    scopus 로고
    • Bisimulation-based non-deterministic admissible interference with applications to the analysis of cryptographic protocols
    • J. Mullins and S. Lafrance, "Bisimulation-based non-deterministic admissible interference with applications to the analysis of cryptographic protocols," in Int. J. Inform. Software Technol., pp. 1-25, 2002.
    • (2002) Int. J. Inform. Software Technol , pp. 1-25
    • Mullins, J.1    Lafrance, S.2
  • 15
    • 0025594567 scopus 로고
    • The infimal prefix-closed and observable superlanguage of a given language
    • K. Rudie and W. M. Wonham, "The infimal prefix-closed and observable superlanguage of a given language," Syst. Control Lett., vol. 15, pp. 361-371, 1990.
    • (1990) Syst. Control Lett , vol.15 , pp. 361-371
    • Rudie, K.1    Wonham, W.M.2
  • 18
    • 68949189451 scopus 로고
    • Transitivity and Channel-Control Security Policies SRI International, Menlo Park, CA
    • Tech. Rep. CSL-92-02
    • J. Rushby, Noninterference, Transitivity and Channel-Control Security Policies SRI International, Menlo Park, CA, Tech. Rep. CSL-92-02, 1992.
    • (1992)
    • Rushby, J.1    Noninterference2
  • 19
    • 0032646572 scopus 로고    scopus 로고
    • Process algebra and non-interference
    • Mordano, Italy, Jun
    • P. Ryan and S. Schneider, "Process algebra and non-interference," in Proc. CSFW-12, Mordano, Italy, Jun. 1999, pp. 214-227.
    • (1999) Proc. CSFW-12 , pp. 214-227
    • Ryan, P.1    Schneider, S.2
  • 20
    • 38049082649 scopus 로고    scopus 로고
    • What, indeed, is intransitive noninterference?
    • R. Van Der Meyden, "What, indeed, is intransitive noninterference?," in Proc. Comput. Security (ESORICS'07), 2008, vol. 4734, pp. 235-250.
    • (2008) Proc. Comput. Security (ESORICS'07) , vol.4734 , pp. 235-250
    • Van Der Meyden, R.1
  • 21
    • 35048854255 scopus 로고    scopus 로고
    • Information flow control revisited: Noninfluence.. noninterference + nonleakage
    • D. Von Oheimb, "Information flow control revisited: Noninfluence.. noninterference + nonleakage," in Proc. Computer Security (ESORICS'04), 2004, vol. 3193, pp. 225-243.
    • (2004) Proc. Computer Security (ESORICS'04) , vol.3193 , pp. 225-243
    • Von Oheimb, D.1


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