Message Authentication Based on Cryptographically Secure CRC without Polynomial Irreducibility Test

Dubrova, Elena; Näslund, Mats; Selander, Göran; Lindqvist, Fredrik

doi:10.1007/s12095-017-0227-8

Cited by 18 publications

(6 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, they increased the security by embedding DNA cryptography on a smart card, and to prevent unauthorized access manually or digitally, they used geo-detection which compares the unregistered device's location with the user's location using any of their personal devices such as smart phone or table. In 2018 [13], Dubrova et al presented a message authentication using secure cyclic redundancy check (CRC). It detects both random and malicious faults without raising bandwidth, according to the researchers, and the distinction from prior systems is that it uses random generator polynomials rather than irreducible generator polynomials.…”

Section: Related Workmentioning

confidence: 99%

Signing and Verifying Encrypted Medical Images Using Double Random Phase Encryption

Abdallah

Elkamchouchi

2022

Entropy

View full text Add to dashboard Cite

Digital Signature using Self-Image signing is introduced in this paper. This technique is used to verify the integrity and originality of images transmitted over insecure channels. In order to protect the user’s medical images from changing or modifying, the images must be signed. The proposed approach uses the Discrete Wavelet Transform to subdivide a picture into four bands and the Discrete Cosine Transform DCT is used to embed a mark from each sub-band to another sub-band of DWT according to a determined algorithm. To increase the security, the marked image is then encrypted using Double Random Phase Encryption before transmission over the communication channel. By verifying the presence of the mark, the authority of the sender is verified at the receiver. Authorized users’ scores should, in theory, always be higher than illegal users’ scores. If this is the case, a single threshold might be used to distinguish between authorized and unauthorized users by separating the two sets of scores. The results are compared to those obtained using an approach that does not employ DWT.

show abstract

Section: Related Workmentioning

confidence: 99%

Signing and Verifying Encrypted Medical Images Using Double Random Phase Encryption

Abdallah

Elkamchouchi

2022

Entropy

View full text Add to dashboard Cite

show abstract

“…In the literature, most of the studies providing an authentication service for CAN tackle the message-based transmission of CAN [ 26 , 27 , 28 ]. An authentication tag, which is referred to as a message authentication code (MAC), for message authentication is mainly generated by a secure hash function from a given original message [ 29 , 30 , 31 , 32 ]. This approach requires a symmetric key between sending and receiving nodes to generate and verify MAC [ 33 , 34 , 35 ].…”

Section: Background and Challengesmentioning

confidence: 99%

CANon: Lightweight and Practical Cyber-Attack Detection for Automotive Controller Area Networks

Baek

Shin

2022

Sensors

View full text Add to dashboard Cite

Automotive cyber-physical systems are in transition from the closed-systems to open-networking systems. As a result, in-vehicle networks such as the controller area network (CAN) have become essential to connect to inter-vehicle networks through the various rich interfaces. Newly exposed security concerns derived from this requirement may cause in-vehicle networks to pose threats to automotive security and driver’s safety. In this paper, to ensure a high level of security of the in-vehicle network for automotive CPS, we propose a novel lightweight and practical cyber defense platform, referred to as CANon (CAN with origin authentication and non-repudiation), to be enabled to detect cyber-attacks in real-time. CANon is designed based on the hierarchical approach of centralized-session management and distributed-origin authentication. In the former, a gateway node manages each initialization vector and session of origin-centric groups consisting of two more sending and receiving nodes. In the latter, the receiving nodes belonging to the given origin-centric group individually perform the symmetric key-based detection against cyber-attacks by verifying each message received from the sending node, namely origin authentication, in real-time. To improve the control security, CANon employs a one-time local key selected from a sequential hash chain (SHC) for authentication of an origin node in a distributed mode and exploits the iterative hash operations with randomness. Since the SHC can constantly generate and consume hash values regardless of their memory capacities, it is very effective for resource-limited nodes for in-vehicle networks. In addition, through implicit key synchronization within a given group, CANon addresses the challenges of a key exposure problem and a complex key distribution mechanism when performing symmetric key-based authentication. To achieve lightweight cyber-attack detection without imposing an additive load on CAN, CANon uses a keyed-message authentication code (KMAC) activated within a given group. The detection performance of CANon is evaluated under an actual node of Freescale S12XF and virtual nodes operating on the well-known CANoe tool. It is seen that the detection rate of CANon against brute-force and replay attacks reaches 100% when the length of KMAC is over 16 bits. It demonstrates that CANon ensures high security and is sufficient to operate in real-time even on low-performance ECUs. Moreover, CANon based on several software modules operates without an additive hardware security module at an upper layer of the CAN protocol and can be directly ported to CAN-FD (CAN with Flexible Data rate) so that it achieves the practical cyber defense platform.

show abstract

“…Krawczyk [40] has shown that a CRC with an irreducible 1 generator polynomial as the key of the function is an -almost-XOR-universal family of hash functions for = (l + n)/2 n−1 , where l is the message size and n is the CRC size, provided that the CRC is encrypted with a one-time pad of size n. In [41] his result was extended to the case of arbitrary reducible polynomials and odd 2 polynomials. The extensions eliminate the need for irreducibility tests, however, have a negative impact on .…”

Section: E Almost Xor-universal Hash Functionsmentioning

confidence: 99%

CRC-PUF: A Machine Learning Attack Resistant Lightweight PUF Construction

Dubrova

Naslund

Degen

et al. 2019

2019 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW)

Self Cite

View full text Add to dashboard Cite

Adversarial machine learning is an emerging threat to security of Machine Learning (ML)-based systems. However, we can potentially use it as a weapon against ML-based attacks. In this paper, we focus on protecting Physical Unclonable Functions (PUFs) against ML-based modeling attacks. PUFs are an important cryptographic primitive for secret key generation and challenge-response authentication. However, none of the existing PUF constructions are both ML attack resistant and sufficiently lightweight to fit low-end embedded devices. We present a lightweight PUF construction, CRC-PUF, in which input challenges are de-synchronized from output responses to make a PUF model difficult to learn. The de-synchronization is done by an input transformation based on a Cyclic Redundancy Check (CRC). By changing the CRC generator polynomial for each new response, we assure that success probability of recovering the transformed challenge is at most 2 −86 for 128-bit challenges and responses.

show abstract

Message Authentication Based on Cryptographically Secure CRC without Polynomial Irreducibility Test

Cited by 18 publications

References 32 publications

Signing and Verifying Encrypted Medical Images Using Double Random Phase Encryption

Signing and Verifying Encrypted Medical Images Using Double Random Phase Encryption

CANon: Lightweight and Practical Cyber-Attack Detection for Automotive Controller Area Networks

CRC-PUF: A Machine Learning Attack Resistant Lightweight PUF Construction

Contact Info

Product

Resources

About