Skip to main content
SpringerLink
Log in

On Intransitive Non-interference in Some Models of Concurrency

  • Chapter
Foundations of Security Analysis and Design VI (FOSAD 2011)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 6858))

Included in the following conference series:

Abstract

Intransitive non-interference (INI for short) is a behavioural property extensively studied by Rushby over deterministic automata with outputs associated to transitions (Mealy machines) in order to discuss the security of systems where declassification of secret information is allowed. In this paper, we first propose a natural transposition of Rushby’s definition on deterministic labelled transition systems, we call INI as well, and then an alternative, yet more easily checkable, formulation of INI, called NI with downgraders (NID for short). We show how NID can be naturally extended to the case of nondeterministic automata by using a variation of it based on bisimulation equivalence (BNID). The most novel contribution of this paper is the extension of this theory on the class of Petri nets called elementary net systems: we propose a semi-static technique, called PBNID and based on the inspection of the net structure, that is shown to be equivalent to BNID.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Best, E., Darondeau, P., Gorrieri, R.: On the Decidability of Non Interference over Unbounded Petri Nets. EPTCS 51, 16–33 (2010); Procs. SecCo 2010

    Article  Google Scholar 

  2. Busi, N., Gorrieri, R.: A Survey on Non-Interference with Petri Nets. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol. 3098, pp. 328–344. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Busi, N., Gorrieri, R.: Positive Non-Interference in Elementary and Trace Nets. In: Cortadella, J., Reisig, W. (eds.) ICATPN 2004. LNCS, vol. 3099, pp. 1–16. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Busi, N., Gorrieri, R.: Structural Non-Interference in Elementary and Trace Nets. Mathematical Structures in Computer Science 19(6), 1065–1090 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bossi, A., Piazza, C., Rossi, S.: Modelling Downgrading in Information Flow Security. In: Procs. 17th IEEE Computer Security Foundations Workshop (CSFW 2004), pp. 187–201. IEEE Press, Los Alamitos (2004)

    Chapter  Google Scholar 

  6. Engelfriet, J., Rozenberg, G.: Elementary Net Systems. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 12–121. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  7. Focardi, R., Gorrieri, R.: A Classification of Security Properties. Journal of Computer Security 3(1), 5–33 (1995)

    Article  Google Scholar 

  8. Focardi, R., Gorrieri, R.: The Compositional Security Checker: A Tool for the Verification of Information Flow Security Properties. IEEE Transactions on Software Engineering 23(9), 550–571 (1997)

    Article  Google Scholar 

  9. Focardi, R., Gorrieri, R.: Classification of Security Properties (Part I: Information Flow). In: Focardi, R., Gorrieri, R. (eds.) FOSAD 2000. LNCS, vol. 2171, pp. 331–396. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Frau, S., Gorrieri, R., Ferigato, C.: Structural Noninterference at Work: the Petri Net Security Checker. In: Degano, P., Guttman, J., Martinelli, F. (eds.) FAST 2008. LNCS, vol. 5491, pp. 210–225. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  11. Hadj-Alouane, N.B., Lafrance, S., Lin, F., Mullins, J., Yeddes, M.M.: Characterizing Intransitive Noninterference for 3-Domain Security Policies With Observability. IEEE Transactions on Automatic Control 50(6), 920–925 (2005)

    Article  MathSciNet  Google Scholar 

  12. Hadj-Alouane, N.B., Lafrance, S., Lin, F., Mullins, J., Yeddes, M.M.: On the verification of intransitive noninterference in multilevel security. IEEE Transactions on Systems, Man, and Cybernetics, Part B 35(5), 948–958 (2005)

    Article  Google Scholar 

  13. Haigh, J.T., Young, W.D.: Extending the noninterference version of MLS for SAT. IEEE Trans. on Software Engineering SE-13(2), 141–150 (1987)

    Article  Google Scholar 

  14. Goguen, J.A., Meseguer, J.: Security Policy and Security Models. In: Proc. of Symposium on Security and Privacy (SSP 1982), pp. 11–20. IEEE CS Press, Los Alamitos (1982)

    Google Scholar 

  15. Goguen, J.A., Meseguer, J.: Unwinding and Inference Control. In: Proc. of Symposium on Security and Privacy (SSP 1984), pp. 75–86. IEEE CS Press, Los Alamitos (1984)

    Chapter  Google Scholar 

  16. Lafrance, S., Mullins, J.: Bisimulation-based Nondeterministic Admissible Interference and ita Applications to the Analysis of Cryptographic Protocols. Information and Software Technology 45(11), 779–790 (2003); Preliminary version in Electronic Notes in Theoretical Computer Science 61, 1–24 (2002)

    Article  Google Scholar 

  17. van der Meyden, R.: What, Indeed, Is Intransitive Noninterference? In: Biskup, J., López, J. (eds.) ESORICS 2007. LNCS, vol. 4734, pp. 235–250. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  18. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  19. Mullins, J.: Nondeterministic Admissible Interference. Journal of Universal Computer Science 11, 1054–1070 (2000)

    MATH  Google Scholar 

  20. Pinsky, S.: Absorbing Covers and Intransitive Noninterference. In: Proc. of IEEE Symposium on Security and Privacy (SSP 1995), pp. 102–113. IEEE CS press, Los Alamitos (1995)

    Chapter  Google Scholar 

  21. Pinsky, S., Zieglar, E.: Noninterference Equations for Nondeterministic Systems. In: Proc. of IEEE Computer Security Foundations Workshop (CSFW 2001), pp. 3–14. IEEE CS press, Los Alamitos (2001)

    Chapter  Google Scholar 

  22. Roscoe, A.W., Goldsmith, M.-H.: What is Intransitive Noninterference? In: Proc. of 12th Computer Security Foundations Workshop (CSFW), pp. 228–238. IEEE CS Press, Los Alamitos (1999)

    Chapter  Google Scholar 

  23. Rushby, J.: Noninterference, Transitivity, and Channel-control Security Policies. Technical Report CSL-92-02, SRI International (1992)

    Google Scholar 

  24. Ryan, P.Y.A.: Mathematical Models of Computer Security. In: Focardi, R., Gorrieri, R. (eds.) FOSAD 2000. LNCS, vol. 2171, pp. 1–62. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  25. Ryan, P.Y.A., Schneider, S.: Process Algebra and Noninterference. In: Proc. of 12th Computer Security Foundations Workshop (CSFW), pp. 214–227. IEEE CS Press, Los Alamitos (1999)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze dell’Informazione, Università di Bologna, Mura A. Zamboni, 7, 40127, Bologna, Italy

    Roberto Gorrieri & Matteo Vernali

Authors
  1. Roberto Gorrieri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matteo Vernali
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Scienze di Base e Fondamenti, Università degli Studi di Urbino “Carlo Bo”, Piazza della Repubblica 13, 61029, Urbino, Italy

    Alessandro Aldini

  2. Dipartimento di Scienze dell’Informazione, Università degli Studi di Bologna, Mura Anteo Zamboni 7, 40127, Bologna, Italy

    Roberto Gorrieri

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Gorrieri, R., Vernali, M. (2011). On Intransitive Non-interference in Some Models of Concurrency. In: Aldini, A., Gorrieri, R. (eds) Foundations of Security Analysis and Design VI. FOSAD 2011. Lecture Notes in Computer Science, vol 6858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23082-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23082-0_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23081-3

  • Online ISBN: 978-3-642-23082-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation