Reham Almukhlifi

Dr. Reham Almukhlifi

The George Washington University
orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 February 2023 in Cryptography
Verified
Journal Article
Open access
PDF file
RAReham Almukhlifi
Reham Almukhlifi
PVPoorvi Vora
Poorvi Vora
The Simeck family of lightweight block ciphers was proposed by Yang et al. in 2015, which combines the design features of the NSA-designed block ciphers Simon and Speck. Previously, we proposed the use of linear cryptanalysis using super-rounds to increase the efficiency of implementing Matsui’s second algorithm and achieved good results on all variants of Simon. The improved linear attacks result from the observation that, after four rounds of encryption, one bit of the left half of the state of the cipher depends on only 17 key bits (19 key bits for the larger variants of the cipher). We were able to follow a similar approach, in all variants of Simeck, with an improvement in Simeck 32 and Simeck 48 by relaxing the previous constraint of a single active bit, using multiple active bits instead. In this paper we present improved linear attacks against all variants of Simeck: attacks on 19-rounds of Simeck 32/64, 28-rounds of Simeck 48/96, and 34-rounds of Simeck 64/128, often with the direct recovery of the full master key without repeating the attack over multiple rounds. We also verified the results of linear cryptanalysis on 8, 10, and 12 rounds for Simeck 32/64.

12 June 2025 in Systems
Verified
Journal Article
Open access
PDF file
RARoba H. Alamir
Roba H. Alamir
Ayman NoorAyman Noor
Ayman Noor
HAHanan Almukhalfi
Hanan Almukhalfi
RAReham Almukhlifi
Reham Almukhlifi
Talal H. NoorTalal H. Noor
Talal H. Noor
Cyber threats that target Internet of Things (IoT) and edge computing environments are growing in scale and complexity, which necessitates the development of security solutions that are both robust and scalable while also protecting privacy. Edge scenarios require new intrusion detection solutions because traditional centralized intrusion detection systems (IDSs) lack in the protection of data privacy, create excessive communication overhead, and show limited contextual adaptation capabilities. This paper introduces the SecFedDNN framework, which combines federated deep learning (FDL) capabilities to protect edge–cloud environments from cyberattacks such as Distributed Denial of Service (DDoS), Denial of Service (DoS), and injection attacks. SecFedDNN performs edge-level pre-aggregation filtering through Layer-Adaptive Sparsified Model Aggregation (LASA) for anomaly detection while supporting balanced multi-class evaluation across federated clients. A Deep Neural Network (DNN) forms the main model that trains concurrently with multiple clients through the Federated Averaging (FedAvg) protocol while keeping raw data local. We utilized Google Cloud Platform (GCP) along with Google Colaboratory (Colab) to create five federated clients for simulating attacks on the TON_IoT dataset, which we balanced across selected attack types. Initial tests showed DNN outperformed Long Short-Term Memory (LSTM) and SimpleNN in centralized environments by providing higher accuracy at lower computational costs. Following federated training, the SecFedDNN framework achieved an average accuracy and precision above 84% and recall and F1-score above 82% across all clients with suitable response times for real-time deployment. The study proves that FDL can strengthen intrusion detection across distributed edge networks without compromising data privacy guarantees.

