Filters








35,840 Hits in 6.8 sec

On optimal and reasonable control in the presence of adversaries

Oded Maler
2007 Annual Reviews in Control  
This paper constitutes a sketch of a unified framework for posing and solving problems of optimal control in the presence of uncontrolled disturbances.  ...  After laying down the general framework we look closely at a concrete instance where the controller is a scheduler and the disturbances are related to uncertainties in task durations.  ...  The work on scheduling enjoyed similar relations with partners in the AMETIST project.  ... 
doi:10.1016/j.arcontrol.2007.02.001 fatcat:5zys7dwfmjbalphnyu3o2ui4ae

On the optimal allocation of adversarial resources

Stylianos Gisdakis, Panos Papadimitratos
2012 Proceedings of the first ACM international workshop on Mission-oriented wireless sensor networking - MiSeNet '12  
This is especially so because powerful adversaries could compromise and control a significant fraction of the network nodes.  ...  We consider an abstract model of the mission-critical WSN and the adversary, and we find that the determination of an optimal attack is computationally hard, thus, we devise an efficient heuristic approach  ...  Resilience to attacks and operation even in the presence of adversaries are highly desired.  ... 
doi:10.1145/2348656.2348666 fatcat:wd37o6gkbfgblbuu44ns2wmdly

Target Surveillance in Adversarial Environments Using POMDPs

Maxim Egorov, Mykel Kochenderfer, Jaak Uudmae
2016 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
The control policy resulting from solving the MOMDP aims to optimize the frequency of target observations and minimize exposure to the ballistic threat.  ...  This paper introduces an extension of the target surveillance problem in which the surveillance agent is exposed to an adversarial ballistic threat.  ...  Acknowledgments This work was supported by the Army AHPCRC grant W911NF-07-2-0027. The authors would like to thank the anonymous reviewers for their helpful comments.  ... 
doi:10.1609/aaai.v30i1.10126 fatcat:gfgqyxpxfbbbldvyyhcxdbtc7y

Limiting false data attacks on power system state estimation

Oliver Kosut, Liyan Jia, Robert J. Thomas, Lang Tong
2010 2010 44th Annual Conference on Information Sciences and Systems (CISS)  
It has been recently observed that if an adversary is able to manipulate the measurements taken at several meters in a power system, it can sometimes change the state estimate at the control center in  ...  In addition, a Bayesian formulation of the bad data problem is introduced, which captures the prior information that a control center has about the likely state of the power system.  ...  The heuristic approximates the degree to which it is possible for the control center to detect the presence of a certain adversarial vector a.  ... 
doi:10.1109/ciss.2010.5464816 dblp:conf/ciss/KosutJTT10 fatcat:sy3m5vpi3fahvhk6l7ocm37crm

Secure communications over hybrid military networks

Vamsi Paruchuri, Arjan Durresi, Sriram Chellappan
2008 MILCOM 2008 - 2008 IEEE Military Communications Conference  
From security point of view, we also assume presence of red zones, which are the ones controlled by the adversary or where the adversary can trace wireless activities.  ...  This paper presents a new architecture for flexible and secure networking in battlefields that enables stealthy and covert communication in the presence of node mobility.  ...  From security point of view, we assume presence of red zones, which are the ones controlled by the adversary or where the adversary can trace wireless activities.  ... 
doi:10.1109/milcom.2008.4753184 fatcat:y2mkp2prkrhsbdq24lcpzma6su

Modeling node capture attacks in wireless sensor networks

Patrick Tague, Radha Poovendran
2008 2008 46th Annual Allerton Conference on Communication, Control, and Computing  
We show that attacks in this adversary model correspond to NP-hard optimization problems and discuss the behavior of a reasonable heuristic algorithm.  ...  We formalize a model for node capture attacks in which an adversary collects information about the network via eavesdropping on the wireless medium and captures nodes based on the learned information.  ...  effective approach to establish an adversarial presence in the WSN and influence the outcome of network protocols.  ... 
doi:10.1109/allerton.2008.4797699 fatcat:dsvwfy7bw5bezdgqc3evd2gxwi

Minimum Violation Control Synthesis on Cyber-Physical Systems under Attacks [article]

Luyao Niu, Jie Fu, Andrew Clark
2018 arXiv   pre-print
In this paper, we focus on the minimum violation control synthesis problem under linear temporal logic constraints of a stochastic finite state discrete-time system with the presence of an adversary.  ...  We model the interaction between the controller and adversary using a concurrent Stackelberg game and present a nonlinear programming problem to formulate and solve for the optimal control policy.  ...  To the best of our knowledge, this is the first attempt to analyze minimum violation control synthesis on stochastic system in the presence of adversary.  ... 
arXiv:1809.00975v1 fatcat:drijkbon2jgtlhd4k33u4cndzm

Performance evaluation and trade-offs of optimal back-off misbehavior detection schemes in wireless networks in the presence of interference

Svetlana Radosavac, John S. Baras
2008 Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools  
Finally, we conclude that in the presence of (i) adaptive intelligent adversaries and (ii) variable environment conditions, the adoption of a static detection system is not advisable and propose employment  ...  In this work we evaluate the impact of interference caused by concurrent transmissions of neighboring stations on the performance of quickest detection schemes for detection of back-off misbehavior in  ...  Capabilities of the Adversary We assume the adversary has full control over his actions.  ... 
doi:10.4108/icst.valuetools2008.4367 dblp:conf/valuetools/RadosavacB08 fatcat:olembici4bgxvlquzgyd7s2s7q

