Ashraf Yahia Hassan

Dr. Ashraf Yahia Hassan

orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
7 November 2023 in Cluster Computing
Verified
Journal Article
Open access
PDF file
SSSherif Hamdy Gomaa Salem
Sherif Hamdy Gomaa Salem
AHAshraf Yahia Hassan
Ashraf Yahia Hassan
MMMarwa S. Moustafa
Marwa S. Moustafa
MHMohamed Nabil Hassan
Mohamed Nabil Hassan
In recent years, face biometrics recognition systems are a wide space of a computer usage which is mostly employed for security purpose. The main purpose of the face biometrics recognition system is to authenticate a user from a given database. Due to the widespread expansion of the surveillance cameras and facial recognition technology, a robust face recognition system required. The recognition system needs to store a large number of training samples in any storage unit, that time hackers can access and control that data. So, Protecting and managing sensitive data is essential object. This requires a technique that preserve the privacy of individuals, maintain data integrity, and prevent information leakage. The storage of biometric templates on centralized servers has been associated with potential privacy risks. To address this issue, we have developed and implemented a proof-of-concept facial biometric identification system that uses a private Blockchain platform and smart contract technology. So, the proposed approach is presented a secure and tamper-proof from data breaches as well as hacks with data availability, by using the Blockchain platform to store face images. This paper aims to utilize Blockchain technology to identify individuals based on their biometric traits, specifically facial recognition system makes it tamper-proof (immutable) ensuring security. The system consists of enrolment and authentication phases. Blockchain technology uses peer-to-peer communication, cryptography, consensus processes, and smart contracts to ensure the security. The proposed approach was tested on two popular datasets: CelebFaces Attributes (CelebA) and large-scale face UTKFace datasets. The experimental results indicate that the system yields highly performance outcomes, as evidenced by the Equal Error Rate (EER) values of 0.05% and 0.07% obtained for the CelebA and UTKFace datasets, respectively. The system was compared to three baseline methods and scored the lowest Equal Error Rate.

17 April 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
NENada Emad El-Din El-Meligy
Nada Emad El-Din El-Meligy
TDTamer O. Diab
Tamer O. Diab
AMAshraf S. Mohra
Ashraf S. Mohra
AHAshraf Yahia Hassan
Ashraf Yahia Hassan
WSWageda I. El Sobky
Wageda I. El Sobky
This paper aims to improve SHA-512 security without increasing complexity; therefore, we focused on hash functions depending on DNA sequences and chaotic maps. After analysis of 45 various chaotic map types, only 5 types are selected in this proposal—namely, improved logistic, cosine logistic map, logistic sine system, tent sine system, and hybrid. Using DNA features and binary coding technology with complementary rules to hide information is a key challenge. This article proposes improving SHA-512 in two aspects: the modification of original hash buffer values, and the modification of additive constants Kt. This proposal is to make hash buffer values (a, b, c, d, e, f, g, and h) and Kt dependent on one-dimensional discrete chaotic maps and DNA sequences instead of constant. This modification complicates the relationship between the original message and hash value, making it unexpected. The performance of the proposed hash function is tested and analyzed the confusion, diffusion, and distributive and compared with the original SHA-512. The performance of security is analyzed by collision analysis, for which the maximum number of hits is only three, showing that the proposed hash function enhances the security and robustness of SHA-512. The statistical data and experimental analysis indicate that the proposed scheme has good properties and satisfies high-performance requirements for secure hash functions.

29 December 2020 in IEEE Access
Verified
Journal Article
Open access
AHAshraf Yahia Hassan
Ashraf Yahia Hassan
In this work, a diversity encoder maps vectors of N modulated symbols to vectors of N diversity symbols using an orthogonal matrix. Each modulated symbol appears in N diversity symbols. An Orthogonal-Frequency-Division-Multiplexing (OFDM) modulator converts the diversity vectors to OFDM symbols. The number of subcarriers in the OFDM symbol equals N. Each diversity symbol modulates one subcarrier; therefore, each modulated symbol is transmitted by N orthogonal subcarriers. The diversity bandwidth of the modulated symbols is N times the subchannel bandwidth. The modulated symbols experience independent fading gains on each subchannel since the diversity bandwidth (OFDM bandwidth) is chosen to be multiple of the coherence bandwidth of the transmission channel. In the receiver, an OFDM demodulator converts back the OFDM symbols to vectors of diversity symbols. The diversity detector maps the diversity vectors to vectors of modulated symbols. The noise samples at the output of the diversity detector are uncorrelated. Maximum likelihood and linear decorrelator detectors are used as diversity detectors. The transmitter and the receiver of this work are implemented using Field-Programable-Gate-Array (FPGA) technology. The performance of the implemented system is the same as the performance of the N channels diversity system with the Maximal-Ratio-Combiner (MRC) receiver.

1 January 2015 in AEU - International Journal of Electronics and Communications
Verified
Journal Article
Closed access
AHAshraf Yahia Hassan
Ashraf Yahia Hassan