BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Andrei Romashchenko (LIRMM Univ Montpellier and CNRS)
DTSTART:20241023T150000Z
DTEND:20241023T161500Z
DTSTAMP:20260423T053018Z
UID:AAIT/38
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/AAIT/38/">In
 formation inequalities on graphs with a strong mixing property and their a
 pplications.</a>\nby Andrei Romashchenko (LIRMM Univ Montpellier and CNRS)
  as part of Seminar on Algorithmic Aspects of Information Theory\n\n\nAbst
 ract\nWe will discuss the argument of Andrei Muchnik (that goes back to th
 e 1990s) that allows to prove information inequalities specific for neighb
 oring vertices sampled on a graph with a strong mixing property. We will u
 se this technique to show that the classical two-phases protocol of secret
  key agreement proposed by Ahlswede-Csiszár and Maurer (information recon
 ciliation + privacy amplification) is in some settings the only possible s
 olution. In particular\, in the one-shot settings\, this protocol is unavo
 idably asymmetric: (almost) the entire burden of communication falls on on
 e of the protocol participants. (By a joint work with Geoffroy Caillat-Gre
 nier and Rustam Zyavgarov.)\n
LOCATION:https://researchseminars.org/talk/AAIT/38/
END:VEVENT
END:VCALENDAR