Feb 4, 2012 · The security strategy is to encode the message with some random key at the sender. Only the message is required to be recovered at the receiver.

Abstract: In a point-to-point communication system which consists of a sender s, a receiver t and a set of noiseless channels, the senders wants to transmit ...

Oct 12, 2014 · When imperfect security is considered in a wiretap network G = (V, E), where V is the set of nodes and E is the set of channels, Cai and Yeung [ ...

When imperfect security is considered in a wiretap network G = (V, E), where V is the set of nodes and E is the set of channels, Cai and Yeung in [2] proved two ...

Oct 22, 2024 · From each wiretap set, the wiretapper can obtain some partial information about the private message which is measured by the equivocation of the ...

17 Citations · Imperfect Secrecy in Wiretap Channel II · Reliable and perfectly secret communication over the generalized Ozarow-Wyner's wire-tap channel.

It is assumed that from each wiretap set, the wiretapper can obtain some partial information about the private message which is measured by the wiretapper's ...

Fan Cheng , Raymond W. Yeung, Kenneth W. Shum: Imperfect Secrecy in Wiretap Channel II. IEEE Trans. Inf. Theory 61(1): 628-636 (2015). manage site settings.

Under this setting, we define an achievable rate tuple consisting of the size of the message, the size of the key, and the equivocation for each wiretap set. We ...

Bibliographic details on Imperfect secrecy in wiretap channel II.