| seminars |
| filter: |
 list |  browse |
 id : |
929
|
| type : |
PhD_Thesis
|
| dateandtime : |
2020-08-07 14:00:00
|
| duration : |
120 min.
|
|
Recommended duration for PhD thesis is 90 minutes, for other seminar types, it is 60 minutes. The duration specified here is used to reserve the room.
|
| place : |
Webinar
|
|
Please check room availability from Room Scheduling page. You must use the same room name as used in the scheduling page if you want to automatically reserve the room.
|
| departmental : |
yes
|
| title : |
PLGAKD: A PUF-based Lightweight Group Authentication and
Key Distribution Protocol
|
| author : |
HUSNU YILDIZ
|
| supervisors : |
PROF.DR.ERTAN ONUR,ASSOC.PROF.DR.MURAT CENK
|
|
Supervisors field is applicable especially for a Thesis Defense
|
| company : |
Computer Engineering Dept. Middle East Technical Univ.
|
| country : |
Turkey
|
| abstract : |
Securing Internet of Things (IoT) applications that collect and
transport sensitive data by guaranteeing authenticity, integrity, and
confidentiality is a critical challenge. Reducing computation and
communication overhead of security functions is also a key concern since
a large number of constrained devices may take place in such
applications. Our main focus in this thesis is group authentication and
key management in IoT. The existing group authentication and key
management protocols in the literature perform computations using
asymmetric ciphers, which costly for IoT. Therefore, applications
generally employ simple security primitives that are prone to or lead to
cyber-attacks by using IoT devices. In this thesis, we propose a
physically unclonable function (PUF) based lightweight group
authentication and key distribution (PLGAKD) protocol that employs PUF,
factorial tree, and the Chinese Remainder Theorem (CRT). In PLGAKD, PUF
facilitates lightweight authentication and key distribution for group
members. Factorial tree and CRT help us reduce the number of keys stored
in nodes and the number of communication messages contrary to the binary
tree. The communication overhead in PLGAKD is reduced to almost half in
comparison with a binary tree for the number of group members close to
each other. Moreover, the computation overhead is significantly less
since only symmetric encryption, hash function, and XOR is performed for
group operations.
|
| biography : |
|
| download slides : |
|
|
[ ]check this to delete slides
|
| slidesFilename : |
|
|
slidesFilename is the name of downloadable file, and will be automatically filled when you upload a new file. You may change the name also.
|
| links : |
|
| notificationSent : |
final
|
