PLGAKD: A PUF-Based Lightweight Group Authentication and Key Distribution Protocol

Yıldız, Hüsnü; Cenk, Murat; Onur, Ertan

doi:10.1109/jiot.2020.3032757

Cited by 30 publications

(22 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However the approach suffers from side channel and physical cloning attacks. Yildiz et al 34 proposed a physically unclonable function based lightweight group authentication and key distribution protocol by utilizing factorial tree and Chinese remainder theorem.…”

Section: Related Workmentioning

confidence: 99%

Dickson polynomial-based secure group authentication scheme for Internet of Things

Syed,

Manickam,

Uddin

et al. 2024

Sci Rep

View full text Add to dashboard Cite

Internet of Things (IoT) paves the way for the modern smart industrial applications and cities. Trusted Authority acts as a sole control in monitoring and maintaining the communications between the IoT devices and the infrastructure. The communication between the IoT devices happens from one trusted entity of an area to the other by way of generating security certificates. Establishing trust by way of generating security certificates for the IoT devices in a smart city application can be of high cost and expensive. In order to facilitate this, a secure group authentication scheme that creates trust amongst a group of IoT devices owned by several entities has been proposed. The majority of proposed authentication techniques are made for individual device authentication and are also utilized for group authentication; nevertheless, a unique solution for group authentication is the Dickson polynomial based secure group authentication scheme. The secret keys used in our proposed authentication technique are generated using the Dickson polynomial, which enables the group to authenticate without generating an excessive amount of network traffic overhead. IoT devices' group authentication has made use of the Dickson polynomial. Blockchain technology is employed to enable secure, efficient, and fast data transfer among the unique IoT devices of each group deployed at different places. Also, the proposed secure group authentication scheme developed based on Dickson polynomials is resistant to replay, man-in-the-middle, tampering, side channel and signature forgeries, impersonation, and ephemeral key secret leakage attacks. In order to accomplish this, we have implemented a hardware-based physically unclonable function. Implementation has been carried using python language and deployed and tested on Blockchain using Ethereum Goerli’s Testnet framework. Performance analysis has been carried out by choosing various benchmarks and found that the proposed framework outperforms its counterparts through various metrics. Different parameters are also utilized to assess the performance of the proposed blockchain framework and shows that it has better performance in terms of computation, communication, storage and latency.

show abstract

Section: Related Workmentioning

confidence: 99%

Dickson polynomial-based secure group authentication scheme for Internet of Things

Syed,

Manickam,

Uddin

et al. 2024

Sci Rep

View full text Add to dashboard Cite

show abstract

“…To prevent illegal members from obtaining the group key, Ref. [ 25 ] proposed a centralized approach where the server distributes a temporary group key to members. The group key is generated by merging the secrets of group members.…”

Section: Related Workmentioning

confidence: 99%

A Secure Secret Key Agreement Scheme among Multiple Twinning Superlattice PUF Holders

Liu

Xie

Liu

et al. 2023

Sensors

View full text Add to dashboard Cite

Modern cryptography attributes the security of a cryptographic system to the security of the key. How to securely distribute the key has always been a bottleneck in key management. This paper proposes a secure group key agreement scheme for multiple parties using a multiple twinning superlattice physical unclonable function (PUF) that can be synchronized. By sharing the challenge and helper data among multiple twinning superlattice PUF holders, the scheme employs a reusable fuzzy extractor to obtain the key locally. Moreover, adopting public-key encryption encrypts public data for establishing the subgroup key, which provides independent communication for the subgroup. At the same time, when the subgroup membership changes, the public key encrypts new public data to update the subgroup key, forming scalable group communication. This paper also presents a cost and formal security analysis, which shows that the proposed scheme can achieve computational security by applying the key obtained by the computationally secure reusable fuzzy extractor to the EAV-secure symmetric-key encryption, which has indistinguishable encryption in the presence of an eavesdropper. Additionally, the scheme is secure against physical attacks, man-in-the-middle attacks, and machine learning modeling attacks.

show abstract

“…Our protocol has the least computational overhead. Notice that the presented schemes in [26] and [28] did not considered the reliability problem of the PUF by assuming it ideal without any erroneous response. While, by considering a simple BCH-based fuzzy extractor as the most known error correction scheme for PUFs, their computational costs will increase to 6.16 ms and 5.392 ms, respectively.…”

Section: Performance Evaluationmentioning

confidence: 99%

Deep PUF: A Highly Reliable DRAM PUF-Based Authentication for IoT Networks Using Deep Convolutional Neural Networks

Najafi

Kaveh

Martín

et al. 2021

Sensors

View full text Add to dashboard Cite

Traditional authentication techniques, such as cryptographic solutions, are vulnerable to various attacks occurring on session keys and data. Physical unclonable functions (PUFs) such as dynamic random access memory (DRAM)-based PUFs are introduced as promising security blocks to enable cryptography and authentication services. However, PUFs are often sensitive to internal and external noises, which cause reliability issues. The requirement of additional robustness and reliability leads to the involvement of error-reduction methods such as error correction codes (ECCs) and pre-selection schemes that cause considerable extra overheads. In this paper, we propose deep PUF: a deep convolutional neural network (CNN)-based scheme using the latency-based DRAM PUFs without the need for any additional error correction technique. The proposed framework provides a higher number of challenge-response pairs (CRPs) by eliminating the pre-selection and filtering mechanisms. The entire complexity of device identification is moved to the server side that enables the authentication of resource-constrained nodes. The experimental results from a 1Gb DDR3 show that the responses under varying conditions can be classified with at least a 94.9% accuracy rate by using CNN. After applying the proposed authentication steps to the classification results, we show that the probability of identification error can be drastically reduced, which leads to a highly reliable authentication.

show abstract

PLGAKD: A PUF-Based Lightweight Group Authentication and Key Distribution Protocol

Cited by 30 publications

References 37 publications

Dickson polynomial-based secure group authentication scheme for Internet of Things

Dickson polynomial-based secure group authentication scheme for Internet of Things

A Secure Secret Key Agreement Scheme among Multiple Twinning Superlattice PUF Holders

Deep PUF: A Highly Reliable DRAM PUF-Based Authentication for IoT Networks Using Deep Convolutional Neural Networks

Contact Info

Product

Resources

About