A lightweight PUF-based authentication protocol

• URL: http://arxiv.org/abs/2405.13146v1
• Date: Tue, 21 May 2024 18:32:13 GMT
• Title: A lightweight PUF-based authentication protocol
• Authors: Yu Zhuang, Gaoxiang Li,
• Abstract summary: Physical Unclonable Functions (PUFs) have the potential as hardware primitives for implementing lightweight authentication protocols. APUF is probably the most lightweight strong PUF capable of generating exponentially many challenge-response pairs (CRPs) We propose a co-design of PUF and protocol, where the PUF consists of an APUF and a zero-transistor interface that obfuscates the true challenge bits fed to the PUF.
• Score: 1.9336815376402723
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Lightweight authentication is essential for resource-constrained Internet-of-Things (IoT). Implementable with low resource and operable with low power, Physical Unclonable Functions (PUFs) have the potential as hardware primitives for implementing lightweight authentication protocols. The arbiter PUF (APUF) is probably the most lightweight strong PUF capable of generating exponentially many challenge-response pairs (CRPs), a desirable property for authentication protocols, but APUF is severely weak against modeling attacks. Efforts on PUF design have led to many PUFs of higher resistance to modeling attacks and also higher area overhead. There are also substantial efforts on protocol development, some leverage PUFs' strength in fighting modeling attacks, and some others employ carefully designed protocol techniques to obfuscate either the challenges or the responses with modest increase of area overhead for some or increased operations for some others. To attain both low resource footprint and high modeling attack resistance, in this paper we propose a co-design of PUF and protocol, where the PUF consists of an APUF and a zero-transistor interface that obfuscates the true challenge bits fed to the PUF. The obfuscated PUF possesses rigorously proven potential and experimentally supported performance against modeling attacks when a condition is met, and the protocol provides the condition required by the PUF and leverages the PUF's modeling resistance to arrive at low resource overhead and high operational simplicity, enabling lightweight authentications while resisting modeling attacks.

Related papers

• A novel reliability attack of Physical Unclonable Functions [1.9336815376402723]
  Physical Unclonable Functions (PUFs) are emerging as promising security primitives for IoT devices. Despite their strengths, PUFs are vulnerable to machine learning (ML) attacks, including conventional and reliability-based attacks.
  arXiv  Detail & Related papers  (2024-05-21T18:34:14Z)
• REBEL: Reinforcement Learning via Regressing Relative Rewards [59.68420022466047]
  We propose REBEL, a minimalist RL algorithm for the era of generative models. In theory, we prove that fundamental RL algorithms like Natural Policy Gradient can be seen as variants of REBEL. We find that REBEL provides a unified approach to language modeling and image generation with stronger or similar performance as PPO and DPO.
  arXiv  Detail & Related papers  (2024-04-25T17:20:45Z)
• Designing a Photonic Physically Unclonable Function Having Resilience to Machine Learning Attacks [2.369276238599885]
  We describe a computational PUF model for producing datasets required for training machine learning (ML) attacks. We find that the modeled PUF generates distributions that resemble uniform white noise. Preliminary analysis suggests that the PUF exhibits similar resilience to generative adversarial networks.
  arXiv  Detail & Related papers  (2024-04-03T03:58:21Z)
• PhenoAuth: A Novel PUF-Phenotype-based Authentication Protocol for IoT Devices [9.608432807038083]
  This work proposes a full noise-tolerant authentication protocol based on the PUF Phenotype concept. It demonstrates mutual authentication and forward secrecy in a setting suitable for device-to-device communication.
  arXiv  Detail & Related papers  (2024-03-06T06:04:32Z)
• Attacking Delay-based PUFs with Minimal Adversary Model [13.714598539443513]
  Physically Unclonable Functions (PUFs) provide a streamlined solution for lightweight device authentication. Delay-based Arbiter PUFs, with their ease of implementation and vast challenge space, have received significant attention. Research is polarized between developing modelling-resistant PUFs and devising machine learning attacks against them.
  arXiv  Detail & Related papers  (2024-03-01T11:35:39Z)
• Secrets of RLHF in Large Language Models Part I: PPO [81.01936993929127]
  Large language models (LLMs) have formulated a blueprint for the advancement of artificial general intelligence. reinforcement learning with human feedback (RLHF) emerges as the pivotal technological paradigm underpinning this pursuit. In this report, we dissect the framework of RLHF, re-evaluate the inner workings of PPO, and explore how the parts comprising PPO algorithms impact policy agent training.
  arXiv  Detail & Related papers  (2023-07-11T01:55:24Z)
• Lightweight Strategy for XOR PUFs as Security Primitives for Resource-constrained IoT device [0.0]
  XOR Arbiter PUF (XOR-PUF) is one of the most studied PUFs. Recent attack studies reveal that even XOR-PUFs with large XOR sizes are still not safe against machine learning attacks. We present a strategy that combines the choice of XOR Arbiter PUF (XOR-PUF) architecture parameters with the way XOR-PUFs are used.
  arXiv  Detail & Related papers  (2022-10-04T17:12:36Z)
• Computation Offloading and Resource Allocation in F-RANs: A Federated Deep Reinforcement Learning Approach [67.06539298956854]
  fog radio access network (F-RAN) is a promising technology in which the user mobile devices (MDs) can offload computation tasks to the nearby fog access points (F-APs)
  arXiv  Detail & Related papers  (2022-06-13T02:19:20Z)
• Covert Model Poisoning Against Federated Learning: Algorithm Design and Optimization [76.51980153902774]
  Federated learning (FL) is vulnerable to external attacks on FL models during parameters transmissions. In this paper, we propose effective MP algorithms to combat state-of-the-art defensive aggregation mechanisms. Our experimental results demonstrate that the proposed CMP algorithms are effective and substantially outperform existing attack mechanisms.
  arXiv  Detail & Related papers  (2021-01-28T03:28:18Z)
• Is Independent Learning All You Need in the StarCraft Multi-Agent Challenge? [100.48692829396778]
  Independent PPO (IPPO) is a form of independent learning in which each agent simply estimates its local value function. IPPO's strong performance may be due to its robustness to some forms of environment non-stationarity.
  arXiv  Detail & Related papers  (2020-11-18T20:29:59Z)
• Boosting Adversarial Training with Hypersphere Embedding [53.75693100495097]
  Adversarial training is one of the most effective defenses against adversarial attacks for deep learning models. In this work, we advocate incorporating the hypersphere embedding mechanism into the AT procedure. We validate our methods under a wide range of adversarial attacks on the CIFAR-10 and ImageNet datasets.
  arXiv  Detail & Related papers  (2020-02-20T08:42:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.