Multi-terminal Secrecy in a Linear Non-coherent Packetized Networks

2012/06/14 by Mahdi Jafari Siavoshani, Siavoshani, Mahdi Jafari, Christina Fragouli +1
Computer Science · Mathematics · #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.CR #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.1206.3133

This paper is going to be presented in NetCod 2012

arxiv created 2012/06/14 · arxiv updated 2012/06/15

Abstract

We consider a group of m+1 trusted nodes that aim to create a shared secret key K over a network in the presence of a passive eavesdropper, Eve. We assume a linear non-coherent network coding broadcast channel (over a finite field F_q) from one of the honest nodes (i.e., Alice) to the rest of them including Eve. All of the trusted nodes can also discuss over a cost-free public channel which is also overheard by Eve. For this setup, we propose upper and lower bounds for the secret key generation capacity assuming that the field size q is very large. For the case of two trusted terminals (m = 1) our upper and lower bounds match and we have complete characterization for the secrecy capacity in the large field size regime.

Related

• Capacity Region for Covert Secret Key Generation over Multiple Access Channels
• Secret Key Establishment over a Pair of Independent Broadcast Channels
• The Secret Key-Private Key Capacity Region for Three Terminals
• Capacity Results for the Wiretapped Oblivious Transfer
• Secrecy and Robustness for Active Attack in Secure Network Coding and its Application to Network Quantum Key Distribution