Parallel key exchange

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

In the paper we study parallel key exchange among multiple parties. The status of parallel key exchange can be depicted by a key graph. In a key graph, a vertex represents a party and an edge represents a relation of two parties who are to share a key. We first propose a security model for a key graph, which extends the Bellare-Rogaway model for two-party key exchange. Next, we clarify the relations among the various security notions of key exchange. Finally, we construct an efficient key exchange protocol for a key graph using the randomness re-use technique. Our protocol establishes the multiple keys corresponding to all edges of a key graph in a single session. The security of our protocol is proven in the standard model.

Original languageEnglish
Pages (from-to)377-396
Number of pages20
JournalJournal of Universal Computer Science
Volume14
Issue number3
Publication statusPublished - 2008 Jun 2

Fingerprint

Key Exchange
Graph in graph theory
Security Model
Randomness
Reuse
Standard Model
Vertex of a graph

Keywords

  • Key exchange
  • Key graph
  • Randomness re-use
  • Security notions

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Parallel key exchange. / Jeong, ik rae; Lee, Dong Hoon.

In: Journal of Universal Computer Science, Vol. 14, No. 3, 02.06.2008, p. 377-396.

Research output: Contribution to journalArticle

@article{db16a2250e074abea104fd3133e16ba8,
title = "Parallel key exchange",
abstract = "In the paper we study parallel key exchange among multiple parties. The status of parallel key exchange can be depicted by a key graph. In a key graph, a vertex represents a party and an edge represents a relation of two parties who are to share a key. We first propose a security model for a key graph, which extends the Bellare-Rogaway model for two-party key exchange. Next, we clarify the relations among the various security notions of key exchange. Finally, we construct an efficient key exchange protocol for a key graph using the randomness re-use technique. Our protocol establishes the multiple keys corresponding to all edges of a key graph in a single session. The security of our protocol is proven in the standard model.",
keywords = "Key exchange, Key graph, Randomness re-use, Security notions",
author = "Jeong, {ik rae} and Lee, {Dong Hoon}",
year = "2008",
month = "6",
day = "2",
language = "English",
volume = "14",
pages = "377--396",
journal = "Journal of Universal Computer Science",
issn = "0948-6968",
publisher = "Springer Verlag",
number = "3",

}

TY - JOUR

T1 - Parallel key exchange

AU - Jeong, ik rae

AU - Lee, Dong Hoon

PY - 2008/6/2

Y1 - 2008/6/2

N2 - In the paper we study parallel key exchange among multiple parties. The status of parallel key exchange can be depicted by a key graph. In a key graph, a vertex represents a party and an edge represents a relation of two parties who are to share a key. We first propose a security model for a key graph, which extends the Bellare-Rogaway model for two-party key exchange. Next, we clarify the relations among the various security notions of key exchange. Finally, we construct an efficient key exchange protocol for a key graph using the randomness re-use technique. Our protocol establishes the multiple keys corresponding to all edges of a key graph in a single session. The security of our protocol is proven in the standard model.

AB - In the paper we study parallel key exchange among multiple parties. The status of parallel key exchange can be depicted by a key graph. In a key graph, a vertex represents a party and an edge represents a relation of two parties who are to share a key. We first propose a security model for a key graph, which extends the Bellare-Rogaway model for two-party key exchange. Next, we clarify the relations among the various security notions of key exchange. Finally, we construct an efficient key exchange protocol for a key graph using the randomness re-use technique. Our protocol establishes the multiple keys corresponding to all edges of a key graph in a single session. The security of our protocol is proven in the standard model.

KW - Key exchange

KW - Key graph

KW - Randomness re-use

KW - Security notions

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

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

M3 - Article

VL - 14

SP - 377

EP - 396

JO - Journal of Universal Computer Science

JF - Journal of Universal Computer Science

SN - 0948-6968

IS - 3

ER -