It is known that the security evaluation can be done by smoothing of Rényi entropy of order 2 in the classical and quantum settings when we apply universal$_2$ hash functions. Using the smoothing of Renyi entropy of order 2, we derive security bounds for $L_1$ distinguishability and modified mutual information criterion under the classical and quantum setting, and have derived these exponential decreasing rates. These results are extended to the case when we apply $\varepsilon$-almost dual universal$_2$ hash functions. Further, we apply this analysis to the secret key generation with error correction.
Generalized Rényi entropy accumulation theorem and generalized quantum probability estimation
Institute for Quantum Computing and Department of Physics and Astronomy, University of Waterloo（滑铁卢大学量子计算研究所和物理与天文学系）；The Center for Quantum Science and Technology, Department of Complex Systems, Weizmann Institute of Science（魏茨曼科学研究所复杂系统系量子科学与技术中心）
Finite-size quantum key distribution rates from Rényi entropies using conic optimization
Luxquanta Technologies S.L.（Luxquanta科技有限公司）；ICFO - Institut de Ciencies Fotoniques, The Barcelona Institute of Science and Technology（ICFO-光子科学研究所，巴塞罗那科学技术研究院）；Universidad de Valladolid（巴利亚多利德大学）
Quantum Differential Privacy: An Information Theory Perspective
Technical University of Munich（慕尼黑工业大学）；National University of Singapore（新加坡国立大学）；Munich Center for Quantum Science and Technology（慕尼黑量子科学与技术中心）；University of Copenhagen（哥本哈根大学）
