Onur, Cansu BetinKilic, AdnanOnur, ErtanOnur, Cansu BetinMathematics2024-07-052024-07-0520170978153861956810.1109/DASC-PICom-DataCom-CyberSciTec.2017.1032-s2.0-85048077022https://doi.org/10.1109/DASC-PICom-DataCom-CyberSciTec.2017.103https://hdl.handle.net/20.500.14411/595Onur, Ertan/0000-0003-0514-5578; Onur, Cansu Betin/0000-0002-3691-1469; KILIC, Adnan/0000-0001-9325-4795Key-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.eninfo:eu-repo/semantics/closedAccess[No Keyword Available]Conference Object573580WOS:000942819400129