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:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2021
Proceedings of the 30th USENIX Security Symposium, 2021
2020
Proceedings of the IMC '20: ACM Internet Measurement Conference, 2020
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
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017
2016
Proceedings of the 23rd Annual Network and Distributed System Security Symposium, 2016
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016
2015
Proceedings of the 8th ACM Workshop on Artificial Intelligence and Security, 2015
2013
J. Cryptol., 2013
Proceedings of the AISec'13, 2013
2012
IACR Cryptol. ePrint Arch., 2012
2011
Deniable Encryption with Negligible Detection Probability: An Interactive Construction.
IACR Cryptol. ePrint Arch., 2011
IACR Cryptol. ePrint Arch., 2011
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
IACR Cryptol. ePrint Arch., 2010
2009
IACR Cryptol. ePrint Arch., 2009
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups.
IACR Cryptol. ePrint Arch., 2009
2008
A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties.
IACR Cryptol. ePrint Arch., 2008
IACR Cryptol. ePrint Arch., 2008
IACR Cryptol. ePrint Arch., 2008
2007
IACR Cryptol. ePrint Arch., 2007
Constructing pairing-friendly genus 2 curves over prime fields with ordinary Jacobians.
IACR Cryptol. ePrint Arch., 2007
Proceedings of the Pairing-Based Cryptography, 2007
2006
IACR Cryptol. ePrint Arch., 2006
2005