Secret Key Establishment over a Pair of Independent Broadcast Channels

2010/01/22 by Hadi Ahmadi, Ahmadi, Hadi, Reihaneh Safavi-Naini +1
Computer Science · Mathematics · #Cryptography and Security (cs.CR) #E.3 #FOS: Computer and information sciences #H.1.1 #Information Theory (cs.IT) #cs.CR #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.1001.3908

23 Pages, 4 figures, submitted to the 2010 International Symposium on Information Theory and its Applications (ISITA2010)

arxiv created 2010/04/21 · arxiv updated 2010/04/23

Abstract

This paper considers the problem of information-theoretic Secret Key Establishment (SKE) in the presence of a passive adversary, Eve, when Alice and Bob are connected by a pair of independent discrete memoryless broadcast channels in opposite directions. We refer to this setup as 2DMBC. We define the secret-key capacity in the 2DMBC setup and prove lower and upper bounds on this capacity. The lower bound is achieved by a two-round SKE protocol that uses a two-level coding construction. We show that the lower and the upper bounds coincide in the case of degraded DMBCs.

Related

• New Results on Secret Key Establishment over a Pair of Broadcast Channels
• Successive Secret Key Agreement over Generalized Multiple Access and Broadcast Channels
• Capacity Region for Covert Secret Key Generation over Multiple Access Channels
• Key agreement over a 3-receiver broadcast channel
• Multi-terminal Secrecy in a Linear Non-coherent Packetized Networks