Computer Science – Information Theory
Scientific paper
2010-04-25
Computer Science
Information Theory
18 pages, 4 figures, submitted to the 2010 International Symposium on Information Theory and its Applications (ISITA2010).
Scientific paper
The problem of Secret Key Establishment (SKE) over a pair of independent Discrete Memoryless Broadcast Channels (DMBCs) has already been studied in \cite{Ah10}, where we provided lower and upper bounds on the secret-key capacity. In this paper, we study the above setup under each of the following two cases: (1) the DMBCs have secrecy potential, and (2) the DMBCs are stochastically degraded with independent channels. In the former case, we propose a simple SKE protocol based on a novel technique, called Interactive Channel Coding (ICC), and prove that it achieves the lower bound. In the latter case, we give a simplified expression for the lower bound and prove a single-letter capacity formula under the condition that one of the legitimate parties sends only i.i.d. variables.
Ahmadi Hadi
Safavi-Naini Reihaneh
No associations
LandOfFree
New Results on Secret Key Establishment over a Pair of 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 New Results on Secret Key Establishment over a Pair of Broadcast Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Results on Secret Key Establishment over a Pair of Broadcast Channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-186394