Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Information-Theoretic Key Agreement of Multiple Terminals -Part I: Source Model
 

Summary: 1
Information-Theoretic Key Agreement of Multiple
Terminals - Part I: Source Model
Amin Aminzadeh Gohari1
and Venkat Anantharam1
1
Department of Electrical Engineering and Computer Science
University of California, Berkeley
{aminzade,ananth}@eecs.berkeley.edu
Abstract
This is the first part of a two-part paper on information-theoretically secure secret key agreement. In
this part, we study the secrecy problem under the widely studied source model. In the source model the
terminals wishing to generate a secret key, as well as the eavesdropper, receive the respective coordinates
of a block of independent and identically distributed copies of jointly distributed random variables, after
which the terminals are allowed interactive authenticated public communication, at the end of which each
terminal should be able to generate the key. We derive a new upper bound on the secrecy capacity that
strictly improves the currently best upper bound, due to Renner and Wolf. Further, while the Renner-
Wolf bound is defined only in the case of two terminals, the new upper bound applies to the general
multi-terminal case. The technique used for deriving our bound is to find certain properties of functions
of joint probability distributions which will imply that they dominate the secrecy capacity, and then prove

  

Source: Anantharam, Venkat - Department of Electrical Engineering and Computer Sciences, University of California at Berkeley

 

Collections: Engineering