The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper studies the problem of secure communication over broadcast channels under the individual secrecy constraints. That is, the transmitter wants to send two independent messages to two legitimate receivers in the presence of an eavesdropper, while keeping the eavesdropper ignorant of each message. A general achievable rate region is established by utilizing Marton's coding together with techniques...
This paper studies the one-sided secrecy of a full-duplex two-way wiretap channel. It is motivated by a practical communication scenario, where two legitimate users communicate with each other in the presence of an external eavesdropper and only one of the users wishes to keep its message confidential from the external eavesdropper for the sake of privacy. As a general result, we establish an achievable...
This paper studies the problem of secure communication over a 2-transmitter multiple access channel (MAC) in the presence of an external eavesdropper. Two different secrecy constraints are considered: 1) individual secrecy (i.e., information leakage rate from each message to the eavesdropper is made vanishing) and 2) joint secrecy (i.e., information leakage rate from both messages to the eavesdropper...
This paper studies the problem of secure communication over broadcast channels under the lens of individual secrecy constraints (i.e., information leakage from each message to an eavesdropper is made vanishing). It is known that, for the communication over the degraded broadcast channels, the stronger receiver is able to decode the message of the weaker receiver. In the individual secrecy setting,...
This paper studies the individual secrecy capacity region of the broadcast channel with receiver side information. First, an achievable rate region is established for the discrete memoryless case by employing superposition coding. Further, it is extended to the corresponding Gaussian case, where the individual secrecy capacity region is characterized in case of a weak or strong eavesdropper (compared...
This paper studies the problem of secret-message transmission over a wiretap channel with correlated sources in the presence of an eavesdropper who has no source observation. A coding scheme is proposed based on a careful combination of 1) Wyner-Ziv's source coding to generate secret key from correlated sources based on a certain cost on the channel, 2) one-time pad to secure messages without additional...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.