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 be found 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.