{"title":"Verifying information flow properties of hybrid systems","authors":"P. Prabhakar, Boris Köpf","doi":"10.1145/2461446.2461458","DOIUrl":"https://doi.org/10.1145/2461446.2461458","url":null,"abstract":"In this paper, we study the problem of analyzing information flow properties of hybrid systems. We begin by formalizing non-interference -- the baseline information flow property -- for hybrid systems. We then present a type system for statically enforcing non-interference, together with a proof of soundness. We conclude with discussions on future work towards analyzing more permissive information flow properties.","PeriodicalId":203753,"journal":{"name":"International Conference on High Confidence Networked Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126077092","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yasser Shoukry, José Araújo, P. Tabuada, M. Srivastava, K. Johansson
{"title":"Minimax control for cyber-physical systems under network packet scheduling attacks","authors":"Yasser Shoukry, José Araújo, P. Tabuada, M. Srivastava, K. Johansson","doi":"10.1145/2461446.2461460","DOIUrl":"https://doi.org/10.1145/2461446.2461460","url":null,"abstract":"The control of physical systems is increasingly being done by resorting to networks to transmit information from sensors to controllers and from controllers to actuators. Unfortunately, this reliance on networks also brings new security vulnerabilities for control systems. We study the extent to which an adversary can attack a physical system by tampering with the temporal characteristics of the network, leading to time-varying delays and more importantly by changing the order in which packets are delivered. We show that such attack can destabilize a system if the controller was not designed to be robust with respect to an adversarial scheduling of messages. Although one can always store delayed messages in a buffer so as to present them to the control algorithm in the order they were sent and with a constant delay, such design is overly conservative. Instead, we design a controller that makes the best possible use of the received packets in a minimax sense. The proposed design has the same worst case performance as a controller based on a buffer but has better performance whenever there is no attack or the attacker does not play the optimal attack strategy.","PeriodicalId":203753,"journal":{"name":"International Conference on High Confidence Networked Systems","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129813024","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Verifiably-safe software-defined networks for CPS","authors":"R. Skowyra, A. Lapets, Azer Bestavros, A. Kfoury","doi":"10.1145/2461446.2461461","DOIUrl":"https://doi.org/10.1145/2461446.2461461","url":null,"abstract":"Next generation cyber-physical systems (CPS) are expected to be deployed in domains which require scalability as well as performance under dynamic conditions. This scale and dynamicity will require that CPS communication networks be programmatic (i.e., not requiring manual intervention at any stage), but still maintain iron-clad safety guarantees. Software-defined networking standards like Openflow provide a means for scalably building tailor-made network architectures, but there is no guarantee that these systems are safe, correct, or secure. In this work we propose a methodology and accompanying tools for specifying and modeling distributed systems such that existing formal verification techniques can be transparently used to analyze critical requirements and properties prior to system implementation. We demonstrate this methodology by iteratively modeling and verifying an Openflow learning switch network with respect to network correctness, network convergence, and mobility-related properties.\u0000 We posit that a design strategy based on the complementary pairing of software-defined networking and formal verification would enable the CPS community to build next-generation systems without sacrificing the safety and reliability that these systems must deliver.","PeriodicalId":203753,"journal":{"name":"International Conference on High Confidence Networked Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123396701","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sibin Mohan, Stanley Bak, E. Betti, H. Yun, L. Sha, M. Caccamo
{"title":"S3A: secure system simplex architecture for enhanced security and robustness of cyber-physical systems","authors":"Sibin Mohan, Stanley Bak, E. Betti, H. Yun, L. Sha, M. Caccamo","doi":"10.1145/2461446.2461456","DOIUrl":"https://doi.org/10.1145/2461446.2461456","url":null,"abstract":"The recently discovered 'W32.Stuxnet' worm has drastically changed the perception that systems managing critical infrastructure are invulnerable to software security attacks. Here we present an architecture that enhances the security of safety-critical cyber-physical systems despite the presence of such malware. Our architecture uses the property that control systems have deterministic real-time) execution behavior to detect an intrusion within 0.6 μs while still guaranteeing the safety of the plant. We also show that even if an attacker is successful (or gains access to the operating system's administrative privileges), the overall state of the physical system still remains safe.","PeriodicalId":203753,"journal":{"name":"International Conference on High Confidence Networked Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131066786","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Future cars: necessity for an adaptive and distributed multiple independent levels of security architecture","authors":"A. Camek, C. Buckl, A. Knoll","doi":"10.1145/2461446.2461450","DOIUrl":"https://doi.org/10.1145/2461446.2461450","url":null,"abstract":"Current automotive systems contain security solutions provided as singular solutions. Security mechanisms are implemented for each automotive function individually. This individual security design leads to several problems: combining several functions that are for its own secure may not result in a secure system. Furthermore, the combination of functions might also lead to situations, where mechanisms erroneously detect a security threat. This paper argues that new features, such as Car-2-Car communication or autonomous driving, will result in new information and communication technology (ICT) architectures of cars. The paper will outline basic properties of this architecture and summarize resulting security threads. We will argue that security needs to be treated in a holistic way and that the design must be suitable for adaptive, multiple independent levels of security (MILS) architecture.","PeriodicalId":203753,"journal":{"name":"International Conference on High Confidence Networked Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116067183","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Mechanism design for robust resource management to false report in cloud computing systems","authors":"Yusuke Aoki, Takafumi Kanazawa, T. Ushio","doi":"10.1145/2461446.2461448","DOIUrl":"https://doi.org/10.1145/2461446.2461448","url":null,"abstract":"Abstract We consider a resource allocation problem that ensures a fair QoS (Quality of Service) level among selfish clients in a cloud computing system. The clients share multiple resources and process applications concurrently on the cloud computing system. When the available resources are less than the total amount of required resources by all clients, the overload condition occurs. To avoid this, a fair resource allocation is needed. However, when there are selfish clients who want to maximize QoS levels of their applications, they may not report their true QoS functions honestly in order to get more resources than their fairly allocated ones. Then, the performance of the system degrades. Thus, it is important to prevent selfish behaviors of the clients. We propose a resource allocation mechanism that ensures a fair QoS level based on the framework of the mechanism design. In the proposed mechanism, the resource manager cannot know applications which will be processed by the clients but can observe their QoS levels after completing the applications.","PeriodicalId":203753,"journal":{"name":"International Conference on High Confidence Networked Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123559394","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Using channel state feedback to achieve resilience to deep fades in wireless networked control systems","authors":"B. Hu, M. Lemmon","doi":"10.1145/2461446.2461453","DOIUrl":"https://doi.org/10.1145/2461446.2461453","url":null,"abstract":"Wireless networked control systems (WNCS) consist of several dynamical systems that exchange information over a wireless radio (RF) communication network. These RF networks are subject to deep fades where the effective link throughput drops precipitously. Deep fading negatively impacts WNCS performance and stability, but in many applications the probability of a deep fade is a function of the system state. This suggests that one can use channel state information (CSI) as a feedback signal to recover some of the performance lost. This paper derives necessary and sufficient conditions for the almost sure stability of WNCS in the presence of deep fading. These conditions relate the channel's state to the WNCS's convergence rate. This paper uses this fact to reconfigure WNCS controllers to recover system performance in the presence of such fades. The results are illustrated using a leader-follower scenario found in vehicle-to-vehicle (V2V) applications.","PeriodicalId":203753,"journal":{"name":"International Conference on High Confidence Networked Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127387621","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Pajic, N. Bezzo, James Weimer, R. Alur, R. Mangharam, Nathan Michael, George J. Pappas, O. Sokolsky, P. Tabuada, Stephanie Weirich, Insup Lee
{"title":"Towards synthesis of platform-aware attack-resilient control systems: extended abstract","authors":"M. Pajic, N. Bezzo, James Weimer, R. Alur, R. Mangharam, Nathan Michael, George J. Pappas, O. Sokolsky, P. Tabuada, Stephanie Weirich, Insup Lee","doi":"10.1145/2461446.2461457","DOIUrl":"https://doi.org/10.1145/2461446.2461457","url":null,"abstract":"Recommended Citation Miroslav Pajic, Nicola Bezzo, James Weimer, Rajeev Alur, Rahul Mangharam, Nathan Michael, George J. Pappas, Oleg Sokolsky, Paulo Tabuada, Stephanie Weirich, and Insup Lee, \"Towards Synthesis of Platform-Aware Attack-Resilient Control Systems: Extended Abstract\", Proceedings of the 2nd ACM International Conference on High Confidence Networked Systems (HiCoNS '13) , 75-76. April 2013. http://dx.doi.org/10.1145/2461446.2461457","PeriodicalId":203753,"journal":{"name":"International Conference on High Confidence Networked Systems","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128613174","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Yampolskiy, P. Horváth, X. Koutsoukos, Yuan Xue, J. Sztipanovits
{"title":"Taxonomy for description of cross-domain attacks on CPS","authors":"M. Yampolskiy, P. Horváth, X. Koutsoukos, Yuan Xue, J. Sztipanovits","doi":"10.1145/2461446.2461465","DOIUrl":"https://doi.org/10.1145/2461446.2461465","url":null,"abstract":"The pervasiveness of Cyber-Physical Systems (CPS) in various aspects of the modern society grows rapidly. This makes CPS to increasingly attractive targets for various kinds of attacks. We consider cyber-security as an integral part of CPS security. Additionally, the necessity exists to investigate the CPS-specific aspects which are out of scope of cyber-security. Most importantly, attacks capable to cross the cyber-physical domain boundary should be analyzed. The vulnerability of CPS to such cross-domain attacks has been practically proven by numerous examples, e.g., by the currently most famous Stuxnet attack. In this paper, we propose taxonomy for description of attacks on CPS. The proposed taxonomy is capable of representing both conventional cyber-attacks as well as cross-domain attacks on CPS. Furthermore, based on the proposed taxonomy, we define the attack categorization. Several possible application areas of the proposed taxonomy are extensively discussed. Among others, it can be used to establish a knowledge base about attacks on CPS known in the literature. Furthermore, the proposed description structure will foster the quantitative and qualitative analysis of these attacks, both of which are necessarily to improve CPS security.","PeriodicalId":203753,"journal":{"name":"International Conference on High Confidence Networked Systems","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134031685","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Bounding the smallest robustly control invariant sets in networks with discrete disturbances and controls","authors":"D. Tarraf","doi":"10.1145/2461446.2461462","DOIUrl":"https://doi.org/10.1145/2461446.2461462","url":null,"abstract":"This paper is concerned with the reliability of logistics networks, specifically the problem of guaranteeing their robustness to uncertainties in operating conditions while maintaining economical storage costs. Indeed, we investigate logistics networks in a setup where both the disturbances and control actions take their values in prescribed finite alphabet sets, we revisit recently derived bounds on the 'l1' norm of the smallest invariant hyperbox sets, we show that the existing bounds are conservative, and we propose a tighter new lower bound.","PeriodicalId":203753,"journal":{"name":"International Conference on High Confidence Networked Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115817229","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}