This paper presents a new multi-authority secret-ballot election scheme that guarantees privacy, universal verifiability, and robustness. The scheme is optimal in terms of time and communication complexity, with the voter's effort being independent of the number of authorities. Each voter posts a single encrypted message accompanied by a compact proof of validity, ensuring that the final tally can be verified by any observer. The scheme uses homomorphic encryption and fault-tolerant threshold decryption techniques to maintain privacy and tolerate malicious or failed authorities. The main contributions include a fair election scheme with linear complexity for the voter, reduced work for authorities, and the ability to extend the system using proactive threshold cryptosystems. The paper also discusses the security of the scheme under different number-theoretic assumptions and explores extensions to multi-way elections and incoercible protocols.This paper presents a new multi-authority secret-ballot election scheme that guarantees privacy, universal verifiability, and robustness. The scheme is optimal in terms of time and communication complexity, with the voter's effort being independent of the number of authorities. Each voter posts a single encrypted message accompanied by a compact proof of validity, ensuring that the final tally can be verified by any observer. The scheme uses homomorphic encryption and fault-tolerant threshold decryption techniques to maintain privacy and tolerate malicious or failed authorities. The main contributions include a fair election scheme with linear complexity for the voter, reduced work for authorities, and the ability to extend the system using proactive threshold cryptosystems. The paper also discusses the security of the scheme under different number-theoretic assumptions and explores extensions to multi-way elections and incoercible protocols.