Digital Image Protection using Keyed Hash Function

Author(s):  
Siva Charan Muraharirao ◽  
Manik Lal Das

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.

Author(s):  
Siva Charan Muraharirao ◽  
Manik Lal Das

The recent advances in multimedia technology demand protection of digital images from unintentional manipulation for content integrity, copyright, and ownership. Digital watermarking technique has wide acceptance in the industry for anti-piracy, ownership verification, and digital image authentication. There have been a large number of schemes in the literature proposed for digital watermarking using non-cryptographic and cryptographic primitives. Use of Least Significant Bits (LSB) is one of the oldest but classical approaches for digital image authentication. Although LSB approach is efficient, it does not provide adequate security. Cryptographic primitives such as hash function, digital signature, and message authentication codes have been used in several applications including multimedia for data authentication. Digital signature-based image authentication provides strong security, but the approach requires managing public key infrastructure, which is a costly operation. Partial data protection is also an optimal approach for protecting important data while leaving unimportant data unprotected. Considering security weakness of the LSB-based approach and cost overhead of the public key-based approach, the authors present in this chapter a digital image authentication scheme using LSB, keyed hash, and partial encryption. They show that the proposed watermarking scheme is secure and efficient in comparison to other related schemes.


Author(s):  
Kannan Balasubramanian

Cryptographic Hash Functions are used to achieve a number of Security goals like Message Authentication, Message Integrity, and are also used to implement Digital Signatures (Non-repudiation), and Entity Authentication. This chapter discusses the construction of hash functions and the various attacks on the Hash functions. The Message Authentication Codes are similar to the Hash functions except that they require a key for producing the message digest or hash. Authenticated Encryption is a scheme that combines hashing and Encryption. The Various types of hash functions like one-way hash function, Collision Resistant hash function and Universal hash functions are also discussed in this chapter.


Author(s):  
Eik List ◽  
Mridul Nandi

There is an ongoing trend in the symmetric-key cryptographic community to construct highly secure modes and message authentication codes based on tweakable block ciphers (TBCs). Recent constructions, such as Cogliati et al.’s HaT or Iwata et al.’s ZMAC, employ both the n-bit plaintext and the t-bit tweak simultaneously for higher performance. This work revisits ZMAC, and proposes a simpler alternative finalization based on HaT. As a result, we propose HtTBC, and call its instantiation with ZHash as a hash function ZMAC+. Compared to HaT, ZMAC+ (1) requires only a single key and a single primitive. Compared to ZMAC, our construction (2) allows variable, per-query parametrizable output lengths. Moreover, ZMAC+ (3) avoids the complex finalization of ZMAC and (4) improves the security bound from Ο(σ2/2n+min(n,t)) to Ο(q/2n + q(q + σ)/2n+min(n,t)) while retaining a practical tweak space.


Author(s):  
Keith M. Martin

This chapter discusses cryptographic mechanisms for providing data integrity. We begin by identifying different levels of data integrity that can be provided. We then look in detail at hash functions, explaining the different security properties that they have, as well as presenting several different applications of a hash function. We then look at hash function design and illustrate this by discussing the hash function SHA-3. Next, we discuss message authentication codes (MACs), presenting a basic model and discussing basic properties. We compare two different MAC constructions, CBC-MAC and HMAC. Finally, we consider different ways of using MACs together with encryption. We focus on authenticated encryption modes, and illustrate these by describing Galois Counter mode.


2005 ◽  
Vol 05 (01) ◽  
pp. 135-148 ◽  
Author(s):  
QIBIN SUN ◽  
SHUIMING YE ◽  
CHING-YUNG LIN ◽  
SHIH-FU CHANG

With the ambient use of digital images and the increasing concern on their integrity and originality, consumers are facing an emergent need of authenticating degraded images despite lossy compression and packet loss. In this paper, we propose a scheme to meet this need by incorporating watermarking solution into traditional cryptographic signature scheme to make the digital signatures robust to these image degradations. Due to the unpredictable degradations, the pre-processing and block shuffling techniques are applied onto the image at the signing end to stabilize the feature extracted at the verification end. The proposed approach is compatible with traditional cryptographic signature scheme except that the original image needs to be watermarked in order to guarantee the robustness of its derived digital signature. We demonstrate the effectiveness of this proposed scheme through practical experimental results.


Sign in / Sign up

Export Citation Format

Share Document