2000 character limit reached
Strong Secrecy for General Multiple-Access Wiretap Channels (2003.03592v1)
Published 7 Mar 2020 in cs.IT and math.IT
Abstract: This paper is concerned with the general multiple access wiretap channel and the existence of codes that accomplish reliability and strong secrecy. Information leakage to the eavesdropper is assessed by the variational distance metric, whereas the average error probability is bounded by modifying Feinsteins Lemma. We derive an achievable strong secrecy rate region by utilizing the resolvability theory for the multiple-access channel in terms of information-spectrum methods.