30 April 2020 in IEEE Access
Different machine learning and deep learning-based approaches have been proposed for designing defensive mechanisms against various phishing attacks. Recently, researchers showed that phishing attacks can be performed by employing a deep neural network-based phishing URL generating system called DeepPhish. To prevent this kind of attack, we design an ensemble machine learning-based detection system called PhishHaven to identify AI-generated as well as human-crafted phishing URLs. To the best of our knowledge, this is the first study to consider detecting phishing attacks by both AI and human attackers. PhishHaven employs lexical analysis for feature extraction. To further enhance lexical analysis, we introduce URL HTML Encoding to classify URL on-the-fly and proactively compare with some of the existing methods. We also introduce a URL Hit approach to deal with tiny URLs, which is an open problem yet to be solved. Moreover, the final classification of URLs is made on an unbiased voting mechanism in PhishHaven, which aims to avoid misclassification when the number of votes is equal. To speed up the ensemble-based machine learning models, PhishHaven employs a multi-threading approach to execute the classification in parallel, leading to real-time detection. Theoretical analysis of our solution shows that (1) it can always detect tiny URLs, and (2) it can detect future AI-generated Phishing URLs based on our selected lexical features with 100% accuracy. Through experiments, we analyze our solution with a benchmark dataset of 100,000 phishing and normal URLs. The results show that PhishHaven can achieve 98.00% accuracy, outperforming the existing lexical-based human-crafted phishing URLs detection systems.
25 April 2024 in IEEE Sensors Journal
As societies age, the issue of falls has become increasingly critical for the health and safety of the elderly. Fall detection in the elderly has traditionally relied on supervised learning methods, which require data on falls, which is difficult to obtain in real situations. Additionally, the complexity of integrating deep learning models into wearable devices for real-time fall detection has been challenging due to limited computational resources. In this paper, we propose a novel fall detection method using unsupervised learning based on a denoising long short term memory (LSTM)-based convolutional variational autoencoder (CVAE) model to solve the problem of lack of fall data. By utilizing the proposed data debugging and hierarchical data balancing techniques, the proposed method achieves an F1 score of 1.0 while reducing the parameter count by 25.6 times compared to the state-of-the-art unsupervised deep learning method. The resulting model occupies only 157.65 KB of memory, making it highly suitable for integration into wearable devices.
1 April 2025 in IEEE Access
Federated learning (FL) has gained widespread adoption for training artificial intelligence (AI) models while ensuring the confidentiality of client data. However, this privacy-preserving nature of FL also makes it vulnerable to poisoning attacks. To counter these attacks, several defense methods have been developed to identify and filter out poisoned local models before the aggregation process. Nevertheless, these defense methods demonstrate sub-optimal performance in retaining benign local models while discarding poisoned local models primarily due to inadequate filtering strategies. Consequently, these defense methods filter out large proportions of benign local models that are not poisoned, resulting in high false rejection rates or low detection accuracy, which leads to test accuracy degradation of the global model as well. In this paper, we propose the Two-step Defense Framework for Poisoning Attacks Detection (TDF-PAD), which first identifies the obvious-poisoned, obvious-benign, and ambiguous local models by utilizing the interquartile range method. The second step employs the Z-score method to classify ambiguous local models into benign or poisoned local models based on their performance history. Through extensive experimentation on two real-world benchmark datasets, we demonstrate that TDF-PAD outperforms state-of-the-art defense methods by achieving a 0% false positive rate on these benchmark datasets, showing it is generally applicable to any dataset.
21 September 2021 in Cluster Computing
3 March 2020 in IEEE Access
Risks regarding Internet privacy and security have been identified as issues for both new and experienced users of Internet technology. This paper explores the privacy and security threats in centralized search engines and proposes a decentralized search system. The proposed decentralized search system provides privacy and security for its users. The decentralized nature also provides transparency, distributed search and community-driven decisions in the proposed framework. We compare the proposed framework with the existing centralized approach. Our analysis shows that (1) there is no significant difference in search time between the centralized and proposed framework, and (2) the proposed framework is more efficient by providing search results with fewer search resources compared to the centralized approach.
30 March 2023 in IEEE Transactions on Emerging Topics in Computing
Privacy preservation is a sensitive and important issue in this ever-growing and highly-connected digital era. Functional encryption is a computation on encrypted data paradigm that allows users to retrieve the evaluation of a function on encrypted data without revealing the data, effectively protecting user's privacy. However, existing functional encryption implementations are still very time-consuming for practical deployment, especially when applied to machine learning applications that involve huge amount of data. In this paper, we present a high-performance implementation of inner-product functional encryption (IPFE) based on ring-learning with errors on graphics processing units. We execute a systematic investigation to select the best strategy for implementing number theoretic transform for different security levels, which is the most time-consuming operations in the IPFE scheme. We further propose novel techniques to parallelize the Gaussian sampling. Compared to the existing AVX2 implementation, our implementation on a RTX 2060 GPU achieves $34.24\times$ , $40.02\times$ , $156.30\times$ and $18.76\times$ speed-up for Setup , Encrypt , KeyGen and Decrypt respectively. Finally, we propose a fast privacy-preserving SVM to classify data securely using our GPU-accelerated IPFE scheme. On average, our implementation can classify one input with 591 support vectors in 688 ms ( $< 1$ second), which is $33.12\times$ faster than the AVX2 version.