Two-Dimensional Compound Message Authentication Code in Lossy Channels

Efficient message authentication is crucial for secure communications. However, the traditional integrity check scheme imposes significant overhead by appending a unique Message Authentication Code (MAC) to each message. At the same time, existing solutions such as aggregate and compound MACs attempt to reduce this overhead by transmitting one MAC tag per multiple messages. This strategy is ineffective in lossy environments where any message loss prevents the corresponding tag from verifying the other messages assigned to it. In this paper, we introduce a novel two-dimensional (2D) MAC structure that organizes messages in a 2D format and computes a single authentication tag for each row and column. This approach enables precise identification of modified or erroneous messages using fewer tags than conventional methods. By integrating the 2D MAC structure with superimposed coding techniques, we further reduce bandwidth consumption by allowing simultaneous transmission of messages and authentication tags. Experimental validation in Wi-Fi networks demonstrates over 20 % increase in authentication throughput, with analytical results indicating additional improvements when tags are superimposed onto the message.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/icc52391.2025.11161584
Primary Topic
Error Correcting Code Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Two-Dimensional Compound Message Authentication Code in Lossy Channels

SeyedMohammad Kashani, Sang Wu Kim, Ashfaq Khokhar
Error Correcting Code Techniques
article

Two-Dimensional Compound Message Authentication Code in Lossy Channels

SeyedMohammad Kashani, Sang Wu Kim, Ashfaq Khokhar
article en

Abstract

Efficient message authentication is crucial for secure communications. However, the traditional integrity check scheme imposes significant overhead by appending a unique Message Authentication Code (MAC) to each message. At the same time, existing solutions such as aggregate and compound MACs attempt to reduce this overhead by transmitting one MAC tag per multiple messages. This strategy is ineffective in lossy environments where any message loss prevents the corresponding tag from verifying the other messages assigned to it. In this paper, we introduce a novel two-dimensional (2D) MAC structure that organizes messages in a 2D format and computes a single authentication tag for each row and column. This approach enables precise identification of modified or erroneous messages using fewer tags than conventional methods. By integrating the 2D MAC structure with superimposed coding techniques, we further reduce bandwidth consumption by allowing simultaneous transmission of messages and authentication tags. Experimental validation in Wi-Fi networks demonstrates over 20 % increase in authentication throughput, with analytical results indicating additional improvements when tags are superimposed onto the message.

Iowa State University (US)
Openalex Percentile: Top 69%
Error Correcting Code Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Two-Dimensional Compound Message Authentication Code in Lossy Channels — SeyedMohammad Kashani, Sang Wu Kim, et al. · (2025) | TGRS Research Map | TGRS