2015/10/30 by Igor Bjelaković, Igor Bjelakovic, Jafar Mohammadi +4
Computer Science · Engineering · Mathematics · #Cryptography and Data Security #Privacy-Preserving Technologies in Data #Wireless Communication Security Techniques #cs.IT #math.IT #msc:94A15
paper · pdf · doi:10.48550/arxiv.1510.09091
arxiv created 2016/02/01 · arxiv updated 2016/02/02
We consider a discrete memoryless broadcast channel consists of two users and a sender. The sender has two independent confidential messages for each user. We extend the work of Liu et al. on broadcast channels with two confidential messages with weak secrecy criterion to strong secrecy. Our results are based on an extension of the techniques developed by Hou and Kramer on bounding Kullback-Leibler divergence in context of resolvability and effective secrecy.