Optimally Secure and Verifiable Election Scheme

• Verifiability

  • Tally Computing
    • For all i, Vi randomly generates s1,i, ... , sm,i such that mj=1 sj, i = si ;; discloses z1,i, ... , zm,i where zj , i = E i(s j, i )
    • V i gives a zero knowledge proof of mj=1 D i(zj, i) = D i(si)
    • Assign the random matrix z i, j to pattern P ;;
    • Let Z 1 := dlist(P)[1];; Let T 1 := Dlabel[1](D1);;