Abstract
This paper proposes a new debiasing method for a stable and efficient extraction of uniform random binary responses from physically unclonable functions (PUFs). The proposed method handles multiple-valued (i.e., ternary) responses from PUF responses, including unstable response bits, and stably extracts uniform random-bit responses from them. In this paper, we evaluate the stability and effectiveness of the proposed method with two experiments with simulated and actual responses of latch PUFs implemented on an FPGA. We demonstrate that the proposed method can obtain longer debiased random-bit responses than the conventional method. In addition, we apply the proposed method to the construction of a fuzzy extractor (FE), and show the advantages of the proposed FE in terms of response length and authentication success rate in an experimental evaluation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Note that the information about these locations is secret information.
- 2.
Y and \(Y'\) do not have a precisely n/2-bit length. However, when \(x_{2i} = x_{2i+1}\) (or \(x'_{2i} = x'_{2i+1}\)), the output \(y_{i}\) (or \(y'_{i}\)) is considered to have a “discard” value in order to simplify the formulation.
References
Dodis, Y., Reyzin, M., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97–139 (2008)
Guajardo, J., Kumar, S.S., Schrijen, G.-J., Tuyls, P.: FPGA intrinsic PUFs and their use for IP protection. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol. 4727, pp. 63–80. Springer, Heidelberg (2007). doi:10.1007/978-3-540-74735-2_5
Koeberl, P., Li, J., Rajan, A., Wu, W.: Entropy loss in puf-based key generation schemes : the repetition code pitfall, pp. 44–49 (2014)
Lily, C.: Recommendation for key derivation using pseudorandom functions(revised) (2009)
Lily, C.: Recommendation for key derivation through extraction-then-expansion (2011)
Lim, D., Lee, J., Gassend, B., Suh, G., van Dijk, M., Devadas, S.: Extracting secret keys from integrated circuits. IEEE Trans. Very Large Scale Integer VLSI Syst. 13(10), 1200–1205 (2005)
Maes, R.: Physically Unclonable Functions. Springer, Heidelberg (2013)
Maes, R., Leest, V., Sluis, E., Willems, F.: Secure key generation from biased PUFs. In: Güneysu, T., Handschuh, H. (eds.) CHES 2015. LNCS, vol. 9293, pp. 517–534. Springer, Heidelberg (2015). doi:10.1007/978-3-662-48324-4_26
von Neumann, J.: Various techniques used in connection with random digits. Appl. Math. Ser. 12, 36–38 (1951). National Bureau of Standards, USA
Su, Y., Holleman, J., Otis, B.: A 1.6pj/bit 96% stable chip-id generating circuit using process variations. In: IEEE International Solid-State Circuits Conference (ISSCC2007), pp. 406–611 (2007)
Su, Y., Holleman, J., Otis, B.: A digital 1.6pj/bit chip identification circuit using process variations. IEEE J. Solid-State Circ. 43(1), 69–77 (2008)
Yamamoto, D., Sakiyama, K., Iwamoto, M., Ohta, K., Takenaka, M., Itoh, K.: Variety enhancement of PUF responce using the locations of random outputting RS latches. Crypt. Eng. 3(4), 197–211 (2013)
Acknowledgment
This work has been supported by JSPS KAKENHI Grants No. 16K12436 and No. 16J05711.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Suzuki, M., Ueno, R., Homma, N., Aoki, T. (2017). Multiple-Valued Debiasing for Physically Unclonable Functions and Its Application to Fuzzy Extractors. In: Guilley, S. (eds) Constructive Side-Channel Analysis and Secure Design. COSADE 2017. Lecture Notes in Computer Science(), vol 10348. Springer, Cham. https://doi.org/10.1007/978-3-319-64647-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-64647-3_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-64646-6
Online ISBN: 978-3-319-64647-3
eBook Packages: Computer ScienceComputer Science (R0)