E2Easy-PC: adaptação e implementação em Rust do protocolo E2Easy com compromissos de Pedersen

Abstract

This work presents E2Easy-PC, an adaptation of the E2Easy voting protocol using Pedersen Commitments and secure implementation in Rust. While the original protocol proposes the use of lattices for full post-quantum security, this variant adopts a pragmatic approach focused on Everlasting Privacy and memory safety. We replaced Lattice-based commitments with Pedersen Commitments, which offer Perfect Hiding, ensuring that vote secrecy is never broken, even by future quantum computers. The Rust implementation mitigates critical memory vulnerabilities, complying with modern software security recommendations (NSA). Experimental results demonstrate that the elliptic curve approach outperforms the original by orders of magnitude in the voting and shuffling phases, while data parallelism reduced tallying time by over 50%. The work consolidates a modular architecture that combines operational efficiency, software security, and perpetual privacy.