arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/0110038quant-ph
收藏

量子与近似隐私

On quantum and approximate privacy

Hartmut Klauck

摘要:

本文研究了通信复杂度下的隐私和安全功能评估问题。重点是量子版本的模型和协议,只有近似的隐私对诚实的球员。我们表明,在计算函数时的隐私损失(最小泄露信息)可以通过使用量子协议以指数方式减少,而私人可计算函数类(即,具有隐私损失的那些)不被量子协议放大。另一方面,量子通信与小的信息泄漏相结合使得某些函数可以(几乎)私下计算,而这些函数使用无泄漏的量子通信或有泄漏的经典通信都无法计算。我们还给出了一个例子,通过允许隐私损失为$o(1)$而不是隐私损失为0,函数的通信复杂度呈指数级降低。

英文摘要:

This paper studies privacy and secure function evaluation in communication complexity. The focus is on quantum versions of the model and on protocols with only approximate privacy against honest players. We show that the privacy loss (the minimum divulged information) in computing a function can be decreased exponentially by using quantum protocols, while the class of privately computable functions (i.e., those with privacy loss 0) is not enlarged by quantum protocols. Quantum communication combined with small information leakage on the other hand makes certain functions computable (almost) privately which are not computable using either quantum communication without leakage or classical communication with leakage. We also give an example of an exponential reduction of the communication complexity of a function by allowing a privacy loss of $o(1)$ instead of privacy loss 0.

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

↑