Design a cryptographic protocol for an electronic voting system that ensures three properties: 1) Anonymity (no one knows who voted for whom), 2) Verifiability (anyone can verify the tally is correct), and 3) Uniqueness (no one can vote twice). Describe the mathematical primitives you would use, such as Homomorphic Encryption, Zero-Knowledge Proofs, or Blind Signatures. Walk through the step-by-step interaction between the Voter, the Authority, and the Tally Server. Discuss how the system would handle a disputed vote or a request for a recount.