pith. sign in

arxiv: 1901.05940 · v4 · pith:AGCQRTNKnew · submitted 2019-01-17 · 💻 cs.IT · math.IT

Information Theoretic Security for Broadcasting of Two Encrypted Sources under Side-Channel Attacks

classification 💻 cs.IT math.IT
keywords encryptedinformationsourcesadversarybroadcastingcommonmessagesproblem
0
0 comments X
read the original abstract

We consider the secure communication problem for broadcasting of two encrypted sources. The sender wishes to broadcast two secret messages via two common key cryptosystems. We assume that the adversary can use the side-channel, where the side information on common keys can be obtained via the rate constraint noiseless channel. To solve this problem we formulate the post encryption coding system. On the information leakage on two secrete messages to the adversary, we provide an explicit sufficient condition to attain the exponential decay of this quantity for large block lengths of encrypted sources.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.