Toward an Optimal Redundancy Strategy for Distributed Computations

Doug Szajda, Barry Lawson, Jason Owen
2005 Proceedings IEEE International Conference on Cluster Computing  
Specifically, our strategy guarantees a desired cheating detection probability regardless of the number of copies of a specific task controlled by the adversary.  ...  Aside from the additional computational costs, a significant disadvantage of redundancy is its vulnerability to colluding adversaries.  ...  Acknowledgments We would like to thank the anonymous reviewers whose comments helped us in preparing the final version of the paper.  ... 
doi:10.1109/clustr.2005.347045 dblp:conf/cluster/SzajdaLO05 fatcat:p6vndz6z5zc3beeubkqyzmgneq

Privacy-Preserving Resilience of Cyber-Physical Systems to Adversaries [article]

Bhaskar Ramasubramanian, Luyao Niu, Andrew Clark, Linda Bushnell, Radha Poovendran
2020 arXiv   pre-print
In this paper, we consider a CPS that has to satisfy a linear temporal logic (LTL) objective in the presence of two kinds of adversaries.  ...  We synthesize a controller for the CPS to maximize the probability of satisfying the LTL objective under any policy of this adversary.  ...  To the best of our knowledge, this is the first work that studies resilient control in the presence of an adversary along with ensuring differential privacy of states along a trajectory satisfying the  ... 
arXiv:2007.13272v1 fatcat:ogd6cf2bpjaczdnonow5osgmm4

Targeted Attack on Deep RL-based Autonomous Driving with Learned Visual Patterns [article]

Prasanth Buddareddygari, Travis Zhang, Yezhou Yang, Yi Ren
2022 arXiv   pre-print
This paper investigates the feasibility of targeted attacks through visually learned patterns placed on physical objects in the environment, a threat model that combines the practicality and effectiveness  ...  of the existing ones.  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the funding entities.  ... 
arXiv:2109.07723v2 fatcat:ayhifjzwsbfxvargqa3fohoj2a

Knapsack Secretary with Bursty Adversary

Thomas Kesselheim, Marco Molinaro, Emanuela Merelli, Anuj Dawar, Artur Czumaj
2020 International Colloquium on Automata, Languages and Programming  
In particular, setting Γ = √k gives a (1 - O((ln² k)/√k))-approximation that is resistant to up to a (ln k)/√k-fraction of the items being adversarial, which is almost optimal even in the absence of adversarial  ...  The assumption of burstiness of unexpected patterns is reasonable in many contexts, since changes (e.g. spike in a demand for a good) are often triggered by a common external event.  ...  While this strategy obtains the optimal guarantee in the random-order model [18] , it fails in the presence of adversarial items.  ... 
doi:10.4230/lipics.icalp.2020.72 dblp:conf/icalp/KesselheimM20 fatcat:jyi6ei3v2zemlo2lrnr75bu2nm

Performance Analysis with Network-Enhanced Complexities: On Fading Measurements, Event-Triggered Mechanisms, and Cyber Attacks

Derui Ding, Zidong Wang, Hongli Dong, Yurong Liu, Bashir Ahmad
2014 Abstract and Applied Analysis  
mechanisms, and attack behaviors of adversaries.  ...  In this paper, we aim to survey some recent advances on the performance analysis and synthesis with three sorts of fashionable network-enhanced complexities, namely, fading measurements, event-triggered  ...  Acknowledgments This work was supported in part by the National Natural Science Foundation of China under Grants 61134009, 61329301, 61203139, 61374127, and 61374010, the Royal Society of the UK, and the  ... 
doi:10.1155/2014/461261 fatcat:o6f7g6zinbaghpjb7ruvgsne4a

Exploiting Context-Awareness to Enhance Source-Location Privacy in Wireless Sensor Networks

R. Rios, J. Lopez
2011 Computer journal  
In this work we propose the Context-Aware Location Privacy (CALP) approach, which takes advantage of the ability of sensor nodes to perceive the presence of a mobile adversary in their vicinity in order  ...  This is a challenging problem because even in the presence of message confidentiality mechanisms, an adversary is capable of obtaining sensitive information.  ...  ACKNOWLEDGEMENTS This work was supported by the by the Ministry of Science and Innovation through the ARES [CSD2007-00004], SPRINT [TIN2009-09237] and IOT-SEC [ACI2009-0949] projects.  ... 
doi:10.1093/comjnl/bxr055 fatcat:b47bmvsndfeado2ihnizuiab2e

Real-time Adversarial Perturbations against Deep Reinforcement Learning Policies: Attacks and Defenses [article]

Buse G. A. Tekgul, Shelly Wang, Samuel Marchal, N. Asokan
2022 arXiv   pre-print
It is faster compared to the response time (0.6ms on average) of different DRL policies, and considerably faster than prior attacks using adversarial perturbations (1.8ms on average).  ...  Adversaries can mislead policies of DRL agents by perturbing the state of the environment observed by the agents.  ...  In contrast, AD 3 can detect the presence of adversarial perturbations in all games.  ... 
arXiv:2106.08746v3 fatcat:ghs4ex7clberpbr55ayhov2hhm
« Previous Showing results 1 — 15 out of 35,840 results