An authentication protocol based on Kerberos 5

We introduce some modifications to the widely deployed Kerberos authentication protocol. The principle’s secretkey will be independent of the user password to overcome the weak passwords chosen by the network principal that are susceptible to password guessing attacks, the main drawback of the Kerberos protocol. Instead, the Kerberos Distribution Center saves a profile for every instance in its realm to generate the principle’s secret-key by hashing the profile, and encrypting the output digest. Besides, the lifetime of the secret-key is controlled using the system clock. Triple-Des is used for encryption, SHA-256 for hashing, and Blum Blum Shub for random number generation

Robust and secure fractional wavelet image watermarking

This paper presents an efficient fractional wavelet transform (FWT) image watermarking technique based on combining the discrete wavelet transform (DWT) and the fractional Fourier transform (FRFT). In the proposed technique, the host image is wavelet transformed with two resolution levels, and then, the middle frequency sub-bands are FRFT transformed. The watermark is hidden by altering the selected FRFT coefficients of the middle frequency sub-bands of the 2-level DWT-transformed host image. Two pseudo-random noise (PN) sequences are used to modulate the selected FRFT coefficients with the watermark pixels, and inverse transforms are finally applied to get the watermarked image. In watermark extraction, we just need the same two PN sequences used in the embedding process and the watermark size. The correlation factor is used to determine whether the extracted pixel is one or zero. The proposed fractional wavelet transform (FWT) image watermarking method is tested with different image processing attacks and under composite attacks to verify its robustness. Experimental results demonstrated improved robustness and security

The effect of Fractional Fourier transform angle in encryption quality for digital images

This paper investigates the effect of the angle of the Fractional Fourier transform (FrFT) on encryption quality in a chaotic image cryptosystem. The adopted approach for encryption is 2D chaotic Baker map. This map is applied to the transformed images using FrFT with different angles. We inspect its application to digital images and its exhaustive security investigation. The security investigation contains statistical tests like histogram and correlation coefficient, the maximum and the irregular deviation metrics, and the processing time. Experimental results prove that the rotation angle of the FrFT does not affect the encryption quality. This indicates a wide range of angles that can be used in this transform domain for encryption in addition to increasing the scheme sensitivity and making it hard for the attacker to exactly determine the right angle used in the transform domain

Efficient Generation of Cancelable Face Templates Based on Quantum Image Hilbert Permutation

The pivotal need to identify people requires efficient and robust schemes to guarantee high levels of personal information security. This paper introduces an encryption algorithm to generate cancelable face templates based on quantum image Hilbert permutation. The objective is to provide sufficient distortion of human facial biometrics to be stored in a database for authentication requirements through encryption. The strength of the proposed Cancelable Biometric (CB) scheme is guaranteed through the ability to generate cancelable face templates by performing the scrambling operation of the face biometrics after addition of a noise mask with a pre-specified variance and an initial seed. Generating the cancelable templates depends on a strategy with three basic steps: Initialization, Odd module, and Even module. Notably, the proposed scheme achieves high recognition rates based on the Area under the Receiver Operating Characteristic (AROC) curve, with a value up to 99.51%. Furthermore, comparisons with the state-of-the-art schemes for cancelable face recognition are performed to validate the proposed scheme

Efficient Generation of Cancelable Face Templates Based on Quantum Image Hilbert Permutation

The pivotal need to identify people requires efficient and robust schemes to guarantee high levels of personal information security. This paper introduces an encryption algorithm to generate cancelable face templates based on quantum image Hilbert permutation. The objective is to provide sufficient distortion of human facial biometrics to be stored in a database for authentication requirements through encryption. The strength of the proposed Cancelable Biometric (CB) scheme is guaranteed through the ability to generate cancelable face templates by performing the scrambling operation of the face biometrics after addition of a noise mask with a pre-specified variance and an initial seed. Generating the cancelable templates depends on a strategy with three basic steps: Initialization, Odd module, and Even module. Notably, the proposed scheme achieves high recognition rates based on the Area under the Receiver Operating Characteristic (AROC) curve, with a value up to 99.51%. Furthermore, comparisons with the state-of-the-art schemes for cancelable face recognition are performed to validate the proposed scheme