Hazem Abbas

Prof. Hazem Abbas

Queen's University
orcid

Research Focus & Metrics

Academic Career Length

43Years (1984-Present)

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

Representative Publications

View All Publications
1 July 2005 in Pattern Recognition Letters
Verified
Journal Article
Closed access
AAAhmed Abouelela
Ahmed Abouelela
HAHazem Abbas
Hazem Abbas
HEHesham Eldeeb
Hesham Eldeeb
AWAbdelmonem A. Wahdan
Abdelmonem A. Wahdan
SNSalwa M. Nassar
Salwa M. Nassar

1 March 2012 in Pattern Recognition
Verified
Journal Article
Closed access
NHN. Houmani
N. Houmani
AMA. Mayoue
A. Mayoue
SGS. Garcia-Salicetti
S. Garcia-Salicetti
BDB. Dorizzi
B. Dorizzi
MKM.I. Khalil
M.I. Khalil
CVCarlos Vivaracho-Pascual
Carlos Vivaracho-Pascual

27 October 2017 in Neural Processing Letters
Verified
Journal Article
Closed access
PDF file
MRMohamed A. Radwan
Mohamed A. Radwan
MKMahmoud I. Khalil
Mahmoud I. Khalil
HAHazem Abbas
Hazem Abbas

1 November 2009
Verified
Conference Paper
Closed access
MKMostafa I. Khalil
Mostafa I. Khalil
MMMohamed Moustafa
Mohamed Moustafa
HAHazem Abbas
Hazem Abbas
This work describes an enhanced technique for on-line signature verification. The distance between two signatures is computed by dynamic time warping (DTW) method. The reference signatures are used to assign special parameters for each signer, which makes the system cover the intra signer variation. Several features are extracted. Systems with single and multi-features are tested. Curvature change and speed enhance success verification rate. The experiments have been carried out using the SUSIG online signature database. The best result for ROC area under curve is 99.5 with equal error rate 3.48%, and the best result for equal error rate is 3.06% with ROC area under curve 99.43.

1 March 1994 in Signal Processing
Verified
Journal Article
Closed access
HAHazem Abbas
Hazem Abbas
MFMoustafa M. Fahmy
Moustafa M. Fahmy

1 August 2013
Verified
Conference Paper
Closed access
AAAhmed M. Allam
Ahmed M. Allam
HAHazem Abbas
Hazem Abbas
MEMohamed Watheq El-Kharashi
Mohamed Watheq El-Kharashi
Key exchange is one of the major concerns in cryp-tology. Neural cryptography is a recent non-classical paradigm which achieves key exchange by mutual learning between two neural networks that receive the same input patterns and update their weights using specific rules. Each weight component of the network can be seen as a random walker in the weight space. The two walkers move in the weight space and reflect at two boundaries (left and right) which represent the network synaptic depth. The reflecting boundaries cause the distance between the two walkers decreases if one of them hits the boundary when a common direction is chosen at each step. Therefore, the mutual learning algorithm relies on this defined boundary condition to achieve synchronization between the two parties. In this paper, we aim to increase the security of the neural cryptography by authenticating the communication using preshared secrets. The mutual learning algorithm is modified so that the reflecting boundaries become hidden and only accessible by the two partners. New update rules are developed to exploit the secret information without adding any limitation to the initial configuration for the two parties. This is done by converting the two boundaries located at a straight line path to a one secret boundary located randomly at a circular path. Therefore, the mutual learning is impeded except this secret information is known. The proposed algorithm is called Neural Cryptography with Secret Boundaries (NCSB) and it is proved with information theory that the secret boundaries can not be revealed from the public information broadcast through the public channel.