Quality of Service Guarantees for Physical Unclonable Functions
- URL: http://arxiv.org/abs/2107.05675v1
- Date: Mon, 12 Jul 2021 18:26:08 GMT
- Title: Quality of Service Guarantees for Physical Unclonable Functions
- Authors: Onur G\"unl\"u, Rafael F. Schaefer, and H. Vincent Poor
- Abstract summary: noisy physical unclonable function (PUF) outputs facilitate reliable, secure, and private key agreement.
We introduce a quality of service parameter to control the percentage of PUF outputs for which a target reliability level can be guaranteed.
- Score: 90.99207266853986
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We consider a secret key agreement problem in which noisy physical unclonable
function (PUF) outputs facilitate reliable, secure, and private key agreement
with the help of public, noiseless, and authenticated storage. PUF outputs are
highly correlated, so transform coding methods have been combined with scalar
quantizers to extract uncorrelated bit sequences with reliability guarantees.
For PUF circuits with continuous-valued outputs, the models for transformed
outputs are made more realistic by replacing the fitted distributions with
corresponding truncated ones. The state-of-the-art PUF methods that provide
reliability guarantees to each extracted bit are shown to be inadequate to
guarantee the same reliability level for all PUF outputs. Thus, a quality of
service parameter is introduced to control the percentage of PUF outputs for
which a target reliability level can be guaranteed. A public ring oscillator
(RO) output dataset is used to illustrate that a truncated Gaussian
distribution can be fitted to transformed RO outputs that are inputs to uniform
scalar quantizers such that reliability guarantees can be provided for each bit
extracted from any PUF device under additive Gaussian noise components by
eliminating a small subset of PUF outputs. Furthermore, we conversely show that
it is not possible to provide such reliability guarantees without eliminating
any PUF output if no extra secrecy and privacy leakage is allowed.
Related papers
- A New Non-Binary Response Generation Scheme from Physical Unclonable Functions [2.142505989409247]
A new non-binary response generation scheme based on the one-probability of PUF bits is proposed.
Our FPGA implementation results demonstrate a significant increase in effective key length as opposed to previous works.
arXiv Detail & Related papers (2024-10-27T03:24:17Z) - Improving semi-device-independent randomness certification by entropy accumulation [5.264789505615773]
We show that the amount of certifiable randomness can be greatly improved using the so-called Entropy Accumulation Theorem.
We demonstrate this improvement in semi-device-independent randomness certification from untrusted measurements.
arXiv Detail & Related papers (2024-05-07T12:00:22Z) - 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) - CycPUF: Cyclic Physical Unclonable Function [1.104960878651584]
We introduce feedback signals into traditional delay-based PUF designs to give them a wider range of possible output behaviors.
Based on our analysis, cyclic PUFs produce responses that can be binary, steady-state, oscillating, or pseudo-random under fixed challenges.
The security gain of the proposed cyclic PUFs is also shown against state-of-the-art attacks.
arXiv Detail & Related papers (2024-02-12T22:04:04Z) - Reliable Federated Disentangling Network for Non-IID Domain Feature [62.73267904147804]
In this paper, we propose a novel reliable federated disentangling network, termed RFedDis.
To the best of our knowledge, our proposed RFedDis is the first work to develop an FL approach based on evidential uncertainty combined with feature disentangling.
Our proposed RFedDis provides outstanding performance with a high degree of reliability as compared to other state-of-the-art FL approaches.
arXiv Detail & Related papers (2023-01-30T11:46:34Z) - Robust Control for Dynamical Systems With Non-Gaussian Noise via Formal
Abstractions [59.605246463200736]
We present a novel controller synthesis method that does not rely on any explicit representation of the noise distributions.
First, we abstract the continuous control system into a finite-state model that captures noise by probabilistic transitions between discrete states.
We use state-of-the-art verification techniques to provide guarantees on the interval Markov decision process and compute a controller for which these guarantees carry over to the original control system.
arXiv Detail & Related papers (2023-01-04T10:40:30Z) - Sampling-Based Robust Control of Autonomous Systems with Non-Gaussian
Noise [59.47042225257565]
We present a novel planning method that does not rely on any explicit representation of the noise distributions.
First, we abstract the continuous system into a discrete-state model that captures noise by probabilistic transitions between states.
We capture these bounds in the transition probability intervals of a so-called interval Markov decision process (iMDP)
arXiv Detail & Related papers (2021-10-25T06:18:55Z) - Bias and Variance of Post-processing in Differential Privacy [53.29035917495491]
Post-processing immunity is a fundamental property of differential privacy.
It is often argued that post-processing may introduce bias and increase variance.
This paper takes a first step towards understanding the properties of post-processing.
arXiv Detail & Related papers (2020-10-09T02:12:54Z) - Differentially Private Federated Learning with Laplacian Smoothing [72.85272874099644]
Federated learning aims to protect data privacy by collaboratively learning a model without sharing private data among users.
An adversary may still be able to infer the private training data by attacking the released model.
Differential privacy provides a statistical protection against such attacks at the price of significantly degrading the accuracy or utility of the trained models.
arXiv Detail & Related papers (2020-05-01T04:28:38Z)
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.