University of Birmingham > Talks@bham > Computer Security Seminars > Do we need trust for verifiability in e-voting?

  Browse A-Z

Log in

System Admin (disabled)details Birmingham usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

Do we need trust for verifiability in e-voting?

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

If you have a question about this talk, please contact Andreea Radu.

One of the main challenges in e-voting is to construct a protocol satisfying both verifiability and privacy properties with minimal trust assumptions. In this talk we will analyse different stages of e-voting processes and see to which degree we can unite these dual properties and to which extent we have to resort to trust. In particular, we will present new zero-knowledge proofs which do not require a trusted setup to non-interactively prove that the tally was correctly calculated.

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.

Other lists

Centre for Systems Biology Coffee Mornings Lab Lunch Type the title of a new list here

Other talks

Extending the Lax type operator for finite W-algebras TBC Modelling uncertainty in image analysis. Ultrafast, all-optical, and highly efficient imaging of molecular chirality Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Quantum simulations using ultra cold ytterbium
 

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