University of Birmingham > Talks@bham > Computer Security Seminars > A verifiable, coercion-resistant voting system with linear complexity

A verifiable, coercion-resistant voting system with linear complexity

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

If you have a question about this talk, please contact Isra Ahmed.

Seminal work by Juels, Catalano & Jakobsson delivered a verifiable, coercion-resistant voting system with quadratic complexity. This talk will attempt to advance the state-of-the-art by delivering a voting system with equivalent security and linear complexity. We will begin by establishing intuition as to how coercion resistance and verifiability can be achieved, informally establish an impossibility result, and then delve into the details of the new verifiable, coercion-resistant voting system. The presentation will stray away from the traditional slide-based style and will make heavy use of whiteboards. The audience are encouraged to interact and challenged to find attacks.

This talk is part of the Computer Security Seminars series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.