Secure Multiplex Coding with Dependent and Non-Uniform Multiple Messages

Abstract

The secure multiplex coding (SMC) is a technique to remove rate loss in the coding for wire-tap channels and broadcast channels with confidential messages caused by the inclusion of random bits into transmitted signals. SMC replaces the random bits by other meaningful secret messages, and a collection of secret messages serves as the random bits to hide the rest of messages. In the previous researches, multiple secret messages were assumed to have independent and uniform distributions, which is difficult to be ensured in practice. We remove this restrictive assumption by a generalization of the channel resolvability technique. We also give practical construction techniques for SMC by using an arbitrary given error-correcting code as an ingredient, and channel-universal coding of SMC. By using the same principle as the channel-universal SMC, we give coding for the broadcast channel with confidential messages universal to both channel and source distributions.

We made several changes to improve the presentation

References in corpus (2)

• More Efficient Privacy Amplification with Less Random Seeds via Dual Universal Hash Function
• Operational Interpretation of Renyi Information Measures via Composite Hypothesis Testing Against Product and Markov Distributions

Cited by in corpus (21)

• More Efficient Privacy Amplification with Less Random Seeds via Dual Universal Hash Function
• Operational Interpretation of Renyi Information Measures via Composite Hypothesis Testing Against Product and Markov Distributions
• Exact Random Coding Secrecy Exponents for the Wiretap Channel
• Semantic Security via Seeded Modular Coding Schemes and Ramanujan Graphs
• Secure uniform random number extraction via incoherent strategies
• Classical-Quantum Arbitrarily Varying Wiretap Channel: Secret Message Transmission under Jamming Attacks
• Mosaics of combinatorial designs for information-theoretic security
• Information-theoretic Physical Layer Security for Satellite Channels
• Semantic Security for Quantum Wiretap Channels
• On the Secrecy Exponent of the Wire-tap Channel
• Quantum-inspired secure wireless communication protocol under spatial and local Gaussian noise assumptions
• Secure Computation-and-Forward with Linear Codes
• Finite-Block-Length Analysis in Classical and Quantum Information Theory
• Encoding Individual Source Sequences for the Wiretap Channel
• Iterative minimization algorithm on a mixture family
• Secure Modulo Sum via Multiple Access Channel
• Non-Adaptive Coding for Two-Way Wiretap Channel with or without Cost Constraints
• Message Randomization and Strong Security in Quantum Stabilizer-Based Secret Sharing for Classical Secrets
• On Error Exponents and Moderate Deviations for Lossless Streaming Compression of Correlated Sources
• Universal classical-quantum superposition coding and universal classical-quantum multiple access channel coding
• Physical Layer Security for RF Satellite Channels in the Finite-length Regime