arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1901.03042quant-ph
收藏

改进且形式化的设备无关量子隐私查询方案

Improved and Formal Proposal for Device Independent Quantum Private Query

Jyotirmoy Basak, Kaushik Chakraborty, Arpita Maitra, Subhamoy Maitra

AI总结:

本文提出一种基于EPR对和自检验技术的完全设备无关量子隐私查询方案,并给出形式化安全性分析及双方最大作弊概率上界。

摘要:

在本文中,我们提出了一种具有完全设备无关认证的新型量子隐私查询(QPQ)方案。据我们所知,这是首次利用EPR对提供如此完整的DI-QPQ方案。我们提出的方案在客户端和服务器互不信任的设置中,利用共享EPR对的自检验以及投影测量算子的自检验。为了认证完全设备无关性,我们利用一种策略来自检验协议中使用的特定类别的POVM元素。此外,我们提供了形式化的安全性分析,并获得了不诚实客户端和不诚实服务器的最大作弊概率的上界。

英文摘要:

In this paper, we propose a novel Quantum Private Query (QPQ) scheme with full Device-Independent certification. To the best of our knowledge, this is the first time we provide such a full DI-QPQ scheme using EPR-pairs. Our proposed scheme exploits self-testing of shared EPR-pairs along with the self-testing of projective measurement operators in a setting where the client and the server do not trust each other. To certify full device independence, we exploit a strategy to self-test a particular class of POVM elements that are used in the protocol. Further, we provide formal security analysis and obtain an upper bound on the maximum cheating probabilities for both the dishonest client as well as the dishonest server.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