Monadoc
The latest version of hjugement-protocol is 0.0.10.20191104-0.

hjugement-protocol

Version 0.0.0.20190501 revision 0 uploaded by julm.

Package meta

Synopsis
A cryptographic protocol for the Majority Judgment.
Description

This work-in-progress library aims at implementing an online voting protocol named Helios-C (Helios with Credentials) by its authors from the CNRS, the INRIA and the Université de Lorraine: Véronique Cortier, David Galindo, Pierrick Gaudry, Stéphane Glondu and Malika Izabachène.

(TODO) Actually, this protocol is adapted a little bit here to better support a better method of voting known as the Majority Judgment.

The main properties of this protocol are:

  • fully correct: the published result are proven to correspond to the (sum of) intended votes of the voters, while accounting for a malicious bulletin board (BB) (adding fake ballots) by requiring a registration authority (RA) (responsible for generating and sending voters' credentials). Assuming that the BB and the RA are not simultaneously dishonest.

  • verifiable: each voter is able to check that: his/her ballot did contribute to the outcome (individual verifiability), and that the tallying authorities did their job properly (universal verifiability).

  • private: the identities of the voters who cast a vote are not publicly revealed.

More specifically, in this protocol :

  • Ballots are encrypted using public-key cryptography secured by the Discrete Logarithm problem: finding x in g^x mod p, where p is a large prime and g a generator of Gq, the multiplicative subgroup of order q, in Fp (the finite prime field whose characteristic is p). Here, p is 2048-bit and q is 256-bit. The signing (Schnorr-like), the encrypting (ElGamal-like) and the Decisional Diffe Hellman (DDH) assumption, all rely on the hardness of that problem.

  • Ballots are added without being decrypted because adding (multiplying actually) ciphertexts then decrypting, is like decrypting then adding plaintexts (additive homomorphism). Which requires to solve the Discrete Logarithm Problem for numbers in the order of the number of voters, which is not hard for small numbers (with a lookup table as here, or with Pollard’s rho algorithm for logarithms).

  • The Schnorr protocol is used to prove that a voter has knowledge of the secret key used to sign their votes. A voter's credentials is a secret key (the signing key) that has a public part (the verification key). The association between the public part and the corresponding voter’s identity does not need to be known, and actually should not be disclosed to satisfy e.g. the French requirements regarding voting systems. Using credentials prevent the submission of duplicated ballots (because they are added as an additional input to the random oracle in the non-interactive zero-knowledge (NIZK) proofs for ciphertext well-formedness). This allows a testing of duplicates which depends only on the size of the number of voters, and thus enables Helios-C to scale for larger elections while attaining correctness.

  • The Chaum-Pedersen protocol (proving that equality of discrete logarithms) is used to prove that ciphertexts are well-formed (encrypting a 0 or a 1… or any expected natural) without decrypting them. Which is known as a Disjunctive Chaum-Pedersen proof of partial knowledge.

  • A strong Fiat-Shamir transformation is used to transform the interactive zero-knowledge (IZK) Chaum-Pedersen protocol into a non-interactive zero-knowledge (NIZK) proof, using a SHA256 hash.

  • (TODO) A Pedersen's distributed key generation (DKG) protocol coupled with ElGamal keys (under the DDH assumption), is used to have a fully distributed semantically secure encryption.

Author
Julien Moutinho <julm+hjugement@autogeree.net>
Bug reports
Julien Moutinho <julm+hjugement@autogeree.net>
Category
Politic
Copyright
n/a
Homepage
n/a
Maintainer
Julien Moutinho <julm+hjugement@autogeree.net>
Package URL
n/a
Stability
experimental

Components