Abstract:

Abstract: Although crypto systems based on the hardness of solving discrete logarithms date back 40 years, they are more prevalent today than ever. The elliptic curve Diffie-Hellman protocol, for example, accounts for 90% of public-key agreements on the internet, meaning your device probably used discrete log based cryptography to fetch these very words. In this talk we’ll examine some of the more complex applications of discrete logarithm based cryptography, including homomorphic encryption, zero-knowledge proofs, distributed decryption, and secure multi-party protocols. Finally, we’ll tie these cryptographic primitives together with a case study of a cryptographically end-to-end verifiable internet voting system.