Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 9 of 9 for “"Byzantine Attacks"”.
-
Distributed Byzantine Tolerant Machine Learning
… solution, but opens up participating workers to Byzantine attacks. This problem emerges when some workers cheat during uploading gradients or weights to the central server, e.g., the information received by the server is not always the true result computed by workers. In order to address this …
-
Investigation of Backdoor Attacks and Design of Effective Countermeasures in Federated Learning
… of FL increases its vulnerability to adversarial attacks. These include backdoor attacks, which subtly alter classification in some categories, and byzantine attacks, aimed at degrading the overall model accuracy. Detecting and defending against such attacks is challenging, as adversaries can …
-
Scheduling Distributed Real-Time Tasks in Unreliable and Untrustworthy Systems
… and untrustworthy systems (e.g., those with Byzantine node behaviors). We present a distributed real-time scheduling algorithm called Gamma. Gamma considers a distributed (i.e., multi-node) task model where tasks are subject to Time/Utility Function (or TUF) end-to-end time constraints, and …
-
Providing Efficient and Secure Cooperative Spectrum Sensing for Multi-Channel Cognitive Radio Networks
… spectrum sensing in MCCRNs, caused by Byzantine attacks. New counterattacks are proposed to combat attacks comprising coalition head and CRs as Byzantine attackers, which target to reduce the number of available channels for sensing in distributed MCCRNs. First, a new secure coalition …
-
ADAPTIVE SHARDING AND FAULT TOLERANCE IN DISTRIBUTED SYSTEMS
… effective data fragmentation and replication. In Byzantine environments, where nodes may behave adversarially, traditional partitioning schemes no longer hold. This dissertation introduces an adaptive sharding framework that combines dynamic data partitioning with Byzantine fault tolerance to …
-
Attack Resilient Pulse Based Synchronization
… results are obtained in the absence of malicious attacks. Given the distributed and unattended nature of wireless sensor networks, it is imperative to enhance the resilience of pulse-based synchronization against malicious attacks. To achieve this goal, we first show that by using a carefully …
-
Federated Neuromorphic Intelligence: Advancing Robustness, Efficiency, and Continual Adaptation in Edge Environments
… of the original model size. Second, it examines Byzantine robustness in federated SNNs and presents a statistical characterization explaining when SNNs are naturally resilient and when they are vulnerable, especially under structured adversaries such as MinMax. Motivated by this analysis, it …
-
Privacy and Security for Trustworthy AI/ML in Multi-Agent Critical Infrastructures: An Analysis of Adversarial Dynamics and Protective Strategies
… vulnerabilities to sophisticated cyberattacks. The raw MACI data-serving as the training data for these AI/ML frameworks - often contain sensitive user and operational information, necessitating robust privacy and security measures to protect against unauthorized access and …
-
Reliable and efficient communications in wireless sensor networks
… reliable distributed detection in SENMA under Byzantine attacks, where some authenticated sensors are compromised to report fictitious information. The q-out-of-m rule is considered. It is popular in distributed detection and can achieve a good trade-off between the miss detection probability …