In May 2011, I finished my Ph.D. in computer science (with a minor
in statistics) at UC
Berkeley. I spent my first two years of grad school at
Carnegie Mellon before my advisor
Dawn Song moved
to Berkeley and I transferred along with her. Prior to that, I got
my B.S. in 2005 from
the University of Wisconsin
with majors in computer science, math, and computer engineering. I
also spent summers at the
IBM Almaden Research
Center, SRI
International,
and Morgan Stanley.
After completing graduate school, I rejoined Morgan Stanley
full-time. For more on my background, see my CV /
resume.
The idea of the ACSC is to help bring very recent, sophisticated
cryptographic schemes (i.e., stuff that can't be done with plain
old PKI) into a more concrete setting by providing implementations.
It consists of a number of original and preexisting projects
collected into one place with descriptions, tutorials, and source
code. Hopefully, it has proven useful to systems security
researchers who would like to explores uses of advanced
cryptography in their projects without getting bogged down in the
number theory and algebra necessary to implement them. The
following projects of mine are included (all
with GPL
source).
Intro to Bilinear Maps
(latex),
John Bethencourt.
Just the slides from a
reading group
meeting in March 2006. Feel free to use these for any purpose (I
put them in the public domain). Corrections and updates
appreciated.