Abstract
This chapter presents the foundation of our PAC learning approach applied to bistable ring PUFs (BR-PUFs). The idea of applying this approach has been first published in Ganji et al. (International Conference on Cryptographic Hardware and Embedded Systems–CHES 2016, Springer, Berlin, pp. 391–411, 2016, [32], J Cryptogr Eng, 2017, [33]). Some sections of this paper have been slightly reworked to be included in this thesis.
The BR-PUF was proposed as a promising circuit-based strong PUF candidate, given that a simple model for its behavior is unknown by now and hence modeling-based attacks would be hard.
[101]
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.
Further information on the implementation of these PUFs, the approach applied to deal with noisy responses and to identify PUFs with a minimum bias can be found in [32].
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 Bistable Ring 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_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-76717-8_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-76716-1
Online ISBN: 978-3-319-76717-8
eBook Packages: EngineeringEngineering (R0)