26 November 2025 in Journal of Cloud Computing
Verified
Journal Article
Open access
PDF file
TATarek Abid
Tarek Abid
AAAhmed Ahmim
Ahmed Ahmim
FMFaiz Maazouzi
Faiz Maazouzi
DCDjalel Chefrour
Djalel Chefrour
IUInsaf Ullah
Insaf Ullah
RAReham Almukhlifi
Reham Almukhlifi
The rush to deploy IoT devices has greatly increased the threat of cyberattacks. Although prevention methods enhance security, they remain insufficient. Intrusion Detection Systems (IDS) represent a crucial complementary line of defense for IoT networks. In this paper, we propose a novel IDS for the Internet of Things (IoT) that combines the Grey Wolf Optimization (GWO) meta-heuristic, the Light Gradient Boosting Machine (LightGBM) model, and Convolutional Neural Networks (CNN). On the one hand, GWO reduces the number of selected features to the most relevant ones, which positively impacts the computation time in IoT. On the other hand, LightGBM presents the advantage of fast training with low memory usage and performs low latency, whereas CNN performs as a second deep feature extractor of LightGBM outputs and acts as the final classifier. The experimental evaluation of our new model, conducted on the CICIoT2023 and CICIoMT2024 datasets, demonstrated its high performance. For the CICIoT2023 dataset, our model achieved notable performance improvements, with an accuracy of 95.24%, a precision of 95.22%, and a very high true positive rate for several attack classes, such as Distributed Denial of Service, reaching 99.85%. Similarly, for the CICIoMT2024 dataset, our model achieved even higher results, with an Accuracy of 99.50%, a Precision of 99.52%, an F1-Score of 99.51%, an Average Accuracy of 93.22%, and an Average Detection Rate (DR) of 92.36%. Moreover, our model provides a very low false alarm rate with 1.30% and 2.45% for CICIoT2023 and CICIoMT2024, respectively. Therefore, it outperforms well-known machine learning techniques (RF, SVM) and deep learning models, namely DNN, CNN, LSTM, and Multi-head Attention.

16 June 2025 in Internet of Things
Verified
Journal Article
Closed access
SSSabrina Sakraoui
Sabrina Sakraoui
MDMakhlouf DERDOUR
Makhlouf DERDOUR
AAAhmed Ahmim
Ahmed Ahmim
RAReham Almukhlifi
Reham Almukhlifi
MAMarwa Ahmim
Marwa Ahmim
IUInsaf Ullah
Insaf Ullah

21 April 2026 in ACM Computing Surveys
Verified
Journal Article
Open access
RARoba Alamir
Roba Alamir
Ayman NoorAyman Noor
Ayman Noor
HAHanan Almukhalfi
Hanan Almukhalfi
RAReham Almukhlifi
Reham Almukhlifi
Talal H. NoorTalal H. Noor
Talal H. Noor
Edge Computing (EC) is revolutionizing applications ranging from smart cities to autonomous vehicles by enabling real-time data processing at the network edge. However, as EC continues to expand, it introduces significant cybersecurity challenges due to its decentralized architecture and resource constraints. This survey examines the primary security threats to EC systems and reviews defense frameworks proposed to mitigate these risks. In this article, we present a generic EC security architecture that evaluates 21 recently proposed research prototypes using multiple assessment criteria (i.e., those we have identified) across perception/monitoring, detection/protection, and defense functional layers. We analyze cybersecurity prototypes for EC through a structured qualitative and quantitative comparative analysis to highlight patterns using frequency distributions. Additionally, we identify key gaps in the current research, such as the need for scalable, efficient solutions and improved integration of heterogeneous devices. Finally, the survey provides insights into future research directions to strengthen edge computing security, offering valuable perspectives for researchers.

18 March 2020 in Cryptography
Verified
Journal Article
Open access
PDF file
RAReham Almukhlifi
Reham Almukhlifi
PVPoorvi Vora
Poorvi Vora
We present attacks on 21-rounds of Simon 32/64, 21-rounds of Simon 48/96, 25-rounds of Simon 64/128, 35-rounds of Simon 96/144 and 43-rounds of Simon 128/256, often with direct recovery of the full master key without repeating the attack over multiple rounds. These attacks result from the observation that, after four rounds of encryption, one bit of the left half of the state of 32/64 Simon depends on only 17 key bits (19 key bits for the other variants of Simon). Further, linear cryptanalysis requires the guessing of only 16 bits, the size of a single round key of Simon 32/64. We partition the key into smaller strings by focusing on one bit of state at a time, decreasing the cost of the exhaustive search of linear cryptanalysis to 16 bits at a time for Simon 32/64. We also present other example linear cryptanalysis, experimentally verified on 8, 10 and 12 rounds for Simon 32/64.