Abstract
This chapter covers the principles of a PAC learning framework applied to ring oscillator (RO) PUFs, which have been first introduced in Ganji et al., The 18th Annual International Conference on Information Security and Cryptology, 2015, ([34]). Parts of this paper have been slightly adapted to be involved in this thesis.
One of the features of modeling PUF circuits through ML techniques is that except for Arbiter PUFs, other PUFs cannot be modeled very satisfactorily in a way to suggest which ML to apply to model them. [...] This observation suggests heuristic techniques which are effective in estimating input-output relationships [...].
[98]
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
We refer the reader to [14] for the proof of Blumer’s theorem.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Ganji, F. (2018). PAC Learning of Ring Oscillator PUFs. In: On the Learnability of Physically Unclonable Functions. T-Labs Series in Telecommunication Services. Springer, Cham. https://doi.org/10.1007/978-3-319-76717-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-76717-8_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-76716-1
Online ISBN: 978-3-319-76717-8
eBook Packages: EngineeringEngineering (R0)