2010/04/25 by Hadi Ahmadi, Ahmadi, Hadi, Reihaneh Safavi–Naini +2
Computer Science · Engineering · Mathematics · #Cooperative Communication and Network Coding #Cryptography and Data Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques #cs.CR #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1004.4334
18 pages, 4 figures, submitted to the 2010 International Symposium on Information Theory and its Applications (ISITA2010).
arxiv created 2010/04/25 · openalex publication_date 2010/04/25 · arxiv updated 2010/04/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The problem of Secret Key Establishment (SKE) over a pair of independent Discrete Memoryless Broadcast Channels (DMBCs) has already been studied in \citeAh10, 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.