David Freeman

Anti-Abuse Research Scientist/Engineer
Facebook, Inc.

Email: dfreeman [at] cs [dot] stanford [dot] edu

Mailing Address:
1 Hacker Way
Menlo Park, CA 94025
USA

 

LinkedIn Profile    CV    Publications    Presentations    Teaching    Travel Schedule    Other activities


Current Position

I am a research scientist/engineer at Facebook, focusing on abuse problems. I previously led various anti-abuse engineering and data science teams at LinkedIn.

Topics I care about from both a practical and research standpoint include:

  • Fake accounts, impersonation, sybils;
  • Account hijacking;
  • Scraping and bot detection;
  • Spam in its many forms;
  • Anomaly detection.

My Strata 2015 talk gives an overview of the kinds of anti-abuse systems we construct.
My Enigma 2016 talk shows some approaches to protecting accounts from being taken over.

Research publications coming out of my work at LinkedIn:

Other works in progress (v1.0 released December 26, 2010; v2.0 released April 10, 2014).


Academic Work

I was previously a postdoctoral scholar in the Applied Cryptography Group at Stanford University, under the supervision of Dan Boneh.

My thesis and postdoctoral research focused on cryptographic applications of number theory and arithmetic geometry. Projects included elliptic and hyperelliptic curve cryptography, pairing-based systems, and lattice-based cryptography.

Amongst my research interests are:

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

In 2009 I was an NSF postdoctoral fellow at CWI, Amsterdam and Universiteit Leiden under the supervision of Ronald Cramer.


Conferences

I have been involved with the following conferences and workshops:


Publications

