Collective Verification Strategies for Complexity Reduction in Homomorphic MAC

Publikation: Beitrag in Buch/Konferenzbericht/Sammelband/Gutachten › Beitrag in Konferenzband › Beigetragen › Begutachtung

Beitragende

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

OriginalspracheEnglisch
TitelIEEE Globecom Workshops, GC Wkshps, 2025
Seiten302-307
Seitenumfang6
ISBN (elektronisch)979-8-3315-6741-5
PublikationsstatusVeröffentlicht - Juli 2026
Peer-Review-StatusJa

Publikationsreihe

ReiheIEEE Globecom Workshops, GC Wkshps
ISSN2166-0069

Konferenz

Titel2025 IEEE Global Communications Conference
UntertitelSustainable Communications for Ubiquitous Intelligence
KurztitelGLOBECOM 2025
Dauer8 - 12 Dezember 2025
Webseite
OrtTaipei International Convention Center (TICC) & Taipei World Trade Center (TWTC)
StadtTaipei
LandTaiwan

Externe IDs

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

Schlagworte

ASJC Scopus Sachgebiete

Schlagwörter

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