More Web Proxy on the site http://driver.im/

research-article

Lightweight Message Authentication for Constrained Devices

Authors:

Göran Selander,

Fredrik LindqvistAuthors Info & Claims

WiSec '18: Proceedings of the 11th ACM Conference on Security & Privacy in Wireless and Mobile Networks

Pages 196 - 201

https://doi.org/10.1145/3212480.3212482

Published: 18 June 2018 Publication History

Abstract

Message Authentication Codes (MACs) used in today's wireless communication standards may not be able to satisfy resource limitations of simpler 5G radio types and use cases such as machine type communications. As a possible solution, we present a lightweight message authentication scheme based on the cyclic redundancy check (CRC). It has been previously shown that a CRC with an irreducible generator polynomial as the key is an ϵ-almost XOR-universal (AXU) hash function with ϵ = (m + n)/2n-1, where m is the message size and n is the CRC size. While the computation of n-bit CRCs can be efficiently implemented in hardware using linear feedback shift registers, generating random degree-n irreducible polynomials is computationally expensive for large n. We propose using a product of k irreducible polynomials whose degrees sum up to n as a generator polynomial for an n-bit CRC and show that the resulting hash functions are ϵ-AXU with ϵ = (m + n)k/2n-k. The presented message authentication scheme can be seen as providing a trade-off between security and implementation efficiency.

References

[1]

Mihir Bellare, Ran Canetti, and Hugo Krawczyk. 1996. Keying Hash Functions for Message Authentication. In Advances in Cryptology - CRYPTO'96, Neal Koblitz (Ed.). LNCS, Vol. 1109. Springer Berlin Heidelberg, 1--15.

Digital Library

[2]

Mihir Bellare, Joe Kilian, and Phillip Rogaway. 1994. The Security of Cipher Block Chaining. In Advances in Cryptology - CRYPTO'94, Yvo G. Desmedt (Ed.). LNCS, Vol. 839. Springer Berlin Heidelberg, 341--358.

Digital Library

[3]

Claude Berrou. 2011. Codes and turbo codes. Springer Science & Business Media.

Digital Library

[4]

Jesper Birch, Lars Gylling Christensen, and Morton Skov. 1992. A Programmable 800 Mbit/s CRC Check/Generator Unit for LANs and MANs. Comput. Netw. ISDN Syst. 24, 2 (April 1992), 109--118.

Digital Library

[5]

Gilles Brassard. 1983. On Computationally Secure Authentication Tags Requiring Short Secret Shared Keys. In Advances in Cryptology, David Chaum, Ronald L. Rivest, and Alan T. Sherman (Eds.). Springer US, 79--86.

[6]

Richard P. Brent and Paul Zimmermann. 2008. Three Ways to Test Irreducibility. http://maths-people.anu.edu.au/~brent/pd/MASCOS02t4.pdf.

[7]

Yvo Desmedt. 1986. Unconditionally Secure Authentication Schemes and Practical and Theoretical Consequences. In Advances in Cryptology - CRYPTO'85, Hugh C. Williams (Ed.). LNCS, Vol. 218. Springer Berlin Heidelberg, 42--55.

Digital Library

[8]

Yevgeniy Dodis. 2013. Randomness in Cryptography. http://cs.nyu.edu/~dodis/randomness-in-crypto/.

[9]

Elena Dubrova, Mats Naslund, and Goran Selander. 2015. CRC-Based Message Authentication for 5G Mobile Technology. In Proceedings of 1st IEEE International Workshop on 5G Security.

Digital Library

[10]

Elena Dubrova, Mats Näslund, Göran Selander, and Fredrik Lindqvist. 2018. Message Authentication Based on Crypto graphic ally Secure CRC without Polynomial Irreducibility Test. Cryptography and Communications 10 (March 2018), 383--399. Issue 2.

Digital Library

[11]

Ericsson. 2015. 5G security. www.ericsson.com/res/docs/whitepapers/5G-security.pdf.

[12]

Niels Ferguson. 2005. Authentication weaknesses in GCM. csrc.nist.gov/groups/ST/toolkit/BCM/documents/comments/CWC-GCM/Ferguson2.pdf.

[13]

Shuhong Gao and Daniel Panario. 1997. Tests and Constructions of Irreducible Polynomials over Finite Fields. In Foundations of Computational Mathematics, Felipe Cucker and Michael Shub (Eds.). Springer Berlin Heidelberg, 346--361.

Digital Library

[14]

S.W. Golomb. 1982. Shift Register Sequences. Aegean Park Press.

Digital Library

[15]

P. Koopman and T. Chakravarty. 2004. Cyclic redundancy code (CRC) polynomial selection for embedded networks. In Dependable Systems and Networks, 2004 International Conference on. 145--154.

Digital Library

[16]

