A Receipt-Free Voting Scheme Using Partially Compatible Homomorphisms

Abstract

A receipt-free voting scheme is proposed based on partially compatible homomorphic encryptions. The new scheme differs from the previous works in tow features: receipt-freeness and the limitation for the maximum number of 'yes' votes a voter can cast. Although there are solutions for "receipt-freeness" of a voting scheme, they are either impractical or inefficient. Solution based on partially compatible homomorphisms is not existed so far.