Presentation 2004-10-14
On the t-Safety of a Key-sharing Graph
Yasuhito ASANO, Takaaki MIZUKI, Takao NISHIZEKI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Assume that there are several persons and some pairs of them share secret keys, called prior secret keys,and that there is an eavesdropper. An undirected graph G. called a key-sharing graph, represents the pairs; eachvertex of G corresponds to a person, and each edge corresponds to a pair sharing a prior secret key. Each personcan broadcast a message to all the persons through a public communication network; the person creates the messagefrom his prior secret keys and all the messages that have already been broadcasted through the network. We thusassume that all the persons and the eavesdropper can hear all the messages broadcasted, and that the eavesdropper can tap at most t of the prior secret keys for an integer t ≧ 0. Under such a situation all the persons wish to share a single common secret key. In this paper we prove that the persons can securely share a common secret key if and only if the key-sharing graph G has (t + 1) edge-disjoint spanning trees.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Protocol / secret key
Paper # COMP2004-36
Date of Issue

Conference Information
Committee COMP
Conference Date 2004/10/7(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On the t-Safety of a Key-sharing Graph
Sub Title (in English)
Keyword(1) Protocol
Keyword(2) secret key
1st Author's Name Yasuhito ASANO
1st Author's Affiliation Graduate School of Information Sciences, Tohoku University()
2nd Author's Name Takaaki MIZUKI
2nd Author's Affiliation Information Synergy Center, Tohoku University
3rd Author's Name Takao NISHIZEKI
3rd Author's Affiliation Graduate School of Information Sciences, Tohoku University
Date 2004-10-14
Paper # COMP2004-36
Volume (vol) vol.104
Number (no) 338
Page pp.pp.-
#Pages 8
Date of Issue