A Novel Probabilistic Image Authentication Methodbased on Universal Hash Function for Rgb Images

2018 ◽  
Author(s):  
Fatih Ozyurt ◽  
Turker Tuncer ◽  
Engin Avci
Keyword(s):  
Hash Function ◽  
Image Authentication ◽  
Rgb Images ◽  
Universal Hash Function

Everlasting security of quantum key distribution with 1K-DWCDM and quadratic hash

2021 ◽  
Vol 21 (3&4) ◽  
pp. 0181-0202
Author(s):  
Khodakhast Bibak ◽  
Robert Ritchie ◽  
Behrouz Zolfaghari
Keyword(s):  
Hash Function ◽  
Quantum Key Distribution ◽  
Key Distribution ◽  
Privacy Amplification ◽  
Universal Hashing ◽  
Wide Range ◽  
Strong Property ◽  
Everlasting Security ◽  
Universal Hash Function ◽  
General Method

Quantum key distribution (QKD) offers a very strong property called everlasting security, which says if authentication is unbroken during the execution of QKD, the generated key remains information-theoretically secure indefinitely. For this purpose, we propose the use of certain universal hashing based MACs for use in QKD, which are fast, very efficient with key material, and are shown to be highly secure. Universal hash functions are ubiquitous in computer science with many applications ranging from quantum key distribution and information security to data structures and parallel computing. In QKD, they are used at least for authentication, error correction, and privacy amplification. Using results from Cohen [Duke Math. J., 1954], we also construct some new families of $\varepsilon$-almost-$\Delta$-universal hash function families which have much better collision bounds than the well-known Polynomial Hash. Then we propose a general method for converting any such family to an $\varepsilon$-almost-strongly universal hash function family, which makes them useful in a wide range of applications, including authentication in QKD.

Digital Image Protection using Keyed Hash Function

2012 ◽  
Vol 2 (2) ◽  
pp. 36-47 ◽  
Author(s):  
Siva Charan Muraharirao ◽  
Manik Lal Das
Keyword(s):  
Digital Image ◽  
Digital Signature ◽  
Hash Function ◽  
Image Authentication ◽  
Experimental Results ◽  
Public Key ◽  
Message Authentication ◽  
Authentication Codes ◽  
Message Authentication Codes ◽  
Image Protection

Digital image authentication is an essential attribute for protecting digital image from piracy and copyright violator. Anti-piracy, digital watermarking, and ownership verification are some mechanisms evolving over the years for achieving digital image authentication. Cryptographic primitives, such as hash function, digital signature, and message authentication codes are being used in several applications including digital image authentication. Use of Least Significant Bit (LSB) is one of the classical approaches for digital image authentication. Although LSB approach is efficient, it does not provide adequate security services. On the other hand, digital signature-based image authentication provides better security, but with added computational cost in comparison with LSB approach. Furthermore, digital signature-based authentication approach requires managing public key infrastructure. Considering security weakness of LSB-based approach and cost overhead of public key based approach, the authors present a digital image authentication scheme using LSB and message authentication codes (MAC). The MAC-based approach for authenticating digital image is secure and efficient approach without public key management overhead. The authors also provide experimental results of the proposed scheme using MATLAB. The experimental results show that the proposed scheme is efficient and secure in comparisons with other schemes.

Pseudorandom Generators Based on One-Way Functions

2014 ◽  
Vol 577 ◽  
pp. 820-823
Author(s):  
Shu Jing Gao ◽  
Ting Qiang Song ◽  
Wei Zhang
Keyword(s):  
Hash Function ◽  
Pseudorandom Generator ◽  
Pseudorandom Generators ◽  
Output Sequence ◽  
Universal Hash Function ◽  
The One ◽  
One Way Function ◽  
Important Notion

Pseudorandom Generators is an important notion of cryptography. A new randomized iterating method of one-way function is proposed, after the analyzing of current research on pseudorandom generators based on one-way function. On the basis of this randomized iteration, a pseudorandom generator with linear seeds length is constructed using general regular one-way function and universal hash function. The output sequence of the proposed PRNG is unpredictable and the length of the seeds is linear to the input length of the one-way function.

An Improved Hashing Function for Human Authentication System

2013 ◽  
Vol 3 (2) ◽  
pp. 32-42
Author(s):  
Lamiaa M. El Bakrawy ◽  
Neveen I. Ghali
Keyword(s):  
Hash Function ◽  
Image Authentication ◽  
Inherent Limitation ◽  
Security Assurance ◽  
Feature Extraction And Selection ◽  
Authentication System ◽  
Five Phases ◽  
Hashing Function ◽  
False Rejection ◽  
Selection Phase

Biometrics have the great advantage of recognition based on an intrinsic aspect of a human being and thus requiring the person to be authenticated for physical presentation. Unfortunately, biometrics suffer from some inherent limitation such as high false rejection when the system works at a low false acceptation rate. In this paper, near set are implemented to improve the Standard Secure Hash Function SHA-1 (ISHA-1) for strict multi-modal biometric image authentication system. The proposed system is composed of five phases, starting from feature extraction and selection phase, hashing computing that uses the ISHA-1 phase, embedding watermark phase, extraction and decryption watermark phase, and finally the authentication phase. Experimental results showed that the proposed algorithm guarantees the security assurance and reduces the time of implementation.

scholarly journals The Definition and Software Performance of Hashstream, a Fast Length-Flexible PRF

Cryptography ◽  
2018 ◽  
Vol 2 (4) ◽  
pp. 31 ◽  
Author(s):  
Ted Krovetz
Keyword(s):  
Hash Function ◽  
Provable Security ◽  
Stream Cipher ◽  
Software Performance ◽  
Authenticated Encryption ◽  
Random Generation ◽  
Process Data ◽  
Straightforward Manner ◽  
Caesar Competition ◽  
Universal Hash Function

Two of the fastest types of cryptographic algorithms are the stream cipher and the almost-universal hash function. There are secure examples of each that process data in software using less than one CPU cycle per byte. Hashstream combines the two types of algorithms in a straightforward manner yielding a PRF that can both consume inputs of and produce pseudorandom outputs of any desired length. The result is an object useful in many contexts: authentication, encryption, authenticated encryption, random generation, mask generation, etc. The HS1-SIV authenticated-encryption algorithm—a CAESAR competition second round selection—was based on Hashstream and showed the promise of such an approach by having provable security and topping the speed charts in several test configurations.

Sign in / Sign up

Export Citation Format

Share Document