Efficient group key agreement for dynamic TETRA networks

Mi Lee Su, Youn Lee Su, Dong Hoon Lee

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

2 Citations (Scopus)

Abstract

Terrestrial Trunked Radio (TETRA) is the most frequencyefficient standard for mobile communication and its architecture is fully scalable, from a large high-capacity system to a low-capacity system. In the TETRA standard, various attacks such as a reply attack can occur and the key-establishment scheme used in the TETRA standard requires high communication costs. In this paper, we propose an efficient group key agreement in TETRA networks that guarantees secure communication among light-weight mobile stations. That is, computation cost per mobile station is very low, only requires XOR operation on-line, and our scheme allows mobile stations and a base station to agree a group key with 1-round complexity.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages400-409
Number of pages10
Volume4362 LNCS
Publication statusPublished - 2007 Dec 1
Event33rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2007 - Harrachov, Czech Republic
Duration: 2007 Jan 202007 Jan 26

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4362 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other33rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2007
CountryCzech Republic
CityHarrachov
Period07/1/2007/1/26

Fingerprint

Group Key Agreement
Radio Networks
Radio
Attack
Secure Communication
Mobile Communication
Communication Cost
Costs and Cost Analysis
Communication
Base stations
Costs
Weights and Measures
Standards

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Su, M. L., Su, Y. L., & Lee, D. H. (2007). Efficient group key agreement for dynamic TETRA networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4362 LNCS, pp. 400-409). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4362 LNCS).

Efficient group key agreement for dynamic TETRA networks. / Su, Mi Lee; Su, Youn Lee; Lee, Dong Hoon.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4362 LNCS 2007. p. 400-409 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4362 LNCS).

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

Su, ML, Su, YL & Lee, DH 2007, Efficient group key agreement for dynamic TETRA networks. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4362 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4362 LNCS, pp. 400-409, 33rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2007, Harrachov, Czech Republic, 07/1/20.
Su ML, Su YL, Lee DH. Efficient group key agreement for dynamic TETRA networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4362 LNCS. 2007. p. 400-409. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Su, Mi Lee ; Su, Youn Lee ; Lee, Dong Hoon. / Efficient group key agreement for dynamic TETRA networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4362 LNCS 2007. pp. 400-409 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2f4ad72e15a5444ea31b7d41f7b9b386,
title = "Efficient group key agreement for dynamic TETRA networks",
abstract = "Terrestrial Trunked Radio (TETRA) is the most frequencyefficient standard for mobile communication and its architecture is fully scalable, from a large high-capacity system to a low-capacity system. In the TETRA standard, various attacks such as a reply attack can occur and the key-establishment scheme used in the TETRA standard requires high communication costs. In this paper, we propose an efficient group key agreement in TETRA networks that guarantees secure communication among light-weight mobile stations. That is, computation cost per mobile station is very low, only requires XOR operation on-line, and our scheme allows mobile stations and a base station to agree a group key with 1-round complexity.",
author = "Su, {Mi Lee} and Su, {Youn Lee} and Lee, {Dong Hoon}",
year = "2007",
month = "12",
day = "1",
language = "English",
isbn = "9783540695066",
volume = "4362 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "400--409",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Efficient group key agreement for dynamic TETRA networks

AU - Su, Mi Lee

AU - Su, Youn Lee

AU - Lee, Dong Hoon

PY - 2007/12/1

Y1 - 2007/12/1

N2 - Terrestrial Trunked Radio (TETRA) is the most frequencyefficient standard for mobile communication and its architecture is fully scalable, from a large high-capacity system to a low-capacity system. In the TETRA standard, various attacks such as a reply attack can occur and the key-establishment scheme used in the TETRA standard requires high communication costs. In this paper, we propose an efficient group key agreement in TETRA networks that guarantees secure communication among light-weight mobile stations. That is, computation cost per mobile station is very low, only requires XOR operation on-line, and our scheme allows mobile stations and a base station to agree a group key with 1-round complexity.

AB - Terrestrial Trunked Radio (TETRA) is the most frequencyefficient standard for mobile communication and its architecture is fully scalable, from a large high-capacity system to a low-capacity system. In the TETRA standard, various attacks such as a reply attack can occur and the key-establishment scheme used in the TETRA standard requires high communication costs. In this paper, we propose an efficient group key agreement in TETRA networks that guarantees secure communication among light-weight mobile stations. That is, computation cost per mobile station is very low, only requires XOR operation on-line, and our scheme allows mobile stations and a base station to agree a group key with 1-round complexity.

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

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

M3 - Conference contribution

SN - 9783540695066

VL - 4362 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 400

EP - 409

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -