Abstract
In this paper, we propose a key agreement protocol for a key hypergraph. In a key hypergraph, a party is represented as a vertex and a group of parties is represented as a hyperedge. A key agreement protocol for a key hypergraph establishes all the keys for hyperedges in a key hypergraph at the same time. A naive approach would be to run a group key protocol concurrently for each hyperedge. By using the randomness re-use technique, we propose an efficient key agreement protocol for a key hypergraph, which is of two rounds. We formalize the key exchange model for a key hypergraph which is an extension of a group key exchange model and especially incorporates insider attacks. The proposed key agreement protocol for a key hypergraph provides key independence and forward secrecy in the random oracle model under the computational Diffie-Hellman assumption.
| Original language | English |
|---|---|
| Pages (from-to) | 452-458 |
| Number of pages | 7 |
| Journal | Computers and Security |
| Volume | 26 |
| Issue number | 7-8 |
| DOIs | |
| Publication status | Published - 2007 Dec |
Bibliographical note
Funding Information:I.R. Jeong was supported by the IT R&D program of MIC/IITA [2005-Y-001-04, Development of next generation security technology]. D.H. Lee was supported by the MIC (Ministry of Information and Communication), Korea, under the ITRC (Information Technology Research Center) support program supervised by the IITA (Institute of Information Technology Advancement) (IITA-2006-(C1090-0603-0025)).
Keywords
- Group key exchange
- Insider attack
- Key exchange
- Key hypergraph
- Randomness re-use
ASJC Scopus subject areas
- Computer Science(all)
- Law