Collective Verification Strategies for Complexity Reduction in Homomorphic MAC
Research output: Contribution to book/Conference proceedings/Anthology/Report › Conference contribution › Contributed › peer-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 language | English |
|---|---|
| Title of host publication | IEEE Globecom Workshops, GC Wkshps, 2025 |
| Pages | 302-307 |
| Number of pages | 6 |
| ISBN (electronic) | 979-8-3315-6741-5 |
| Publication status | Published - Jul 2026 |
| Peer-reviewed | Yes |
Publication series
| Series | IEEE Globecom Workshops, GC Wkshps |
|---|---|
| ISSN | 2166-0069 |
Conference
| Title | 2025 IEEE Global Communications Conference |
|---|---|
| Subtitle | Sustainable Communications for Ubiquitous Intelligence |
| Abbreviated title | GLOBECOM 2025 |
| Duration | 8 - 12 December 2025 |
| Website | |
| Location | Taipei International Convention Center (TICC) & Taipei World Trade Center (TWTC) |
| City | Taipei |
| Country | Taiwan, Province of China |
External IDs
| ORCID | /0000-0001-8469-9573/work/222761034 |
|---|---|
| ORCID | /0000-0001-7008-1537/work/222762551 |
Keywords
ASJC Scopus subject areas
Keywords
- Authentication, Computational Complexity, Homomorphic MAC, Random Linear Network Coding, Security