Talks and presentations

Machine Checked Properties of the Schulze Method

August 06, 2021

Workshop proceedings talk, Hot Issues in Security Principles and Trust (HotSpot 2021), Online

The correctness of electronic vote-counting software programs is crucial in establishing the trust of people in electronic voting. However, most of these vote-counting programs, used in various jurisdiction for legally binding election, establish the correctness by means of testing which is not sufficient and leaves much to be desired. Therefore, we propose that legally binding vote-counting software programs should be formally verified and its correctness should be evaluated against some well established framework from social choice theory.

Final PhD Presentation

January 10, 2020

Talk, Australian National University, Canberra, Australia

This was my final PhD talk, where I discussed the challenges of conducting elections electronically, and their possible solutions.

Verifiable homomorphic tallying for the schulze vote counting scheme

July 10, 2019

Conference proceedings talk, VSTTE 2019: Verified Software. Theories, Tools, and Experiments, New York City, NY, USA

The encryption of ballots is crucial to maintaining integrity and anonymity in electronic voting schemes. It enables, amongst other things, each voter to verify that their encrypted ballot has been recorded as cast, by checking their ballot against a bulletin board.