Optimally Secure and Verifiable Election Scheme

• Robustness

  • There are three cases:
    • Vlabel[s] suddenly stops its participation in the protocol
    • Vlabel[s] tries to cheat at the computation of Ts := Ts-1 + dlist(P)[s]
    • Vlabel[s-1] tries to cheat by passing some incorrect message to Vlabel[s] , or Vlabel[s-1] is honest, but Vlabel[s] tries to sue Vlabel[s - 1]
    • (3) can be detected by requiring sender to give a zero knowledge proof of the correctness of its message, or requiring the receiver to give a zero knowledge proof that the sender sent incorrect data.