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.
Electronic voting is presented as an applied setting where zero-knowledge proofs can enforce ballot validity while preserving secrecy. The system must verify that each voter chooses exactly one candidate and that the vote is binary, without revealing the individual voter's choice.
Conditions: There are multiple candidates.; Votes are encrypted before aggregation.; Validity must be checked without revealing individual votes.
Electronic voting is presented as an applied setting where zero-knowledge proofs can enforce ballot validity while preserving secrecy. The system must verify that each voter chooses exactly one candidate and that the vote is binary, without revealing the individual voter's choice.
Conditions: There are multiple candidates.; Votes are encrypted before aggregation.; Validity must be checked without revealing individual votes.
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.