An XTR-based constant round key agreement scheme
type: Item
instance of: scholarly article
title: An XTR-based constant round key agreement scheme
zbMATH Open document ID: 1299.94098
DOI: 10.1155/2013/596868
author: Silan Zhang
author: Jingbo Xia
author: Xiaochuan Ai
author: Jianhua Chen
published in: Mathematical Problems in Engineering
publication date: 2014-11-24T00:00:00Z
review text: Summary: A new XTR-based key agreement scheme with constant rounds is presented. Three theorems are formulated to reveal the logarithmic computational complexity of this scheme. Furthermore, the computation framework of XTR-based key agreement scheme is introduced, and security of the scheme is proven under the formal model.
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 6372804
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2013/596868
OpenAlex ID: W2079354678
Wikidata QID: Q59027099
cites work: Information Security and Privacy
cites work: Constant-Round Authenticated Group Key Exchange with Logarithmic Computation Complexity
cites work: Q5491200
cites work: Q2739458
cites work: ID-based authenticated group key agreement from bilinear maps
cites work: A new two-round certificateless authenticated key agreement protocol without bilinear pairings
cites work: Q4474181
cites work: Q4536791
cites work: An overview of the XTR public key system
cites work: Q4474169
cites work: Q2778850
cites work: A round-optimal three-party ID-based authenticated key agreement protocol
description: scientific article; zbMATH DE number 6372804