21 research outputs found
Universal coding for correlated sources with complementary delivery
This paper deals with a universal coding problem for a certain kind of
multiterminal source coding system that we call the complementary delivery
coding system. In this system, messages from two correlated sources are jointly
encoded, and each decoder has access to one of the two messages to enable it to
reproduce the other message. Both fixed-to-fixed length and fixed-to-variable
length lossless coding schemes are considered. Explicit constructions of
universal codes and bounds of the error probabilities are clarified via
type-theoretical and graph-theoretical analyses. [[Keywords]] multiterminal
source coding, complementary delivery, universal coding, types of sequences,
bipartite graphsComment: 18 pages, some of the material in this manuscript has been already
published in IEICE Transactions on Fundamentals, September 2007. Several
additional results are also include
Distributed Source Coding with Encryption Using Correlated Keys
We pose and investigate the distributed secure source coding based on the
common key cryptosystem. This cryptosystem includes the secrecy amplification
problem for distributed encrypted sources with correlated keys using
post-encryption-compression, which was posed investigated by Santoso and
Oohama. In this paper we propose another new security criterion which is
generally more strict compared to the commonly used security criterion which is
based on the upper-bound of mutual information between the plaintext and the
ciphertext. Under this criterion, we establish the necessary and sufficient
condition for the secure transmission of correlated sources.Comment: 7 pages, 3 figure. The short version was submitted to ISIT 2021. We
have some typos in the short version. Those are fixed in this version. arXiv
admin note: text overlap with arXiv:1801.0492
Information Theoretic Security for Broadcasting of Two Encrypted Sources under Side-Channel Attacks
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.Comment: 13 pages, 4 figures. In the current version we we have corrected
errors in Fig. 2 and Fig. 4. arXiv admin note: substantial text overlap with
arXiv:1801.02563, arXiv:1801.0492