2013•Unpublished venueRequires access

Reliability of Soft Verification of Message Authentication Codes

Natasa S. Zivic

Open publisher page 2 citations

Abstract

It is known that Message Authentication Codes are extremely sensitive to any change of the message they are appended to. Even one or more bits of the changed message invert about 50% of bits of Message Authentication Codes, making in such a way the message useless. The hard condition for the successful verification of Message Authentication Codes is that all bits of the received Message Authentication Code and that one recalculated of the received message have to be equal. This condition for the successful verification of messages protected by Message Authentication Codes is not suitable in many applications. Therefore an introduction of a softer condition for the successful verification would enable the correction and improvement of the verification rate of messages corrupted by transmission over a noisy channel. The following paper is based on an algorithm for Soft Verification which introduces robustness into the verification of messages protected by Message Authentication Codes together with a correction of messages corrupted due to the noisy channel. A soft output of the algorithm gives information about the reduction of the security level of the successful authentication to the source decoder. This information can be compared to reliability values as soft output of SISO channel decoder.

About this research paper

What this paper is about

It is known that Message Authentication Codes are extremely sensitive to any change of the message they are appended to. Even one or more bits of the changed message invert about 50% of bits of Message Authentication Codes, making in such a way the message useless. The hard condition for the successful verification of Message Authentication Codes is that all bits of the received Message Authentication Code and that one recalculated of the received message have to be equal. This condition for the successful verification of messages protected by Message Authentication Codes is not suitable in many applications. Therefore an introduction of a softer condition for the successful verification would enable the correction and improvement of the verification rate of messages corrupted by transmission over a noisy channel. The following paper is based on an algorithm for Soft Verification which introduces robustness into the verification of messages protected by Message Authentication Codes together with a correction of messages corrupted due to the noisy channel. A soft output of the algorithm gives information about the reduction of the security level of the successful authentication to the source decoder. This information can be compared to reliability values as soft output of SISO channel decoder.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

It is known that Message Authentication Codes are extremely sensitive to any change of the message they are appended to. Even one or more bits of the changed message invert about 50% of bits of Message Authentication Codes, making in such a way the message useless. The hard condition for the successful verification of Message Authentication Codes is that all bits of the received Message Authentication Code and that one recalculated of the received message have to be equal. This condition for the successful verification of messages protected by Message Authentication Codes is not suitable in many applications. Therefore an introduction of a softer condition for the successful verification would enable the correction and improvement of the verification rate of messages corrupted by transmission over a noisy channel. The following paper is based on an algorithm for Soft Verification which introduces robustness into the verification of messages protected by Message Authentication Codes together with a correction of messages corrupted due to the noisy channel. A soft output of the algorithm gives information about the reduction of the security level of the successful authentication to the source decoder. This information can be compared to reliability values as soft output of SISO channel decoder.

Key concepts: Message authentication code, Computer science, Hash-based message authentication code, Authentication (law), Message broker, Robustness (evolution), Computer network, Data Authentication Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Reliability of Soft Verification of Message Authentication Codes — Research Paper | ScholarLens