Cryptography Primer Session 3 – Integral Asymmetric Functions
Date
April 23, 2014
Speaker
Josh Benaloh
Affiliation
Microsoft MSR-T
Series
Overview
This will be the third of six cryptography primer sessions exploring the basics of modern cryptography. In this session, we’ll explore integral asymmetric functions including Diffie-Hellman and RSA with an emphasis on how and why they work and the properties they enjoy.
Subsequent sessions (on alternating Fridays) are expected to include the following topics. Depending on the interests of the participants, other topics may be included or substituted. Non-integer asymmetric functions including elliptic curves and lattice-based systems Cryptosystem properties, attacks, and vulnerabilities Applications including zero-knowledge, secret sharing, homomorphic encryption, and election protocols
Speakers
Josh Benaloh
Josh Benaloh is Senior Cryptographer at Microsoft Research. He earned his S.B. degree at M.I.T. and M.S., M. Phil., and Ph.D. degrees at Yale University where his doctoral dissertation Verifiable Secret-Ballot Elections made the first substantive use of homomorphic encryption techniques and introduced a new paradigm for achieving election integrity. Josh serves as an elected director of the International Association for Cryptologic Research and an editor of the Journal of Election Technologies and Systems. He also serves on Microsoft’s Crypto Board and its PKI Working Group and in his copious spare time serves as Chair of Sound Transit’s Citizen Oversight Panel.
