Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with voting
Search options not deleted
user 64
Voting is a method for a group such as a meeting or an electorate to make a decision or express an opinion.
19
votes
Accepted
Can Elgamal be made additively homomorphic and how could it be used for E-voting?
See this answer for how to build a voting scheme from it (or this paper for the full description). … Dispite this, many voting schemes still use exponential Elgamal because it is faster, easier to do distributed key generation, and not patented. …
- 8,717
10
votes
Approach towards anonymous e-voting
Using exponential Elgamal as the encryption function,
Define the list of candidates: e.g., Alice, Bob, Carol
Voters submit an encryption of their vote: e.g., to voter for Alice: $v=\langle\mathsf{En …
- 8,717
2
votes
Accepted
Existing works on pre-computing ElGamal ephermal keys
There is a worry that if a voting machine chooses the randomness, they could try a few values until the ciphertext comes out with a certain pattern (e.g., the 5th bit is a 0 if the vote is for Alice and … A more thorough approach is considered in On Subliminal Channels in Encrypt-on-Cast Voting Systems
.
If you insist on your approach, note that you never need to use $c_1$ at all. …
- 8,717