Computer Science – Information Theory
Scientific paper
2012-02-07
Computer Science
Information Theory
Scientific paper
A secret key agreement framework between three users is considered in which each of the users 1 and 2 intends to share a secret key with user 3 and users 1 and 2 are eavesdroppers with respect to each other. There is a generalized discrete memoryless multiple access channel (GDMMAC) from users 1 and 2 to user 3 where the three users receive outputs from the channel. Furthermore, there is a broadcast channel (BC) from user 3 to users 1 and 2. Secret key sharing is intended where GDMMAC and BC can be successively used. In this framework, an inner bound of the secret key capacity region is derived. Moreover, for a special case where the channel inputs and outputs of the GDMAC and the BC form Markov chains in some order, the secret key capacity region is derived. Also the results are discussed through a binary example.
Aref Mohammad Reza
Salimi Somayeh
Salmasizadeh Mahmoud
Skoglund Mikael
No associations
LandOfFree
Successive Secret Key Agreement over Generalized Multiple Access and Broadcast Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Successive Secret Key Agreement over Generalized Multiple Access and Broadcast Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Successive Secret Key Agreement over Generalized Multiple Access and Broadcast Channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-579028