Novel ECC-Based RFID Mutual Authentication Protocol for Emerging IoT Applications

Gabsi, Souhir; Kortli, Yassin; Beroulle, Vincent; Kieffer, Yann; Alasiry, Areej; Hamdi, Belgacem

doi:10.1109/access.2021.3112554

Cited by 26 publications

(9 citation statements)

References 65 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Figure 11 illustrates FIGURE 13. ID size n id as a function of the cue size n cue for (q = 251, k i , k o = 251) {PPM, OOC1}-RS2 codes of dimensions k i ∈ {2, 3, 4, 5} of the outer RS code, and for (q = 251, m, r ) PPM-RM codes of parameter pairs (m, r ) ∈ { (3,15), (4,9), (5,7), (6,6)}. ID codes of the same color share the same overall block code length n and overall block code dimension k. Increasing the dimension k i of the inner RS code causes a minor increase in the ID size n id , while increasing the cue size n cue significantly.…”

Section: A Dimension Of Outer Rs Codementioning

confidence: 99%

“…For the error probability characteristics, Figure 17 illustrates the diverging behavior of the error probability bound λ 2 from the mean error probability p err for an increasing ID size n id . The cue size n cue follows the stepwise increases of the dimension k i ∈ [2,3,4,5,6] of the inner RS code. We increase the dimension k i of the inner RS code if the dimension k o otherwise (if k i is not increased) exceeds the threshold q k i −1 that we determined in Equation (40).…”

Section: ) Cue Size and Error Probability As A Function Of Id Sizementioning

confidence: 99%

“…An identity or a set of identification information is the main message of interest in various distributed information technology and communication systems. For instance, radiofrequency identification (RFID) systems [1], [2], [3], [4], [5] identify physical objects via attached tags or smart labels [6], [7], [8], [9] via principles of wireless communication. Similarly, the connection establishment procedure in cellular…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Identification Codes: A Topical Review With Design Guidelines for Practical Systems

et al. 2023

View full text Add to dashboard Cite

A wide range of information technology applications require the identification of a particular message or label that represents the identity of an object at a distance, e.g., over a wireless channel. Conventionally, the underlying information that represents the identity is transmitted over the channel, following the information-theoretic concept of message transmission. If the purpose of the interaction over the channel is only to verify (match) an identity, then the concept of identification over channels-utilizing the identification codes that have been developed by the information theory community-can provide an exponential efficiency gain over message transmission. This topical review article conducts for the first time a comprehensive detailed evaluation of the existing identification codes for the practically relevant regime of finite parameters. We examine essentially all published identification codes, including codes based on inner constant weight codes that are concatenated with outer linear block codes, such as Reed-Solomon and Reed-Muller codes. Specifically, we conduct a holistic identification code comparison based on the logarithm of the number of representable identities (in shannon), the size (in bit) of the transmitted cue that represents an identity, and the corresponding type II error probability bound for essentially all existing identification codes. Based on the resulting insights, we formulate guidelines for the design of practical (finite-parameter) identification codes. For instance, we find that a linear block code (without concatenation with a sophisticated inner constant-weight code) is sufficient for most practical identification code usages.

show abstract

Section: A Dimension Of Outer Rs Codementioning

confidence: 99%

Section: ) Cue Size and Error Probability As A Function Of Id Sizementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Identification Codes: A Topical Review With Design Guidelines for Practical Systems

et al. 2023

View full text Add to dashboard Cite

show abstract

“…It cannot also provide user anonymity. On the other hand, the RFID based mutual authentication protocol in [169] requires the execution of complex elliptic curve encryption. As such, it incurs high computing overheads [170], which is inefficient for the tags.…”

Section: Security Schemes For Cloud Environmentmentioning

confidence: 99%

Cloud computing communication environment security and performance: Challenges and probable solutions

Kanini¹

2023

World J. Adv. Eng. Technol. Sci.

View full text Add to dashboard Cite

The adoption of cloud computing has continued to grow, owing to its broad network access, remote accessibility, scalability, on demand self-service, rapid elasticity and resource pooling. In this environment, numerous devices are deployed to access the cloud data and services. This potentially increases the attack services, more so in public clouds. As such, the biggest challenge is the secure data exchange over insecure open network channels. This issue has seen the development of numerous security solutions over the recent past. In this paper, a survey of these security schemes, techniques and methods is provided. The findings indicate that majority of these methods have vulnerabilities that expose users to many attacks. Additionally, some of these security solutions have extremely high complexities that make the cloud communications inefficient.

show abstract

“…Desynchronization attacks can break this condition by blocking protocol messages or forcing protocol parties to modify their shared secret values to different values, preventing the parties from authenticating each other and destroying service availability. Many protocols have been developed in the literature to satisfy CIA security standards; however, multiple instances of attacks [2,[10][11][12][13][14] against them show that they have failed to achieve the needed security. As a result, attempts to build a secure protocol are still continuing, and new attacks are emerging that provide designers fresh insight into how to (not) design a protocol.…”

Section: Problem Definitionmentioning

confidence: 99%

An Enhanced RFID-Based Authentication Protocol using PUF for Vehicular Cloud Computing

Kumar¹,

Kumar²,

Jangirala

et al. 2022

Security and Communication Networks

View full text Add to dashboard Cite

RFID (radio frequency identification) is an Internet of Things (IoT) enabling technology. All physical devices can be connected to the Internet of Things thanks to RFID. When RFID is extensively utilized and fast increasing, security and privacy concerns are unavoidable. Interception, manipulation, and replay of the wireless broadcast channel between the tag and the reader are all possible security threats. Unverified tags or readers provide untrustworthy messages. IoT requires a safe and consistent RFID authentication system. PUFs are also physical one-way functions made up of the unique nanoscopic structure of physical things and their reactivity to random occurrences. PUF includes an unclonable feature that takes advantage of physical characteristics to boost security and resistance to physical attacks. We analyze the security of the RSEAP2 authentication protocol that has been recently proposed by Safkhani et al., a hash-based protocol, and elliptic curve cryptosystem-based protocol. Our security analysis clearly shows important security pitfalls in RSEAP2 such as mutual authentication, session key agreement, and denial-of-service attack. In our proposed work, we improved their scheme and enhanced their version using physically unclonable function (PUF), which are used by the proposed protocol in tags. This research proposes a cloud-based RFID authentication technique that is both efficient and trustworthy. To decrease the RFID tag’s overhead, the suggested authentication approach not only resists the aforementioned typical assaults and preserves the tag’s privacy, but also incorporates the cloud server into the RFID system. According to simulation results, our approach is efficient. Moreover, according to our security study, our protocol can withstand a variety of attacks, including tracking, replay, and desynchronization assaults. Our scheme withstands all the 18 security features and further consumes the computation cost as 14.7088 ms which is comparable with the other schemes. Similarly, our scheme consumes the communication cost as 672 bits during the sending mode and 512 bits during the receiving mode. Overall, the performance of our proposed method is equivalent to that of related schemes and provides additional security features than existing protocols. Mutual authentication, session key generation, and ephemeral session security are all achieved. Using the real-or-random concept, we formalize the security of the proposed protocol.

show abstract

Novel ECC-Based RFID Mutual Authentication Protocol for Emerging IoT Applications

Cited by 26 publications

References 65 publications

Identification Codes: A Topical Review With Design Guidelines for Practical Systems

Identification Codes: A Topical Review With Design Guidelines for Practical Systems

Cloud computing communication environment security and performance: Challenges and probable solutions

An Enhanced RFID-Based Authentication Protocol using PUF for Vehicular Cloud Computing

Contact Info

Product

Resources

About