Loading...

Comments on 'Information-Theoretic Key Agreement of Multiple Terminals - Part I'

Gohari, A ; Sharif University of Technology | 2017

386 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/TIT.2017.2685579
  3. Publisher: Institute of Electrical and Electronics Engineers Inc , 2017
  4. Abstract:
  5. Theorem 5 of A. Gohari, V. Anantharam, IEEE Transactions on Information Theory, vol. 56, no. 8, pp. 3973-3996, 2010, states an upper bound on the secrecy capacity for the source model problem. It has a three page proof given in Appendix B of the paper. Unfortunately, we show that this bound does not provide any improvement over the simpler bound given in Corollary 1 of the paper. We also provide an example of a family of two agent source model problems where the one-way secrecy rate in each direction is zero, but the secrecy rate is nonzero and can be determined exactly as a conditional mutual information. © 1963-2012 IEEE
  6. Keywords:
  7. Computer applications ; Conditional mutual information ; Information-theoretic key agreements ; Source modeling ; Two agents ; Upper Bound ; Information theory
  8. Source: IEEE Transactions on Information Theory ; Volume 63, Issue 8 , 2017 , Pages 5440-5442 ; 00189448 (ISSN)
  9. URL: https://ieeexplore.ieee.org/document/7976410