7 research outputs found
Secure Multiplex Coding with a Common Message
We determine the capacity region of the secure multiplex coding with a common
message, and evaluate the mutual information and the equivocation rate of a
collection of secret messages to the second receiver (eavesdropper), which were
not evaluated by Yamamoto et al.Comment: 5 pages, no figure, IEEEtran.sty, final version to appear in Proc.
ISIT 201
The Degraded Gaussian Diamond-Wiretap Channel
In this paper, we present nontrivial upper and lower bounds on the secrecy
capacity of the degraded Gaussian diamond-wiretap channel and identify several
ranges of channel parameters where these bounds coincide with useful
intuitions. Furthermore, we investigate the effect of the presence of an
eavesdropper on the capacity. We consider the following two scenarios regarding
the availability of randomness: 1) a common randomness is available at the
source and the two relays and 2) a randomness is available only at the source
and there is no available randomness at the relays. We obtain the upper bound
by taking into account the correlation between the two relay signals and the
availability of randomness at each encoder. For the lower bound, we propose two
types of coding schemes: 1) a decode-and-forward scheme where the relays
cooperatively transmit the message and the fictitious message and 2) a partial
DF scheme incorporated with multicoding in which each relay sends an
independent partial message and the whole or partial fictitious message using
dependent codewords.Comment: 26 pages, 6 figures, a short version will appear in Proc. IEEE ISIT
201
Universal Secure Multiplex Network Coding with Dependent and Non-Uniform Messages
We consider the random linear precoder at the source node as a secure network
coding. We prove that it is strongly secure in the sense of Harada and Yamamoto
and universal secure in the sense of Silva and Kschischang, while allowing
arbitrary small but nonzero mutual information to the eavesdropper. Our
security proof allows statistically dependent and non-uniform multiple secret
messages, while all previous constructions of weakly or strongly secure network
coding assumed independent and uniform messages, which are difficult to be
ensured in practice.Comment: 10 pages, 1 figure, IEEEtrans.cls. Online published in IEEE Trans.
Inform. Theor
Secure Multiplex Coding Over Interference Channel with Confidential Messages
In this paper, inner and outer bounds on the capacity region of two-user
interference channels with two confidential messages have been proposed. By
adding secure multiplex coding to the error correction method in [15] which
achieves the best achievable capacity region for interference channel up to
now, we have shown that the improved secure capacity region compared with [2]
now is the whole Han-Kobayashi region. In addition, this construction not only
removes the rate loss incurred by adding dummy messages to achieve security,
but also change the original weak security condition in [2] to strong security.
Then the equivocation rate for a collection of secret messages has also been
evaluated, when the length of the message is finite or the information rate is
high, our result provides a good approximation for bounding the worst case
equivocation rate. Our results can be readily extended to the Gaussian
interference channel with little efforts.Comment: 10 pages, 6 figure
Coding Schemes for Achieving Strong Secrecy at Negligible Cost
We study the problem of achieving strong secrecy over wiretap channels at
negligible cost, in the sense of maintaining the overall communication rate of
the same channel without secrecy constraints. Specifically, we propose and
analyze two source-channel coding architectures, in which secrecy is achieved
by multiplexing public and confidential messages. In both cases, our main
contribution is to show that secrecy can be achieved without compromising
communication rate and by requiring only randomness of asymptotically vanishing
rate. Our first source-channel coding architecture relies on a modified wiretap
channel code, in which randomization is performed using the output of a source
code. In contrast, our second architecture relies on a standard wiretap code
combined with a modified source code termed uniform compression code, in which
a small shared secret seed is used to enhance the uniformity of the source code
output. We carry out a detailed analysis of uniform compression codes and
characterize the optimal size of the shared seed.Comment: 15 pages, two-column, 5 figures, accepted to IEEE Transactions on
Information Theor