{"title":"A framework for privacy and security analysis of probe-based traffic information systems","authors":"E. Canepa, C. Claudel","doi":"10.1145/2461446.2461451","DOIUrl":"https://doi.org/10.1145/2461446.2461451","url":null,"abstract":"Most large scale traffic information systems rely on fixed sensors (e.g. loop detectors, cameras) and user generated data, this latter in the form of GPS traces sent by smartphones or GPS devices onboard vehicles. While this type of data is relatively inexpensive to gather, it can pose multiple security and privacy risks, even if the location tracks are anonymous. In particular, creating bogus location tracks and sending them to the system is relatively easy. This bogus data could perturb traffic flow estimates, and disrupt the transportation system whenever these estimates are used for actuation. In this article, we propose a new framework for solving a variety of privacy and cybersecurity problems arising in transportation systems. The state of traffic is modeled by the Lighthill-Whitham-Richards traffic flow model, which is a first order scalar conservation law with concave flux function. Given a set of traffic flow data, we show that the constraints resulting from this partial differential equation are mixed integer linear inequalities for some decision variable. The resulting framework is very flexible, and can in particular be used to detect spoofing attacks in real time, or carry out attacks on location tracks. Numerical implementations are performed on experimental data from the~emph{Mobile Century} experiment to validate this framework.","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":"127590468","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":"Privacy-preserving release of aggregate dynamic models","authors":"J. L. Ny, George J. Pappas","doi":"10.1145/2461446.2461454","DOIUrl":"https://doi.org/10.1145/2461446.2461454","url":null,"abstract":"New solutions proposed for the monitoring and control of large-scale systems increasingly rely on sensitive data provided by end-users. As a result, there is a need to provide guarantees that these systems do not unintentionally leak private and confidential information during their operation. Motivated by this context, this paper discusses the problem of releasing a dynamic model describing the aggregate input-output dynamics of an ensemble of subsystems coupled via a common input and output, while controlling the amount of information that an adversary can infer about the dynamics of the individual subsystems. Such a model can then be used as an approximation of the true system, e.g., for controller design purposes. The proposed schemes rely on the notion of differential privacy, which provides strong and quantitative privacy guarantees that can be used by individuals to evaluate the risk/reward trade-offs involved in releasing detailed information about their behavior.","PeriodicalId":203753,"journal":{"name":"International Conference on High Confidence Networked Systems","volume":"28 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":"114159756","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}
Zhijin Qin, G. Denker, C. Talcott, N. Venkatasubramanian
{"title":"Achieving resilience of heterogeneous networks through predictive, formal analysis","authors":"Zhijin Qin, G. Denker, C. Talcott, N. Venkatasubramanian","doi":"10.1145/2461446.2461459","DOIUrl":"https://doi.org/10.1145/2461446.2461459","url":null,"abstract":"Rapid development and wide deployment of wireless technologies in recent years have brought an increasing number and variety of services that are accessible directly from mobile terminals via multiple network access technologies (e.g, Ethernet, WiFi, Bluetooth, LTE, etc). A particular traffic flow may go through different kinds of networks, which greatly increases the end-to-end connectivity opportunities. However, the disadvantage of multinetworks is that a failure or change in one network type may affect many traffic flows. Thus, the various networks in a multinetwork cannot be managed in isolation. Rather we need methodologies that analyze the effects of changes in these dynamic and heterogeneous network environments in unison. Traditional network analysis approaches only focus on static network attributes and do not fully consider the impact of failures on quality of services (QoS) across flows. In this paper, we design and implement a \"what-if\" analysis methodology using formal methods. Our methodology analyzes the impact of failures and changes in heterogeneous networks on QoS of flows. The results of the formal analysis can guide network administrators in their decisions to proactively adapt network configurations to achieve mission or application objectives. We illustrate our methodology with the help of use cases such as incorporating additional nodes in a network or reconfiguring the network due to failure. We compare our results with conventional network configuration approaches and show how our formal methodology provides more effective decision support than conventional network configuration approaches and that it scales better than simulation approaches.","PeriodicalId":203753,"journal":{"name":"International Conference on High Confidence Networked Systems","volume":"23 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":"132461669","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":"Distributed model-invariant detection of unknown inputs in networked systems","authors":"James Weimer, Damiano Varagnolo, K. Johansson","doi":"10.1145/2461446.2461464","DOIUrl":"https://doi.org/10.1145/2461446.2461464","url":null,"abstract":"This work considers hypothesis testing in networked systems under severe lack of prior knowledge. In previous work we derived a centralized Uniformly Most Powerful Invariant (UMPI) approach to testing unknown inputs in unknown Linear Time Invariant (LTI) networked dynamics subject to unknown Gaussian noise. The detector was also shown to have Constant False Alarm Rate (CFAR) properties. Nonetheless, in large-scale systems, centralized testing may be infeasible or undesirable. Thus, we develop a distributed testing version of our previous work that utilizes a statistic that is maximally invariant to the unknown parameters and the nonlocal/neighboring measurements. Similar to the centralized approach, the distributed test is shown to have CFAR properties and to have performance that asymptotically approaches that of the centralized test. Simulation results illustrate that the performance of the distributed approach suffers marginal performance degradation in comparison to the centralized approach. Insight to this phenomena is provided through a discussion.","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":"127832120","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}
Shaohui Wang, A. Ayoub, Radoslav Ivanov, O. Sokolsky, Insup Lee
{"title":"Contract-based blame assignment by trace analysis","authors":"Shaohui Wang, A. Ayoub, Radoslav Ivanov, O. Sokolsky, Insup Lee","doi":"10.1145/2461446.2461463","DOIUrl":"https://doi.org/10.1145/2461446.2461463","url":null,"abstract":"Fault diagnosis in networked systems has been an extensively studied field in systems engineering. Fault diagnosis generally includes the tasks of fault detection and isolation, and optionally recovery (FDIR). In this paper we further consider the blame assignment problem: given a system trace on which a system failure occurred and an identified set of faulty components, determine which subsets of faulty components are the culprits for the system failure. We provide formal definitions of the notion culprits and the blame assignment problem, under the assumptions that only one system trace is given and the system cannot be rerun. We show that the problem is equivalent to deciding the unsatisfiability of a set of logical constraints on component behaviors, and present the transformation from a blame assignment instance into an instance of unsatisfiability checking. We also apply the approach to a case study in the medical device interoperability scenario that has motivated our work.","PeriodicalId":203753,"journal":{"name":"International Conference on High Confidence Networked Systems","volume":"16 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":"115622169","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}
Aaron M. Bestick, L. Ratliff, Posu Yan, R. Bajcsy, S. Sastry
{"title":"An inverse correlated equilibrium framework for utility learning in multiplayer, noncooperative settings","authors":"Aaron M. Bestick, L. Ratliff, Posu Yan, R. Bajcsy, S. Sastry","doi":"10.1145/2461446.2461449","DOIUrl":"https://doi.org/10.1145/2461446.2461449","url":null,"abstract":"In a game-theoretic framework, given parametric agent utility functions, we solve the inverse problem of computing the feasible set of utility function parameters for each individual agent, given that they play a correlated equilibrium strategy. We model agents as utility maximizers, then cast the problem of computing the parameters of players' utility functions as a linear program using the fact that their play results in a correlated equilibrium. We focus on situations where agents must make tradeoffs between multiple competing components within their utility function. We test our method first on a simulated game of Chicken-Dare, and then on data collected in a real-world trial of a mobile fitness game in which five players must balance between protecting their privacy and receiving a reward for burning calories and improving their physical fitness. Through the learned utility functions from the fitness game, we hope to gain insight into the relative importance each user places on safeguarding their privacy vs. achieving the other desirable objectives in the game.","PeriodicalId":203753,"journal":{"name":"International Conference on High Confidence Networked Systems","volume":"32 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":"133570587","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":"Algorithms for determining network robustness","authors":"Heath J. LeBlanc, X. Koutsoukos","doi":"10.1145/2461446.2461455","DOIUrl":"https://doi.org/10.1145/2461446.2461455","url":null,"abstract":"In this paper, we study algorithms for determining the robustness of a network. Network robustness is a novel graph theoretic property that provides a measure of redundancy of directed edges between all pairs of nonempty, disjoint subsets of nodes in a graph. The robustness of a graph has been shown recently to be useful for characterizing the class of network topologies in which resilient distributed algorithms that use purely local strategies are able to succeed in the presence of adversary nodes. Therefore, network robustness is a critical property of resilient networked systems. While methods have been given to construct robust networks, algorithms for determining the robustness of a given network have not been explored. This paper introduces several algorithms for determining the robustness of a network, and includes centralized, decentralized, and distributed algorithms.","PeriodicalId":203753,"journal":{"name":"International Conference on High Confidence Networked Systems","volume":"82 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":"123257746","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":"Bio-inspired strategy for control of viral spreading in networks","authors":"Chinwendu Enyioha, V. Preciado, George J. Pappas","doi":"10.1145/2461446.2461452","DOIUrl":"https://doi.org/10.1145/2461446.2461452","url":null,"abstract":"We consider a variant of the well-known Susceptible-Infected-Susceptible (SIS) network spreading model, and present a virus control strategy in which nodes in a network are in sleep state or awake state with certain probabilities. Nodes in sleep state are assumed to have a lower infection rate relative to nodes in awake state, hence lower exposure levels to a viral attack on the network. The strategy presented is inspired by the notion of bacteria colony textit{persistence} to antibiotics in which certain bacteria in the colony hibernate or switch to dormant states as a way of reducing their exposure to antibiotics and helping the colony withstand the effects of the antibiotic attack. Based on a simplified model of persistence, we present a threshold above which a small infection may become an epidemic. Further, we consider the problem of designing the probability of each node being in sleep (less infectious) state with the least effort, allowing the network to control the spread of an infection. Our design strategy for the probabilities of being in sleep state exploits the diagonal dominance property of a non-convex constraint, which enables relaxation of the problem to a Linear Program, for which we compute an exact solution using only local information. Finally, via simulations, we show that the probability of being in sleep state, resulting from our relaxation does, indeed, exploit the network structure in controlling the virus spread.","PeriodicalId":203753,"journal":{"name":"International Conference on High Confidence Networked Systems","volume":"300 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":"131605227","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":"A dynamic game-theoretic approach to resilient control system design for cascading failures","authors":"Quanyan Zhu, T. Başar","doi":"10.1145/2185505.2185512","DOIUrl":"https://doi.org/10.1145/2185505.2185512","url":null,"abstract":"The migration of many current critical infrastructures, such as power grids and transportations systems, into open public networks has posed many challenges in control systems. Modern control systems face uncertainties not only from the physical world but also from the cyber space. In this paper, we propose a hybrid game-theoretic approach to investigate the coupling between cyber security policy and robust control design. We study in detail the case of cascading failures in industrial control systems and provide a set of coupled optimality criteria in the linear-quadratic case. This approach can be further extended to more general cases of parallel cascading failures.","PeriodicalId":203753,"journal":{"name":"International Conference on High Confidence Networked Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115265596","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}
Wei Yan, Yuan Xue, Xiaowei Li, Jiannian Weng, T. Busch, J. Sztipanovits
{"title":"Integrated simulation and emulation platform for cyber-physical system security experimentation","authors":"Wei Yan, Yuan Xue, Xiaowei Li, Jiannian Weng, T. Busch, J. Sztipanovits","doi":"10.1145/2185505.2185519","DOIUrl":"https://doi.org/10.1145/2185505.2185519","url":null,"abstract":"There is a pressing need to evaluate both cyber- and physical systems together and holistically for a rapidly growing number of applications using simulation and emulation in a realistic environment, which brings realistic attacks against the defensive capabilities of CPS (Cyber-Physical System). Without the support from appropriate tools and run-time environments, this assessment process can be extremely time-consuming and error-prone, if possible at all. In this paper, we present iSEE - integrated Simulation and Emulation platform for security Experimentation, as a \"software supporting research infrastructure used for cyber security research and development\". iSEE allows for the concurrent modeling, experimentation and evaluation of CPS that range from a fully simulated to a fully implemented system. iSEE has two major components: 1) modeling environment for system specification and experiment configuration and 2) run-time environment that supports experiment execution. iSEE employs the Model-Integrated-Computing (MIC) approach, which explicitly uses models throughout the experiment environments and integrates them at the domain-specific model level. The run-time environment of iSEE integrates Matlab and the DETERlab testbed to support realistic assessment of CPS on real distributed networking environments in its early design phase, before a fully implemented system is available. At run time, iSEE provides time synchronization and data communication and coordinates the execution of the security experiment across simulation and emulation platforms.","PeriodicalId":203753,"journal":{"name":"International Conference on High Confidence Networked Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116550770","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}