Error-Correcting Message Authentication for 5G

@inproceedings{Dubrova2016ErrorCorrectingMA,
  title={Error-Correcting Message Authentication for 5G},
  author={Elena Dubrova and Mats N{\"a}slund and G{\"o}ran Selander and Karl Norrman},
  booktitle={MobiMedia},
  year={2016}
}
Message Authentication Codes (MACs) used in today's wireless communication standards are not capable of correcting errors which may occur during transmission. If MAC verification fails, the message is typically discarded and a retransmission is requested. Re-transmissions waste energy and increase average packet latency. Excessive re-transmissions may lead to network congestion. In this paper, we introduce a new MAC, MAC-C, which efficiently combines integrity protection with single-bit error… 
SYNERGY: Rethinking Secure-Memory Design for Error-Correcting Memories
TLDR
This paper proposes Synergy, a reliability-security co-design that improves performance of secure execution while providing strong reliability for systems with 9-chip ECC-DIMMs and increases reliability by 185x compared to ECCs that provide Single-Error Correction, Double-Error Detection (SECDED) capability.
A BRIEF STUDY FOR RESOURCE MANAGEMENT IN 5G HETEROGENEOUS NETWORKS
TLDR
To address problems with the small cells in 5G HetNets, software-defined networking [SDN] enabled fast authentication scheme is used.
On Designing PUF-Based TRNGs with Known Answer Tests
  • Yang Yu, E. Dubrova, M. Näslund, S. Tao
  • Computer Science
    2018 IEEE Nordic Circuits and Systems Conference (NORCAS): NORCHIP and International Symposium of System-on-Chip (SoC)
  • 2018
TLDR
This paper proposes a method for designing physical unclonable function (PUF)-based TRNGs which can be tested in-field by known answer tests and presents a prototype FPGA implementation of the proposed TRNG based on an arbiter PUF which passes all NIST 800-22 statistical tests.
On Designing PUF-Based TRNGs with Known Answer Tests
  • Yang Yu, E. Dubrova, M. Näslund, S. Tao
  • Computer Science
    2018 IEEE Nordic Circuits and Systems Conference (NORCAS): NORCHIP and International Symposium of System-on-Chip (SoC)
  • 2018
TLDR
This paper proposes a method for designing physical unclonable function (PUF)-based TRNGs which can be tested in-field by known answer tests and presents a prototype FPGA implementation of the proposed TRNG based on an arbiter PUF which passes all NIST 800-22 statistical tests.
Vowel Harmony Viewed as Error-Correcting Code
TLDR
The example of VH shows that the notion of an ECC serves as a suitable formal model not only for technical but also for natural robustness, and is provided as empirical as well as formal evidence on this fact.

References

SHOWING 1-10 OF 28 REFERENCES
Message Authentication Codes with Error Correcting Capabilities
TLDR
A new notion of error tolerant forgery of hash messages is introduced, which allows full error recovery for all applications, while being error-tolerant for less information-sensitive applications.
Efficient Noise-Tolerant Message Authentication Codes Using Direct Sequence Spread Spectrum Technique
  • S. Xiao, C. Boncelet
  • Computer Science
    2006 40th Annual Conference on Information Sciences and Systems
  • 2006
We present a new scheme to reduce the communications requirements for sending noise-tolerant message authentication codes (NTMACs), by sending the NTMAC's over direct sequence spread spectrum
CRC-Based Message Authentication for 5G Mobile Technology
TLDR
A new CRC-based message authentication method that enables combining the detection of random and malicious errors without increasing bandwidth and provides a quantitative analysis of the achieved security as a function of message and CRC sizes is presented.
Error Correcting and Weighted Noise Tolerant Message Authentication Codes
TLDR
A novel algorithm as an enhancement of NTMAC and a variant of EC-NTMAC, called the Error Correcting - Weighted N TMAC (EC-WNTMAC), which makes the EC- NTMAC more suitable for some applications like image and multimedia communications where few errors are acceptable.
Approximate Message Authentication Codes for$N$-ary Alphabets
TLDR
The generalized generalized AMAC algorithm and its probabilistic model are developed and a statistical analysis characterizing the behavior of the AMACs is provided along with the simulations illustrating their properties.
Cryptographically Secure CRC for Lightweight Message Authentication
TLDR
A simple and practical hashing scheme based on Cyclic Redundancy Check (CRC) that detects both, random and malicious, errors without increasing bandwidth is presented and seems to be particularly attractive for the authentication of short messages.
Unconditionally Secure Approximate Message Authentication
TLDR
This paper develops a framework for approximate message authentication systems in unconditionally security setting and derives lower bounds on an opponent's deception probability in these attacks under the assumption that all keys are equiprobable.
A survey of information authentication
The general principles that underlie all authentication schemes are reviewed and illustrated using the examples of an early telegraphy cable code, a US military authentication protocol, and
UMAC: Fast and Secure Message Authentication
TLDR
A message authentication algorithm, UMAC, which can authenticate messages roughly an order of magnitude faster than current practice (e.g., HMAC-SHA1), and about twice as fast as times previously reported for the universal hash-function family MMH.
On Computationally Secure Authentication Tags Requiring Short Secret Shared Keys
TLDR
As an application of strongly universal-2 classes of hash functions, Wegman and Carter have proposed a provably secure authentication tag system that requires that the sender and the receiver share a rather long secret key if they wish to use the system more than once.
...
1
2
3
...