Secret Key Generation from Dependent Source, part 2

Abstract: We consider the problem of extracting a secret key from dependent sources. In this problem, the legitimate terminals observe iid repetition of correlated random variables and wish to create a shared secret key that is secure from a passive eavesdropper using a noiseless public communication channel. Finding the maximum achievable key rate is a fundamental open problem in information-theoretic security. We review the history and the state-of-the-art results for this problem, with an emphasis on the speaker's prior work on this problem. Certain extensions of the problem will also be discussed.

Computer scienceMathematics

Audience: researchers in the discipline

Seminar on Algorithmic Aspects of Information Theory

Series comments: This online seminar is a follow up of the Dagstuhl Seminar 22301, www.dagstuhl.de/en/program/calendar/semhp/?semnr=22301.