arXiv subjects

Abdelhakim Hafid

Publications and source records attributed to Abdelhakim Hafid.

11 recordsLinked to original sources

arXiv2026

Future-Proofing Cloud Security Against Quantum Attacks: Risk, Transition, and Mitigation Strategies

Quantum Computing (QC) threatens the cryptographic foundations of Cloud Computing (CC), exposing distributed infrastructures to novel attack vectors. This survey provides comprehensive analysis of quantum-safe cloud security, examining vulnerabilities, transition strategies, and layer-specific countermeasures across nine architectural layers (application, data, runtime, middleware, OS, virtualization, server, storage, networking). We employ STRIDE-based risk assessment aligned with NIST SP 800-30 to evaluate quantum threats through three transition phases: pre-transition (classical cryptography vulnerabilities), hybrid (migration risks), and post-transition (PQC implementation weaknesses including side-channel attacks). Our security framework integrates hybrid cryptographic strategies (algorithmic combiners, dual/composite certificates, protocol-level migration), cryptographic agility, and risk-prioritized mitigation tailored to cloud environments. We benchmark NIST-standardized PQC algorithms for performance and deployment suitability, assess side-channel and implementation vulnerabilities, and analyze quantum-safe strategies from leading CSPs (AWS, Azure, GCP). The survey delivers layer-specific threat taxonomies, likelihood-impact risk matrices, and CSP-informed deployment roadmaps for cloud architects, policymakers, and researchers. We identify six critical research directions: standardization and interoperability, hardware acceleration and performance optimization, AI-enhanced security and threat mitigation, integration with emerging cloud technologies, systemic preparedness and workforce development, and migration frameworks with crypto-agility.

cs.CR↗

arXiv2025

Blockchain Security Risk Assessment in Quantum Era, Migration Strategies and Proactive Defense

The emergence of quantum computing presents a formidable challenge to the security of blockchain systems. Traditional cryptographic algorithms, foundational to digital signatures, message encryption, and hashing functions, become vulnerable to the immense computational power of quantum computers. This paper conducts a thorough risk assessment of transitioning to quantum-resistant blockchains, comprehensively analyzing potential threats targeting vital blockchain components: the network, mining pools, transaction verification mechanisms, smart contracts, and user wallets. By elucidating the intricate challenges and strategic considerations inherent in transitioning to quantum-resistant algorithms, the paper evaluates risks and highlights obstacles in securing blockchain components with quantum-resistant cryptography. It offers a hybrid migration strategy to facilitate a smooth transition from classical to quantum-resistant cryptography. The analysis extends to prominent blockchains such as Bitcoin, Ethereum, Ripple, Litecoin, and Zcash, assessing vulnerable components, potential impacts, and associated STRIDE threats, thereby identifying areas susceptible to quantum attacks. Beyond analysis, the paper provides actionable guidance for designing secure and resilient blockchain ecosystems in the quantum computing era. Recognizing the looming threat of quantum computers, this research advocates for a proactive transition to quantum-resistant blockchain networks. It proposes a tailored security blueprint that strategically fortifies each component against the evolving landscape of quantum-induced cyber threats. Emphasizing the critical need for blockchain stakeholders to adopt proactive measures and implement quantum-resistant solutions, the paper underscores the importance of embracing these insights to navigate the complexities of the quantum era with resilience and confidence.

cs.CR↗

arXiv2025

Fully Distributed Fog Load Balancing with Multi-Agent Reinforcement Learning

Real-time Internet of Things (IoT) applications require real-time support to handle the ever-growing demand for computing resources to process IoT workloads. Fog Computing provides high availability of such resources in a distributed manner. However, these resources must be efficiently managed to distribute unpredictable traffic demands among heterogeneous Fog resources. This paper proposes a fully distributed load-balancing solution with Multi-Agent Reinforcement Learning (MARL) that intelligently distributes IoT workloads to optimize the waiting time while providing fair resource utilization in the Fog network. These agents use transfer learning for life-long self-adaptation to dynamic changes in the environment. By leveraging distributed decision-making, MARL agents effectively minimize the waiting time compared to a single centralized agent solution and other baselines, enhancing end-to-end execution delay. Besides performance gain, a fully distributed solution allows for a global-scale implementation where agents can work independently in small collaboration regions, leveraging nearby local resources. Furthermore, we analyze the impact of a realistic frequency to observe the state of the environment, unlike the unrealistic common assumption in the literature of having observations readily available in real-time for every required action. The findings highlight the trade-off between realism and performance using an interval-based Gossip-based multi-casting protocol against assuming real-time observation availability for every generated workload.

cs.AI↗

