In a Single Secret Leader Election (SSLE), a group of participants aims to randomly choose one leader from the group, with the restriction that the identity of the leader will be known only to the chosen leader. At a later time, the elected leader should be able to publicly reveal their identity and prove that they have won the election. The election process itself should work properly even if many registered users are passive. Among the many applications of SSLEs, they have the potential to enable more efficient proof-of-stake-based cryptocurrencies. In this presentation, Dan Boneh (Stanford) surveys SSLEs, including some recent results on post-quantum constructions. Based on recent work with Aditi Pratap and Lior Rotem.
About the speaker
Dan is a Professor of Computer Science at Stanford University, where he heads the applied cryptography group and co-directs the Center for Blockchain Research. Dan’s research focuses on applications of cryptography to blockchains and to computer security. He is the author of over 200 publications in the field, and is a recipient of the 2014 ACM prize and the 2013 Godel prize.
About a16z crypto
research a16z crypto research is a multidisciplinary lab that works closely with our portfolio companies and others toward solving the important problems in the space, and toward advancing the science and technology of the next generation of the internet.