.png){kind=icon}
返回
Quantum private comparison based on quantum dense coding
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-015-0616-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A serious problem in cloud computing is privacy information protection. This study proposes a new private comparison protocol using Einstein-Podolsky-Rosen (EPR) pairs. This protocol allows two parties to secretly compare their classical information. Quantum dense coding enables the comparison task to be completed with the help of a classical semi-honest center. A one-step transmission scheme and designed decoy photons can be used against various quantum attacks. The new protocol can ensure fairness, efficiency, and security. The classical semi-honest center cannot learn any information about the private inputs of the players. Moreover, this scheme can be easily generalized using the general EPR pairs in order to improve the transmission efficiency.
Keyword:
private comparison
multiparty secure computation
classical semi-honesty center
quantum dense coding
general EPR pair
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
4.9K
被引数:
8.9K
机构
引用论文
.png){kind=icon}
分享收藏
Selection of unitary operations in quantum secret sharing without entanglement无纠缠量子秘密共享中unit操作的选择
PREAI
分享收藏High-efficiency quantum steganography based on the tensor product of Bell states基于Bell态张量积的高效量子隐写算法
PREAI
分享收藏分享收藏分享收藏
查看更多内容