Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Distributed Secret Securing in Discrete-Event Systems (2402.08878v1)

Published 14 Feb 2024 in eess.SY and cs.SY

Abstract: In this paper, we study a security problem of protecting secrets in distributed systems. Specifically, we employ discrete-event systems to describe the structure and behaviour of distributed systems, in which global secret information is separated into pieces and stored in local component agents. The goal is to prevent such secrets from being exposed to intruders by imposing appropriate protection measures. This problem is formulated as to ensure that at least one piece of every distributed global secret is secured by a required number of protections, while the overall cost to apply protections is minimum. We first characterize the solvability of this security problem by providing a necessary and sufficient condition, and then develop an algorithm to compute a solution based on the supervisory control theory of discrete-event systems. Finally, we illustrate the effectiveness of our solution with an example system comprising distributed databases.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (20)
  1. K. Scarfone, W. Jansen, M. Tracy, et al., “Guide to general server security,” NIST Special Publication, vol. 800, no. 123, 2008.
  2. T. Kulik, B. Dongol, P. G. Larsen, H. D. Macedo, S. Schneider, P. W. V. Tran-Jørgensen, and J. Woodcock, “A survey of practical formal methods for security,” Formal Aspects of Computing, vol. 34, no. 1, pp. 1–39, 2022.
  3. J. W. Bryans, M. Koutny, and P. Y. Ryan, “Modelling opacity using Petri nets,” Electronic Notes in Theoretical Computer Science, vol. 121, pp. 101–115, 2005.
  4. A. Saboori and C. N. Hadjicostis, “Notions of security and opacity in discrete event systems,” in IEEE Conference on Decision and Control, 2007, pp. 5056–5061.
  5. F. Lin, “Opacity of discrete event systems and its applications,” Automatica, vol. 47, no. 3, pp. 496–503, 2011.
  6. J. Balun and T. Masopust, “On verification of weak and strong k-step opacity for discrete-event systems,” IFAC-PapersOnLine, vol. 55, no. 28, pp. 108–113, 2022.
  7. A. Labed, I. Saadaoui, N. Wu, J. Yu, and Z. Li, “Current-state opacity verification in discrete event systems using an observer net,” Scientific Reports, vol. 12, 2022.
  8. X. Han, K. Zhang, J. Zhang, Z. Li, and Z. Chen, “Strong current-state and initial-state opacity of discrete-event systems,” Automatica, vol. 148, 2023.
  9. J. Dubreil, P. Darondeau, and H. Marchand, “Opacity enforcing control synthesis,” in International Workshop on Discrete Event Systems, 2008, pp. 28–35.
  10. A. Saboori and C. N. Hadjicostis, “Opacity-enforcing supervisory strategies via state estimator constructions,” IEEE Transactions on Automatic Control, vol. 57, no. 5, pp. 1155–1165, 2012.
  11. M. Wakaiki, P. Tabuada, and J. P. Hespanha, “Supervisory control of discrete-event systems under attacks,” Dynamic Games and Applications, vol. 9, no. 4, pp. 965–983, 2018.
  12. L. K. Carvalho, Y.-C. Wu, R. Kwong, and S. Lafortune, “Detection and prevention of actuator enablement attacks in supervisory control systems,” in International Workshop on Discrete Event Systems, 2016, pp. 298–305.
  13. A. Paoli and F. Lin, “Decentralized opacity of discrete event systems,” in American Control Conference, 2012, pp. 6083–6088.
  14. B. Wu, J. Dai, and H. Lin, “Synthesis of insertion functions to enforce decentralized and joint opacity properties of discrete-event systems,” in American Control Conference, 2018, pp. 3026–3031.
  15. Y. Tong, K. Cai, and A. Giua, “Decentralized opacity enforcement in discrete event systems using supervisory control,” in Annual Conference of the Society of Instrument and Control Engineers of Japan, 2018, pp. 1053–1058.
  16. Y. Tong and H. Lan, “Current-state opacity verification in modular discrete event systems,” in IEEE Conference on Decision and Control, 2019, pp. 7665–7670.
  17. S. Matsui and K. Cai, “Secret securing with multiple protections and minimum costs,” in IEEE Conference on Decision and Control, 2019, pp. 7635–7640.
  18. S. Matsui and K. Cai, “Usability aware secret protection with minimum cost,” Nonlinear Analysis: Hybrid Systems, vol. 43, 2021.
  19. Z. Ma and K. Cai, “Optimal secret protections in discrete-event systems,” IEEE Transactions on Automatic Control, vol. 67, no. 6, pp. 2816–2828, 2021.
  20. Z. Ma, J. Jiang, and K. Cai, “Secret protections with costs and disruptiveness in discrete-event systems using centralities,” IEEE Transactions on Automatic Control (Early Access), pp. 1–16, 2023.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now