A Secure Internet Voting Protocol Based on Non-interactive Deniable Authentication Protocol and Proof Protocol that Two Ciphertexts are Encryption of the Same Plaintext

Abstract

Internet voting protocol is the base of the Internet voting systems. Firstly, an improved proof protocol that two ciphertexts are encryption of the same plaintext is introduced. Secondly, a receipt-free and coercion-resistant Internet voting protocol based on the non-interactive deniable authentication protocol and an improved proof protocol that two ciphertexts are encryption of the same plaintext is developed. Thirdly, we analyze the proposed Internet voting protocol. The proposed Internet voting protocol has the properties of universal verifiability, receiptfreeness and coercion-resistance. At the same time the proposed protocol is with the weak physical assumption. Lastly, we compare security properties of the several typical Internet voting protocols with our present protocol.