David Mandell Freeman

Postdoctoral Fellow,
CWI Amsterdam and Leiden University

Curriculum Vitae    Publications    Presentations    Teaching    Travel Schedule    Other activities

I am a postdoctoral fellow at CWI, Amsterdam and Universiteit Leiden under the supervision of Ronald Cramer. I am supported by a National Science Foundation International Research Fellowship, with additional support from the Office of Multidisciplinary Activities in the NSF Directorate for Mathematical and Physical Sciences.

Current Research

My research focuses on number theory and arithmetic geometry with applications to cryptography. Specific interests include elliptic and hyperelliptic curve cryptography, pairing-based systems, and multi-party computation.

Amongst my current research projects are:

• Public-key cryptosystems based on pairings. (New preprint available.)
• Constructing pairing-friendly abelian varieties. (New preprint available.)
• Signatures for network coding. (Slides from a recent talk.)
• "Alternative" pairings in cryptography.

I received my Ph.D. in Mathematics from the University of California, Berkeley. My dissertation is now available. My Ph.D. advisors were Ken Ribet (UC Berkeley) and Ed Schaefer (Santa Clara University).

From June to November 2008 I was a postdoctoral scholar in the Applied Cryptography Group at Stanford University, under the supervision of Dan Boneh. I will be returning to Stanford in January 2010. My research at Stanford is supported by a National Science Foundation Mathematical Sciences Postdoctoral Research Fellowship.

Publications

Papers Published or Submitted

• Converting pairing-based cryptosystems from composite-order groups to prime-order groups
  David Mandell Freeman
  Preprint, 2009
  Download (.pdf)

• Constructing pairing-friendly hyperelliptic curves using Weil restriction
  David Mandell Freeman and Takakazu Satoh
  Preprint, 2009
  Download (.pdf)

• A taxonomy of pairing-friendly elliptic curves
  David Freeman, Michael Scott, and Edlyn Teske
  To appear in Journal of Cryptology, 2010
  Download published version (.pdf)

• On the security of pairing-friendly abelian varieties over non-prime fields
  Naomi Benger, Manuel Charlemagne, and David Mandell Freeman
  In Pairing-Based Cryptography -- Pairing 2009 (Palo Alto, California, August 2009), Springer LNCS 5671 (2009), 52-65
  Download (.pdf)

• Signing a subspace: Signatures for network coding
  Dan Boneh, David Freeman, Jonathan Katz, and Brent Waters
  In Public-Key Cryptography -- PKC 2009 (Irvine, California, March 2009), Springer LNCS 5443 (2009), 68-87
  Download full version (.pdf)

• A generalized Brezing-Weng method for constructing pairing-friendly ordinary abelian varieties
  David Freeman
  In Pairing-Based Cryptography -- Pairing 2008 (Egham, United Kingdom, September 2008), Springer LNCS 5209 (2008), 146-163
  Download (.pdf); Download additional examples (.pdf)

• Abelian varieties with prescribed embedding degree
  David Freeman, Peter Stevenhagen and Marco Streng
  In Algorithmic Number Theory Symposium -- ANTS-VIII (Banff, Canada, May 2008), Springer LNCS 5011 (2008), 60-73.
  Download (.pdf)

• Constructing pairing-friendly genus 2 curves with ordinary Jacobians
  David Freeman
  In Pairing-Based Cryptography -- Pairing 2007 (Tokyo, Japan, July 2007), Springer LNCS 4575, (2007), 152-176
  Download full version (.pdf)

• Computing endomorphism rings of Jacobians of genus 2 curves over finite fields
  David Freeman and Kristin Lauter
  In Symposium on Algebraic Geometry and its Applications (Papeete, Tahiti, May 2007), World Scientific, 2008, 29-66
  Download (.pdf)

• Constructing pairing-friendly elliptic curves with embedding degree 10
  David Freeman
  In Algorithmic Number Theory Symposium -- ANTS-VII (Berlin, Germany, July 2006), Springer LNCS 4076 (2006), 452-465
  Download (.pdf)

• The isoperimetric problem on singular surfaces
  Andrew Cotton, David Freeman, Andrei Gnepp, Ting Ng, John Spivack, and Cara Yoder
  Journal of the Australian Mathematical Society 78:2 (April 2005) 167-199
  Download (.pdf)

