Abstract
This paper describes an authentication protocol using a Hardware-Embedded Delay PUF called HELP. HELP derives randomness from within-die path delay variations that occur along the paths within a hardware implementation of a cryptographic primitive, such as AES or SHA-3. The digitized timing values which represent the path delays are stored in a database on a secure server (verifier) as an alternative to storing PUF response bitstrings. This enables the development of an efficient authentication protocol that provides both privacy and mutual authentication. The security properties of the protocol are analyzed using data collected from a set of Xilinx Zynq FPGAs.
Highlights
Authentication is the process between a prover, e.g., a hardware token or smart card, and a verifier, a secure server or bank, that confirms the identities, using corroborative evidence, of one or both parties [1]
We propose a Hardware-Embedded Delay Physical unclonable functions (PUFs) (HELP) [6] as the basis for a novel authentication protocol
We reported the size of the challenge space to be 2 × (3n − 2n ) two-vector sequences, and the number of response bitstrings to be approximately seven billion excluding the diversity introduced by the Path-Select-Mask
Summary
Authentication is the process between a prover, e.g., a hardware token or smart card, and a verifier, a secure server or bank, that confirms the identities, using corroborative evidence, of one or both parties [1]. In order to improve the reliability of HELP, we constrain the two-vector sequences to generate either rising transitions or falling transitions along the paths, but not both This reduces the challenge space from 22n to 2 × (3n − 2n ), which is still an exponential as required of a strong PUF. Relatively small because the large CRPs space of a strong PUF along with the secrecy of the selected subset make it very difficult for adversaries to build a clone to impersonate the token.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.