arXiv2024

Navigating Quantum Security Risks in Networked Environments: A Comprehensive Study of Quantum-Safe Network Protocols

The emergence of quantum computing poses a formidable security challenge to network protocols traditionally safeguarded by classical cryptographic algorithms. This paper provides an exhaustive analysis of vulnerabilities introduced by quantum computing in a diverse array of widely utilized security protocols across the layers of the TCP/IP model, including TLS, IPsec, SSH, PGP, and more. Our investigation focuses on precisely identifying vulnerabilities susceptible to exploitation by quantum adversaries at various migration stages for each protocol while also assessing the associated risks and consequences for secure communication. We delve deep into the impact of quantum computing on each protocol, emphasizing potential threats posed by quantum attacks and scrutinizing the effectiveness of post-quantum cryptographic solutions. Through carefully evaluating vulnerabilities and risks that network protocols face in the post-quantum era, this study provides invaluable insights to guide the development of appropriate countermeasures. Our findings contribute to a broader comprehension of quantum computing's influence on network security and offer practical guidance for protocol designers, implementers, and policymakers in addressing the challenges stemming from the advancement of quantum computing. This comprehensive study is a crucial step toward fortifying the security of networked environments in the quantum age.

cs.CR↗

arXiv2023

Privacy-Aware Load Balancing in Fog Networks: A Reinforcement Learning Approach

In this paper, we propose a load balancing algorithm based on Reinforcement Learning (RL) to optimize the performance of Fog Computing for real-time IoT applications. The algorithm aims to minimize the waiting delay of IoT workloads in dynamic environments with unpredictable traffic demands, using intelligent workload distribution. Unlike previous studies, our solution does not require load and resource information from Fog nodes to preserve the privacy of service providers, who may wish to hide such information to prevent competitors from calculating better pricing strategies. The proposed algorithm is evaluated on a Discrete-event Simulator (DES) to mimic practical deployment in real environments, and its generalization ability is tested on simulations longer than what it was trained on. Our results show that our proposed approach outperforms baseline load balancing methods under different workload generation rates, while ensuring the privacy of Fog service providers. Furthermore, the environment representation we proposed for the RL agent demonstrates better performance compared to the commonly used representations for RL solutions in the literature, which compromise privacy.

cs.DC↗

arXiv2022

Resilience and Load Balancing in Fog Networks: A Multi-Criteria Decision Analysis Approach

The advent of Cloud Computing enabled the proliferation of IoT applications for smart environments. However, the distance of these resources makes them unsuitable for delay-sensitive applications. Hence, Fog Computing has emerged to provide such capabilities in proximity to end devices through distributed resources. These limited resources can collaborate to serve distributed IoT application workflows using the concept of stateless micro Fog service replicas, which provides resiliency and maintains service availability in the face of failures. Load balancing supports this collaboration by optimally assigning workloads to appropriate services, i.e., distributing the load among Fog nodes to fairly utilize compute and network resources and minimize execution delays. In this paper, we propose using ELECTRE, a Multi-Criteria Decision Analysis (MCDA) approach, to efficiently balance the load in Fog environments. We considered multiple objectives to make service selection decisions, including compute and network load information. We evaluate our approach in a realistic unbalanced topological setup with heterogeneous workload requirements. To the best of our knowledge, this is the first time ELECTRE-based methods are used to balance the load in Fog environments. Through simulations, we compared the performance of our proposed approach with traditional baseline methods that are commonly used in practice, namely random, Round-Robin, nearest node, and fastest service selection algorithms. In terms of the overall system performance, our approach outperforms these methods with up to 67% improvement.

cs.DC↗

arXiv2022

Blockchain as privacy and security solution for smart environments: A Survey

Blockchain was always associated with Bitcoin, cryptocurrencies, and digital asset trading. However, its benefits are far beyond that. It supports technologies like the Internet-of-Things (IoT) to pave the way for futuristic smart environments, like smart homes, smart transportation, smart energy trading, smart industries, smart supply chains, and more. To enable these environments, IoT devices, machines, appliances, and vehicles, need to intercommunicate without the need for centralized trusted parties. Blockchain replaces these trusted parties in such trustless environments. It provides security enforcement, privacy assurance, authentication, and other key features to IoT ecosystems. Besides IoT-Blockchain integration, other technologies add more benefits that attract the research community. Software-Defined Networking (SDN), Fog, Edge, and Cloud Computing technologies, for example, play a key role in enabling realistic IoT applications. Moreover, the integration of Artificial Intelligence (AI) provides smart, dynamic, and autonomous decision-making capabilities for IoT devices in smart environments. To push the research further in this domain, we provide in this paper a comprehensive survey that includes state-of-the-art technological integration, challenges, and solutions for smart environments, and the role of these technologies as the building blocks of such smart environments. We also demonstrate how the level of integration between these technologies has increased over the years, which brings us closer to the futuristic view of smart environments. We further discuss the current need to provide general-purpose Blockchain platforms that can adapt to unique design requirements of different applications and solutions. Finally, we provide a simplified architecture of futuristic smart environments that integrate these technologies, showing the advantage of such integration.

