Lecture 5: Secret sharing/electronic voting

Written on 12.05.2021 13:16 by Anand Narayanan

Hi all,

On today's lecture we will study an important application of algebraic coding theory to cryptography: secret sharing. We then deploy secret sharing to build a certifiable distributed voting scheme where the votes are kept secret while being counted. 

We will go through secret sharing at an easy pace, small bias sets (advertised in the course description) will be deferred to a later lecture.


Privacy Policy | Legal Notice
If you encounter technical problems, please contact the administrators.