Revisiting Shamir's No-key Protocol: Lightweight Key Transport
No Thumbnail Available
Date
2017
Journal Title
Journal ISSN
Volume Title
Publisher
Ieee Computer Soc
Open Access Color
OpenAIRE Downloads
OpenAIRE Views
Abstract
Key-transport protocols, subclasses of key-establishment protocols, are employed to convey secret keys from a principal to another for establishing a security association. In this paper, we propose a lightweight, practicable, tweakable, energy-efficient, and secure key-transport protocol, suitable for wireless sensor networks (WSN), Internet of Things (IoT) and mobile networks. The proposed protocol is based on the Shamir's no-key protocol. Although Shamir's no-key protocol does not require any pre-shared secret between principals, we show that it is impossible to employ the no-key protocol over public commutative groups. We modify Diffie-Hellman key-agreement protocol to morph it into a key-transport protocol by applying a set of changes on the original protocol and it becomes possible to compare both protocols in terms of memory usage and total time to accomplish a single key transport. The experimental results show that the proposed key transport protocol perform faster than the modified Diffie-Hellman protocol, and the total time to transport a single key by using the modified Diffie-Hellman protocol grows drastically with the increase in key size.
Description
Onur, Ertan/0000-0003-0514-5578; Onur, Cansu Betin/0000-0002-3691-1469; KILIC, Adnan/0000-0001-9325-4795
Keywords
[No Keyword Available]
Turkish CoHE Thesis Center URL
Fields of Science
Citation
0
WoS Q
Scopus Q
Source
15th Intl Conf on Dependable, Autonomic and Secure Computing, 15th Intl Conf on Pervasive Intelligence and Computing, 3rd Intl Conf on Big Data Intelligence and Computing and Cyber Science and Technology Congress(DASC/PiCom/DataCom/CyberSciTech) -- NOV 06-10, 2017 -- IEEE Tech Comm on Scalable Comp, Orlando, FL
Volume
Issue
Start Page
573
End Page
580