Questions tagged [voting]

Voting is a method for a group such as a meeting or an electorate to make a decision or express an opinion.

Filter by
Sorted by
Tagged with
0
votes
0answers
14 views

Could Helios Voting be changed to allow cumulative voting?

I'm trying to figure out if Helios Voting could be changed to allow cumulative voting. The goal is to allow this: one voter as 3 votes. It could use
2
votes
2answers
72 views

What is blindness and forgeability in chaum blind signature scheme?

I am going through the voting protocols. I know how blind signature works (Blind Signature), but why is blind signature - unconditionally ”blind”, conditionally ”unforgeable" (as highlighted in the ...
3
votes
1answer
99 views

Murder Mystery Party

For a "Murder Mystery Party", one person is chosen anonymously to be the murderer (i.e., only the murderer knows who the murderer is) by shuffling cards with everyone randomly taking a private card (...
0
votes
0answers
41 views

Is “Bingo voting” insecure against a corrupt election authority?

I am reading about "Bingo voting" (Wikipedia, Paper), and I'm not understanding how it is secure against a corrupt election authority. If the election authority knows all the dummy votes $N_j^i$, ...
2
votes
1answer
47 views

Maintaining validity of ZKP throughout re-randomization of homomorphic ciphertext without linkability to previous ciphertext

Question: How is it possible to adapt a ZKP for a homomorphic ciphertext to still be valid after said ciphertext has been re-randomized? Context: In a lot of e-voting systems homomorphic encryption ...
2
votes
0answers
26 views

Is there a scheme to force a party to generate a fresh key?

Is there a way to force one party to generate a fresh key, such that another party can be convinced that the key was freshly generated, without that party also knowing the key? I'm motivated by a ...
1
vote
1answer
31 views

Randomization attack in voting protocols

I'm looking into coercion-resistant voting schemes and one of the key elements of coercion-resistance is resistance to randomization attacks. Juels et al. define a randomization attack as one where ...
1
vote
1answer
59 views

How to prove element equality in G1 using Groth-Sahai proofs

In the BeleniosRF e-voting scheme, Groth-Sahai proofs with the "Instantiation based on the SXDH assumption" are used (see https://eprint.iacr.org/2007/155, version 20160411:065033, page 24). In the ...
47
votes
2answers
6k views

How is the Swiss post e-voting system supposed to work, and how was it wrong?

I read that the Swiss post had an e-voting solution developed, made it possible to obtain the source code for review, and that vulnerabilities were found. Apparently we are not talking about the ...
2
votes
2answers
281 views

Any ideas to make an Electronic Voter Machine more secure? [closed]

EVMs are not secure they say. So how can we make it more secure tham the existing one using cryptography?
4
votes
1answer
324 views

What is chain voting?

I read The Three Ballot Voting System by Rivest. This paper-based voting system can be attacked with chain voting. But can't find any description of what "Chain voting" is mentioned in section 4.9. ...
0
votes
0answers
74 views

Helios voting system voting verification

In the decryption step in helios, why do we need Chaum-Pedersen to prove that a certain plaintext $m$ corresponds to a given ciphertext $c$? Why can we just encrypt $m$ and see if it's equal to $c$?
0
votes
0answers
34 views

Helios: Where are admin tools stated in the paper

I read the Helios Paper Helios: Web-based Open-Audit Voting. In section 4.4 Anonymization they are saying that "once the voting period ends" the admin can "shuffle" (re-encrypt and permutate), "...
0
votes
1answer
128 views

How might one create a system of election by lot (sortition) that is both secure and verifiable?

I've been puzzling recently over sortition, a democratic method of selection for public office which I find very fascinating. Basically, instead of choosing candidates like Hillary Clinton or Donald ...
1
vote
3answers
72 views

Non-interactive public sum of private values

Suppose there is a large number of participants each with a secret value. The secret values are very large (e.g. 256-bit integers). Each participant has published a public commitment to their secret ...
2
votes
1answer
275 views

Why is this voting system not secure?

Why not have each person simply treated as a counterparty to an off-the-record chat? People show up in groups and show an ID which is cross-referenced against a central database to prevent Sybil ...
2
votes
1answer
268 views

Anonymity of Paillier cryptosystem in e-voting system

I'm not an expert so at the moment I'm trying to figure out (at high level) how such cryptosystem would exploit it's homomorphic properties to guarantee anonymity in a e-voting system. As far as i ...
0
votes
1answer
171 views

Non interactive ZKP that encrypted additive elgamal message is in set of valid messages

This is taken from Anonymous voting by two-round public discussion by F. Hao P.Y.A. Ryan P. Zielinski Votes are encrypted using the additive variant of ElGamal. I am also using ECElgamal. The idea is ...
1
vote
1answer
126 views

Revealing vote after time

Imagine we have 5 different parties, all of these parties test if a particular thing is true or false over the course of 24 hours. The network needs to come to a consensus about the majority outcome ...
1
vote
0answers
55 views

Aggregating Votes

Voters may vote 0 or 1. We want to aggregate their votes, proving runs efficiently $O(n)$ in number of votes but verifying runs $O(1)$ or $O(\log n)$. Voting has to be cryptographically secure - no ...
0
votes
1answer
102 views

Secure way to Tally Votes

I want to find a secure and efficient way to tally votes. Say we have N ~ 10000 voters. Each one can vote for candidate 1, candidate 0, or both. But no one can vote more than once. The groups who ...
4
votes
1answer
184 views

Cryptographically secure shaming

I was thinking of the problem of naming&shaming, victims don't want to reveal themselves. Yet the public wants to know, and have some confidence in the veracity of statements. Such confidence ...
1
vote
1answer
130 views

Zero-knowledge voting with hidden weights

Assume a voting with delegates, where each delegate's vote $v_i \in \{-1,1\}$ has a certain weight $w_i$ depending on the number of people who elected the delegate. Is there a way to calculate the ...
2
votes
0answers
142 views

Estonian e-voting, vote verification system

I believe I do understand the basics of how the Estonian e-voting system works, but I'm stuck at their vote verification system. In order to get the vote verified, a client needs to encrypt all of the ...
2
votes
0answers
132 views

How does threshold decryption with secretly shared exponents actually work?

Imagine the case where you have a sufficiently large finite field (or any multiplicative field for that matter) $\mathbb{Z}_{p}$ where p is some large prime. Now, I have a number $g \in \mathbb{Z}_{p}...
2
votes
3answers
327 views

Privacy of vote from tallying authority in El Gamal Voting Schemes

I've been reading this paper about ElGamal encryptions and its application in electronic voting: http://www.win.tue.nl/~berry/papers/euro97.pdf Section 2.3 talks about using Shamir secret sharing so ...
3
votes
0answers
62 views

Draw/Lottery with hidden but provable outcome?

I have a scenario in which one of n participants is to be assigned a positive value and all other participants a negative value. The outcome of the draw is to be known only by the respective ...
7
votes
3answers
180 views

E-voting: public tallying vs. vote selling

There are many design goals for an e-voting system. My question concerns a conflict between 2 particular goals: A voter should be able to verify that their vote was correctly tallied A voter should ...
2
votes
0answers
144 views

Oblivious Transfer in E-Voting

I'm having trouble understanding why and how an oblivious transfer (OT) is used in e-voting systems. According to many descriptions of OT's, a receiver (I suppose that's the ballot collector?) can ...
2
votes
1answer
451 views

Easy to implement proof of shuffle

I will be writing some code to implement a non interactive proof of shuffle. I intend to use it on a voting application that supports Borda voting. The voter must prove that her vote is valid, that is ...
15
votes
1answer
519 views

How to create a decentralized secret ballot among a small group of people?

A small (< 100) group wants to implement an election. For that, each participant must vote in one of N candidates. After everyone has voted, they must be able to determine a winner; yet, nobody ...
1
vote
0answers
47 views

Unique decentralized ID systems

We are all familiar with the standard decentralized ID system, the web of trust, e.g. for PGP keys. However, normal web of trust systems are unable to guarantee uniqueness — there's no practical limit ...
4
votes
0answers
66 views

Election communication protocol

I'm not a cryptography expert, but this seems like it falls into this area. Imagine I want to design an election system (senate race for example) where I send the exact same ballot of 100 candidates ...
0
votes
1answer
49 views

How to run a (provably probably) secure global referendum?

The following question is extremely broad and speculative, for which I apologize, but it strikes me as exceedingly important, so I will ask it nonetheless. Suppose an event of global significance ...
9
votes
1answer
408 views

How do voters verify a Helios (v3) election result?

So from my understanding of verification specification version 3, a Helios election proceeds as follows: A voter retrieves the system's public key to encrypt their vote & submit it. The voter ...
3
votes
1answer
194 views

Why doesn't this operation reveal the voter's message?

I am working my way through this paper. I am trying to figure out the OR zero knowledge proof in figure 2. The prover is verifying that she has correctly voted, and that her input satisfies $$\log_gx=\...
4
votes
1answer
302 views

Have I made any glaring mistakes in my use of Yao's garbled circuits?

I would like to use garbled circuits to provide a service that allows people to vote where they do not need to reveal their votes to my server or to anyone else. Let's assume that I have secure ways ...
3
votes
1answer
194 views

Anonymity problem after voting with blind signatures

In a distributed voting system (all the messages are public, but signed and maybe encrypted/blinded), having: $d$, $e$, $N$ — registrar key params $m$ — msg $r$ — random blinding factor $m'$ — ...
12
votes
3answers
626 views

Are there reasonably secure online voting implementations e.g. for student council elections?

Assume a university want to elect the student council. This was done via paper ballot and there is a need to reach more students for voting, so electronic voting is on the table. While researching ...
4
votes
0answers
82 views

Are there any real-world E-voting systems in use with the Paillier cryptosystem?

There are a lot of theories of Paillier cryptosystem with references to e-voting. Are there any real-world E-voting systems in use with the Paillier cryptosystem?
3
votes
1answer
210 views

Could eVoting on the bitcoin blockchain be done?

I'm basically a crypto noob (and not an english native), so please be indulgent :) I thought about if you could realize an eVoting system with bitcoin. I see 2 major requirements: each citizen can ...
1
vote
0answers
51 views

Voting protocol - How many dishonest tallying centres can the protocol cope with?

We have the voting protocol that is described here. I am looking at the following exercise: Determine how many dishonest tallying centres the protocol can cope with before the following properties ...
6
votes
2answers
944 views

An electronic voting system

This semester I am taking the course Cryptography. I will have a presentation about the topic "Voting Scheme". I am preparing myself by reading from the book “Cryptography : an Introduction” by N....
3
votes
0answers
91 views

During electronic voting, how does one hide the choice from Voting device?

Assume the following: I want to cast a vote during an election through an electronic voting system. For our system we make the assumption that the device one uses to cast the vote is potentially ...
0
votes
2answers
266 views

Voting system validation

I'm developing an application to run elections. A voting system. I would like to give the ability to the voters to check later if their vote were correct computed/casted. assumptions: each user has ...
2
votes
1answer
445 views

Proving correctness of a decryption of a homomorphically summed ciphertext?

I would like to take some additively homomorphic cryptosystem - don't care much which one for now - and encrypt a series of numbers with it. I would then like to (in public) take these numbers, add ...
3
votes
1answer
358 views

Homomorphic crypto allowing anonymous yes/no votes?

I'd need a crypto system allowing online yes/no votes but without revealing who voted what. Is a "partial" homomorphic crypto system what I'm after? Would, for example, Damgård-Jurik work in my case? ...
1
vote
1answer
350 views

Unique, anonymous online authentication

Is there a way to authenticate users online without knowing their real identity yet preventing them from registering twice? If not, what is the least amount of information you would need? If it helps, ...
9
votes
2answers
314 views

Voting scheme where the votes become public when a threshold is reached

Does there exist a voting scheme where voters cast private encrypted votes that automatically become public only after the threshold number of votes is cast? It needs to be done without a central ...
5
votes
2answers
230 views

Current Status of mixnets for voting

I am currently doing some research on universally verifiable mixnets, but it seems to me that there are too few papers about them after 2006 or so and most of them come from the team of Douglas ...