The first zero-knowledge proof checks that the encrypted ballot entries add up to 1, enforcing that the voter selected exactly one candidate rather than none or both. This rules out voting for both candidates or for none.
Conditions: There are two candidate slots in the example.; Each slot contains one encrypted value.; The proof must hold without revealing the individual values.
The first zero-knowledge proof checks that the encrypted ballot entries add up to 1, enforcing that the voter selected exactly one candidate rather than none or both. This rules out voting for both candidates or for none.
Conditions: There are two candidate slots in the example.; Each slot contains one encrypted value.; The proof must hold without revealing the individual values.
The protocol combines encrypted ballots so that only the totals for each candidate are revealed, not the individual voters' choices. All encrypted ballots can be combined using a mathematical protocol that preserves the sum without decrypting the individual components.
Conditions: All ballots are encrypted before submission.; Aggregation is performed on encrypted data.; Only final totals are revealed.
The protocol combines encrypted ballots so that only the totals for each candidate are revealed, not the individual voters' choices. All encrypted ballots can be combined using a mathematical protocol that preserves the sum without decrypting the individual components.
Conditions: All ballots are encrypted before submission.; Aggregation is performed on encrypted data.; Only final totals are revealed.
The envelope is used as a concrete metaphor for cryptographic encryption of the ballot values. Putting the vote inside the envelope actually means encrypting them using a specific type of scheme, hiding the ballot values from public view while preserving later aggregation properties.
Conditions: The ballot values are hidden from public view.; Encryption is assumed to preserve later aggregation properties.; The specific cryptosystem is not named in this clip.
The envelope is used as a concrete metaphor for cryptographic encryption of the ballot values. Putting the vote inside the envelope actually means encrypting them using a specific type of scheme, hiding the ballot values from public view while preserving later aggregation properties.
Conditions: The ballot values are hidden from public view.; Encryption is assumed to preserve later aggregation properties.; The specific cryptosystem is not named in this clip.
In the physical demonstration, each candidate receives a numeric ballot entry: 1 means vote for that candidate and 0 means do not vote for that candidate. This binary encoding turns the election into a pair of numeric ballot entries, allowing the system to mathematically verify that exactly one candidate is chosen.
Conditions: Exactly two candidates are considered.; Each candidate receives one ballot value.; The intended vote is for exactly one candidate.
In the physical demonstration, each candidate receives a numeric ballot entry: 1 means vote for that candidate and 0 means do not vote for that candidate. This binary encoding turns the election into a pair of numeric ballot entries, allowing the system to mathematically verify that exactly one candidate is chosen.
Conditions: Exactly two candidates are considered.; Each candidate receives one ballot value.; The intended vote is for exactly one candidate.