Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 213

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

A Multiplexer-Based Arbiter PUF Composition with Enhanced Reliability and Security

Sahoo, Durga Prasad, Mukhopadhyay, Debdeep, Chakraborty, Rajat Subhra, Nguyen, Phuong Ha · 2018 · IEEE Transactions on Computers

Abstract

Arbiter Physically Unclonable Functions (APUFs), while being relatively lightweight, are extremely vulnerable to modeling attacks. Hence, various compositions of APUFs such as XOR APUF and Lightweight Secure PUF have been proposed to be secure alternatives. Previous research has demonstrated that PUF compositions have two major challenges to overcome: vulnerability against modeling and statistical attacks, and lack of reliability. In this paper, we introduce a multiplexer-based composition of APUFs, denoted as MPUF, to simultaneously overcome these challenges. In addition to the basic MPUF design, we propose two MPUF variants namely cMPUF and rMPUF to improve the robustness against cryptanalysis and reliability-based modeling attack, respectively. An rMPUF demonstrates enhanced robustness against the reliability-based modeling attack, while even the well-known XOR APUF, otherwise robust to machine learning based modeling attacks, has been modeled using the same technique with linear data and time complexities. The rMPUF can provide a good trade-off between security and hardware overhead while maintaining a significantly higher reliability level than any practical XOR APUF instance. Moreover, MPUF variants are the first APUF compositions, to the best of our knowledge, that can achieve Strict Avalanche Criterion without using any additional input network (or hardware) for challenge transformation. Finally, we validate our theoretical findings using Matlab-based simulations of MPUFs.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tc.2017.2749226

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

  • Linear Cryptanalysis Method for DES Cipher

    Matsui, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_33 · Cited by 2,748 · cited 2×

    “For example, an adversary may try to model the composition B by a linear function of its inputs, to enable linear cryptanalysis [21].”
    Background
  • PUF Modeling Attacks on Simulated and Silicon Data

    Ruhrmair, U., Solter, J., Sehnke, F., Xu, X., Mahmoud, A., Stoyanova, V., Dror, G., Schmidhuber, J., Burleson, W., & Devadas, S. (2013) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2013.2279798 · Cited by 637 · cited 1×

    “The CM attacks of x-XOR APUF using logistic regression (LR) are reported in [5], [9], [10], and SCM attacks are published in [11]–[15].”
    Method

Show all 2 references

Cited by

See all 213

Metadata

Authors
Sahoo, D. P., Mukhopadhyay, D., Chakraborty, R. S., & Nguyen, P. H.
Venue
IEEE Transactions on Computers
Published
2018-03-01
Volume
67
Issue
3
Pages
403-417
ISSN
0018-9340 (ISSN-L)
OpenAlex
W2752832485
Cited by
213
References
2
FWCI
12.15
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A Multiplexer-Based Arbiter PUF Composition with Enhanced Reliability and Security. https://app.cochat.ai/papers/10.1109/tc.2017.2749226
The paper
Sahoo, D. P., Mukhopadhyay, D., Chakraborty, R. S., & Nguyen, P. H. (2018). A Multiplexer-Based Arbiter PUF Composition with Enhanced Reliability and Security. IEEE Transactions on Computers. https://doi.org/10.1109/tc.2017.2749226

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.