Secret communication over compound multiple access channel

  • Authors

    • S Bharathi
    • R Blessy Jenila
    2018-02-05
    https://doi.org/10.14419/ijet.v7i1.7.10651
  • CMAC, Wiretap channel, gaussian two-way channel, secrecy capacity CMAC

  • The general gaussian numerous entrance wire-tap channel(GGMAC-WT) and the guassiantwoway wire-tap channel(GTW-WT) are considered. In this paper, we learn about the mystery correspondence between the correspondence channels with exacerbate various access channel(CMAC). Secret messages are exchanged with consummate mystery. In this channel the messages sent by one channel can be decoded by its relating recipient and kept mystery from other beneficiary. A MAC is considered and the messages from the encoders ae secret. By and large, our outcomes demonstrate that in various access situation, clients can help each other to on the whole accomplish positive mystery rates. At the end of the day, collaboration among clients can be priceless for accomplishing mystery for the framework.

  • References

    1. [1] A.D. Wyner, “The wire-tap channel†Bell System Technical journal, vol 57, no.8,oct 1975

      [2] M.Wiese and H. Boche, “An a achievable region for the wiretap multiple access channel with common message,†in Proc.IEEE Int.Symp. On Info. Theory (ISIT), Cambridge,MA,july 2012,pp.249-253

      [3] M. Salehi, Cardinality bounds on auxiliary variables in multiple user theory via the method of Ahlswede and Körner Stanford Univ... Stanford,CA, Aug. 1978, Tech. Rep. 33.

      [4] E. Tekin, S.S. erbetli, and A.Yener, “on secure signaling for the Guassian multiple access wire-tap channel,†in proc. Asilomar conf.sig., Syst., Comp., Asilomar, CA, oct 28- nov 1 2005

      [5] A. Thamgaraj, S.Dihidar, A.R. Calderbank, S.McLaughlin and J-M. Mero;;a. “Application of LDPC codes to the wiretap channel,†IEETrans,Inform. Theory, vol.53, no.8, pp. 2933-2945, Aug 2007.

      [6] Y. Liang and V. Poor, “Secure communication over fading channels,â€inProc. Allerton Conf. Commun., Contr., Comput., Monticello, IL, Sep27-29 2006.

      [7] L. Zang, R. Yates, and W. Trappe, “Secrecy capacity of independent parallel channels,†in Proc. Allerton Conf. Commun., Contr., Comput.,Monticello, IL, Sep 27-29 2006.

      [8] U. Maurer and S. Wolf, “Secret-key agreement over unauthenticated public channels - part I: Definitions and a completeness result,†IEEETrans. Inform. Theory, vol. 49, no. 4, pp. 822–831, Apr 2003.

      [9] A.El Gamal and Y. H-Kim, Network information Theory, !st ed.cambridge, U.K: Cambridge university prss,2012.

      [10] “The common randomness capacity of a network of discrete memoryless channels,†IEEE Trans. Inform. Theory, vol. 46, no. 2, pp.367–387, Mar 2000.

      [11] U. M. Maurer and S. Wolf, “Information-theoretic key agreement: From weak to strong secrecy for free,†in Proc. EUROCRYPT, 2000, pp. 351–368.

      [12] J. Barros and M. R. D. Rodrigues, “Secrecy capacity of wirelesschannels,†in Proc. IEEE Int. Symp. Inform. Theory (ISIT), Seattle, WA,Jul 9-14 2015.

      [13] M. van Berg, O. Cheong, M. van Kreveld, and M. Overmars, Computational Geometry: Algorithms and Applications. NewYork:Springer-Verlag,2008.

  • Downloads

  • How to Cite

    Bharathi, S., & Blessy Jenila, R. (2018). Secret communication over compound multiple access channel. International Journal of Engineering & Technology, 7(1.7), 197-198. https://doi.org/10.14419/ijet.v7i1.7.10651