论文标题
连续无内存来源的多个私钥一代
Multiple Private Key Generation for Continuous Memoryless Sources with A Helper
论文作者
论文摘要
我们提出了一种研究关键世代问题中的保密限制的方法，在这些问题中可能会出现在不受信任的用户中的附带信息。我们的方法的灵感来自Hayashi和Tan的最新作品，他们使用RényiDivergence作为保密度量，以研究将哈希函数应用于随机序列的输出统计数据。通过将Hayashi和Tan的可实现性结果推广到多末端情况下，我们获得了将哈希功能应用于多个随机序列的输出统计数据，这些序列证明了在未经信任的用户中使用侧面信息的密钥生成问题的实现强大秘密产能区域的重要性。为了说明我们方法的功能，我们通过不受信任的助手来得出多个私钥生成问题的容量区域，用于在马尔可夫条件下连续无内存的来源。我们的结果的相反证明是将Nitinawarat和Narayan的结果推广到案例中，并在不受信任的用户中提供了附带信息。
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.
