University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Verificatum -- An efficient and provably secure mix-net

Verificatum -- An efficient and provably secure mix-net

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

Semantics and Syntax: A Legacy of Alan Turing

A common component in electronic election schemes is a so called ‘mix-net’. This is a protocol executed by a group of servers that takes a list of ciphertexts and outputs the plaintexts in sorted order without revealing anything about the correspondence between input ciphertexts and output plaintexts. Thus, a mix-net can securely perform the tabulation in an electronic election where voters submit encrypted votes. Verificatum is an open source implementation of an efficient and provably secure mix-net (see http://www.verificatum.org). In its simplest form it is a Java application that is easy to install and use, but it can also exploit optimized C code, it can be configured in many ways, and it is a perfect platform for implementing more advanced election schemes. It has already been used successfully in the Wombat voting project. We will present Verificatum and describe the work we have done so far and what lies ahead.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity