On Secure Communication with Constrained Randomization

2012/02/24 by Matthieu R. Bloch, Bloch, Matthieu R., Jörg Kliewer +1
Computer Science · Engineering · #Cooperative Communication and Network Coding #Cryptography and Data Security #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques

paper · pdf · doi:10.48550/arxiv.1202.5529

openalex publication_date 2012/02/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we investigate how constraints on the randomization in the encoding process affect the secrecy rates achievable over wiretap channels. In particular, we characterize the secrecy capacity with a rate-limited local source of randomness and a less capable eavesdropper's channel, which shows that limited rate incurs a secrecy rate penalty but does not preclude secrecy. We also discuss a more practical aspect of rate-limited randomization in the context of cooperative jamming. Finally, we show that secure communication is possible with a non-uniform source for randomness; this suggests the possibility of designing robust coding schemes.

Related

• Coding Schemes for Achieving Strong Secrecy at Negligible Cost
• Adding Common Randomness Can Remove the Secrecy Constraints in Communication Networks
• Arbitrarily Varying Wiretap Channel with State Sequence Known or Unknown at the Receiver
• Imperfect Secrecy in Wiretap Channel II
• Capacity results for compound wiretap channels