CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Silicon physical random functions
Proceedings of the 9th ACM conference on Computer and communications security
Physical one-way functions
Physical unclonable functions for device authentication and secret key generation
Proceedings of the 44th annual Design Automation Conference
Security with Noisy Data: Private Biometrics, Secure Key Storage and Anti-Counterfeiting
Security with Noisy Data: Private Biometrics, Secure Key Storage and Anti-Counterfeiting
FPGA Intrinsic PUFs and Their Use for IP Protection
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
Extended abstract: The butterfly PUF protecting IP on every FPGA
HST '08 Proceedings of the 2008 IEEE International Workshop on Hardware-Oriented Security and Trust
Power-Up SRAM State as an Identifying Fingerprint and Source of True Random Numbers
IEEE Transactions on Computers
New shielding functions to enhance privacy and prevent misuse of biometric templates
AVBPA'03 Proceedings of the 4th international conference on Audio- and video-based biometric person authentication
Hardware intrinsic security from D flip-flops
Proceedings of the fifth ACM workshop on Scalable trusted computing
The glitch PUF: a new delay-PUF architecture exploiting glitch shapes
CHES'10 Proceedings of the 12th international conference on Cryptographic hardware and embedded systems
A Formalization of the Security Features of Physical Functions
SP '11 Proceedings of the 2011 IEEE Symposium on Security and Privacy
Efficient implementation of true random number generator based on SRAM PUFs
Cryptography and Security
The context-tree weighting method: basic properties
IEEE Transactions on Information Theory
Comparison of SRAM and FF PUF in 65nm technology
NordSec'11 Proceedings of the 16th Nordic conference on Information Security Technology for Applications
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
Comparative analysis of SRAM memories used as PUF primitives
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
An accurate probabilistic reliability model for silicon PUFs
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
| Hi-index | 0.00 |
Physical Unclonable Functions (PUFs) are increasingly becoming a well-known security primitive for secure key storage and anti-counterfeiting. For both applications it is imperative that PUFs provide enough entropy. The aim of this paper is to propose a new model for binary-output PUFs such as SRAM, DFF, Latch and Buskeeper PUFs, and a method to accurately estimate their entropy. In our model the measurable property of a PUF is its set of cell biases. We determine an upper bound on the "extractable entropy", i.e. the number of key bits that can be robustly extracted, by calculating the mutual information between the bias measurements done at enrollment and reconstruction. In previously known methods only uniqueness was studied using information-theoretic measures, while robustness was typically expressed in terms of error probabilities or distances. It is not always straightforward to use a combination of these two metrics in order to make an informed decision about the performance of different PUF types. Our new approach has the advantage that it simultaneously captures both of properties that are vital for key storage: uniqueness and robustness. Therefore it will be possible to fairly compare performance of PUF implementations using our new method. Statistical validation of the new methodology shows that it clearly captures both of these properties of PUFs. In other words: if one of these aspects (either uniqueness or robustness) is less than optimal, the extractable entropy decreases. Analysis on a large database of PUF measurement data shows very high entropy for SRAM PUFs, but rather poor results for all other memory-based PUFs in this database.