Authenticated group key agreement protocol without pairing

Gaurav Sharma, Rajeev Anand Sahu, Veronika Kuchta, Olivier Markowitch, Suman Bala

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

3 Citations (Scopus)

Abstract

Since the inception of pairing-based constructions in cryptography, the authentication in group key agreement (GKA) protocol has been usually achieved by pairings. But due to high computation cost of pairing such constructions are inefficient for practical implementation, specially for low power devices. Also, in almost all such constructions leakage of both the keys- the long-term secret key and the ephemeral key has not been considered for security guarantee. In this view, construction of an efficient and secure GKA protocol is desired. In this paper, we propose an authenticated GKA protocol without pairing. We have achieved security of the proposed scheme following the most standard and recent security notion namely the EGBG model. In particular, we have proved the authenticated key exchange (AKE) security and the mutual authentication (MA) security with full forward secrecy, considering leakage of both the keys long-term and ephemeral, adopting a comparatively efficient technique, the game hopping technique. Our proposed scheme is more efficient in the view of computation and operation time with compare to the existing similar schemes, hence it is more acceptable for the tiny processors. To the best of our knowledge ours is the first pairing free balanced AGKA protocol secure in the EGBG model.

Original languageEnglish
Title of host publicationInformation and Communications Security
Subtitle of host publication19th International Conference, ICICS 2017 Beijing, China, December 6–8, 2017 Proceedings
EditorsSihan Qing, Chris Mitchell, Liqun Chen, Dongmei Liu
Place of PublicationCham Switzerland
PublisherSpringer
Pages606-618
Number of pages13
ISBN (Electronic)9783319895000
ISBN (Print)9783319894997
DOIs
Publication statusPublished - 2018
Externally publishedYes
EventInternational Conference on Information and Communications Security 2017 - Beijing, China
Duration: 6 Dec 20178 Dec 2017
Conference number: 19th
https://web.archive.org/web/20170821060805/http://icics.cn/

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume10631
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on Information and Communications Security 2017
Abbreviated titleICICS 2017
CountryChina
CityBeijing
Period6/12/178/12/17
Internet address

Keywords

  • Authentication
  • Batch verification
  • Forward security
  • Group key agreement
  • Insider security
  • Mutual authentication

Cite this

Sharma, G., Sahu, R. A., Kuchta, V., Markowitch, O., & Bala, S. (2018). Authenticated group key agreement protocol without pairing. In S. Qing, C. Mitchell, L. Chen, & D. Liu (Eds.), Information and Communications Security: 19th International Conference, ICICS 2017 Beijing, China, December 6–8, 2017 Proceedings (pp. 606-618). (Lecture Notes in Computer Science ; Vol. 10631 ). Cham Switzerland: Springer. https://doi.org/10.1007/978-3-319-89500-0_52
Sharma, Gaurav ; Sahu, Rajeev Anand ; Kuchta, Veronika ; Markowitch, Olivier ; Bala, Suman. / Authenticated group key agreement protocol without pairing. Information and Communications Security: 19th International Conference, ICICS 2017 Beijing, China, December 6–8, 2017 Proceedings. editor / Sihan Qing ; Chris Mitchell ; Liqun Chen ; Dongmei Liu. Cham Switzerland : Springer, 2018. pp. 606-618 (Lecture Notes in Computer Science ).
@inproceedings{f332c4f416824231a84e052a89980e72,
title = "Authenticated group key agreement protocol without pairing",
abstract = "Since the inception of pairing-based constructions in cryptography, the authentication in group key agreement (GKA) protocol has been usually achieved by pairings. But due to high computation cost of pairing such constructions are inefficient for practical implementation, specially for low power devices. Also, in almost all such constructions leakage of both the keys- the long-term secret key and the ephemeral key has not been considered for security guarantee. In this view, construction of an efficient and secure GKA protocol is desired. In this paper, we propose an authenticated GKA protocol without pairing. We have achieved security of the proposed scheme following the most standard and recent security notion namely the EGBG model. In particular, we have proved the authenticated key exchange (AKE) security and the mutual authentication (MA) security with full forward secrecy, considering leakage of both the keys long-term and ephemeral, adopting a comparatively efficient technique, the game hopping technique. Our proposed scheme is more efficient in the view of computation and operation time with compare to the existing similar schemes, hence it is more acceptable for the tiny processors. To the best of our knowledge ours is the first pairing free balanced AGKA protocol secure in the EGBG model.",
keywords = "Authentication, Batch verification, Forward security, Group key agreement, Insider security, Mutual authentication",
author = "Gaurav Sharma and Sahu, {Rajeev Anand} and Veronika Kuchta and Olivier Markowitch and Suman Bala",
year = "2018",
doi = "10.1007/978-3-319-89500-0_52",
language = "English",
isbn = "9783319894997",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "606--618",
editor = "Sihan Qing and Chris Mitchell and Liqun Chen and Dongmei Liu",
booktitle = "Information and Communications Security",

}

