Skip to Main Content
This paper investigates the feasibility of Rivest's chaffing and winnowing (C&W) paradigm in providing incoercibility into electronic voting (e-voting) scheme. We begin with analysis the previous attempts to introduce incoercibility into e-voting scheme and then present the basic idea behind the C&W. We show that by using C&W, we could achieve incoercibility without sacrificing other security requirements or relying on some forms of physical assumption. Our scheme is secure against both passive and active coercers if the adversaries could not prescribe the random value of the number theory in used.