Martin Gagné

Martin Gagné

Visiting Professor
Computer Science Department
Swarthmore College
500 College Ave
Swarthmore, PA 19081
phone: (610) 690-6872
office: 251 Science Center
email: LookAtTheAddressBarForMyUsername{at}swarthmore{dot}edu

I'm a visiting professor in the Computer Science Department at Swarthmore College. I received my Ph.D. in Computer Science in 2008 from the University of California, Davis. My general research area is cryptography and automated verification of cryptographic protocols.

Current Schedule

Spring 2018 Schedule
  CS35 Data Structures and Algorithms   Tu-Th 13:15-14:30   Sci Center 199
  CS35B Lab   M 1:15-2:45   Sci Center 256
  CS35C Lab   M 3:00-4:30   Sci Center 256
  Office Hours   Tu 3:00-4:00
  W 2:00-3:30
  F 2:00-3:30
  Sci Center 270
  Research, Grading, and, you know, stuff...
  (Limited availability)
  Monday and Friday morning

Past Courses:

At Swarthmore College

  CS31:   Introduction to Computer Systems
  CS35:   Data Structures and Algorithms (Fall 2017)
  CS91:   Computer Security

At Wheaton College

  Comp 115:   Robots, Games and Problem Solving
  Comp 121:   Foundation of Computing Theory
  Comp 215:   Algorithms
  Comp 375:   Theory of Computation
  Comp 398:   (Experimental Course) Network Security


Automated verification of cryptographic protocols: I try to teach computers how to produce or verify proofs of cryptographic protocols. It's not easy. Computers are stupid. We have had a fair bit of success so far with symmetric encryption based on block ciphers, are currently working on message authentication codes. We hope to move on to public key encryption soon. I'm currently working on the verification of the e-voting protocol developed by the Norwegian government for their public elections.

Pairing-based cryptography: While in Calgary, I did research in efficient cryptographic protocols using pairings. I was particularly interested in making efficient attribute-based encryption and signature algorithms, either by improving on previously constructed protocols, or by specializing their functionality. I'm currently trying to do away with the paring operation in identity-based and attribute-based cryptosystems by using hardware tokens.

Selected Publications

Computer Science Graduate School Resources

Summer Research Opportunities for Undergraduates

CS Job Searching Resources

Last updated Friday, August 19, 2016.