cs.CR↗

arXiv2017

Simulating with AcCoRD: Actor-Based Communication via Reaction-Diffusion

This paper introduces AcCoRD (Actor-based Communication via Reaction-Diffusion) version 1.0. AcCoRD is a sandbox reaction-diffusion solver designed for the study of molecular communication systems. It uses a hybrid of microscopic and mesoscopic simulation models that enables scalability via user control of local accuracy. AcCoRD is developed in C as an open source command line tool and includes utilities to process simulation output in MATLAB. The latest code and links to user documentation can be found at https://github.com/adamjgnoel/AcCoRD/. This paper provides an overview of AcCoRD's design, including the motivation for developing a specialized reaction-diffusion solver. The corresponding algorithms are presented in detail, including the computational complexity of the microscopic and mesoscopic models. Other novel derivations include the transition rates between adjacent mesoscopic subvolumes of different sizes. Simulation results demonstrate the use of AcCoRD as both an accurate reaction-diffusion solver and one that is catered to the analysis of molecular communication systems. A link is included to videos that demonstrate many of the simulated scenarios. Additional insights from the simulation results include the selection of suitable hybrid model parameters, the impact of reactive surfaces that are in the proximity of a hybrid interface, and the size of a bounded environment that is necessary to assume that it is unbounded. The development of AcCoRD is ongoing, so its future direction is also discussed in order to highlight improvements that will expand its potential areas of application. New features that are being planned at the time of writing include a fluid flow model and more complex actor behavior.

physics.chem-ph↗

arXiv2016

SLA Violation Prediction In Cloud Computing: A Machine Learning Perspective

Service level agreement (SLA) is an essential part of cloud systems to ensure maximum availability of services for customers. With a violation of SLA, the provider has to pay penalties. In this paper, we explore two machine learning models: Naive Bayes and Random Forest Classifiers to predict SLA violations. Since SLA violations are a rare event in the real world (~0.2 %), the classification task becomes more challenging. In order to overcome these challenges, we use several re-sampling methods. We find that random forests with SMOTE-ENN re-sampling have the best performance among other methods with the accuracy of 99.88 % and F_1 score of 0.9980.

cs.DC↗

arXiv2016

Channel Impulse Responses in Diffusive Molecular Communication with Spherical Transmitters

Molecular communication is an emerging paradigm for systems that rely on the release of molecules as information carriers. Communication via molecular diffusion is a popular strategy that is ubiquitous in nature and very fast over distances on the order of a micron or less. Existing closed-form analysis of the diffusion channel impulse response generally assumes that the transmitter is a point source. In this paper, channel impulse responses are derived for spherical transmitters with either a passive or absorbing receiver. The derived channel impulse responses are in closed-form for a one-dimensional environment and can be found via numerical integration for a three-dimensional environment. The point transmitter assumption (PTA) is formally defined so that its accuracy can be measured in comparison to the derived spherical transmitter impulse responses. The spherical transmitter model is much more accurate than the PTA when the distance between a transmitter and its receiver is small relative to the size of the transmitter. The derived results are verified via microscopic particle-based simulations using the molecular communication simulation platform AcCoRD (Actor-based Communication via Reaction-Diffusion). A spherical transmitter variation where molecules are released from the surface of a solid sphere is also considered via simulation.

cs.ET↗

arXiv2016

Active Versus Passive: Receiver Model Transforms for Diffusive Molecular Communication

This paper presents an analytical comparison of active and passive receiver models in diffusive molecular communication. In the active model, molecules are absorbed when they collide with the receiver surface. In the passive model, the receiver is a virtual boundary that does not affect molecule behavior. Two approaches are presented to derive transforms between the receiver signals. As an example, two models for an unbounded diffusion-only molecular communication system with a spherical receiver are unified. As time increases in the three-dimensional system, the transform functions have constant scaling factors, such that the receiver models are effectively equivalent. Methods are presented to enable the transformation of stochastic simulations, which are used to verify the transforms and demonstrate that transforming the simulation of a passive receiver can be more efficient and more accurate than the direct simulation of an absorbing receiver.

cs.ET↗