论文标题
对于安全功能评估的任何量子协议的常数下限
A constant lower bound for any quantum protocol for secure function evaluation
论文作者
论文摘要
安全功能评估是一个两方密码原始的原始词，鲍勃计算爱丽丝和他各自的投入的函数，并且都希望将他们的意见与另一方保持私密。事实证明，即使对于量子协议，甚至是完美（或接近完美）的安全性也是不可能的。我们通过对任何量子协议的作弊概率表现出不断的下限来概括这一不进行的结果，以进行安全功能评估，并向百万富翁的问题提供了许多应用程序。恒定的下限具有实际利益，因为它们意味着不可能通过任何方式任意扩大量子协议的安全性。
Secure function evaluation is a two-party cryptographic primitive where Bob computes a function of Alice's and his respective inputs, and both hope to keep their inputs private from the other party. It has been proven that perfect (or near perfect) security is impossible, even for quantum protocols. We generalize this no-go result by exhibiting a constant lower bound on the cheating probabilities for any quantum protocol for secure function evaluation, and present many applications from oblivious transfer to the millionaire's problem. Constant lower bounds are of practical interest since they imply the impossibility to arbitrarily amplify the security of quantum protocols by any means.
