Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
Secret-Key Generation Using Compound Sources and One-Way Public Communication. Abstract: In the classical secret-key generation model, common randomness is generated by two terminals based on the observation of correlated components of a common source, while keeping it secret from a non-legitimate observer.
Sep 20, 2016
Jan 27, 2016 · It is assumed that the statistics of the source are known to all participants. In this work, the Secret-Key generation based on a compound ...
Jan 27, 2016 · Boche, and R. F. Schaefer, “Secret-key capacity of compound source models with one-way public communication,” in Proc. IEEE ITW, Jeju Island ...
A single-letter lower-bound of the secret-key capacity for a finite compound source is derived as a function of the public communication rate constraint and ...
In this work, the Secret-Key generation model based on a compound source is studied where the source realization is unknown. The protocol should guarantee the ...
A single-letter lower-bound of the secret-key capacity for a finite compound source is derived as a function of the public communication rate constraint. A ...
In this paper we study secret key generation using compound sources where the terminals have access to correlated components of a compound source and can ...
Abstract—In the classical Secret-Key generation model, Com- mon Randomness is generated by two terminals based on the observation of correlated components ...
In this paper, we consider the problem of secret key generation with one-way communication through both a rate-limited public channel and a rate-limited ...