Scytl will be presenting the latest advances in secure online voting at the upcoming Financial Cryptography and Data Security 2019 Conference that will be held on February 18–22, 2019 in Saint Kitts and Nevis’ island in the Caribbean.
As the uptake on electronic voting continues to grow, so does the interest in the implementation of fully secure systems. However, with the upcoming arrival of quantum computers, today’s cryptography used in most systems will no longer be safe, since its security is based on mathematical problems that quantum computers could solve in a reasonable amount of time. One genuine solution is the use mathematical problems that are resistant to these attacks, like post-quantum cryptography.
During the 4th Workshop on Advances in Secure Electronic Voting, Scytl´s cryptography researcher Núria Costa, will present the new paper entitled “Lattice-based proof of a shuffle” that is co-authored by UPC professors Paz Morillo and Ramiro Martínez. The paper presents a full post-quantum proof of a shuffle, an improvement of the proposal presented at NordSec2017. This proof is based on the technique introduced by Bayer and Groth to construct a proof of a shuffle, where all the schemes used to build the proof are post-quantum, that is, their security is guaranteed even if a quantum computer is used to attack them.
