Optimally Secure and Verifiable Election Scheme

• Secure Summarization Protocol (P, (s1, ... , sN))

  • For all i, Vi randomly generates s1, i , ... , sm, i such that:
    • mj=1 sj, i = si ;;
  • Assign the random matrix sj, i to P ;;
  • Let T1 := dlist(P)[1] ;;
  • For i = 1 to mN-1 do
    • Vlabel [ i ],, sends Ti securely to Vlabel [ i + 1 ] ;;
    • Vlabel [ i + 1] computes Ti+1 := Ti + dlist(P)[i + 1] in private ;;
  • Vlabel [ mN ], discloses TmN to the public