This talk will cover recent break-through in practical publicly verifiable MPC and its applications in several security sensitive domains.
NB: Cryptographic background is not necessary to follow this talk.
Zachary Peterson is an Associate Professor of Computer Science at Cal Poly, San Luis Obispo, California. His technical background is in applied cryptography, particularly as applied to storage systems. He also has a passion for creating new ways of engaging students of all ages in computer security, especially through the use of games and play.
Motivated by minimizing trust assumptions for verifiable e-voting and simplifying implementations of these systems in practice, I will revisit the necessity of this trust assumption and introduce two polling-station e-voting systems that do not require such tallying authorities.