Conference Proceedings

Universally Verifiable MPC and IRV Ballot Counting

K Ramchen, C Culnane, O Pereira, V Teague

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Springer | Published : 2019


We present a very simple universally verifiable MPC protocol. The first component is a threshold somewhat homomorphic cryptosystem that permits an arbitrary number of additions (in the source group), followed by a single multiplication, followed by an arbitrary number of additions in the target group. The second component is a black-box construction of universally verifiable distributed encryption switching between any public key encryption schemes supporting shared setup and key generation phases, as long as the schemes satisfy some natural additive-homomorphic properties. This allows us to switch back from the target group to the source group, and hence perform an arbitrary number of multi..

View full abstract


Awarded by Walloon Region through the FEDER project USERMedia

Funding Acknowledgements

Olivier Pereira is grateful to the Belgian Fund for Scientific Research (F.R.S.-FNRS) for its financial support provided through the SeVoTe project, to the European Union (EU) and the Walloon Region through the FEDER project USERMedia (convention number 501907-379156), and to the Melbourne School of Engineering for its fellowship.