372 research outputs found
Secure and Reliable Key Agreement with Physical Unclonable Functions
Different transforms used in binding a secret key to correlated
physical-identifier outputs are compared. Decorrelation efficiency is the
metric used to determine transforms that give highly-uncorrelated outputs.
Scalar quantizers are applied to transform outputs to extract uniformly
distributed bit sequences to which secret keys are bound. A set of transforms
that perform well in terms of the decorrelation efficiency is applied to ring
oscillator (RO) outputs to improve the uniqueness and reliability of extracted
bit sequences, to reduce the hardware area and information leakage about the
key and RO outputs, and to maximize the secret-key length. Low-complexity
error-correction codes are proposed to illustrate two complete key-binding
systems with perfect secrecy, and better secret-key and privacy-leakage rates
than existing methods. A reference hardware implementation is also provided to
demonstrate that the transform-coding approach occupies a small hardware area.Comment: An extra term in the last page due to the mismatch between the Arxiv
compiler and MDPI template is eliminated. No other change
An Efficient Authentication Protocol for Smart Grid Communication Based on On-Chip-Error-Correcting Physical Unclonable Function
Security has become a main concern for the smart grid to move from research
and development to industry. The concept of security has usually referred to
resistance to threats by an active or passive attacker. However, since smart
meters (SMs) are often placed in unprotected areas, physical security has
become one of the important security goals in the smart grid. Physical
unclonable functions (PUFs) have been largely utilized for ensuring physical
security in recent years, though their reliability has remained a major problem
to be practically used in cryptographic applications. Although fuzzy extractors
have been considered as a solution to solve the reliability problem of PUFs,
they put a considerable computational cost to the resource-constrained SMs. To
that end, we first propose an on-chip-error-correcting (OCEC) PUF that
efficiently generates stable digits for the authentication process. Afterward,
we introduce a lightweight authentication protocol between the SMs and
neighborhood gateway (NG) based on the proposed PUF. The provable security
analysis shows that not only the proposed protocol can stand secure in the
Canetti-Krawczyk (CK) adversary model but also provides additional security
features. Also, the performance evaluation demonstrates the significant
improvement of the proposed scheme in comparison with the state-of-the-art
Low-complexity and Reliable Transforms for Physical Unclonable Functions
Noisy measurements of a physical unclonable function (PUF) are used to store
secret keys with reliability, security, privacy, and complexity constraints. A
new set of low-complexity and orthogonal transforms with no multiplication is
proposed to obtain bit-error probability results significantly better than all
methods previously proposed for key binding with PUFs. The uniqueness and
security performance of a transform selected from the proposed set is shown to
be close to optimal. An error-correction code with a low-complexity decoder and
a high code rate is shown to provide a block-error probability significantly
smaller than provided by previously proposed codes with the same or smaller
code rates.Comment: To appear in IEEE International Conference on Acoustics, Speech, and
Signal Processing 202
Public-Key Based Authentication Architecture for IoT Devices Using PUF
Nowadays, Internet of Things (IoT) is a trending topic in the computing
world. Notably, IoT devices have strict design requirements and are often
referred to as constrained devices. Therefore, security techniques and
primitives that are lightweight are more suitable for such devices, e.g.,
Static Random-Access Memory (SRAM) Physical Unclonable Functions (PUFs) and
Elliptic Curve Cryptography (ECC). SRAM PUF is an intrinsic security primitive
that is seeing widespread adoption in the IoT segment. ECC is a public-key
algorithm technique that has been gaining popularity among constrained IoT
devices. The popularity is due to using significantly smaller operands when
compared to other public-key techniques such as RSA (Rivest Shamir Adleman).
This paper shows the design, development, and evaluation of an
application-specific secure communication architecture based on SRAM PUF
technology and ECC for constrained IoT devices. More specifically, it
introduces an Elliptic Curve Diffie-Hellman (ECDH) public-key based
cryptographic protocol that utilizes PUF-derived keys as the root-of-trust for
silicon authentication. Also, it proposes a design of a modular hardware
architecture that supports the protocol. Finally, to analyze the practicality
as well as the feasibility of the proposed protocol, we demonstrate the
solution by prototyping and verifying a protocol variant on the commercial
Xilinx Zynq-7000 APSoC device
- …