We outline a straightforward approach for obtaining a secret key rate using only no-signaling constraints and linear programming. Assuming an individual attack, we consider all possible joint probabilities. Initially, we study only the case where Eve has binary outcomes, and we impose constraints due to the no-signaling principle and given measurement outcomes. Within the remaining space of joint probabilities, by using linear programming, we get bound on the probability of Eve correctly guessing Bob's bit. We then make use of an inequality that relates this guessing probability to the mutual information between Bob and a more general Eve, who is not binary-restricted. Putting our computed bound together with the Csiszár-Körner formula, we obtain a positive key generation rate. The optimal value of this rate agrees with known results, but was calculated in a more straightforward way, offering the potential of generalization to different scenarios.
"Nonlocality-of-a-single-photon" based Quantum Key Distribution and Random Number Generation schemes and their device-independent security analysis
University of Gdańsk（格但斯克大学）；Technology Innovation Institute（技术创新研究所）；Indian Institute of Technology Kharagpur（印度理工学院卡拉格普尔分校）；Institute of Theoretical and Applied Informatics, Polish Academy of Sciences（波兰科学院理论与应用数学研究所）
Efficient Computation of QKD Key Rates without Semidefinite Programming
Institute for Theoretical Physics, Leibniz Universität Hannover（汉诺威莱布尼茨大学理论物理研究所）；Chair of Data Security and Cryptography, University of Regensburg（雷根斯堡大学数据安全和密码学教席）；Institute for Quantum Information, RWTH Aachen University（亚琛工业大学量子信息研究所）
Quantum key distribution using generalized contextuality against post-quantum eavesdroppers
Perimeter Institute for Theoretical Physics；Department of Physics and Astronomy, University of Waterloo（滑铁卢大学物理与天文系）；Institute for Quantum Computing, University of Waterloo（滑铁卢大学量子计算研究所）
