论文标题
安全的多部分量子最小值多重计算协议
A Secure Multiparty Quantum Least Common Multiple Computation Protocol
论文作者
论文摘要
在本文中，我们根据Shor的量子周期捕获算法（QPA）提出了至少常见倍数（LCM）的安全多方计算（SMC）协议。我们的协议基于以下原则：多个周期函数的连接也是一个周期性函数，其周期是所有小时段中最不常见的倍数。由于QPA是一种概率算法，因此我们还基于现有的安全多方量子求和协议提出了一个单票投票协议，该协议用于验证拟议的LCM协议的结果。安全性分析表明，在半honest模型下，所提出的协议具有很高的概率，而计算消耗仍然保持在多项式复杂性。本文提出的协议解决了LCM的有效和安全的多方计算问题，证明了量子计算潜力。
In this paper, we present a secure multiparty computation (SMC) protocol for least common multiple (LCM) based on Shor's quantum period-finding algorithm (QPA). Our protocol is based on the following principle: the connection of multiple periodic functions is also a periodic function whose period is exactly the least common multiple of all small periods. Since QPA is a probabilistic algorithm, we also propose a one-vote-down vote protocol based on the existing secure multi-party quantum summation protocol, which is used to verify the results of the proposed LCM protocol. Security analysis shows that under the semi-honest model, the proposed protocol is secure with high probability, while the computational consumption remains at polynomial complexity. The protocol proposed in this paper solves the problem of efficient and secure multiparty computation of LCM, demonstrating quantum computation potential.
