Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Journal of Cryptographic Engineering
Erschienen in: Journal of Cryptographic Engineering 2/2021

08.05.2020 | Regular Paper

Rock’n’roll PUFs: crafting provably secure pufs from less secure ones (extended version)

verfasst von: Fatemeh Ganji, Shahin Tajik, Pascal Stauss, Jean-Pierre Seifert, Mark Tehranipoor, Domenic Forte

Erschienen in: Journal of Cryptographic Engineering | Ausgabe 2/2021

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

The era of PUFs has been characterized by the efforts put into research and the development of PUFs that are resilient against attacks, in particular, machine learning attacks. Due to the lack of systematic and provable methods for this purpose, we have witnessed the ever-continuing competition between PUF designers/manufacturers, cryptanalysts, and of course, adversaries that maliciously break the security of PUFs. This is despite a series of acknowledged principles developed in cryptography and complexity theory, under the umbrella term “hardness amplification”. This paper aims at narrowing the gap between these studies and hardware security, specifically for applications in the domain of PUFs. To this end, this paper provides an example of somewhat hard PUFs and demonstrates how to build a strongly secure construction out of these considerably weaker primitives. Our theoretical findings are discussed in an exhaustive manner and supported by the silicon results captured from real-world PUFs.
Vorheriger Artikel Editorial about PROOFS 2019
Nächster Artikel Detecting faults in inner product masking scheme

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Fußnoten
1
The algorithms are available under https://​www.​trust-hub.​org/​software.
 
