Authentication and key distribution protocol based on Diffie-Hellman algorithm and physically unclonable function

2024

Full text Open access: Gold Metadata (CSL-JSON)
DOI 10.12928/telkomnika.v22i2.25705
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

Based on the modified Diffie-Hellman (DH) protocol, a key distribution scheme between two correspondents over open communication channels is considered. The correspondents communicate through a trusted entity. An attacker can control the communication channels between the correspondents and the channels between the correspondents and the trusted authority (TA) and perform active attacks there, including a man-in-the-middle attack. DH authentication protocol using physically unclonable functions (PUF) is proposed. A formalized PUF model based on the class of universal hash functions is presented. Namely, it is proposed to use the class of strictly universal hash functions developed by Wegman and Carter. A polynomial dependence of the possible number of PPUs on the number of answers has been proven. Requirements for PPUs suitable for authentication systems are formulated. The protocol has been analyzed, and its security has been proved