Martin Gagné

Martin Gagné is a Visiting Professor in the Computer Science Department at Swarthmore College since at least 2018. He holds a Ph.D. in Computer Science from the University of California, Davis (2008). His research focuses on cryptography and automated verification of cryptographic protocols, including work on symmetric encryption, message authentication codes, and public-key encryption systems. He is currently involved in verifying the Norwegian government's e-voting protocol and exploring hardware token-based solutions to eliminate pairing operations in cryptosystems.

Education:

• Ph.D. in Computer Science, University of California, Davis (2008)

Research Interests:

• Automated verification of cryptographic protocols
• Pairing-based cryptography
• Efficient attribute-based encryption and signature algorithms
• Privacy-preserving systems in healthcare and e-voting

Teaching:

• Current courses (Spring 2018): CS35 (Data Structures and Algorithms), CS35B/C Labs
• Past courses at Swarthmore: CS31 (Computer Systems), CS35 (Data Structures and Algorithms), CS91 (Computer Security)
• Past courses at Wheaton College: Comp 115 (Robots & Problem Solving), Comp 121 (Computing Theory), Comp 215 (Algorithms), Comp 375 (Theory of Computation), Comp 398 (Network Security)

Publications: 10+ peer-reviewed articles in journals like Journal of Automated Reasoning and conferences including ESORICS, SCC, and Pairing. Key themes include block cipher verification, proxy re-encryption, and attribute-based systems.

Labs/Teams: Active in cryptographic protocol analysis and security system design, collaborating on e-voting and healthcare privacy projects.