Skip to main content
SpringerLink
Log in

Variable-Length Bit Mapping and Error-Correcting Codes for Higher-Order Alphabet PUFs

  • Conference paper
  • First Online:
Security, Privacy, and Applied Cryptography Engineering (SPACE 2017)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 10662))

Abstract

Device-specific physical characteristics provide the foundation for Physical Unclonable Functions (PUFs), a hardware primitive for secure storage of cryptographic keys. So far, they have been implemented by either directly evaluating a binary output or by mapping outputs from a higher-order alphabet to a fixed-length bit sequence. However, the latter causes a significant bias in the derived key when combined with an equidistant quantization.

To overcome this limitation, we propose a variable-length bit mapping that reflects the properties of a Gray code in a different metric, namely the Levenshtein metric instead of the classical Hamming metric. Subsequent error-correction is therefore based on a custom insertion/deletion correcting code. This new approach effectively counteracts the bias in the derived key already at the input side.

We present the concept for our scheme and demonstrate its feasibility based on an empirical PUF distribution. As a result, we increase the effective output bit length of the secret by over \(40\%\) compared to state-of-the-art approaches while at the same time obtaining additional advantages, e.g., an improved tamper-sensitivity. This opens up a new direction of Error-Correcting Codes (ECCs) for PUFs that output responses with symbols of higher-order output alphabets.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Suh, G.E., Devadas, S.: Physical unclonable functions for device authentication and secret key generation. In: ACM/IEEE Design Automation Conference (DAC) (2007)

    Google Scholar 

  2. 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). https://doi.org/10.1007/978-3-540-74735-2_5

    Chapter  Google Scholar 

  3. Tuyls, P., Schrijen, G.-J., Škorić, B., van Geloven, J., Verhaegh, N., Wolters, R.: Read-proof hardware from protective coatings. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol. 4249, pp. 369–383. Springer, Heidelberg (2006). https://doi.org/10.1007/11894063_29

    Chapter  Google Scholar 

  4. Immler, V., Hennig, M., Kürzinger, L., Sigl, G.: Practical aspects of quantization and tamper-sensitivity for physically obfuscated keys. In: Workshop on Cryptography and Security in Computing Systems (CS2) (2016)

    Google Scholar 

  5. Juels, A., Wattenberg, M.: A fuzzy commitment scheme. In: ACM Conference on Computer and Communications Security (CCS) (1999)

    Google Scholar 

  6. Dodis, Y., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 523–540. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24676-3_31

    Chapter  Google Scholar 

  7. Bösch, C., Guajardo, J., Sadeghi, A.-R., Shokrollahi, J., Tuyls, P.: Efficient helper data key extractor on FPGAs. In: Oswald, E., Rohatgi, P. (eds.) CHES 2008. LNCS, vol. 5154, pp. 181–197. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-85053-3_12

    Chapter  Google Scholar 

  8. Yu, M., Devadas, S.: Secure and robust error correction for physical unclonable functions. IEEE Des. Test Comput. 27(1), 48–65 (2010)

    Article  Google Scholar 

  9. Maes, R.: Physically unclonable functions: constructions, properties and applications. Dissertation (2012)

    Google Scholar 

  10. Hiller, M., Merli, D., Stumpf, F., Sigl, G.: Complementary IBS: application specific error correction for PUFs. In: IEEE International Symposium on Hardware-Oriented Security and Trust (HOST), pp. 1–6 (2012)

    Google Scholar 

  11. Puchinger, S., Müelich, S., Bossert, M., Hiller, M., Sigl, G.: On error correction for physical unclonable functions. In: International ITG Conference on Systems, Communications and Coding (SCC), February 2015

    Google Scholar 

  12. Hiller, M., Yu, M., Sigl, G.: Cherry-picking reliable PUF bits with differential sequence coding. IEEE Trans. Inf. Forensics Secur. 11(9), 2065–2076 (2016)

    Article  Google Scholar 

  13. Puchinger, S., Müelich, S., Bossert, M., Wachter-Zeh, A.: Timing attack resilient decoding algorithms for physical unclonable functions. In: International ITG Conference on Systems, Communications and Coding (SCC), February 2017

    Google Scholar 

  14. Tenengolts, G.: Nonbinary codes, correcting single deletion or insertion (corresp.). IEEE Trans. Inf. Theory 30(5), 766–769 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  15. Varshamov, R.R., Tenengolts, G.M.: Codes which correct single asymmetric errors. Automatika i Telemekhanika (1965). (in Russian)

    Google Scholar 

  16. Levenshtein, V.: Binary codes capable of correcting deletions, insertions and reversals. Doklady Akademii Nauk SSR 163(4), 845–848 (1965). (in Russian)

    MathSciNet  MATH  Google Scholar 

  17. Günlü, O., Iscan, O.: DCT based ring oscillator physical unclonable functions. In: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 8248–8251 (2014)

    Google Scholar 

  18. Stanko, T., Andini, F.N., Skoric, B.: Optimized quantization in zero leakage helper data systems. IEEE Trans. Inf. Forensics Secur. (2017)

    Google Scholar 

  19. Delvaux, J., Gu, D., Verbauwhede, I., Hiller, M., Yu, M.-D.M.: Efficient fuzzy extraction of PUF-induced secrets: theory and applications. In: Gierlichs, B., Poschmann, A.Y. (eds.) CHES 2016. LNCS, vol. 9813, pp. 412–431. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53140-2_20

    Google Scholar 

  20. Armknecht, F., Maes, R., Sadeghi, A.-R., Standaert, F.-X., Wachsmann, C.: A formalization of the security features of physical functions. In: IEEE Symposium on Security and Privacy (S&P), pp. 397–412 (2011)

    Google Scholar 

  21. Colombier, B., Bossuet, L., Fischer, V., Hely, D.: Key reconciliation protocols for error correction of silicon PUF responses. IEEE Trans. Inf. Forensics Secur. 12, 1988–2002 (2017)

    Article  Google Scholar 

  22. Hiller, M., Yu, M.-D.M., Pehl, M.: Systematic low leakage coding for physical unclonable functions. In: ACM Symposium on Information, Computer and Communications Security (ASIACCS) (2015)

    Google Scholar 

  23. Ignatenko, T., Willems, F.M.: Information leakage in fuzzy commitment schemes. IEEE Trans. Inf. Forensics Secur. 5(2), 337–348 (2010)

    Article  Google Scholar 

  24. Maes, R., van der Leest, V., van der Sluis, E., Willems, F.: Secure key generation from biased PUFs: extended version. J. Cryptogr. Eng. 6(2), 121–137 (2016)

    Article  Google Scholar 

  25. von Neumann, J.: Various techniques used in connection with random digits. In: Applied Math Series (1951)

    Google Scholar 

  26. Suzuki, M., Ueno, R., Homma, N., Aoki, T.: Multiple-valued debiasing for physically unclonable functions and its application to fuzzy extractors. In: Guilley, S. (ed.) COSADE 2017. LNCS, vol. 10348, pp. 248–263. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-64647-3_15

    Chapter  Google Scholar 

  27. Yu, M., Hiller, M., Devadas, S.: Maximum likelihood decoding of device-specific multi-bit symbols for reliable key generation. In: IEEE International Symposium on Hardware-Oriented Security and Trust (HOST), pp. 38–43 (2015)

    Google Scholar 

  28. Delvaux, J., Verbauwhede, I.: Key-recovery attacks on various RO PUF constructions via helper data manipulation. In: Design, Automation Test in Europe Conference Exhibition (DATE) (2014)

    Google Scholar 

  29. Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet physics doklady (1966)

    Google Scholar 

  30. Sloane, N.J.A.: On single-deletion-correcting codes. In: Codes and Designs, pp. 273–292. de Gruyter (2002)

    Google Scholar 

  31. Saowapa, K., Kaneko, H., Fujiwara, E.: Systematic deletion/insertion error correcting codes with random error correction capability. In: Defect and Fault Tolerance in VLSI Systems (1999)

    Google Scholar 

  32. Davida, G.I., Frankel, Y., Matt, B.J.: On enabling secure applications through off-line biometric identification. In: IEEE Symposium on Security and Privacy (S&P), pp. 148–157 (1998)

    Google Scholar 

  33. Gray, F.: Pulse code communication. US Patent 2,632,058 (1953)

    Google Scholar 

  34. Delvaux, J., Gu, D., Verbauwhede, I., Hiller, M., Yu, M.: Secure sketch metamorphosis: tight unified bounds. IACR eprint archive (2015)

    Google Scholar 

  35. MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes. North-Holland, Amsterdam (1977)

    MATH  Google Scholar 