• The double bubble problem in spherical and hyperbolic space
  Andrew Cotton and David Freeman
  International Journal of Mathematics and Mathematical Sciences 32:11 (15 Dec 2002), 641-699
  Download (.pdf)

Other Papers

• Constructing abelian varieties for pairing-based cryptography
  David Freeman
  Ph.D. Dissertation, University of California, Berkeley, May 2008
  Download (.pdf)

• Pairing-based identification schemes
  David Freeman
  Hewlett-Packard Laboratories technical report HPL-2005-154, August 2005
  Download (.pdf)

• Fast arithmetic and pairing evaluation on genus 2 curves
  David Freeman
  Preprint, March 2005
  Download (.pdf)

• Applications of modular forms
  David Freeman
  Cambridge University Part III Essay, May 2003
  Download (.pdf)

Presentations

• Pairing-friendly hyperelliptic curves and Weil restriction
  Contributed talk at Workshop on Discovery and Experimentation in Number Theory, Toronto, Canada, September 2009.
  Slides: full version, short version (.pdf)

• Signing a linear subspace: Signatures for Network Coding
  Contributed talk at IPAM Securing Cyberspace Reunion Conference, Lake Arrowhead, CA, June 2009
  Slides: .pdf, .keynote

• Constructing abelian varieties for pairing-based cryptography
  Invited talk at Workshop on Pairings in Arithmetic Geometry and Cryptography, Essen, Germany, May 2009.
  Slides (.pdf)

• A generalized Brezing-Weng method for constructing pairing-friendly ordinary abelian varieties
  Contributed paper at Pairing 2008, Egham, United Kingdom, September 2008.
  Slides (.pdf)

• Constructing abelian varieties for pairing-based cryptography.
  Invited talk at Computational Number Theory Workshop, Foundations of Computational Mathematics 2008, Hong Kong, June 2008
  Slides (.pdf)

• Implementing the genus 2 CM method
  Invited talk at AMS Special Session on Low Genus Curves and Applications, AMS-MAA Joint Mathematics Meetings, San Diego, CA, January 2008.
  Slides (.pdf)

• Constructing pairing-friendly genus 2 curves with ordinary Jacobians
  Contributed paper at Pairing 2007, Tokyo, Japan, July 2007
  Slides (.pdf)

• Constructing Pairing-Friendly Elliptic Curves for Cryptography
  Invited talk at the 2nd KIAS-KMS Summer Workshop on Cryptography, Seoul, Korea, June 2007.
  Slides Part 1, Part 2 (.pdf)

• Methods for constructing pairing-friendly elliptic curves.
  Invited talk at the 10th Workshop on Elliptic Curves in Cryptography (ECC 2006), Toronto, Canada, September 2006.
  Slides (.pdf)

• Constructing pairing-friendly elliptic curves with embedding degree 10.
  Contributed paper at ANTS-VII, Berlin, Germany, July 2006.
  Slides (.pdf)

• Qualifying exam
  Taken to advance to doctoral candidacy at UC Berkeley, May 2005
  Syllabus (.pdf)

In Fall 2007 I was a Graduate Student Instructor for Math 16a, taught by Jack Wagoner.
Section web page.

In Fall 2005 I was a Graduate Student Instructor for Math 1a, taught by Vaughan Jones.
Section web page.

• Studentenkoor Amsterdam
• UC Berkeley University Chorus.
• University of California Alumni Chorus.
• Cal Cycling.
• Harvard Radio Broadcasting (WHRB).
• See what I'm doing in my spare time.
• Fact Tree Enterprises web sites:
  • ClassicalCDGuide.com: This site recommends classical music CDs, with lists of the Top 10 CDs and Top 20 CDs, and recommendations by composer, era, and genre. The site is very extensive, and the reviews are extremely detailed. Great for a beginner or someone looking to expand his or her collection!
  • SailingCourseGuide.com: This guide provides general advice for anyone in the U.S. who wants to sign up for a sailing course, including tips on how to choose between schools and warning signs of problematic programs.
  • SpainAdventure.com: This site guides prospective study abroad students through the wonderful possibilities of studying Spanish in Spain and provides tips on choosing a destination, finding a school, and having a good time.

Last updated Thu 5 Nov 2009