Abstract:Multi-candidate electronic voting schemes play an important role in elections. Full privacy implies privacy protection for both voters and candidates, which is an important property of secure electronic voting schemes. A “k-out-of-m” electronic voting scheme based on secure multi-party computation is proposed in the study. In the scheme, voters’ willingness is mapped into the form of an array. Combined with the ElGamal homomorphic encryption system, the scheme outputs election results through the interactive computing of voters and candidates in a semi-honest model, which achieves full privacy and does not require the participation of a third-party vote-counting agency. Furthermore, the number of dissenting votes is taken into account for the first time in order to avoid controversial election results.