移动Ad Hoc网络的公开可校验并行份额更新

为了增强抵御短期受限攻击者的能力并提高算法的收敛速度,基于RSA算法和国际普遍采用的Diffie-Hellman假设,提出了公开可校验的并行份额更新算法.即利用公开校验算法使任何节点都能够校验份额的正确性,而不仅局限于特定的一组节点,从而提高发现并抵御攻击者的能力;同时利用并行份额更新可以提高算法的收敛速度.此外,新算法还把通信轮次从3次减少到了2次,以减少网络开销并降低被攻击的风险.该算法还利用份额更新乘性加扰方案取代了错误的加性加扰方案.最终的仿真结果验证了新算法的可行性和有效性.

Publicly verifiable and parallel share updates on mobile Ad Hoc networks

In order to further achieve security against short-term constrained adversaries and improve convergence,based on RSA algorithm and Diffie-Hellman assumption,publicly verifiable and parallel share updates algorithm was proposed.By publicly verification,any node not just the participants can verify that the participants received correct shares,so adversaries are prone to befound and defended.By parallel share updates,rapid convergence is insured.In addition,communication rounds have been decreased from three to two so as to reduce the network cost and the risk of being attacked.A new multiplicative shuffle scheme is also proposed to replace false additive shuffle scheme for share updates.Simulation and implementation evaluate and confirm the feasibility and validity of this solution.