Cryptography Primer Session 2 – Symmetric Primitives

  • Josh Benaloh

This will be the second of six cryptography primer sessions exploring the basics of modern cryptography. In this session, we’ll explore symmetric ciphers, primitives, and protocols – including AES, cipher modes, hash functions, and message authentication.

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. • Integer asymmetric functions including BigNums, Diffie-Hellman, RSA, and DSA • Non-integer asymmetric functions including elliptic curves and lattice-based systems • Protocol properties including forward secrecy, crypto agility, and certificate management • Applications including zero-knowledge, secret sharing, homomorphic encryption, and election protocols

Speaker Bios

Josh Benaloh is Senior Cryptographer at Microsoft Research. He joined Microsoft in 1994 after receiving an S.B. from MIT, M.Sc., M.Phil., and Ph.D. degrees from Yale University, and serving on the faculties of the University of Toronto and Clarkson University. His doctoral dissertation Verifiable Secret-Ballot Elections introduced the homomorphic tallying paradigm which was the first practical use of homomorphic encryption. In addition to extensive work on verifiable election protocols, his other notable work includes significant contributions in secret sharing and the introduction of one-way accumulators. Josh serves as a director of the International Association for Cryptologic Research and as Vice-Chair of the Sound Transit Citizen Oversight Panel.

Taille: Microsoft Research Talks