David Mandell Freeman

Affiliations:
  • Meta Platforms, Inc., USA
  • Stanford University (former)
  • University of California, Berkeley, Department of Mathematics, CA, USA (former)


According to our database1, David Mandell Freeman authored at least 29 papers between 2005 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Deep Entity Classification: Abusive Account Detection for Online Social Networks.
Proceedings of the 30th USENIX Security Symposium, 2021

2020
Towards A User-Level Understanding of IPv6 Behavior.
Proceedings of the IMC '20: ACM Internet Measurement Conference, 2020

2018
11th International Workshop on Artificial Intelligence and Security (AISec 2018).
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
Can You Spot the Fakes?: On the Limitations of User Feedback in Online Social Networks.
Proceedings of the 26th International Conference on World Wide Web, 2017

10th International Workshop on Artificial Intelligence and Security (AISec 2017).
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016
Who Are You? A Statistical Approach to Measuring User Authenticity.
Proceedings of the 23rd Annual Network and Distributed System Security Symposium, 2016

9th International Workshop on Artificial Intelligence and Security: AISec 2016.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
Detecting Clusters of Fake Accounts in Online Social Networks.
Proceedings of the 8th ACM Workshop on Artificial Intelligence and Security, 2015

2013
More Constructions of Lossy and Correlation-Secure Trapdoor Functions.
J. Cryptol., 2013

Using naive bayes to detect spammy names in social networks.
Proceedings of the AISec'13, 2013

2012
Improved Security for Linearly Homomorphic Signatures: A Generic Framework.
IACR Cryptol. ePrint Arch., 2012

2011
Deniable Encryption with Negligible Detection Probability: An Interactive Construction.
IACR Cryptol. ePrint Arch., 2011

Homomorphic Signatures for Polynomial Functions.
IACR Cryptol. ePrint Arch., 2011

Functional Encryption for Inner Product Predicates from Learning with Errors.
IACR Cryptol. ePrint Arch., 2011

2010
A Taxonomy of Pairing-Friendly Elliptic Curves.
J. Cryptol., 2010

Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures.
IACR Cryptol. ePrint Arch., 2010

Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures.
IACR Cryptol. ePrint Arch., 2010

Preventing Pollution Attacks in Multi-Source Network Coding.
IACR Cryptol. ePrint Arch., 2010

2009
Constructing pairing-friendly hyperelliptic curves using Weil restriction.
IACR Cryptol. ePrint Arch., 2009

Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups.
IACR Cryptol. ePrint Arch., 2009

2008
Abelian varieties with prescribed embedding degree.
IACR Cryptol. ePrint Arch., 2008

A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties.
IACR Cryptol. ePrint Arch., 2008

Signing a Linear Subspace: Signature Schemes for Network Coding.
IACR Cryptol. ePrint Arch., 2008

On the security of pairing-friendly Abelian varieties over non-prime fields.
IACR Cryptol. ePrint Arch., 2008

2007
Computing endomorphism rings of Jacobians of genus 2 curves over finite fields.
IACR Cryptol. ePrint Arch., 2007

Constructing pairing-friendly genus 2 curves over prime fields with ordinary Jacobians.
IACR Cryptol. ePrint Arch., 2007

Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians.
Proceedings of the Pairing-Based Cryptography, 2007

2006
Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10.
IACR Cryptol. ePrint Arch., 2006

2005
Pairing-based identification schemes.
IACR Cryptol. ePrint Arch., 2005


  Loading...