Loading...
Search for: secret-communications
0.011 seconds

    Compound multiple access channel with confidential messages

    , Article 2014 IEEE International Conference on Communications, ICC 2014 ; 10-14 June 2014 , 2014 , Pages 1922-1927 ; ISBN: 9781479920037 Zivari Fard, H ; Akhbari, B ; Ahmadian Attari, M ; Aref, M. R ; Sharif University of Technology
    Abstract
    In this paper, we study the problem of secret communication over a Compound Multiple Access Channel (MAC). In this channel, we assume that one of the transmitted messages is confidential that is only decoded by its corresponding receiver and kept secret from the other receiver. For this proposed setting (compound MAC with confidential messages), we derive general inner and outer bounds on the secrecy capacity region. Also, as examples, we investigate 'Less noisy' and 'Gaussian' versions of this channel, and extend the results of the discrete memoryless version to these cases. Moreover, providing numerical examples for the Gaussian case, we illustrate the comparison between achievable rate... 

    Multiple access channel with common message and secrecy constraint

    , Article IET Communications ; Volume 10, Issue 1 , 2016 , Pages 98-110 ; 17518628 (ISSN) Zivari Fard, H ; Akhbari, B ; Ahmadian Attari, M ; Aref, M. R ; Sharif University of Technology
    Institution of Engineering and Technology 
    Abstract
    The authors study the problem of secret communication over a multiple-access channel with a common message. Here, the authors assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second receiver), and both of them have access to a common message which can be decoded by the two receivers. The authors call this setting as multiple-access wiretap channel with common message (MAWC-CM). For this setting, the authors derive general inner and outer bounds on the secrecy capacity region for the discrete memoryless case and show that these bounds meet each other for a special case called the switch channel. As well, for a Gaussian version of... 

    Compressed sensing encryption: compressive sensing meets detection theory

    , Article Journal of Communications ; Volume 13, Issue 2 , February , 2018 , Pages 82-87 ; 17962021 (ISSN) Ramezani Mayiami, M ; Ghanizade Bafghi, H ; Seyfe, B ; Sharif University of Technology
    Engineering and Technology Publishing  2018
    Abstract
    Since compressive sensing utilizes a random matrix to map the sparse signal space to a lower dimensional transform domain, it may be possible to apply this matrix at the same time for encrypting the signal opportunistically. In this paper, a compressed sensing based encryption method is considered and the secrecy of measurement matrix of compressive sensing is analysed from the detection theory perspective. Here, the detection probability of intended and unintended receivers are compared by applying the Neyman-Pearson test. We prove that the detection probability of eavesdropper will be reduced significantly because he does not know the transform domain subspace. Furthermore, in some...