Strong Secrecy From Channel Resolvability

DOI10.1109/TIT.2013.2283722zbMath1364.94574arXiv1105.5419MaRDI QIDQ5346209

J. Nicholas Laneman, Matthieu Bloch

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1105.5419

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40) Authentication, digital signatures and secret sharing (94A62) Communication theory (94A05)

Related Items (3)

Strong Secrecy for Multiple Access Channels ⋮ Common Information, Noise Stability, and Their Extensions ⋮ Over-the-Air computation for distributed machine learning and consensus in large wireless networks

This page was built for publication: Strong Secrecy From Channel Resolvability