BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Amin Gohari (Chinese University of Hong Kong)
DTSTART:20240124T100000Z
DTEND:20240124T111500Z
DTSTAMP:20260423T040046Z
UID:AAIT/27
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/AAIT/27/">Se
 cret Key Generation from Dependent Source\, part 1</a>\nby Amin Gohari (Ch
 inese University of Hong Kong) as part of Seminar on Algorithmic Aspects o
 f Information Theory\n\n\nAbstract\nWe consider the problem of extracting 
 a secret key from dependent sources. In this problem\, the legitimate term
 inals observe iid repetition of correlated random variables and wish to cr
 eate a shared secret key that is secure from a passive eavesdropper using 
 a noiseless public communication channel. Finding the maximum achievable k
 ey rate is a fundamental open problem in information-theoretic security. W
 e review the history and the state-of-the-art results for this problem\, w
 ith an emphasis on the speaker's prior work on this problem. Certain exten
 sions of the problem will also be discussed.\n
LOCATION:https://researchseminars.org/talk/AAIT/27/
END:VEVENT
END:VCALENDAR