Paper, pens, and ballot-boxes, appropriate procedures were used in traditional voting schemes to reassure voters that the result of the tally is correct [1]. Most viable approach to address voter coercion and vote selling in Internet voting is still the basic concept [4]. Its unrealistic computational requirements of the quadratic-time tallying procedure. is one of the main open issues [4]. In this paper, they examine authorization of votes which is the main cause of the issue and the most recent proposals to perform this step in linear time will be summarized. Based on anonymity sets we explain the key underlying concepts of these proposals and introduce a new protocol. However at the negative side, high transparency will generally make it easier for voters to reveal how they voted [1]. Relevant information is published so that the voter may verify that her vote is included in the final tally and that accepted votes have been cast using proper voting material. With the purpose of internet voting protocol it is practically impossible for vote buyers or coercers to elicit the voters' behavior. The efficiency is compared efficiency with existing work under equal degrees of coercion-resistance using an appropriate measure. Internet voting enjoys wide interest from both researches as well as practices [2]. The main purpose of the new protocol is to move computational complexity introduced in recent works from the voter side to the tallying authority side.

Quadratic-time tallying coercion-resistance computational complexity