Optimally Secure and Verifiable Election Scheme

• Verifiability

  • Tally Computing (cont.)
    • For i = 1 to mN – 1 do
      • Vlabel[i], passes Ti securely to Vlabel[i + 1] ;;
      • In private Vlabel[ i + 1] computes Ti+1 := Ti + Dlabel[i + 1](dlist(P)[i + 1]) ;; discloses Zi+1 = Elabel[i + 1](Ti+1) ;;
      • Vlabel[i+1] gives a zero knowledge proof of Dlabel[i+1](Zi+1) = Dlabel[i](Zi) + Dlabel[i+1](dlist(P)[i+1]) ;;
    • Vlabel[mN] discloses TmN to the public