Skip to main content

Process Opacity for Timed Process Algebra

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8974))

Abstract

A new security concept called process opacity is formalized and studied. For processes which are process opaque with respect to a given predicate over processes, an intruder cannot learn validity of this predicate for any subsequent state of computation. We discuss different extensions of this concept as well as its properties. We put some restrictions on predicates in such a way that we obtain decidable security properties.

Work supported by the grant VEGA 1/1333/12.

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

Buying options

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 EPUB and 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

Learn about institutional subscriptions

References

  1. Bryans, J., Koutny, M., Ryan, P.: Modelling non-deducibility using Petri Nets. In: Proceedings of the 2nd International Workshop on Security Issues with Petri Nets and Other Computational Models (2004)

    Google Scholar 

  2. Bryans, J.W., Koutny, M., Mazaré, L., Ryan, P.Y.A.: Opacity generalised to transition systems. In: Dimitrakos, T., Martinelli, F., Ryan, P.Y.A., Schneider, S. (eds.) FAST 2005. LNCS, vol. 3866, pp. 81–95. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Focardi, R., Gorrieri, R., Martinelli, F.: Information flow analysis in a discrete-time process algebra. In: Proceedings of 13th Computer Security Foundation Workshop. IEEE Computer Society Press (2000)

    Google Scholar 

  4. Gorrieri, R., Martinelli, F.: A simple framework for real-time cryptographic protocol analysis with compositional proof rules. Sci. Comput. Program. 50(1–3), 23–49 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  5. Goguen, J.A., Meseguer, J.: Security policies and security Models. In: Proceedings of IEEE Symposium on Security and Privacy (1982)

    Google Scholar 

  6. Groote, J.F.: Transition system specifications with negative premises. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 332–341. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  7. Gruska, D.P.: Informational analysis of security and integrity. Fundamenta Informaticae 120(3–4), 295–309 (2012)

    MATH  MathSciNet  Google Scholar 

  8. Test based security: Concurrency, Specification and Verification CS&P 2012, Berlin, vol. 1 (2012)

    Google Scholar 

  9. Gruska, D.P.: Process algebra contexts and security properties. Fundamenta Informaticae 102(1), 63–76 (2010)

    MATH  MathSciNet  Google Scholar 

  10. Gruska, D.P.: Observation based system security. Fundamenta Informaticae 79(3–4), 335–346 (2007)

    MATH  MathSciNet  Google Scholar 

  11. Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. In: Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, ACM (1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Damas P. Gruska .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gruska, D.P. (2015). Process Opacity for Timed Process Algebra. In: Voronkov, A., Virbitskaite, I. (eds) Perspectives of System Informatics. PSI 2014. Lecture Notes in Computer Science(), vol 8974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46823-4_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-46823-4_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-46822-7

  • Online ISBN: 978-3-662-46823-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics