A dynamic multi-secrets sharing threshold scheme is presented to apply to a large scale electronic voting system with many talliers (tallying authorities). Even if there exist adaptive adversaries, this scheme can guard the ballot’s producing, encrypting, transmitting, decrypting and final tallying in spite of the adversaries’s attack, so the scheme guarantees robustness. In this paper, the verifiability of the voters’ qualification and talliers’ identification will be solved by a dynamic multi-secret sharing scheme without invoking more zero knowledge proof to maintain privacy, universal verifiablitlity, and anonymity of ballots. It holds more communication efficiency and more security than the proposed schemes in early time.