Quick Verification and Security Integrity of Emergency Messages Communication over Wireless Network

Communication over wireless networks is increasingly vital for reliable, low-latency transmission of small messages by resource-constrained devices. These devices often struggle with the demands of implementing robust integrity security for emergency messages. Our solution, the BB-MAC (Bit by Bit Message Authentication Code) method, addresses this challenge with a quick, memory-efficient approach rooted in the Carter-Wegman structure. The key idea is to shift resource-intensive computations to idle periods, conserving critical time during latency-sensitive phases when new data must be processed. BB-MAC employs a universal hash function for Bit by Bit pre-computation of integrity security, minimizing XOR cycles during critical operations. Our research on embedded systems shows that BB-MAC outperforms recent methods in terms of delay and memory overhead, particularly for small payloads, making it a superior choice for safeguarding resource-limited devices under stringent security and latency requirements.

Authors

Institutions

Publication Details

Published
2024-12-06
DOI
https://doi.org/10.1109/ccis63231.2024.10931903
Primary Topic
IPv6, Mobility, Handover, Networks, Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quick Verification and Security Integrity of Emergency Messages Communication over Wireless Network

Dhananjay Kumar Singh, Diwakar Bhardwaj
IPv6, Mobility, Handover, Networks, Security
article

Quick Verification and Security Integrity of Emergency Messages Communication over Wireless Network

Dhananjay Kumar Singh, Diwakar Bhardwaj
article en

Abstract

Communication over wireless networks is increasingly vital for reliable, low-latency transmission of small messages by resource-constrained devices. These devices often struggle with the demands of implementing robust integrity security for emergency messages. Our solution, the BB-MAC (Bit by Bit Message Authentication Code) method, addresses this challenge with a quick, memory-efficient approach rooted in the Carter-Wegman structure. The key idea is to shift resource-intensive computations to idle periods, conserving critical time during latency-sensitive phases when new data must be processed. BB-MAC employs a universal hash function for Bit by Bit pre-computation of integrity security, minimizing XOR cycles during critical operations. Our research on embedded systems shows that BB-MAC outperforms recent methods in terms of delay and memory overhead, particularly for small payloads, making it a superior choice for safeguarding resource-limited devices under stringent security and latency requirements.

GLA University (IN)
Openalex Percentile: Top 73%
IPv6, Mobility, Handover, Networks, Security
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.

Quick Verification and Security Integrity of Emergency Messages Communication over Wireless Network — Dhananjay Kumar Singh, Diwakar Bhardwaj · (2024) | TGRS Research Map | TGRS