.png){kind=icon}
返回
A Key Verification Protocol for Quantum Key Distribution
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2943478.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Sharing a secret key between two physically separated nodes, Alice and Bob, is possible through the use of quantum key distribution (QKD) techniques. In the presence of an eavesdropper, Alices key may not be identical with Bobs key, due to the characteristics of a quantum channel. To obtain identical keys at Alice and Bob, we propose a block-based key verification protocol that relies on Newtons polynomial interpolation. As the nodes solely share random numbers and indices of the removed blocks, no information is revealed about the secret message, at a cost of higher computational complexity. The error propagation through the key verification process is prevented by the characteristics of the proposed approach.
Keyword:
Protocols
Interpolation
Cryptography
Qubit
Complexity theory
Communication channels
Key verification
polynomial interpolation
quantum key distribution
secret sharing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
An Improved Moth-Flame Optimization Algorithm with Adaptation Mechanism to Solve Numerical and Mechanical Engineering Problems.png)
EntropyOAAI
EntropyIF0
OAAI分享收藏
查看更多内容