Sharma, G, Sahu, RA, Kuchta, V, Markowitch, O & Bala, S 2018, Authenticated group key agreement protocol without pairing. in S Qing, C Mitchell, L Chen & D Liu (eds), Information and Communications Security: 19th International Conference, ICICS 2017 Beijing, China, December 6–8, 2017 Proceedings. Lecture Notes in Computer Science , vol. 10631 , Springer, Cham Switzerland, pp. 606-618, International Conference on Information and Communications Security 2017, Beijing, China, 6/12/17. https://doi.org/10.1007/978-3-319-89500-0_52

Authenticated group key agreement protocol without pairing. / Sharma, Gaurav; Sahu, Rajeev Anand; Kuchta, Veronika; Markowitch, Olivier; Bala, Suman.

Information and Communications Security: 19th International Conference, ICICS 2017 Beijing, China, December 6–8, 2017 Proceedings. ed. / Sihan Qing; Chris Mitchell; Liqun Chen; Dongmei Liu. Cham Switzerland : Springer, 2018. p. 606-618 (Lecture Notes in Computer Science ; Vol. 10631 ).

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

TY - GEN

T1 - Authenticated group key agreement protocol without pairing

AU - Sharma, Gaurav

AU - Sahu, Rajeev Anand

AU - Kuchta, Veronika

AU - Markowitch, Olivier

AU - Bala, Suman

PY - 2018

Y1 - 2018

N2 - Since the inception of pairing-based constructions in cryptography, the authentication in group key agreement (GKA) protocol has been usually achieved by pairings. But due to high computation cost of pairing such constructions are inefficient for practical implementation, specially for low power devices. Also, in almost all such constructions leakage of both the keys- the long-term secret key and the ephemeral key has not been considered for security guarantee. In this view, construction of an efficient and secure GKA protocol is desired. In this paper, we propose an authenticated GKA protocol without pairing. We have achieved security of the proposed scheme following the most standard and recent security notion namely the EGBG model. In particular, we have proved the authenticated key exchange (AKE) security and the mutual authentication (MA) security with full forward secrecy, considering leakage of both the keys long-term and ephemeral, adopting a comparatively efficient technique, the game hopping technique. Our proposed scheme is more efficient in the view of computation and operation time with compare to the existing similar schemes, hence it is more acceptable for the tiny processors. To the best of our knowledge ours is the first pairing free balanced AGKA protocol secure in the EGBG model.

AB - Since the inception of pairing-based constructions in cryptography, the authentication in group key agreement (GKA) protocol has been usually achieved by pairings. But due to high computation cost of pairing such constructions are inefficient for practical implementation, specially for low power devices. Also, in almost all such constructions leakage of both the keys- the long-term secret key and the ephemeral key has not been considered for security guarantee. In this view, construction of an efficient and secure GKA protocol is desired. In this paper, we propose an authenticated GKA protocol without pairing. We have achieved security of the proposed scheme following the most standard and recent security notion namely the EGBG model. In particular, we have proved the authenticated key exchange (AKE) security and the mutual authentication (MA) security with full forward secrecy, considering leakage of both the keys long-term and ephemeral, adopting a comparatively efficient technique, the game hopping technique. Our proposed scheme is more efficient in the view of computation and operation time with compare to the existing similar schemes, hence it is more acceptable for the tiny processors. To the best of our knowledge ours is the first pairing free balanced AGKA protocol secure in the EGBG model.

KW - Authentication

KW - Batch verification

KW - Forward security

KW - Group key agreement

KW - Insider security

KW - Mutual authentication

UR - http://www.scopus.com/inward/record.url?scp=85045988287&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-89500-0_52

DO - 10.1007/978-3-319-89500-0_52

M3 - Conference Paper

SN - 9783319894997

T3 - Lecture Notes in Computer Science

SP - 606

EP - 618

BT - Information and Communications Security

A2 - Qing, Sihan

A2 - Mitchell, Chris

A2 - Chen, Liqun

A2 - Liu, Dongmei

PB - Springer

CY - Cham Switzerland

ER -

Sharma G, Sahu RA, Kuchta V, Markowitch O, Bala S. Authenticated group key agreement protocol without pairing. In Qing S, Mitchell C, Chen L, Liu D, editors, Information and Communications Security: 19th International Conference, ICICS 2017 Beijing, China, December 6–8, 2017 Proceedings. Cham Switzerland: Springer. 2018. p. 606-618. (Lecture Notes in Computer Science ). https://doi.org/10.1007/978-3-319-89500-0_52