A New Non-Binary Response Generation Scheme from Physical Unclonable Functions

• URL: http://arxiv.org/abs/2410.20324v1
• Date: Sun, 27 Oct 2024 03:24:17 GMT
• Title: A New Non-Binary Response Generation Scheme from Physical Unclonable Functions
• Abstract summary: 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.
• Score: 2.142505989409247
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Physical Unclonable Functions (PUFs) are widely used in key generation, with each PUF cell typically producing one bit of data. To enable the extraction of longer keys, a new non-binary response generation scheme based on the one-probability of PUF bits is proposed. Instead of using PUF bits directly as keys, non-binary responses are first derived by comparing the one-frequency of PUF bits with thresholds that evenly divide the area under the probability density function of the one-probability distribution and then converted to binary keys. To simplify the calculation of these thresholds, a re-scaling process is proposed and the beta distribution is used to model the one-probability distribution. Our FPGA implementation results demonstrate a significant increase in effective key length as opposed to previous works. Finally, we estimate the error rates and biases of the generated keys, and confirm the feasibility of the proposed key generation scheme.

Related papers

• S$^3$AM: A Single-Stream SAM with Reliability-Calibrated Frequency Adapter for Multi-modal Salient Object Detection [74.15663758681849]
  Single-stream framework integrates reliability-calibrated frequency adaptation into the adopted SAM backbone for MSOD.<n>Experiments on RGB-D, RGB-T, and RGB-NIR salient object detection benchmarks validate that the proposed framework achieves competitive performance.
  arXiv  Detail & Related papers  (2026-08-18T08:05:00Z)
• State-of-art minibatches via novel DPP kernels: discretization, wavelets, and rough objectives [10.565834218166524]
  We contribute to the programme of establishing DPPs as a subsampling toolbox for ML by advancing on two fronts.<n>First, we propose new DPPs on the Euclidean space based on wavelets, with provably better accuracy guarantees than the best known rates.<n>Second, we introduce a general method to convert continuous DPPs, which are more amenable to proving analytical statements, into discrete kernels.
  arXiv  Detail & Related papers  (2026-05-13T07:54:37Z)
• Variational Secret Common Randomness Extraction [38.319927578257726]
  We study the problem of extracting common randomness (CR) or secret keys from correlated random sources observed by two legitimate parties, Alice and Bob, through public discussion in the presence of an eavesdropper, Eve.<n>We propose a practical two-stage CR extraction framework. In the first stage, Alice and Bob employ probabilistic neural network (NN) encoders to map their observations into discrete, nearly uniform random variables (RVs) with high agreement probability.<n>In the second stage, a secure sketch using code-offset construction reconciles the encoder outputs into identical secret keys, whose secrecy is guaranteed by the VPQ objective
  arXiv  Detail & Related papers  (2025-10-02T14:22:21Z)
• Decoupled-Value Attention for Prior-Data Fitted Networks: GP Inference for Physical Equations [0.3823356975862005]
  Prior-data fitted networks (PFNs) are a promising alternative to time-consuming Gaussian Process (GP) inference for creating fast surrogates of physical systems.<n>We introduce Decoupled-Value Attention (DVA), motivated by the GP property that the function space is fully characterized by the kernel over inputs.<n>We demonstrate that the crucial factor for scaling PFNs is the attention rule rather than the architecture itself.
  arXiv  Detail & Related papers  (2025-09-25T09:32:42Z)
• Improved finite-size key rates for discrete-modulated continuous variable quantum key distribution under coherent attacks [0.0]
  We consider a prepare-and-measure CVQKD protocol, where Alice chooses from a set of four coherent states and Bob performs a heterodyne measurement. We provide a security proof against coherent attacks in the finite-size regime, and compute the achievable key rate.
  arXiv  Detail & Related papers  (2024-07-03T13:18:31Z)
