May 5, 2020 · In this work, we explore the prospect of decentralized e-voting where security is preserved under concurrent protocol executions.
This work formalizes the requirements for secure STE schemes in the Universal Composability (UC) framework, and presents E-cclesia, a new family of STE ...
In Setup phase, SA generates election parameters and receives a list of eligible voters. In Credential Generation phase, each voter generates a pair of ...
Mesh messaging in large-scale protests: Breaking Bridgefy. MR Albrecht, J Blasco, RB Jensen, L Mareková. Cryptographers' Track at the RSA Conference, 375-398, ...
Apr 25, 2024 · Myrto Arapinis, Ábel Kocsis, Nikolaos Lamprou, Liam Medley, Thomas Zacharias: Universally Composable Simultaneous Broadcast against a ...
E-cclesia: Universally Composable Self-Tallying Elections ... In standard e-voting designs, the tally process is assigned to a committee of designated entities ...
We overcome this limitation by extending any secure TLE construction adopting the techniques of Nielsen [CRYPTO 2002] in the random oracle model. Specifically, ...
Arapinis, M., Lamprou, N., Zacharias, T.: E-cclesia: universally composable self-tallying elections. ... Self-tallying elections and perfect ballot secrecy.
This work study the cryptographic primitive called time-lock encryption (TLE), and formally abstracts the concept of TLE into an ideal functionality in a ...
Sep 18, 2024 · affiliation: Royal Holloway University of London, Department of Information Security, UK; affiliation: University of Edinburgh, ...