Efficient Receipt-Free Voting Based on Homomorphic Encryption

By Martin Hirt, Kazue Sako. International Conference on the Theory and Application of Cryptographic Techniques, 2000

548 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Coercion-resistant electronic elections (2005, methodology): “[22] J. Furukawa and K. Sako.”
Civitas: Toward a Secure Voting System (2008, methodology): “The registration teller responds with (si, r, S′ i, D), where r is random, S ′ i = Enc(si; r; KTT) and D is a designated-verifier reencryption proof (DVRP) due to Hirt and Sako [37].”
Random projection-based multiplicative data perturbation for privacy preserving distributed data mining (2006, methodology): “The circuit evaluation protocol, oblivious transfer and oblivious polynomial evaluation [19], homomorphic encryption [20], commutative encryption [21], Yao’s millionaire problem (secure comparison) [22] and some other cryptographic techniques serve as the building blocks of SMC.”
Verifying privacy-type properties of electronic voting protocols (2009, unknown): “In schemes using homomorphic encryption [6] [27], the voter cooperates with the administrator in order to construct an encryption of her vote.”
A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System (2001, methodology): “In [ 8 ], Hirt and Sako propose a general method for building receipt-free election schemes, i.e.”