Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

The Bright Side of Timed Opacity

  • Conference paper
  • First Online:
Formal Methods and Software Engineering (ICFEM 2024)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 15394))

Included in the following conference series:

  • 232 Accesses

Abstract

In 2009, Franck Cassez showed that the timed opacity problem, where an attacker can observe some actions with their timestamps and attempts to deduce information, is undecidable for timed automata (TAs). Moreover, he showed that the undecidability holds even for subclasses such as event-recording automata. In this article, we consider the same definition of opacity for several other subclasses of TAs: with restrictions on the number of clocks, of actions, on the nature of time, or on a new subclass called observable event-recording automata. We show that opacity can mostly be retrieved, except for one-action TAs and for one-clock TAs with \(\varepsilon \)-transitions, for which undecidability remains. We then exhibit a new decidable subclass in which the number of observations made by the attacker is limited.

This work is partially supported by ANR BisoUS (ANR-22-CE48-0012).

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 74.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

Similar content being viewed by others

Notes

  1. 1.

    See Sect. 5.5.

References

  1. Abdulla, P.A., Deneux, J., Ouaknine, J., Quaas, K., Worrell, J.: Universality analysis for one-clock timed automata. FI 89(4), 419–450 (2008)

    Google Scholar 

  2. Alur, R., Dill, D.L.: A theory of timed automata. TCS 126(2), 183–235 (1994). https://doi.org/10.1016/0304-3975(94)90010-8

    Article  Google Scholar 

  3. Alur, R., Fix, L., Henzinger, T.A.: Event-clock automata: a determinizable class of timed automata. TCS 211(1–2), 253–273 (1999). https://doi.org/10.1016/S0304-3975(97)00173-4

    Article  MathSciNet  Google Scholar 

  4. Alur, R., Henzinger, T.A., Vardi, M.Y.: Parametric real-time reasoning. In: Kosaraju, S.R., Johnson, D.S., Aggarwal, A. (eds.) STOC, pp. 592–601. ACM, New York (1993). https://doi.org/10.1145/167088.167242

  5. Ammar, I., El Touati, Y., Yeddes, M., Mullins, J.: Bounded opacity for timed systems. JISA 61, 1–13 (2021). https://doi.org/10.1016/j.jisa.2021.102926

    Article  Google Scholar 

  6. An, J., Gao, Q., Wang, L., Zhan, N., Hasuo, I.: The opacity of timed automata. In: Platzer, A., Rozier, K.Y., Pradella, M., Rossi, M. (eds.) FM. LNCS, vol. 14933, pp. 620–637. Springer (2024). https://doi.org/10.1007/978-3-031-71162-6_32

  7. André, É., Bolat, S., Lefaucheux, E., Marinho, D.: strategFTO: untimed control for timed opacity. In: Artho, C., Ölveczky, P. (eds.) FTSCS, pp. 27–33. ACM (2022). https://doi.org/10.1145/3563822.3568013

  8. André, É., Duflot-Krémer, M., Laversa, L., Lefaucheux, E.: Execution-time opacity control for timed automata. In: Madeira, A., Knapp, A. (eds.) SEFM (2024), to appear

    Google Scholar 

  9. André, É., Kryukov, A.: Parametric non-interference in timed automata. In: Li, Y., Liew, A. (eds.) ICECCS, pp. 37–42 (2020). https://doi.org/10.1109/ICECCS51672.2020.00012

  10. André, É., Lefaucheux, E., Lime, D., Marinho, D., Sun, J.: Configuring timing parameters to ensure execution-time opacity in timed automata. In: ter Beek, M.H., Dubslaff, C. (eds.) TiCSA. Electronic Proceedings in Theoretical Computer Science, vol. 392, pp. 1–26 (2023). https://doi.org/10.4204/EPTCS.392.1, invited paper

  11. André, É., Lefaucheux, E., Marinho, D.: Expiring opacity problems in parametric timed automata. In: Ait-Ameur, Y., Khendek, F. (eds.) ICECCS, pp. 89–98 (2023). https://doi.org/10.1109/ICECCS59891.2023.00020

  12. André, É., Lime, D., Marinho, D., Sun, J.: Guaranteeing timed opacity using parametric timed model checking. ToSEM 31(4), 1–36 (2022). https://doi.org/10.1145/3502851

    Article  Google Scholar 

  13. André, É., Dépernet, S., Lefaucheux, E.: The bright side of timed opacity (extended version). Technical report abs/2408.12240, arXiv, September 2024. http://arxiv.org/abs/2408.12240

  14. Arcile, J., André, É.: Timed automata as a formalism for expressing security: a survey on theory and practice. CSUR 55(6), 1–36 (2023). https://doi.org/10.1145/3534967

    Article  Google Scholar 

  15. Barbuti, R., Francesco, N.D., Santone, A., Tesei, L.: A notion of non-interference for timed automata. FI 51(1-2), 1–11 (2002)

    Google Scholar 

  16. Barbuti, R., Tesei, L.: A decidable notion of timed non-interference. FI 54(2-3), 137–150 (2003)

    Google Scholar 

  17. Benattar, G., Cassez, F., Lime, D., Roux, O.H.: Control and synthesis of non-interferent timed systems. IJC 88(2), 217–236 (2015). https://doi.org/10.1080/00207179.2014.944356

    Article  MathSciNet  Google Scholar 

  18. Bryans, J.W., Koutny, M., Mazaré, L., Ryan, P.Y.A.: Opacity generalised to transition systems. IseCure 7(6), 421–435 (2008). https://doi.org/10.1007/s10207-008-0058-x

    Article  Google Scholar 

  19. Cassez, F.: The dark side of timed opacity. In: Park, J.H., Chen, H., Atiquzzaman, M., Lee, C., Kim, T., Yeo, S. (eds.) ISA. LNCS, vol. 5576, pp. 21–30. Springer (2009). https://doi.org/10.1007/978-3-642-02617-1_3

  20. Dima, C.: Real-time automata. JALC 6(1), 3–23 (2001). https://doi.org/10.25596/jalc-2001-003

  21. Fearnley, J., Jurdzinski, M.: Reachability in two-clock timed automata is PSPACE-complete. I &C 243, 26–36 (2015). https://doi.org/10.1016/J.IC.2014.12.004

    Article  MathSciNet  Google Scholar 

  22. Gardey, G., Mullins, J., Roux, O.H.: Non-interference control synthesis for security timed automata. ENTCS 180(1), 35–53 (2007). https://doi.org/10.1016/j.entcs.2005.05.046

  23. Klein, J., Kogel, P., Glesner, S.: Verifying opacity of discrete-timed automata. In: Plat, N., Gnesi, S., Furia, C.A., Lopes, A. (eds.) FormaliSE, pp. 55–65. ACM (2024). https://doi.org/10.1145/3644033.3644376

  24. Mazar’e, L.: Using unification for opacity properties. In: Ryan, P. (ed.) WITS, pp. 165–176, April 2004

    Google Scholar 

  25. Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: closing a decidability gap. In: LICS, pp. 54–63. IEEE Computer Society (2004). https://doi.org/10.1109/LICS.2004.1319600

  26. Wang, L., Zhan, N.: Decidability of the initial-state opacity of real-time automata. In: Jones, C.B., Wang, J., Zhan, N. (eds.) Symposium on Real-Time and Hybrid Systems - Essays Dedicated to Professor Chaochen Zhou on the Occasion of His 80th Birthday, LNCS, vol. 11180, pp. 44–60. Springer (2018). https://doi.org/10.1007/978-3-030-01461-2_3

  27. Wang, L., Zhan, N., An, J.: The opacity of real-time automata. TCAD 37(11), 2845–2856 (2018). https://doi.org/10.1109/TCAD.2018.2857363

    Article  Google Scholar 

  28. Zhang, K.: State-based opacity of labeled real-time automata. TCS 987, 114373 (2024). https://doi.org/10.1016/J.TCS.2023.114373

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université Sorbonne Paris Nord, CNRS, Laboratoire d’Informatique de Paris Nord, LIPN, F-93430, Villetaneuse, France

    Étienne André

  2. Institut universitaire de France (IUF), Paris, France

    Étienne André

  3. Université de Bordeaux, Bordeaux, France

    Sarah Dépernet

  4. Université de Lorraine, CNRS, Inria, LORIA, 54000, Nancy, France

    Sarah Dépernet & Engel Lefaucheux

Authors
  1. Étienne André
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sarah Dépernet
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Engel Lefaucheux
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Étienne André .

Editor information

Editors and Affiliations

  1. JAIST, Ishikawa, Japan

    Kazuhiro Ogata

  2. University of Lorraine, Nancy, France

    Dominique Mery

  3. Peking University, Beijing, China

    Meng Sun

  4. Hiroshima University, Hiroshima, Japan

    Shaoying Liu

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

André, É., Dépernet, S., Lefaucheux, E. (2024). The Bright Side of Timed Opacity. In: Ogata, K., Mery, D., Sun, M., Liu, S. (eds) Formal Methods and Software Engineering. ICFEM 2024. Lecture Notes in Computer Science, vol 15394. Springer, Singapore. https://doi.org/10.1007/978-981-96-0617-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-981-96-0617-7_4

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-96-0616-0

  • Online ISBN: 978-981-96-0617-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation