Optimally Secure and Verifiable Election Scheme

• Robustness

  • Those who attempt to prevent a correct tally can be recognized using a timing mechanism.
  • Recall the two steps of our protocol
    • Local computation and correctness verification
    • Pairwise local communication
    • These steps are timed by CT which is agreed upon by all voters at the beginning of the protocol.