Hugo Krawczyk. 1994. LFSR-based Hashing and Authentication. In Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology (CRYPTO'94). Springer-Verlag, London, UK, 129--139.

Digital Library

[17]

National Institute of Standards and Technology. 2015. FIPS PUB 202: SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions. http://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.202.pdf.

[18]

T.-B. Pei and C. Zukowski. 1992. High-speed parallel CRC circuits in VLSI. IEEE Transactions on Communications 40, 4 (Apr. 1992), 653--657.

[19]

W.W. Peterson and D.T. Brown. 1961. Cyclic Codes for Error Detection. Proceedings of the IRE 49, 1 (Jan. 1961), 228--235.

[20]

M. Rabin. 1981. Fingerprinting by random polynomials. Technical Report TR-15-81. Center for Research in Computing Technology, Harvard Univ., Cambridge.

[21]

Ishtiaq Rouf, Rob Miller, Hossen Mustafa, Travis Taylor, Sangho Oh, Wenyuan Xu, Marco Gruteser, Wade Trappe, and Ivan Seskar. 2010. Security and Privacy Vulnerabilities of In-car Wireless Networks: A Tire Pressure Monitoring System Case Study. In 19th USENIX Conference on Security. Berkeley, CA, USA, 21--21.

Digital Library

[22]

Statista. 2018. Internet of Things (IoT) connected devices installed base worldwide from 2015 to 2025. https://www.statista.com/statistics/471264/iot-number-of-connected-devices-worldwide/.

[23]

D. R. Stinson. 1994. Universal Hashing and Authentication Codes. Des. Codes Cryptography 4, 4 (Oct. 1994), 369--380.

Digital Library

[24]

W. Trappe, R. Howard, and R. S. Moore. 2015. Low-Energy Security: Limits and Opportunities in the Internet of Things. IEEE Security Privacy 13, 1 (2015), 14--21.

Digital Library

[25]

Mark N. Wegman and J. Lawrence Carter. 1981. New hash functions and their use in authentication and set equality. J. Comput. System Sci. 22, 3 (1981), 265--279.

[26]

Yang Yu. 2017. Evaluation of Cryptographic CRC in 65nm CMOS. M. Sc. Thesis, Royal Institute of Technology (KTH), Sweden.

Cited By

Sharma GGrover JVerma A(2023)QSec-RPL: Detection of version number attacks in RPL based mobile IoT using Q-LearningAd Hoc Networks10.1016/j.adhoc.2023.103118142(103118)Online publication date: Apr-2023
https://doi.org/10.1016/j.adhoc.2023.103118
Wang SHuang KMa KXu XHu X(2022)A lightweight encryption and message authentication framework for wireless communicationIET Communications10.1049/cmu2.1253517:3(265-278)Online publication date: 8-Nov-2022
https://doi.org/10.1049/cmu2.12535

Index Terms

Lightweight Message Authentication for Constrained Devices
1. Security and privacy
  1. Cryptography
    1. Symmetric cryptography and hash functions
      1. Hash functions and message authentication codes

Recommendations

Message Authentication Based on Cryptographically Secure CRC without Polynomial Irreducibility Test

In this paper, we present a message authentication scheme based on cryptographically secure cyclic redundancy check (CRC). Similarly to previously proposed cryptographically secure CRCs, the presented one detects both random and malicious errors without ...
Efficient many-to-one authentication with certificateless aggregate signatures

Aggregate signatures allow an efficient algorithm to aggregate n signatures of n distinct messages from n different users into one single signature. The resulting aggregate signature can convince a verifier that the n users did indeed sign the n ...
A Secure YS-Like User Authentication Scheme

Recently, there are several articles proposed based on Yang and Shieh's password authentication schemes (YS for short) with the following features: (1) A user can choose password freely. (2) The server does not need to maintain a password table. (3) ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

WiSec '18: Proceedings of the 11th ACM Conference on Security & Privacy in Wireless and Mobile Networks

June 2018

317 pages

ISBN:9781450357319

DOI:10.1145/3212480

General Chair:
Panos Papadimitratos
KTH, Sweden
,
Program Chairs:
Kevin Butler
University of Florida, USA
,
Christina Pöpper
New York University Abu Dhabi, UAE

Copyright © 2018 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

In-Cooperation

SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 June 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Funding Sources

Stiftelsen för Strategisk Forskning

Conference

WiSec '18

Sponsor:

SIGSAC

WiSec '18: 11th ACM Conference on Security & Privacy in Wireless and Mobile Networks

June 18 - 20, 2018

Stockholm, Sweden

Acceptance Rates

Overall Acceptance Rate 98 of 338 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
249
Total Downloads

Downloads (Last 12 months)11
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Sharma GGrover JVerma A(2023)QSec-RPL: Detection of version number attacks in RPL based mobile IoT using Q-LearningAd Hoc Networks10.1016/j.adhoc.2023.103118142(103118)Online publication date: Apr-2023
https://doi.org/10.1016/j.adhoc.2023.103118
Wang SHuang KMa KXu XHu X(2022)A lightweight encryption and message authentication framework for wireless communicationIET Communications10.1049/cmu2.1253517:3(265-278)Online publication date: 8-Nov-2022
https://doi.org/10.1049/cmu2.12535

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten