Group key agreement from bilinear pairings
The use of bilinear pairings as a building block for cryptographic protocols, most notably in the construction of identity-based cryptosystems, is a very popular area of cryptographic research. In this thesis, we provide a novel classification of pairing-based group key agreement (GKA) from current...
Main Author: | |
---|---|
Format: | Others |
Language: | en |
Published: |
University of Ottawa (Canada)
2013
|
Subjects: | |
Online Access: | http://hdl.handle.net/10393/28296 http://dx.doi.org/10.20381/ruor-19183 |
id |
ndltd-uottawa.ca-oai-ruor.uottawa.ca-10393-28296 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-uottawa.ca-oai-ruor.uottawa.ca-10393-282962018-01-05T19:07:56Z Group key agreement from bilinear pairings Mailloux, Nicholas J Mathematics. The use of bilinear pairings as a building block for cryptographic protocols, most notably in the construction of identity-based cryptosystems, is a very popular area of cryptographic research. In this thesis, we provide a novel classification of pairing-based group key agreement (GKA) from current literature. We propose a new framework for constructing secure and efficient computationally asymmetric authenticated GKA protocols from identity-based signcryption schemes and adapt this framework to construct a novel identity-based authenticated GKA protocol with perfect forward secrecy. To the best of our knowledge, our protocol is the first that maintains perfect forward secrecy in the presence of auxiliary key agreement protocols. We formally prove the security of our protocols in the random oracle model and show that they are communication and computationally efficient in comparison to the pairing-based protocols from the literature. 2013-11-07T19:04:17Z 2013-11-07T19:04:17Z 2009 2009 Thesis Source: Masters Abstracts International, Volume: 48-06, page: 3689. http://hdl.handle.net/10393/28296 http://dx.doi.org/10.20381/ruor-19183 en 257 p. University of Ottawa (Canada) |
collection |
NDLTD |
language |
en |
format |
Others
|
sources |
NDLTD |
topic |
Mathematics. |
spellingShingle |
Mathematics. Mailloux, Nicholas J Group key agreement from bilinear pairings |
description |
The use of bilinear pairings as a building block for cryptographic protocols, most notably in the construction of identity-based cryptosystems, is a very popular area of cryptographic research. In this thesis, we provide a novel classification of pairing-based group key agreement (GKA) from current literature. We propose a new framework for constructing secure and efficient computationally asymmetric authenticated GKA protocols from identity-based signcryption schemes and adapt this framework to construct a novel identity-based authenticated GKA protocol with perfect forward secrecy. To the best of our knowledge, our protocol is the first that maintains perfect forward secrecy in the presence of auxiliary key agreement protocols. We formally prove the security of our protocols in the random oracle model and show that they are communication and computationally efficient in comparison to the pairing-based protocols from the literature. |
author |
Mailloux, Nicholas J |
author_facet |
Mailloux, Nicholas J |
author_sort |
Mailloux, Nicholas J |
title |
Group key agreement from bilinear pairings |
title_short |
Group key agreement from bilinear pairings |
title_full |
Group key agreement from bilinear pairings |
title_fullStr |
Group key agreement from bilinear pairings |
title_full_unstemmed |
Group key agreement from bilinear pairings |
title_sort |
group key agreement from bilinear pairings |
publisher |
University of Ottawa (Canada) |
publishDate |
2013 |
url |
http://hdl.handle.net/10393/28296 http://dx.doi.org/10.20381/ruor-19183 |
work_keys_str_mv |
AT maillouxnicholasj groupkeyagreementfrombilinearpairings |
_version_ |
1718602570942906368 |