• Poisson Process for Bayesian Optimization [126.51200593377739]
  We propose a ranking-based surrogate model based on the Poisson process and introduce an efficient BO framework, namely Poisson Process Bayesian Optimization (PoPBO) Compared to the classic GP-BO method, our PoPBO has lower costs and better robustness to noise, which is verified by abundant experiments.
  arXiv  Detail & Related papers  (2024-02-05T02:54:50Z)
• Bayesian Kernelized Tensor Factorization as Surrogate for Bayesian Optimization [13.896697187967545]
  Kernel optimization (BO) primarily uses Gaussian processes (GP) as the key surrogate model. In this paper, we propose to use Bayesian Factorization (BKTF) as a new surrogate model -- for BO in a $D$-dimensional product space. BKTF offers a flexible and highly effective approach for characterizing complex functions with uncertainty quantification.
  arXiv  Detail & Related papers  (2023-02-28T12:00:21Z)
• Quantum key distribution rates from semidefinite programming [0.0]
  We introduce an efficient algorithm for computing the key rate in quantum key distribution protocols. The resulting algorithm is easy to implement and easy to use. We use it to reanalyse experimental data to demonstrate how higher key rates can be achieved.
  arXiv  Detail & Related papers  (2022-11-10T17:47:37Z)
• Sample-Efficient Optimisation with Probabilistic Transformer Surrogates [66.98962321504085]
  This paper investigates the feasibility of employing state-of-the-art probabilistic transformers in Bayesian optimisation. We observe two drawbacks stemming from their training procedure and loss definition, hindering their direct deployment as proxies in black-box optimisation. We introduce two components: 1) a BO-tailored training prior supporting non-uniformly distributed points, and 2) a novel approximate posterior regulariser trading-off accuracy and input sensitivity to filter favourable stationary points for improved predictive performance.
  arXiv  Detail & Related papers  (2022-05-27T11:13:17Z)
• Transformers Can Do Bayesian Inference [56.99390658880008]
  We present Prior-Data Fitted Networks (PFNs) PFNs leverage in-context learning in large-scale machine learning techniques to approximate a large set of posteriors. We demonstrate that PFNs can near-perfectly mimic Gaussian processes and also enable efficient Bayesian inference for intractable problems.
  arXiv  Detail & Related papers  (2021-12-20T13:07:39Z)
• Neural network-based prediction of the secret-key rate of quantum key distribution [6.040436695129137]
  We construct a neural network that can quickly predict the secure key rate based on the experimental parameters and experimental results. This allows the secure key rate of discrete-modulated CV-QKD to be extracted in real time on a low-power platform.
  arXiv  Detail & Related papers  (2021-08-05T12:34:56Z)
• Simple and practical DIQKD security analysis via BB84-type uncertainty relations and Pauli correlation constraints [0.0]
  In this work, we describe how the conditional entropy can be bounded in the 2-input/2-output setting. We illustrate the approach on a variant of the device-independent CHSH QKD protocol where both bases are used to generate the key.
  arXiv  Detail & Related papers  (2021-07-19T14:08:43Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• On the Practicality of Differential Privacy in Federated Learning by Tuning Iteration Times [51.61278695776151]
  Federated Learning (FL) is well known for its privacy protection when training machine learning models among distributed clients collaboratively. Recent studies have pointed out that the naive FL is susceptible to gradient leakage attacks. Differential Privacy (DP) emerges as a promising countermeasure to defend against gradient leakage attacks.
  arXiv  Detail & Related papers  (2021-01-11T19:43:12Z)
• Efficient semidefinite-programming-based inference for binary and multi-class MRFs [83.09715052229782]
  We propose an efficient method for computing the partition function or MAP estimate in a pairwise MRF. We extend semidefinite relaxations from the typical binary MRF to the full multi-class setting, and develop a compact semidefinite relaxation that can again be solved efficiently using the solver.
  arXiv  Detail & Related papers  (2020-12-04T15:36: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.