First page Back Continue Last page Overview Graphics
Optimally Secure and Verifiable Election Scheme
Verifiability
- Distributed Algorithm of two parts
- Local Computation, ( i, OP )
- Local pairwise Communication ( i, j, DATA )
- We need a proof of correctness from ith user on ( i, OP )
- Said proof must only reveal validity of operation
- Facilitated by probabilistic encryption and ZKIPs