Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής

Πολυτεχνική Σχολή - Πανεπιστήμιο Ιωαννίνων

Σεμινάριο Τμήματος (ζωντανή μετάδοση) με τίτλο:»Hardware Security: Authentication and Functional Encryption», Prof. Keshab K. Parhi

Περιγραφή

Στο πλαίσιο της διοργάνωσης των σεμιναρίων του τμήματος θα μεταδοθεί ζωντανά τηv Τρίτη 10/3/2020 και ώρα 11:00 στην αίθουσα Σεμιναρίων του Τμήματος Μηχανικών Η/Υ και Πληροφορικής, ομιλία με τίτλο «Hardware Security: Authentication and Functional Encryption». Ομιλητής θα είναι o Prof. Keshab K. Parhi, Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, USA.
H εκδήλωση θα πραγματοποιηθεί στην Αίθουσα 8 του Τμήματος Ηλεκτρολόγων Μηχ. και Μηχ. Υπολογιστών,ΑΠΘ, την Τρίτη 10 Μαρτίου 2020, στις 11:00. Η διάλεξη θα δοθεί στα Αγγλικά (Θα υπάρχει ζωντανή μετάδοση) Σχετικό link

ΠΕΡΙΛΗΨΗ
Physical unclonable functions (PUFs) are small circuits that can exploit manufacturing process variations to generate unique signatures of chips. These unique signatures, in the form of challenge-response pairs, can be stored in a server and can be used to authenticate devices. Various delay-based PUFs include multiplexer (MUX) PUF and ring-oscillator PUF. Examples of memory PUFs include SRAM PUF and DRAM PUF. I will talk about modeling both linear and nonlinear MUX PUFs. We will show that both hard and soft responses of linear and nonlinear MUX PUFs can be modeled by artificial neural network. I will then talk about XOR PUFs and feed-forward XOR PUFs that are more secure. In the second part of the talk, I will talk about functional obfuscation where the functionality is hidden by incorporating keys to a design such that the circuit only functions correctly if the key is correct. Various modes are introduced such that only the correct key triggers the correct functionality of the chip. One goal is to prevent foundries from manufacturing excess parts and selling in black market. Another goal is to prevent theft of intellectual property. A third goal of obfuscation is to prevent reverse engineering. I will introduce the notions of fixed and dynamic obfuscation. We will show that the time to find the key by trial and error can be increased exponentially with respect to the number of key bits with dynamic obfuscation.