I am now a third year Ph.D. student in computer science at Berkeley, where I am advised
by Dawn Song
and supported by NSF and NDSEG graduate research fellowships. I
spent my first two years of grad school at CMU before my advisor moved to
Berkeley and I transfered along with her. I got my B.S. in 2005
from the University of
Wisconsin with majors in computer science, math, and computer
engineering. I've also spent summers at SRI and the IBM Almaden Research Center.
My current research interests include cryptography and network
security. I like cryptographic systems that address issues such as
privacy, anonymity, and trust, especially in a decentralized
setting.
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 will prove 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.
Science is more than a body of knowledge; it is a way of thinking.
I have a foreboding of an America in my children's or grand
children's time ... when awesome technological powers are in the
hands of a very few, and no one representing the public interest
can even grasp the issues.
