Related papers: An Attack-Resilient Pulse-Based Synchronization St…
The proliferation of Internet of Things devices in critical infrastructure has created unprecedented cybersecurity challenges, necessitating collaborative threat detection mechanisms that preserve data privacy while maintaining robustness…
In this paper, a fully distributed averaging algorithm in the presence of adversarial Byzantine agents is proposed. The algorithm is based on a resilient retrieval procedure, where all non-Byzantine nodes send their own initial values and…
Pulse-wave Distributed Denial-of-Service (DDoS) attacks generate short, synchronized bursts of traffic that circumvent pattern-based detection and quickly exhaust traditional defense systems. This transient and spatially distributed…
Robust qubit-qubit interactions mediated by bosonic modes are central to many quantum technologies. Existing proposals combining fast oscillator-mediated gates with dynamical decoupling require strong pulses or fast control over the…
The rapid development of artificial intelligence systems has amplified societal concerns regarding their usage, necessitating regulatory frameworks that encompass data privacy. Federated Learning (FL) is posed as potential solution to data…
We study the dynamical behavior of an ensemble of oscillators interacting through short range bidirectional pulses. The geometry is 1D with periodic boundary conditions. Our interest is twofold. To explore the conditions required to reach…
This paper describes a simple and efficient asynchronous Binary Byzantine faulty tolerant consensus algorithm. In the algorithm, non-faulty nodes perform an initial broadcast followed by a executing a series of rounds each consisting of a…
Establishing and maintaining a common time reference across spatially separated devices is a prerequisite for networked quantum experiments and secure communications. Classical two-way timing protocols such as Network Time Protocol (NTP) or…
In this work, we extend the topology-based approach for characterizing computability in asynchronous crash-failure distributed systems to asynchronous Byzantine systems. We give the first theorem with necessary and sufficient conditions to…
Network coding is an elegant technique where, instead of simply relaying the packets of information they receive, the nodes of a network are allowed to combine \emph{several} packets together for transmission and this technique can be used…
We consider the problem of reliably broadcasting information in a multihop asyn- chronous network that is subject to Byzantine failures. That is, some nodes of the network can exhibit arbitrary (and potentially malicious) behavior. Existing…
\textit{Federated learning} (FL) is a nascent distributed learning paradigm to train a shared global model without violating users' privacy. FL has been shown to be vulnerable to various Byzantine attacks, where malicious participants could…
To observe synchronization in a large network of classical or quantum systems demands both excellent control of the interactions between the nodes and very accurate preparation of the initial conditions due to the involved nonlinearities…
We study the performance of composite pulses in the presence of time-varying control noise on a single qubit. These protocols, originally devised only to correct for static, systematic errors, are shown to be robust to time-dependent…
In this study, we analyze the feasibility of distributed phase synchronization for coherent signal superposition, a fundamental enabler for paradigms such as coherent over-the-air computation (OAC), distributed beamforming, and interference…
In this work we revisit the nonmonotonic behavior (NMB) of synchronization time with velocity reported for systems of mobile pulse-coupled oscillators (PCOs). We devise a control parameter that allows us to predict in which range of…
For tolerating Byzantine faults of both the terminal and communication components in self-stabilizing clock synchronization, the two-dimensional self-stabilizing Byzantine-fault-tolerant clock synchronization problem is investigated and…
This paper deals with the chaotic oscillator synchronization. A new approach to detect the synchronized behaviour of chaotic oscillators has been proposed. This approach is based on the analysis of different time scales in the time series…
We present and experimentally demonstrate a technique for achieving and maintaining a global state of identical synchrony of an arbitrary network of chaotic oscillators even when the coupling strengths are unknown and time-varying. At each…
The problem of designing distributed optimization algorithms that are resilient to Byzantine adversaries has received significant attention. For the Byzantine-resilient distributed optimization problem, the goal is to (approximately)…