Secret Key Amplification from Uniformly Leaked Key Exchange Complete Graph

Tatsuya Sasaki, Bateh Mathias Agbor, Shingo Masuda, Yu ichi Hayashi, Takaaki Mizuki, Hideaki Sone

研究成果: Conference contribution

抄録

We assume that every pair of n players has shared a one-bit key in advance, and that each key has been completely exposed to an eavesdropper, Eve, independently with a fixed probability p (and, thus, is perfectly secure with a probability of 1-p). Using these pre-shared, possibly leaked keys, we want two designated players to share a common one-bit secret key in cooperation with other players so that Eve’s knowledge about the generated secret key will be as small as possible. The existing protocol, called the st-flow protocol, achieves this, but the specific probability that Eve knows the generated secret key is unknown. In this study, we answer this problem by showing the exact leak probability as a polynomial in p for any number n of players.

本文言語English
ホスト出版物のタイトルWALCOM
ホスト出版物のサブタイトルAlgorithms and Computation - 12th International Conference, WALCOM 2018, Proceedings
編集者M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara
出版社Springer Verlag
ページ20-31
ページ数12
ISBN(印刷版)9783319751719
DOI
出版ステータスPublished - 2018
イベント12th International Conference and Workshop on Algorithms and Computation, WALCOM 2018 - Dhaka, Bangladesh
継続期間: 2018 3 32018 3 5

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
10755 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other12th International Conference and Workshop on Algorithms and Computation, WALCOM 2018
CountryBangladesh
CityDhaka
Period18/3/318/3/5

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Secret Key Amplification from Uniformly Leaked Key Exchange Complete Graph」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル