An application of st-numbering to secret key agreement

Takaaki Mizuki, Satoru Nakayama, Hideaki Sone

研究成果: Article査読

2 被引用数 (Scopus)

抄録

Assume that there are players and an eavesdropper Eve, where several pairs of players have shared secret keys beforehand. We regard each player as a vertex of a graph and regard each pair of players sharing a key as an edge. Consider the case where Eve knows some of the keys according to a certain probability distribution. In this paper, applying the technique of st-numbering, we propose a protocol which allows any two designated players to agree on a secret key through such a partially leaked key exchange graph. Our protocol is optimal in the sense that Eve's knowledge about the secret key agreed on by the two players is as small as possible.

本文言語English
ページ(範囲)1211-1227
ページ数17
ジャーナルInternational Journal of Foundations of Computer Science
22
5
DOI
出版ステータスPublished - 2011 8

ASJC Scopus subject areas

  • コンピュータ サイエンス(その他)

フィンガープリント

「An application of st-numbering to secret key agreement」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル