# Adding Vote Delegation to Anonymous E-Voting Schemes

*2022-05-06 by Vincenzo Iovino*

Anonymous e-voting systems, often based on SNARK proof systems, provide the following features and security properties:

**Easy tallying.**After the end of the election, the votes (also called preferences or options) appear on the bulletin board in the clear, so the tally can be easily computed and checked at hand as in traditional paper-based elections.**Vote independence.**A voter cannot base her own preference on the preferences of other voters.**Eligibility.**Only eligible voters are allowed to cast one and only one valid vote.**Anonymity.**A vote cannot be associated to any of the eligible voters.**Individual and universal verifiability.**Each eligible voter can quickly check that her own vote was counted. Moreover, everyone, even a third party who did not participate in the election, can check that the election process was run faithfully.**No authority is trusted for privacy.**There is no authority or participant in the electronic election that is able to guess what a voter voted for. Moreover, no authority or participant is even able to detect whether a voter cast a vote.

One example of such voting schemes based on SNARK proofs is Vocdoni, developed by Aragon Labs.

## Delegation

We would like to add a new feature, namely *delegation.* This means that a *delegator* can issue to a *delegate* a *token* \(T_f\) relative a predicate \(f\) so that the delegate will be able to only submit a vote \(v\) for the election identified by the identifier \(id\) iff \(f(v,id)=1\).

Observe that in this framework we can capture all delegation mechanisms. For instance, the predicate \(f\) can just check that the identifier \(id\) corresponds to the identifiers of the elections running in 2022 and 2023 or can check that \(v\) belongs to a subset of options.

## Snark-based anoynmous e-voting schemes

Before describing our proposal to add delegation, we present a construction of a typical SNARK-based anonymous e-voting scheme. The following description is generic and does not describe a specific implementation. For sake of simplicity, the solution we sketch does not satisfy vote independence; we will discuss later how to add such property.

We assume the reader be familiar with the concept of SNARK. A typical anonymous e-voting scheme from SNARKs look as follows.

**Setup Phase.** Let \(n\) be the number of eligible voters. For each \(i=1,\ldots,n\), we assume voter \(i\) registers in the system with a public-key \(pk_i\) relative to a signature scheme and retains privately the corresponding secret-key \(sk_i\). All public-keys \((pk_1,\ldots,pk_n)\) of all eligible voters are published on a blockchain (that acts like a public bulletin board).

The setup algorithm builds a Merkle tree \(M\) (called the *census*) from \((pk_1,\ldots,pk_N)\) and publishes it on the blockchain. Let us call \(R\) the root of \(M\). The setup procedure outputs \(R\) as the public-key of the e-voting scheme. Note that the voter’s public-keys (their identities) are the leaves of \(M\).

We assume a public identifier \(id\) is chosen for each election and published on the blockchain. The string \(id\) can be for instance the day in which the election is run along with other information about the election.

**Cast Phase.** Each eligible voter \(V\) who decides to cast a vote \(v\) proceeds as follows.

Let \(v\) be the intended vote that \(V\) wants to cast. The string \(v\) can be both a valid voting option (e.g., the name of a candidate, a data structure representing the rating for each of a set of alternative proposals, etc) or an arbitrary string representing an invalid vote.

Let \(sk_V\) be the secret-key of \(V\) corresponding to public-key \(pk_V\), and let \(h_V=H(sk_V,id),\) where \(H\) is a cryptographic hash function like SHA256.

Let \(p\) be the Merkle-path in \(M\) that proves that \(R\) is the root of a tree that has \(pk_V\) as leaf. Note that the length of \(p\) is logarithmic in \(M\).

Let \(C^{R,v,h_V,id}\) be the following Boolean circuit with one output gate.

\(C^{R,v,h_v,id}\) depends on the constants \(R,v,h_V,id\), takes as input a pair \(w=(p,v',sk_V)\) and outputs \(1\) if and only if *all* the following conditions are verified:

- The string \(p\) is a Merkle-path from \(R\) to \(pk_V\).
- \(sk_V\) is a secret-key corresponding to the public-key \(pk_V\).
- \(h_v=H(sk_V,id)\).
- \(v'=v\).

Note that the values \(R,v,h_V,id\), and thus \(C^{R,v,h_v,id}\) will represent public information while \(w\) is only known to \(V\). The voter \(V\) uses the SNARK prover to compute a proof \(\pi_V\) of the fact that \(C^{R,v,h_v,id}\) is satisfied by witness \(w=(p,v,sk_V)\). (Note: the above circuit is an oversimplification that does not take in account important security considerations but serves as a toy example.)

\(V\) publishes on the blockchain her ballot \(B_V=(v,h_V,\pi_V)\).

*Discarding invalid votes and duplicates.*

When a voter sends a ballot \((v,h_V,\pi_V)\) to the blockchain, we assume that if the proof \(\pi_V\) is not accepted by the SNARK verifier, an error symbol \(\bot\) is written next to the ballot to indicate that \(v\) should not be considered for the tally.

Moreover, if two ballots \(B_1=(v_1,h_1,\pi_1)\) and \(B_2=(v_2,h_2,\pi_2)\) with \(h_1=h_2\) are found, they should be considered a *duplicate* vote. Indeed, the purpose of the hash \(H(sk_V,id)\) is to tie the voter \(V\) with the election \(id\) so to be able to detect whether \(V\) (without revealing the identity of \(V\)) voted multiple times. According to the election policy, both ballots can be discarded or only the second one can be discarded.

**Tallying Phase.** The tally can be now publicly computed from all votes \(v\) in each ballot. Note that \(v\) can be still an invalid voting option but we have the insurance that one of the voters (we do not know which) intended to write \(v\) on the blockchain.

**Vote independence.** The previous solution suffers from the issue that the votes appear on the blockchain as soon as each voter casts her own preference. In this case, at time of casting a ballot, a voter could be affected by the current *partial* tally of the election.
This issue can be solved by having the voters to encrypt their own preferences under a public-key of a public-key encryption scheme whose secret-key is shared among a set of authorities. Here, we need to assume that not all authorities collude together to break the vote independence property. Note however that, even if all such authorities colluded together, they could not break the anonymity of the votes. Other mechanisms can be employed to mitigate this issue.

**Security.** For the sake of this post, we will not analyze the security in depth. We briefly mention that the security properties of the SNARK guarantee that a proof published on the blockchain does not leak the witness. This means that the Merkle path from the root to the voter’s public-key is hidden, thus the identity of the voter (among the many voters eligible to vote) is hidden as well.
Similarly, if a SNARK proof is verified, then it is possible to extract a secret-key corresponding to one of the public-keys published in the census tree, and by the fact that it is hard to extract secret-keys from public-keys, eligibility follows.

## Adding delegation

When Alice wants to delegate to Bob a token for predicate \(f\), Alice does the following. First, let \((pk,sk)\) be the public- and secret- key pair of Alice. We suppose that \(pk\) is in the census Merkle Tree.

Alice generates a new pair of public and secret keys \((pk',sk')\) for the digital signature scheme (the same used to create the public- and secret- keys of the census Merkle Tree). Observe that the generic SNARK-based anonymous e-voting scheme we described before does not use signatures directly, but still the Merkle Tree consists of public-keys of a digital signature scheme.

Alice signs the string \((pk'||f)\) with secret-key \(sk\), that is Alice generates the signature

\[\sigma=Sign(sk,(pk'||f))\]

Finally, Alice sets as token \(T_f\) the following:

\[T_f= (sk', \sigma).\]

Alice can pass the token \(T_f\) to Bob and Bob can use it to vote for any option satisfying \(f(v,id)=1\) where \(id\) is the identifier of the election.

The circuit for the SNARK proof is changed as follows. The public statement is as before. The witness input by Bob will also include the token \(T_f\) (that inclues the description of \(f\)).

The circuit checks that the path points to \(pk\) and that \(\sigma\) is a valid signature with respect to \(pk\) of message \(pk'||f\) and that \(f(v,id)=1\) (where \(id\) is the identifier of the election). Moreover, the circuit does the usual check on the nullifier to prevent double voting but the secret-key used to compute the nullifier is \(sk'\).

Note that if Alice wants to vote, she can vote by simulating this delegation to herself.

#### Allowing a voter to change her mind before the end of the election.

In the previous proposal, once the vote is delegated the delegator cannot change her mind. If we do want to allow this, the scheme can be changed as follows.

The public statement will include a bit \(b\) indicating whether the vote is a direct vote from a voter or is a delegated vote. Delegated vote will work as before setting the bit to \(1\) but direct vote will work setting the bit to \(0\) and the circuit will work as described above in the version without delegation.

Now, if there are two nullifiers in the blockchain, one of which with the bit set to \(1\) and one with the bit set to \(0\), only the one with bit set to \(0\) will be counted to indicated that delegated vote has to be discarded to give priority to direct vote.

#### Distributing a token to multiple delegates.

Notice that the mechanism allows distribution of a token to multiple delegates. Then, depending on the policy, only one vote submitted by these delegates will be counted. It can be thought like delegating the trust to anyone in a given group and at the same time trying to increase the chance that one of them will actually submit a vote.

## Conclusion

The idea of delegating voting capabilities traces back to Charles Dodgson (more commonly known by his pseudonym Lewis Carroll), the author of the novel Alice in Wonderland, who first envisioned the ability to transfer votes; in modern times this concept has been named Liquid Democracy. In recent years, delegation of voting rights has been proposed as a potential solution to several problems in coin voting.

We showed a simple and elegant way to add delegation capabilities to current SNARK-based anonymous e-voting schemes like Vocdoni. Our proposal does not significantly increase complexity and does not rely on new assumptions.

\(\mathrm{\blacksquare}\)