An Internet Voting Protocol with Receipt-Free and Coercion-Resistant

Internet voting protocols is the base of the Internet voting systems. In this paper an Internet voting protocol applied designated verifier proof and proof of knowledge of two ciphertexts of the same plaintext is introduced. The proposed Internet voting protocol has the properties of universal verifiability, receipt-free and coercion-resistant and don´t use the strong physical constraints. We only assume that there is a one-way anonymous channel from authorities to voters