The scheme of ABRTY (Araújo et al., CANS 2010) is one of the most promising solutions for internet voting nowadays. It fights realistic coercive attacks and can be applied in large scale voting scenarios as it has linear time complexity. However, this scheme has two intrinsic drawbacks. As it does not allow revocation of credentials of ineligible voters, voters need to obtain fresh credentials before each new election. Also, authorities could generate valid but illegitimate credentials unnoticed. In this work, we present solutions for these drawbacks and show a modified version of ABRTY’s scheme. In addition, we describe a weakness of a receipt-free voting scheme proposed by Acquisti in 2004.