Secret Key Amplification from Uniformly Leaked Key Exchange Complete Graph

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationWALCOM
Subtitle of host publicationAlgorithms and Computation - 12th International Conference, WALCOM 2018, Proceedings
EditorsM. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara
PublisherSpringer Verlag
Pages20-31
Number of pages12
ISBN (Print)9783319751719
DOIs
Publication statusPublished - 2018 Jan 1
Event12th International Conference and Workshop on Algorithms and Computation, WALCOM 2018 - Dhaka, Bangladesh
Duration: 2018 Mar 32018 Mar 5

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10755 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

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

Keywords

  • Key agreement protocol
  • Key exchange graph
  • Network reliability problem
  • Privacy amplification
  • st-numbering

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Secret Key Amplification from Uniformly Leaked Key Exchange Complete Graph'. Together they form a unique fingerprint.

  • Cite this

    Sasaki, T., Agbor, B. M., Masuda, S., Hayashi, Y-I., Mizuki, T., & Sone, H. (2018). Secret Key Amplification from Uniformly Leaked Key Exchange Complete Graph. In M. S. Rahman, W-K. Sung, & R. Uehara (Eds.), WALCOM: Algorithms and Computation - 12th International Conference, WALCOM 2018, Proceedings (pp. 20-31). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10755 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-75172-6_3