Title: Phishing attack detection and zero trust-based verification for secure data transfer using BTEL-GRU

Authors: Rajya Lakshmi Gudivaka; Basava Ramanjaneyulu Gudivaka; Raj Kumar Gudivaka; Dinesh Kumar Reddy Basani; Sri Harsha Grandhi; M.M. Kamruzzaman

Addresses: Wipro, Hyderabad, Telangana, India ' Raas Infotek, Newark, Delaware, USA ' Infosys, Raleigh, North Carolina, USA ' CGI, CGI, Vancouver, British Columbia, Canada ' Intel, Folsom, California, USA ' Department of Computer Science, College of Computer and Information Sciences, Jouf University, Sakakah, Saudi Arabia

Abstract: The authentication and access control of the user's data using zero trust architecture (ZTA) is necessary to prevent data breaches. Initially, the user registers in the cloud, and here, the hashcode is generated using the substitution cipher-based whirlpool hashing algorithm (SC-WHA). In the phishing attack detection model, word embedding is done using Kaiming normalised Xavier-based bidirectional encoder representations from Transformers (KNX-BERT) for content extracted from the email dataset, the features are extracted, and the dimensionality is reduced using linear discriminant analysis (LDA). The word embedded and reduced features are classified using Bernoulli-dropout TanhExp logish gated recurrent unit (BTEL-GRU). During testing, the attacked data is blocked, and the non-attacked data is secured using deltoid spiral curve cryptography (DS-CC) and uploaded to the cloud. Hence, in the proposed model, the phishing attack is identified with an accuracy of 98.77586945%, and the multifactor hashcode verification is done with a hashcode generation time of 1,326 ms for secured data transfer.

Keywords: zero trust architecture; phishing attack detection; PAD; decentralised user management; data security; whirlpool hashing algorithm; WHA; mobile security system; gated recurrent unit; GRU.

DOI: 10.1504/IJCCBS.2026.153785

International Journal of Critical Computer-Based Systems, 2026 Vol.12 No.1, pp.98 - 126

Received: 10 Sep 2024
Accepted: 23 Dec 2024
Published online: 26 May 2026 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article