基于Grover算法的秘密共享协议的安全性——推广至任意参与者数量——对抗拦截攻击
Security of a Grover's Algorithm-based secret sharing protocol, generalized for an arbitrary number of participants, against interception attacks
AI总结:
本研究将基于Grover搜索算法的秘密共享协议推广至任意参与者数量,并分析拦截攻击下窃听者破解秘密的概率,给出二、三参与者的精确解析解及多参与者情况的推广公式。
摘要:
在这项工作中,我们研究了针对基于Grover搜索算法的秘密共享协议的拦截攻击。与先前仅给出两方和三方参与者算法的工作不同,我们将该算法推广至任意数量的参与者。算法中使用的两种反射均通过广义Householder反射构建。我们的主要目标是获得窃听者破解秘密的概率,该概率取决于真实的初始状态、窃听者假定的初始状态以及Householder角度。在两方和三方参与者的情况下,我们给出了精确的解析解。这些公式与数值结果一致。我们利用4至7个参与者的模拟结果,外推得到任意参与者数量的解析公式。
英文摘要:
In this work, we study interception attacks against a secret sharing protocol based on Grovers search algorithm. Unlike previous works that only give the algorithm for two and three participants, we have generalized the algorithm for any number of participants. Both reflections used in the algorithm are constructed using a generalized Householder reflection. Our main goal is to obtain the probability for an eavesdropper to break the secret depending on the true initial state and the one assumed by the eavesdropper and on the Householder angle. In cases where there are two and three participants, we give an exact analytical solution. These formulas are consistent with the numerical results. We use simulations for the case of between 4 and 7 participants to extrapolate the analytical formula for any number of participants.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。