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 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.