scholarly journals Square Hash: Fast Message Authentication via Optimized Universal Hash Functions

1999 ◽  
pp. 234-251 ◽  
Author(s):  
Mark Etzel ◽  
Sarvar Patel ◽  
Zulfikar Ramzan
Keyword(s):  
Hash Functions ◽  
Message Authentication

Data Integrity

2017 ◽  
Author(s):  
Keith M. Martin
Keyword(s):  
Hash Function ◽  
Hash Functions ◽  
Data Integrity ◽  
Message Authentication ◽  
Authenticated Encryption ◽  
Authentication Codes ◽  
Basic Model ◽  
Function Design ◽  
Security Properties ◽  
Different Levels

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.

Cryptanalysis of a Fragile Watermark Based H.264/AVC Video Authentication Scheme

2011 ◽  
Vol 145 ◽  
pp. 552-556 ◽  
Author(s):  
Grace C.W. Ting ◽  
Bok Min Goi ◽  
S. W. Lee
Keyword(s):  
Hash Function ◽  
Hash Functions ◽  
Authentication Scheme ◽  
The Internet ◽  
Message Authentication ◽  
High Definition ◽  
Video Authentication ◽  
Fragile Watermark ◽  
Private Key ◽  
Watermark Embedding

H.264/AVC is a widespread standard for high definition video (HD) for example DVD and HD videos on the internet. To prevent unauthorized modifications, video authentication can be used. In this paper, we present a cryptanalysis of a H.264/AVC video authentication scheme proposed by Saadi et al. [1] at EUSIPCO 2009. Our result will prevent situations where newer schemes are developed from the scheme thus amplifying the flaw. The designers claimed that the scheme can detect modifications on watermarked video. However, we show that an attacker can modify the watermarked video and compute a valid watermark such that the recipient will retrieve a watermark from the modified watermarked video that will match what the recipient computes during video authentication check. Thus, the recipient will think the tampered video is authentic. The first main problem of the scheme is its use of hash functions for watermark generation. Since hash functions are public functions not depending on any secret, the attacker can modify the watermarked video and feed this through the hash function to compute a new watermark. The second problem is that it is possible for the attacker to perform watermark embedding thus producing a modified watermarked video. On receiving the modified video, the recipient recomputes the watermark and compares this with the watermark extracted from the video. They will match because the embedded watermark and recomputed watermark use the same hash function based watermark generation and the same input i.e. the modified video. Our cryptanalysis strategy applies to any watermarking based video authentication scheme where the watermark and embedding are not functions of secrets. As countermeasure, the functions should be designed so that only legitimate parties can perform them. We present two improved schemes that solve this problem based on private key signing functions and message authentication functions respectively.

Hash Functions and Their Applications

2018 ◽  
pp. 66-77
Author(s):  
Kannan Balasubramanian
Keyword(s):  
Hash Function ◽  
Hash Functions ◽  
Digital Signatures ◽  
Message Authentication ◽  
Authenticated Encryption ◽  
Authentication Codes ◽  
Message Authentication Codes ◽  
Message Digest ◽  
Cryptographic Hash Functions

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.

scholarly journals Designing Two Secure Keyed Hash Functions Based on Sponge Construction and the Chaotic Neural Network

Entropy ◽  
2020 ◽  
Vol 22 (9) ◽  
pp. 1012 ◽  
Author(s):  
Nabil Abdoun ◽  
Safwan El Assad ◽  
Thang Manh Hoang ◽  
Olivier Deforges ◽  
Rima Assaf ◽  
...  
Keyword(s):  
Neural Network ◽  
Statistical Tests ◽  
Hash Functions ◽  
Message Authentication ◽  
Security Measures ◽  
Chaotic Neural Network ◽  
Chaotic Neural Networks ◽  
Classical Chaos ◽  
Neural Network System ◽  
Number Of Cycles

In this paper, we propose, implement, and analyze the structures of two keyed hash functions using the Chaotic Neural Network (CNN). These structures are based on Sponge construction, and they produce two variants of hash value lengths, i.e., 256 and 512 bits. The first structure is composed of two-layered CNN, while the second one is formed by one-layered CNN and a combination of nonlinear functions. Indeed, the proposed structures employ two strong nonlinear systems, precisely a chaotic system and a neural network system. In addition, the proposed study is a new methodology of combining chaotic neural networks and Sponge construction that is proved secure against known attacks. The performance of the two proposed structures is analyzed in terms of security and speed. For the security measures, the number of hits of the two proposed structures doesn’t exceed 2 for 256-bit hash values and does not exceed 3 for 512-bit hash values. In terms of speed, the average number of cycles to hash one data byte (NCpB) is equal to 50.30 for Structure 1, and 21.21 and 24.56 for Structure 2 with 8 and 24 rounds, respectively. In addition, the performance of the two proposed structures is compared with that of the standard hash functions SHA-3, SHA-2, and with other classical chaos-based hash functions in the literature. The results of cryptanalytic analysis and the statistical tests highlight the robustness of the proposed keyed hash functions. It also shows the suitability of the proposed hash functions for the application such as Message Authentication, Data Integrity, Digital Signature, and Authenticated Encryption with Associated Data.

CIPHER BLOCK BASED AUTHENTICATION MODULE: A HARDWARE DESIGN PERSPECTIVE

2011 ◽  
Vol 20 (02) ◽  
pp. 163-184 ◽  
Author(s):  
HARRIS E. MICHAIL ◽  
DIMITRIOS SCHINIANAKIS ◽  
COSTAS E. GOUTIS ◽  
ATHANASIOS P. KAKAROUNTAS ◽  
GEORGIOS SELIMIS
Keyword(s):  
Block Cipher ◽  
Hardware Design ◽  
Hash Functions ◽  
Message Authentication ◽  
Authentication Codes ◽  
Data Packets ◽  
Design And Implementation ◽  
Design Perspective ◽  
Encryption Algorithms ◽  
Block Based

Message Authentication Codes (MACs) are widely used in order to authenticate data packets, which are transmitted thought networks. Typically MACs are implemented using modules like hash functions and in conjunction with encryption algorithms (like Block Ciphers), which are used to encrypt the transmitted data. However NIST in May 2005 issued a standard, addressing certain applications and their needs, defining a way to implement MACs through FIPS-approved and secure block cipher algorithms. In this paper the best performing implementation of the CMAC standard is presented, in terms of throughput, along with an efficient AES design and implementation.

scholarly journals Information-Theoretically Secure Data Origin Authentication with Quantum and Classical Resources

Cryptography ◽  
2020 ◽  
Vol 4 (4) ◽  
pp. 31
Author(s):  
Georgios M. Nikolopoulos ◽  
Marc Fischlin
Keyword(s):  
Broad Class ◽  
Hash Functions ◽  
Message Authentication ◽  
Secret Key ◽  
Authentication Codes ◽  
Message Authentication Codes ◽  
Secure Data ◽  
Authentication Schemes ◽  
Better Than

In conventional cryptography, information-theoretically secure message authentication can be achieved by means of universal hash functions, and requires that the two legitimate users share a random secret key, which is at least twice as long as the tag. We address the question of whether quantum resources can offer any advantage over classical unconditionally secure message authentication codes. It is shown that a broad class of symmetric prepare-and-measure quantum message-authentication schemes cannot do better than their classical counterparts.

Sign in / Sign up

Export Citation Format

Share Document