Papers Published or Submitted

  1. Can You Spot the Fakes? On the Limitations of User Feedback in Online Social Networks
    David Mandell Freeman
    In WWW 2017 (Perth, Australia, April 2017).
    Published version (.pdf)

  2. Who are you? A statistical approach to measuring user authenticity
    David Mandell Freeman, Sakshi Jain, Markus Dürmuth, Battista Biggio, and Giorgio Giacinto
    In NDSS 2016 (San Diego, USA, February 2016).
    Published version (.pdf)

  3. Detecting Clusters of Fake Accounts in Online Social Networks
    Cao Xiao, David Mandell Freeman, and Theodore Hwa
    In AISec 2015 (Denver, USA, October 2015), ACM (2015).
    Published version (.pdf)

  4. Using Naive Bayes to Detect Spammy Names in Social Networks
    David Mandell Freeman
    In AISec 2013 (Berlin, Germany, November 2013), ACM (2013) 3-12.
    Published version (.pdf)

  5. Improved security for linearly homomorphic signatures: A generic framework
    David Mandell Freeman
    In Public Key Cryptography -- PKC 2012 (Darmstadt, Germany, May 2012), Springer LNCS 7293 (2012), 697-714.
    Download full version (.pdf)

  6. Functional encryption for inner product predicates from learning with errors
    Shweta Agrawal, David Mandell Freeman, and Vinod Vaikuntanathan
    In Advances in Cryptology -- Asiacrypt 2011 (Seoul, Korea, December 2011), Springer LNCS 7073 (2011), 21-40.
    Download full version (.pdf)

  7. Homomorphic signatures for polynomial functions
    Dan Boneh and David Mandell Freeman
    In Advances in Cryptology -- Eurocrypt 2011 (Tallinn, Estonia, May 2011), Springer LNCS 6632 (2011), 149-168.
    Download full version (.pdf)

  8. Deniable encryption with negligible detection probability: An interactive construction
    Markus Dürmuth and David Mandell Freeman
    In Advances in Cryptology -- Eurocrypt 2011 (Tallinn, Estonia, May 2011), Springer LNCS 6632 (2011), 610-626.
    Download full version (.pdf)

    Subsequent to the publication of the above work in Eurocrypt 2011, it was shown that the main theorem in the paper is incorrect. A description of the problem appears in the Foreword to the full version.

  9. Constructing pairing-friendly hyperelliptic curves using Weil restriction
    David Mandell Freeman and Takakazu Satoh
    Journal of Number Theory 131:5 (May 2011), 959-983.
    Download (.pdf)

  10. Homomorphic signatures over binary fields and new tools for lattice-based signatures
    Dan Boneh and David Mandell Freeman
    In Public Key Cryptography -- PKC 2011 (Taormina, Italy, March 2011), Springer LNCS 6571 (2011), 1-16.
    Download full version (.pdf)

  11. Limitations on transformations from composite-order to prime-order groups: The case of round-optimal blind signatures
    Sarah Meiklejohn, Hovav Shacham, and David Mandell Freeman
    In Advances in Cryptology -- Asiacrypt 2010 (Singapore, December 2010), Springer LNCS 6477 (2010), 519-538.
    Download full version (.pdf)

  12. Converting pairing-based cryptosystems from composite-order groups to prime-order groups
    David Mandell Freeman
    In Advances in Cryptology -- Eurocrypt 2010 (French Riviera, May 2010), Springer LNCS 6110 (2010), 44-61.
    Download full version (.pdf)

  13. Preventing pollution attacks in multi-source network coding
    Shweta Agrawal, Dan Boneh, Xavier Boyen, and David Mandell Freeman
    In Public Key Cryptography -- PKC 2010 (Paris, France, May 2010), Springer LNCS 6056 (2010), 161-176.
    Download (.pdf)

  14. More constructions of lossy and correlation-secure trapdoor functions
    David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, and Gil Segev
    In Public Key Cryptography -- PKC 2010 (Paris, France, May 2010), Springer LNCS 6056 (2010), 279-295.
    Download full version (.pdf)

  15. A taxonomy of pairing-friendly elliptic curves
    David Freeman, Michael Scott, and Edlyn Teske
    Journal of Cryptology 23 (2010), 224-280.
    Download published version (.pdf)

  16. 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)

  17. 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)

  18. 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)

  19. 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)

  20. 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)

  21. 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)

  22. 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)

  23. 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)

  24. 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

  • Server-Side Second Factors: Approaches to Measuring User Authenticity
    Contributed talk at Enigma 2016, San Francisco, California, January 2016.
    Slides (SlideShare)

  • Data Science vs. the Bad Guys: Using Data to Defend Linkedin From Fraud and Abuse
    Contributed talk at Strata 2015, San Jose, California, February 2015.
    Slides (SlideShare)

  • Using Naive Bayes to Detect Spammy Names in Social Networks
    Contributed paper at AISec 2013, Berlin, Germany, November 2013.
    Slides (.pdf)

  • Improved security for linearly homomorphic signatures: A generic framework
    Contributed paper at PKC 2012, Darmstadt, Germany, May 2012.
    Slides (.pdf)

  • Functional encryption for inner product predicates from learning with errors
    Contributed paper at Asiacrypt 2011, Seoul, Korea, December 2011.
    Slides (.pdf)

  • Homomorphic signatures: Message integrity for network coding and beyond
    Invited talk at Workshop on Beyond Worst-Case Analysis, Stanford, California, September 2011.
    Slides (.keynote)

  • Homomorphic signatures for polynomial functions
    Cryptography Seminar at IBM Research, Hawthorne, NY, November 2010.
    Theory Seminar at UC San Diego, San Diego, CA, November 2010.
    Theory Seminar at Microsoft Research Silicon Valley, December 2010.
    Séminaire de Crypto de l'ENS, Paris, France, March 2011.
    Eurocrypt 2011, Tallinn, Estonia, May 2011.
    Information Security Group Research Seminar, Royal Holloway University of London, July 2011.
    Slides: long version, short version (.pdf)

  • Homomorphic signatures over binary fields and new tools for lattice-based signatures
    Contributed paper at PKC 2011, Taormina, Italy, March 2011.
    Slides (.pdf)

  • Converting pairing-based cryptosystems from composite-order groups to prime-order groups
    Contributed paper at Eurocrypt 2010, Monaco, May 2010.
    Slides (.pdf)

  • More constructions of lossy and correlation-secure trapdoor functions
    Contributed paper at PKC 2010, Paris, France, May 2010.
    Slides (.pdf)

  • Pairing-friendly hyperelliptic curves and Weil restriction
    Contributed talk at Workshop on Discovery and Experimentation in Number Theory, Toronto, Canada, September 2009.
    Poster at ANTS-IX, Nancy, France, July 2010.
    Slides: full version, short version; Poster (.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)


Teaching

In Fall 2011 I taught Elliptic Curves in Cryptography (CS 259C/Math 250) at Stanford.
Course web page.

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

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


Other activities


Last updated 1 Sep 2017.