Publicationes Mathematicae Debrecen · 2011 · 20 citations · 9 references
ComputingComputer ScienceCybersecurityComputer SecurityCryptographySecurity ProtocolsCryptographic AlgorithmsCryptographic Protocol DesignCryptographic ProtocolsElection SecurityHomomorphic EncryptionVoting EligibilityAuthentication In Voting SystemsChannelsElectronic Voting CryptographyElectronic Voting ProtocolsElectronic Voting Security
In this paper we propose a homomorphic encryption-based secure el- ectronic voting scheme that is based on (5). It guarantees eligibility, unreusability, pri- vacy, veriflability and also receipt-freeness and uncoercibility. The scheme can be imp- lemented in a practical environment, since it does not use voting booth or untappable channel, only anonymous channels are applied.
9
Practical multi-candidate election system
Olivier Baudron, Pierre-Alain Fouque, David Pointcheval et al. · 2001 · 301 citations · Full text
Receipt-Free Secret-Ballot Elections
Josh Cohen Benaloh · Symposium on the Theory of Computing · 1994 · 282 citations