Literatur
1.
Lee, J.W., Lim, D., Gassend, B., Suh, G.E., Van Dijk, M., Devadas, S.: A technique to build a secret key in integrated circuits for identification and authentication applications. In: Symposium on VLSI Circuits, Digest of Technical Papers, pp. 176–179 (2004)
2.
Sahoo, D.P., Saha, S., Mukhopadhyay, D., Chakraborty, R.S., Kapoor, H.: Composite PUF: a new design paradigm for physically unclonable functions on FPGA. In: International Symposium on Hardware-Oriented Security and Trust, pp. 50–55. IEEE (2014)
3.
Sahoo, D.P., Mukhopadhyay, D., Chakraborty, R.S.: Formal design of composite physically unclonable function. In: WKSH on Security Proofs for Embedded Systems, pp. 84–97. Santa Barbara, CA (2013)
4.
Rührmair, U., Sehnke, F., Sölter, J., Dror, G., Devadas, S., Schmidhuber, J.: Modeling attacks on physical unclonable functions. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, pp. 237–249 (2010)
5.
Ganji, F., Tajik, S., Seifert, J.-P.: Why attackers win: on the learnability of XOR arbiter PUFs. In: Intrl Conf. on Trust and Trustworthy Computing, pp. 22–39. Springer, Cham (2015)
6.
Becker, G.T.: The gap between promise and reality: on the insecurity of XOR arbiter PUFs. In: Cryptographic Hardware and Embedded System, pp. 535–555. Springer, Berlin, Heidelberg (2015)
7.
8.
Majzoobi, M., Koushanfar, F., Devadas, S.: FPGA PUF using programmable delay lines. In: IEEE International WKSH on Information Forensics and Security, pp. 1–6 (2010)
9.
Armknecht, F., Maes, R., Sadeghi, A., Standaert, O.X., Wachsmann, C.: A formalization of the security features of physical functions. In: IEEE Symposium on Security and Privacy, pp. 397–412 (2011)
10.
11.
Blumer, A., Ehrenfeucht, A., Haussler, D., Warmuth, M.K.: Learnability and the Vapnik–Chervonenkis dimension. J. ACM 36(4), 929–965 (1989)MathSciNetCrossRef
12.
Spenke, A., Breithaupt, R., Plaga, R.: An arbiter PUF secured by remote random reconfigurations of an FPGA. In: International Conference on Trust and Trustworthy Computing, pp. 140–158. Springer (2016)
13.
Ye, J., Gong, Y., Hu, Y., Li, X.: Polymorphic PUF: exploiting reconfigurability of CPU+ FPGA SoC to resist modeling attack. In: Asian Hardware Oriented Security and Trust Symposium, pp. 43–48. IEEE (2017)
14.
Maes, R.: An accurate probabilistic reliability model for silicon PUFs. In: Cryptographic Hardware and Embedded System, pp. 73–89. Springer, Berlin, Heidelberg (2013)
15.
Ganji, F., Tajik, S., Seifert, J.P.: A Fourier analysis based attack against physically unclonable functions. In: International Conference on Financial Cryptography and Data Security. Springer (2018)
16.
Majzoobi, M., Koushanfar, F., Potkonjak, M.: Techniques for design and implementation of secure reconfigurable PUFs. ACM Trans. Reconfig. Technol. Syst. 2, 1–33 (2009)CrossRef
17.
Matulef, K., O’Donnell, R., Rubinfeld, R., Servedio, R.A.: Testing halfspaces. SIAM J. Comput. 39(5), 2004–2047 (2010)MathSciNetCrossRef
18.
Angluin, D., Laird, P.: Learning from noisy examples. Mach. Learn. 2(4), 343–370 (1988)
19.
Gassend, B., Clarke, D., Van Dijk, M., Devadas, S.: Controlled physical random functions. In: Computer Security Applications Conference, pp. 149–160 (2002)
20.
Sahoo, D.P., Mukhopadhyay, D., Chakraborty, R.S., Nguyen, P.H.: A multiplexer-based arbiter PUF composition with enhanced reliability and security. IEEE Trans. Comput. 67(3), 403–417 (2018)MathSciNetCrossRef
21.
22.
Gehrer, S., Sigl, G.: Using the reconfigurability of modern FPGAs for highly efficient PUF-based key generation. In: 2015 10th International Symposium on Reconfigurable Communication-Centric Systems-on-Chip, pp. 1–6. IEEE (2015)
23.
24.
Fischer, E., Kindler, G., Ron, D., Safra, S., Samorodnitsky, A.: Testing juntas. In: The 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 103–112 (2002)
25.
26.
Bshouty, N.H., Jackson, J.C., Tamon, C.: Uniform-distribution attribute noise learnability. Inf. Comput. 187(2), 277–290 (2003)MathSciNetCrossRef
27.
Linial, N., Mansour, Y., Nisan, N.: Constant depth circuits, fourier transform, and learnability. J. ACM 40(3), 607–620 (1993)MathSciNetCrossRef
28.
O’Donnell, R.W.: Computational Applications of Noise Sensitivity. Ph.D. thesis, Massachusetts Institute of Technology (2003)
29.
Klivans, A.R., O’Donnell, R., Servedio, R.A.: Learning intersections and thresholds of halfspaces. In: Proceedings the 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 177–186 (2002)
30.
Rostami, M., Majzoobi, M., Koushanfar, F., Wallach, D., Devadas, S.: Robust and reverse-engineering resilient PUF authentication and key-exchange by substring matching. IEEE Trans. Emerg. Top. Comput. 2(1), 37–49 (2014)CrossRef
31.
32.
Delvaux, J.: Security Analysis of PUF-Based Key Generation and Entity Authentication. Ph.D. thesis, Ph. D. dissertation, Shanghai Jiao Tong University, China (2017)
33.
Schapire, R.E., Freund, Y.: Boosting: Foundations and Algorithms. MIT Press, Cambridge (2012)MATH
34.
Dietterich, T.G.: Ensemble methods in machine learning. In: International WKSH on Multiple Classifier System, pp. 1–15. Springer (2000)
35.
Servedio, R.A.: Smooth boosting and learning with malicious noise. J. Mach. Learn. Res. 4(Sep), 633–648 (2003)MathSciNetMATH
36.
Klivans, A.R., Long, P.M., Servedio, R.A.: Learning halfspaces with malicious noise. J. Mach. Learn. Res. 10(Dec), 2715–2740 (2009)MathSciNetMATH
37.
Yu, M.D.M., Verbauwhede, I., Devadas, S., MRaihi, D.: A noise bifurcation architecture for linear additive physical functions. In: IEEE International Symposium on Hardware-Oriented Security and Trust, pp. 124–129 (2014)
38.
Tobisch, J., Becker, G.T.: On the scaling of machine learning attacks on PUFs with application to noise bifurcation. In: International WKSH on Radio Frequency Identification: Security and Privacy Issues, pp. 17–31. Springer (2015)
39.
Goldman, S.A., Sloan, R.H.: Can PAC learning algorithms tolerate random attribute noise? Algorithmica 14(1), 70–84 (1995)MathSciNetCrossRef
40.
Delvaux, J., Verbauwhede, I.: Fault injection modeling attacks on 65 nm Arbiter and RO sum PUFs via environmental changes. IEEE Trans. Circuits Syst. I 61(6), 1701–1713 (2014)CrossRef
Metadaten
Titel
Rock’n’roll PUFs: crafting provably secure pufs from less secure ones (extended version)
verfasst von
Fatemeh Ganji
Shahin Tajik
Pascal Stauss
Jean-Pierre Seifert
Mark Tehranipoor
Domenic Forte
Publikationsdatum
08.05.2020
Verlag
Springer Berlin Heidelberg
Erschienen in
Journal of Cryptographic Engineering / Ausgabe 2/2021
Print ISSN: 2190-8508
Elektronische ISSN: 2190-8516
DOI
https://doi.org/10.1007/s13389-020-00226-7

Weitere Artikel der Ausgabe 2/2021

Journal of Cryptographic Engineering 2/2021 Zur Ausgabe

Regular Paper

Detecting faults in inner product masking scheme

Regular Paper

End-to-end automated cache-timing attack driven by machine learning

Regular Paper

Removable weak keys for discrete logarithm-based cryptography

Correction

Correction to: Editorial about PROOFS 2019

Regular Paper

A method for constructing sliding windows leak from noisy cache timing information

Regular Paper

IPM-RED: combining higher-order masking with robust error detection