Verifiable Elections with Commitment Consistent Encryption -- A Primer
It addresses secure and private voting systems for elections, but appears incremental as it builds on existing CCE schemes.
The paper introduces the PPATS Commitment Consistent Encryption (CCE) scheme for designing end-to-end verifiable elections, achieving perfect privacy in audits that prevent vote leakage even under key compromise or broken cryptographic assumptions.
This note provides an introduction to the PPATS Commitment Consistent Encryption (CCE) scheme proposed by Cuvelier, Pereira and Peters and its use in the design of end-to-end verifiable elections with a perfectly private audit trail. These elections can be verified using audit data that will never leak any information about the vote, even if all the private keys of the elections are compromised, or if the cryptographic assumptions are broken.