Download references

Acknowledgements

The authors from Fraunhofer AISEC have been supported by the Fraunhofer Internal Programs under Grant No. MAVO 828 432. A. Lenz and A. Wachter-Zeh have been supported by the Technical University of Munich–Institute for Advanced Study, funded by the German Excellence Initiative and European Union Seventh Framework Programme under Grant Agreement No. 291763. Many thanks to Aysun Önalan for preparing the numbers of the RS-based fuzzy commitment scheme.

Author information

Authors and Affiliations

  1. Fraunhofer Institute for Applied and Integrated Security (AISEC), Garching bei München, Germany

    Vincent Immler, Matthias Hiller & Qinzhi Liu

  2. RWTH Aachen University, Aachen, Germany

    Qinzhi Liu

  3. Institute for Communications Engineering, Technical University of Munich (TUM), Munich, Germany

    Andreas Lenz & Antonia Wachter-Zeh

Authors
  1. Vincent Immler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthias Hiller
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Qinzhi Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Andreas Lenz
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Antonia Wachter-Zeh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vincent Immler .

Editor information

Editors and Affiliations

  1. Indian Institute of Technology, Tirupati, Andhra Pradesh, India

    Sk Subidh Ali

  2. Institut Mines-Télécom, Paris, France

    Jean-Luc Danger

  3. University of Lübeck, Lübeck, Germany

    Thomas Eisenbarth

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Immler, V., Hiller, M., Liu, Q., Lenz, A., Wachter-Zeh, A. (2017). Variable-Length Bit Mapping and Error-Correcting Codes for Higher-Order Alphabet PUFs. In: Ali, S., Danger, JL., Eisenbarth, T. (eds) Security, Privacy, and Applied Cryptography Engineering. SPACE 2017. Lecture Notes in Computer Science(), vol 10662. Springer, Cham. https://doi.org/10.1007/978-3-319-71501-8_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-71501-8_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-71500-1

  • Online ISBN: 978-3-319-71501-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation