Key agreement over a generalized multiple access channel using noiseless and noisy feedback

Salimi, S ; Sharif University of Technology | 2013

310 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/JSAC.2013.130910
  3. Publisher: 2013
  4. Abstract:
  5. A secret key agreement framework involving 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 feedback channel from user 3 to users 1 and 2 through which user 3 sends information extracted from the received output from the GDMMAC to increase the key rates. We consider both noiseless and noisy feedback. In the case of noiseless feedback, a public channel of unlimited capacity from user 3 to users 1 and 2 is used only once. In the case of noisy feedback, a noisy broadcast channel (BC) from user 3 to users 1 and 2 can be repeatedly used, like GDMMAC. In both setups, inner bounds of the secret key capacity region are derived. The secret key capacity region is derived in some special cases where the channel inputs and outputs form Markov chains in certain orders. For illustration, the corresponding results are also derived and discussed for Gaussian channels. The cases with noiseless feedback, noisy feedback, and no feedback at all are compared with each other
  6. Keywords:
  7. Broadcast channel ; Multiple access channel ; Secret key capacity region ; Wiretap channel ; Broadcast channels ; Feedback channel ; Multiple access channels ; Secret key agreement ; Secret key capacities ; Wire-tap channels ; Broadcasting ; Communication channels (information theory) ; Markov processes ; Telecommunication ; Feedback
  8. Source: IEEE Journal on Selected Areas in Communications ; Volume 31, Issue 9 , 2013 , Pages 1765-1778 ; 07338716 (ISSN)
  9. URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6584936