Multiple Private Key Generation for Continuous Memoryless Sources with A Helper
arXiv:2009.02852 · doi:10.1109/TIFS.2020.2973865
Abstract
We propose a method to study the secrecy constraints in key generation problems where side information might be present at untrusted users. Our method is inspired by a recent work of Hayashi and Tan who used the Rényi divergence as the secrecy measure to study the output statistics of applying hash functions to a random sequence. By generalizing the achievability result of Hayashi and Tan to the multi-terminal case, we obtain the output statistics of applying hash functions to multiple random sequences, which turn out to be an important tool in the achievability proof of strong secrecy capacity regions of key generation problems with side information at untrusted users. To illustrate the power of our method, we derive the capacity region of the multiple private key generation problem with an untrusted helper for continuous memoryless sources under Markov conditions. The converse proof of our result follows by generalizing a result of Nitinawarat and Narayan to the case with side information at untrusted users.
IEEE Transactions on Information Forensics and Security, Feb. 2020
References in corpus (9)
- Rényi Divergence and Kullback-Leibler Divergence
- Exponential decreasing rate of leaked information in universal random privacy amplification
- Secret Key Agreement from Vector Gaussian Sources by Rate Limited Public Communication
- Secret-key Agreement with Channel State Information at the Transmitter
- Secret-Key Generation using Correlated Sources and Channels
- Dual universality of hash functions and its applications to quantum cryptography
- Secret Key Agreement from Correlated Gaussian Sources by Rate Limited Public Communication
- Security analysis of epsilon-almost dual universal2 hash functions: smoothing of min entropy vs. smoothing of Rényi entropy of order 2
- The Sender-Excited Secret Key Agreement Model: Capacity, Reliability and Secrecy Exponents