Revisiting Shamir's No-key Protocol: Lightweight Key Transport

dc.authoridOnur, Ertan/0000-0003-0514-5578
dc.authoridOnur, Cansu Betin/0000-0002-3691-1469
dc.authoridKILIC, Adnan/0000-0001-9325-4795
dc.authorscopusid57202385650
dc.authorscopusid7003500221
dc.authorscopusid57561890900
dc.authorwosidOnur, Ertan/V-7360-2019
dc.authorwosidOnur, Cansu Betin/AAY-5136-2020
dc.contributor.authorOnur, Cansu Betin
dc.contributor.authorOnur, Ertan
dc.contributor.authorOnur, Cansu Betin
dc.contributor.otherMathematics
dc.date.accessioned2024-07-05T14:30:40Z
dc.date.available2024-07-05T14:30:40Z
dc.date.issued2017
dc.departmentAtılım Universityen_US
dc.department-temp[Kilic, Adnan; Onur, Ertan] Middle East Tech Univ, Dept Comp Engn, Ankara, Turkey; [Onur, Cansu Betin] Atilim Univ, Dept Math, Ankara, Turkeyen_US
dc.descriptionOnur, Ertan/0000-0003-0514-5578; Onur, Cansu Betin/0000-0002-3691-1469; KILIC, Adnan/0000-0001-9325-4795en_US
dc.description.abstractKey-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.en_US
dc.identifier.citation0
dc.identifier.doi10.1109/DASC-PICom-DataCom-CyberSciTec.2017.103
dc.identifier.endpage580en_US
dc.identifier.isbn9781538619568
dc.identifier.scopus2-s2.0-85048077022
dc.identifier.startpage573en_US
dc.identifier.urihttps://doi.org/10.1109/DASC-PICom-DataCom-CyberSciTec.2017.103
dc.identifier.urihttps://hdl.handle.net/20.500.14411/595
dc.identifier.wosWOS:000942819400129
dc.language.isoenen_US
dc.publisherIeee Computer Socen_US
dc.relation.ispartof15th 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, FLen_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subject[No Keyword Available]en_US
dc.titleRevisiting Shamir's No-key Protocol: Lightweight Key Transporten_US
dc.typeConference Objecten_US
dspace.entity.typePublication
relation.isAuthorOfPublication665ba6b0-4e09-4188-8704-8386edff2b10
relation.isAuthorOfPublication.latestForDiscovery665ba6b0-4e09-4188-8704-8386edff2b10
relation.isOrgUnitOfPublication31ddeb89-24da-4427-917a-250e710b969c
relation.isOrgUnitOfPublication.latestForDiscovery31ddeb89-24da-4427-917a-250e710b969c

Files

Collections