Collective Verification Strategies for Complexity Reduction in Homomorphic MAC

Research output: Contribution to book/Conference proceedings/Anthology/ReportConference contributionContributedpeer-review

Contributors

Abstract

Homomorphic Message Authentication Code (HMAC) protects communications networks from pollution attacks by verifying every message. However, complex verification processes hinder current schemes from adoption, especially for large-scale systems. We introduce Low-Complexity Homomorphic Message Authentication Code, reducing verification complexity and significantly accelerating the process by employing advanced verification methods across multiple nodes. LC-HMAC leverages batch verifications and incorporates previous verification results, resulting in a more efficient verification. Simulations demonstrate that the best LC-HMAC variation, Adversary Rate-based Verification (ARV), reduces the added latency by up to 32.47% and 40%, respectively, compared to its counterpart Batch Verification (BV) and the state-of-the-art Single Packet Verification (SPV).

Details

Original languageEnglish
Title of host publicationIEEE Globecom Workshops, GC Wkshps, 2025
Pages302-307
Number of pages6
ISBN (electronic)979-8-3315-6741-5
Publication statusPublished - Jul 2026
Peer-reviewedYes

Publication series

SeriesIEEE Globecom Workshops, GC Wkshps
ISSN2166-0069

Conference

Title2025 IEEE Global Communications Conference
SubtitleSustainable Communications for Ubiquitous Intelligence
Abbreviated titleGLOBECOM 2025
Duration8 - 12 December 2025
Website
LocationTaipei International Convention Center (TICC) & Taipei World Trade Center (TWTC)
CityTaipei
CountryTaiwan, Province of China

External IDs

ORCID /0000-0001-8469-9573/work/222761034
ORCID /0000-0001-7008-1537/work/222762551

Keywords

Keywords

  • Authentication, Computational Complexity, Homomorphic MAC, Random Linear Network Coding, Security