Two-party quantum computation (2PQC) allows two participants Alice and Bob to securely compute a given unitary function on their quantum inputs without leaking privacy. Existing 2PQC protocols require participants to have strong quantum capability, such as preparing qubits and performing measurements. Recently, Kashefi et al. proposed a 2PQC protocol named QYao protocol, where Alice only has to prepare qubits and perform Pauli operations, but Bob needs to have a powerful quantum computer. In this paper, we simplify the QYao protocol and reduce Bob’s quantum capability by applying blind quantum computing (BQC) in 2PQC. Two improved 2PQC protocols are proposed. The first protocol allows Bob to generate his encrypted input by making measurements and thus removes encryption at the input stage. The second protocol improves the verification capability of Bob based on the method of stabilizer testing and further reduces Bob’s ability to make measurements only. Besides, Alice can be more flexible since it is enough for her to produce an appropriate graph state instead of a fixed dotted triple-graph resource state DT(G). After the computation, two parties’ inputs also can be kept secret in both presented protocols.

中文翻译：

---

基于盲量子计算的安全两方计算

两方量子计算 (2PQC) 允许两个参与者 Alice 和 Bob 在他们的量子输入上安全地计算给定的幺正函数，而不会泄露隐私。现有的 2PQC 协议要求参与者具有强大的量子能力，例如准备量子位和执行测量。最近，Kashefi 等人。提出了一个名为 QYao 协议的 2PQC 协议，其中 Alice 只需要准备量子比特和执行泡利运算，而 Bob 需要有一台强大的量子计算机。在本文中，我们通过在 2PQC 中应用盲量子计算 (BQC) 来简化 QYao 协议并降低 Bob 的量子能力。提出了两种改进的 2PQC 协议。第一个协议允许 Bob 通过测量生成他的加密输入，从而在输入阶段删除加密。第二个协议基于稳定器测试的方法提高了 Bob 的验证能力，并进一步降低了 Bob 仅进行测量的能力。此外，Alice 可以更加灵活，因为她可以生成适当的图状态而不是固定的点状三重图资源状态 DT(G)。在计算之后，双方的输入也可以在两种呈现的协议中保密。