On combining Arbiter based PUFs

DOI10.1007/S12095-024-00769-0MaRDI QIDQ6995240zbMATH OpenFDO

Authors Animesh Roy, Dibyendu Roy, Pantelimon Stanica

Publication date 22 April 2025

Published in Cryptography and Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S12095-024-00769-0

zbMATH Keywords

biasBoolean functionenumerationPUFthreshold functionXOR-PUF

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Boolean functions (94D10)

Cites work

• A Lower Bound of the Number of Threshold Functions
• Analysis of the strict avalanche criterion in variants of arbiter-based physically unclonable functions
• Analysis on Boolean Function in a Restricted (Biased) Domain
• How do the arbiter PUFs sample the Boolean function class?
• Physically uncloneable functions in the universal composition framework
• The gap between promise and reality: on the insecurity of XOR arbiter PUFs
• Theory of majority decision elements
• Towards stream ciphers for efficient FHE with low-noise ciphertexts

This page was built for publication: On combining Arbiter based PUFs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6995240)