Resilient Distributed Diffusion in Networks With Adversaries
نویسندگان
چکیده
منابع مشابه
Secure broadcast in distributed networks with strong adversaries
This paper proposes a framework that enables secure one-to-many communication for networks with limited capabilities in the face of a strong adversary that can capture an arbitrary set of nodes. Our approach consists of two main components: (a) group key establishment protocol and (b) special key management. Especially, we try to address the following question: How strong of security properties...
متن کاملGame-Theoretic Design of Secure and Resilient Distributed Support Vector Machines with Adversaries
With a large number of sensors and control units in networked systems, distributed support vector machines (DSVMs) play a fundamental role in scalable and efficient multisensor classification and prediction tasks. However, DSVMs are vulnerable to adversaries who can modify and generate data to deceive the system to misclassification and misprediction. This work aims to design defense strategies...
متن کاملL-Resilient Adversaries and Hitting Sets
The condition of t-resilience stipulates that an n-process program is only obliged to make progress when at least n− t processes are correct. Put another way, the live sets, the collection of process sets such that progress is required if all the processes in one of these sets are correct, are all sets with at least n − t processes. In this paper we study what happens when the live sets are any...
متن کاملOptimal Distributed t-Resilient Election in Complete Networks
We study the problem of distributed leader election in an asynchronous complete network, in presence of faults that occurred prior to the execution of the election algorithm. Failures of this type are encountered, for example, during a recovery from a crash in the network. For a network with n processors, k of which start the algorithm and at most t of which might he faulty, we present an algor...
متن کاملOn Attack-Resilient Distributed Formation Control in Operator-Vehicle Networks
This paper tackles a distributed formation control problem where a group of vehicles is remotely controlled by a network of operators. Each operator-vehicle pair is attacked by an adversary, who corrupts the commands sent from the operator to the vehicle. From the point of view of operators, each adversary follows an attacking strategy linearly parameterized by some (potentially time-varying) m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal and Information Processing over Networks
سال: 2020
ISSN: 2373-776X,2373-7778
DOI: 10.1109/tsipn.2019.2957731