Secure pairing-free two-party certificateless authenticated key agreement protocol with minimal computational complexity
Key agreement protocols play a vital role in maintaining security in many critical applications due to the importance of the secret key. Bilinear pairing was commonly used in designing secure protocols for the last several years; however, high computational complexity of this operation has been the...
Saved in:
Main Author: | |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2019
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/96184/1/SeyedmohsenGhoreishiPSC2019.pdf.pdf http://eprints.utm.my/id/eprint/96184/ http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:142064 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
my.utm.96184 |
---|---|
record_format |
eprints |
spelling |
my.utm.961842022-07-04T08:21:52Z http://eprints.utm.my/id/eprint/96184/ Secure pairing-free two-party certificateless authenticated key agreement protocol with minimal computational complexity Ghoreishi, Seyedmohsen QA75 Electronic computers. Computer science Key agreement protocols play a vital role in maintaining security in many critical applications due to the importance of the secret key. Bilinear pairing was commonly used in designing secure protocols for the last several years; however, high computational complexity of this operation has been the main obstacle towards its practicality. Therefore, implementation of Elliptic-curve based operations, instead of bilinear pairings, has become popular recently, and pairing-free key agreement protocols have been explored in many studies. A considerable amount of literatures has been published on pairing-free key agreement protocols in the context of Public Key Cryptography (PKC). Simpler key management and non-existence of key escrow problem make certificateless PKC more appealing in practice. However, achieving certificateless pairing-free two-party authenticated key agreement protocols (CL-AKA) that provide high level of security with low computational complexity, remains a challenge in the research area. This research presents a secure and lightweight pairingfree CL-AKA protocol named CL2AKA (CertificateLess 2-party Authenticated Key Agreement). The properties of CL2AKA protocol is that, it is computationally lightweight while communication overhead remains the same as existing protocols of related works. The results indicate that CL2AKA protocol is 21% computationally less complex than the most efficient pairing-free CL-AKA protocol (KKC-13) and 53% less in comparison with the pairing-free CL-AKA protocol with highest level of security guarantee (SWZ-13). Security of CL2AKA protocol is evaluated based on provable security evaluation method under the strong eCK model. It is also proven that the CL2AKA supports all of the security requirements which are necessary for authenticated key agreement protocols. Besides the CL2AKA as the main finding of this research work, there are six pairing-free CL-AKA protocols presented as CL2AKA basic version protocols, which were the outcomes of several attempts in designing the CL2AKA. 2019 Thesis NonPeerReviewed application/pdf en http://eprints.utm.my/id/eprint/96184/1/SeyedmohsenGhoreishiPSC2019.pdf.pdf Ghoreishi, Seyedmohsen (2019) Secure pairing-free two-party certificateless authenticated key agreement protocol with minimal computational complexity. PhD thesis, Universiti Teknologi Malaysia. http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:142064 |
institution |
Universiti Teknologi Malaysia |
building |
UTM Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Teknologi Malaysia |
content_source |
UTM Institutional Repository |
url_provider |
http://eprints.utm.my/ |
language |
English |
topic |
QA75 Electronic computers. Computer science |
spellingShingle |
QA75 Electronic computers. Computer science Ghoreishi, Seyedmohsen Secure pairing-free two-party certificateless authenticated key agreement protocol with minimal computational complexity |
description |
Key agreement protocols play a vital role in maintaining security in many critical applications due to the importance of the secret key. Bilinear pairing was commonly used in designing secure protocols for the last several years; however, high computational complexity of this operation has been the main obstacle towards its practicality. Therefore, implementation of Elliptic-curve based operations, instead of bilinear pairings, has become popular recently, and pairing-free key agreement protocols have been explored in many studies. A considerable amount of literatures has been published on pairing-free key agreement protocols in the context of Public Key Cryptography (PKC). Simpler key management and non-existence of key escrow problem make certificateless PKC more appealing in practice. However, achieving certificateless pairing-free two-party authenticated key agreement protocols (CL-AKA) that provide high level of security with low computational complexity, remains a challenge in the research area. This research presents a secure and lightweight pairingfree CL-AKA protocol named CL2AKA (CertificateLess 2-party Authenticated Key Agreement). The properties of CL2AKA protocol is that, it is computationally lightweight while communication overhead remains the same as existing protocols of related works. The results indicate that CL2AKA protocol is 21% computationally less complex than the most efficient pairing-free CL-AKA protocol (KKC-13) and 53% less in comparison with the pairing-free CL-AKA protocol with highest level of security guarantee (SWZ-13). Security of CL2AKA protocol is evaluated based on provable security evaluation method under the strong eCK model. It is also proven that the CL2AKA supports all of the security requirements which are necessary for authenticated key agreement protocols. Besides the CL2AKA as the main finding of this research work, there are six pairing-free CL-AKA protocols presented as CL2AKA basic version protocols, which were the outcomes of several attempts in designing the CL2AKA. |
format |
Thesis |
author |
Ghoreishi, Seyedmohsen |
author_facet |
Ghoreishi, Seyedmohsen |
author_sort |
Ghoreishi, Seyedmohsen |
title |
Secure pairing-free two-party certificateless authenticated key agreement protocol with minimal computational complexity |
title_short |
Secure pairing-free two-party certificateless authenticated key agreement protocol with minimal computational complexity |
title_full |
Secure pairing-free two-party certificateless authenticated key agreement protocol with minimal computational complexity |
title_fullStr |
Secure pairing-free two-party certificateless authenticated key agreement protocol with minimal computational complexity |
title_full_unstemmed |
Secure pairing-free two-party certificateless authenticated key agreement protocol with minimal computational complexity |
title_sort |
secure pairing-free two-party certificateless authenticated key agreement protocol with minimal computational complexity |
publishDate |
2019 |
url |
http://eprints.utm.my/id/eprint/96184/1/SeyedmohsenGhoreishiPSC2019.pdf.pdf http://eprints.utm.my/id/eprint/96184/ http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:142064 |
_version_ |
1738510334543527936 |
score |
13.18916 |