default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Mandell Freeman
Person information
- affiliation: Meta Platforms, Inc., USA
- affiliation (former): Stanford University
- affiliation (former): University of California, Berkeley, Department of Mathematics, CA, USA
Other persons with the same name
- David Freeman — disambiguation page
- David Freeman 0003
![[0000-0001-6146-8940]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-6146-8940")
— Simon Fraser University, Department of Economics, Burnaby, BC, Canada (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c24]Teng Xu, Gerard Goossen, Huseyin Kerem Cevahir, Sara Khodeir, Yingyezhe Jin, Frank Li, Shawn Shan, Sagar Patel, David Freeman, Paul Pearce:
Deep Entity Classification: Abusive Account Detection for Online Social Networks. USENIX Security Symposium 2021: 4097-4114- 2020
- [c23]Frank Li, David Freeman:
Towards A User-Level Understanding of IPv6 Behavior. Internet Measurement Conference 2020: 428-442
2010 – 2019
- 2018
- [c22]Sadia Afroz, Battista Biggio, Yuval Elovici, David Freeman, Asaf Shabtai:
11th International Workshop on Artificial Intelligence and Security (AISec 2018). CCS 2018: 2166-2167 - [e3]Sadia Afroz, Battista Biggio, Yuval Elovici, David Freeman, Asaf Shabtai:
Proceedings of the 11th ACM Workshop on Artificial Intelligence and Security, CCS 2018, Toronto, ON, Canada, October 19, 2018. ACM 2018, ISBN 978-1-4503-6004-3 [contents] - 2017
- [c21]Battista Biggio, David Freeman, Brad Miller, Arunesh Sinha:
10th International Workshop on Artificial Intelligence and Security (AISec 2017). CCS 2017: 2621-2622 - [c20]David Mandell Freeman:
Can You Spot the Fakes?: On the Limitations of User Feedback in Online Social Networks. WWW 2017: 1093-1102 - [e2]Bhavani Thuraisingham, Battista Biggio, David Mandell Freeman, Brad Miller, Arunesh Sinha:
Proceedings of the 10th ACM Workshop on Artificial Intelligence and Security, AISec@CCS 2017, Dallas, TX, USA, November 3, 2017. ACM 2017, ISBN 978-1-4503-5202-4 [contents] - 2016
- [c19]David Mandell Freeman, Katerina Mitrokotsa, Arunesh Sinha:
9th International Workshop on Artificial Intelligence and Security: AISec 2016. CCS 2016: 1881 - [c18]David Freeman, Sakshi Jain, Markus Dürmuth, Battista Biggio, Giorgio Giacinto:
Who Are You? A Statistical Approach to Measuring User Authenticity. NDSS 2016 - [e1]David Mandell Freeman, Aikaterini Mitrokotsa, Arunesh Sinha:
Proceedings of the 2016 ACM Workshop on Artificial Intelligence and Security, AISec@CCS 2016, Vienna, Austria, October 28, 2016. ACM 2016, ISBN 978-1-4503-4573-6 [contents] - 2015
- [c17]Cao Xiao, David Mandell Freeman, Theodore Hwa:
Detecting Clusters of Fake Accounts in Online Social Networks. AISec@CCS 2015: 91-101 - 2013
- [j2]David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev:
More Constructions of Lossy and Correlation-Secure Trapdoor Functions. J. Cryptol. 26(1): 39-74 (2013) - [c16]David Mandell Freeman:
Using naive bayes to detect spammy names in social networks. AISec 2013: 3-12 - 2012
- [c15]David Mandell Freeman:
Improved Security for Linearly Homomorphic Signatures: A Generic Framework. Public Key Cryptography 2012: 697-714 - [i21]David Mandell Freeman:
Improved Security for Linearly Homomorphic Signatures: A Generic Framework. IACR Cryptol. ePrint Arch. 2012: 60 (2012) - 2011
- [c14]Shweta Agrawal, David Mandell Freeman, Vinod Vaikuntanathan:
Functional Encryption for Inner Product Predicates from Learning with Errors. ASIACRYPT 2011: 21-40 - [c13]Dan Boneh, David Mandell Freeman:
Homomorphic Signatures for Polynomial Functions. EUROCRYPT 2011: 149-168 - [c12]Markus Dürmuth, David Mandell Freeman:
Deniable Encryption with Negligible Detection Probability: An Interactive Construction. EUROCRYPT 2011: 610-626 - [c11]Dan Boneh, David Mandell Freeman:
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures. Public Key Cryptography 2011: 1-16 - [i20]Dan Boneh, David Mandell Freeman:
Homomorphic Signatures for Polynomial Functions. IACR Cryptol. ePrint Arch. 2011: 18 (2011) - [i19]Markus Dürmuth, David Mandell Freeman:
Deniable Encryption with Negligible Detection Probability: An Interactive Construction. IACR Cryptol. ePrint Arch. 2011: 66 (2011) - [i18]Shweta Agrawal, David Mandell Freeman, Vinod Vaikuntanathan:
Functional Encryption for Inner Product Predicates from Learning with Errors. IACR Cryptol. ePrint Arch. 2011: 410 (2011) - 2010
- [j1]David Freeman, Michael Scott, Edlyn Teske:
A Taxonomy of Pairing-Friendly Elliptic Curves. J. Cryptol. 23(2): 224-280 (2010) - [c10]Sarah Meiklejohn, Hovav Shacham, David Mandell Freeman:
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures. ASIACRYPT 2010: 519-538 - [c9]David Mandell Freeman:
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups. EUROCRYPT 2010: 44-61 - [c8]Shweta Agrawal, Dan Boneh, Xavier Boyen, David Mandell Freeman:
Preventing Pollution Attacks in Multi-source Network Coding. Public Key Cryptography 2010: 161-176 - [c7]David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev:
More Constructions of Lossy and Correlation-Secure Trapdoor Functions. Public Key Cryptography 2010: 279-295 - [i17]Shweta Agrawal, Dan Boneh, Xavier Boyen, David Mandell Freeman:
Preventing Pollution Attacks in Multi-Source Network Coding. IACR Cryptol. ePrint Arch. 2010: 183 (2010) - [i16]Dan Boneh, David Mandell Freeman:
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures. IACR Cryptol. ePrint Arch. 2010: 453 (2010) - [i15]Sarah Meiklejohn, Hovav Shacham, David Mandell Freeman:
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures. IACR Cryptol. ePrint Arch. 2010: 474 (2010)
2000 – 2009
- 2009
- [c6]Naomi Benger, Manuel Charlemagne, David Mandell Freeman:
On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields. Pairing 2009: 52-65 - [c5]Dan Boneh, David Mandell Freeman, Jonathan Katz, Brent Waters:
Signing a Linear Subspace: Signature Schemes for Network Coding. Public Key Cryptography 2009: 68-87 - [i14]David Mandell Freeman, Takakazu Satoh:
Constructing pairing-friendly hyperelliptic curves using Weil restriction. IACR Cryptol. ePrint Arch. 2009: 103 (2009) - [i13]David Mandell Freeman:
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups. IACR Cryptol. ePrint Arch. 2009: 540 (2009) - [i12]David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev:
More Constructions of Lossy and Correlation-Secure Trapdoor Functions. IACR Cryptol. ePrint Arch. 2009: 590 (2009) - 2008
- [c4]David Freeman, Peter Stevenhagen, Marco Streng:
Abelian Varieties with Prescribed Embedding Degree. ANTS 2008: 60-73 - [c3]David Freeman:
A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties. Pairing 2008: 146-163 - [i11]David Mandell Freeman, Peter Stevenhagen, Marco Streng:
Abelian varieties with prescribed embedding degree. IACR Cryptol. ePrint Arch. 2008: 61 (2008) - [i10]David Freeman:
A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties. IACR Cryptol. ePrint Arch. 2008: 155 (2008) - [i9]Dan Boneh, David Mandell Freeman, Jonathan Katz, Brent Waters:
Signing a Linear Subspace: Signature Schemes for Network Coding. IACR Cryptol. ePrint Arch. 2008: 316 (2008) - [i8]Naomi Benger, Manuel Charlemagne, David Mandell Freeman:
On the security of pairing-friendly Abelian varieties over non-prime fields. IACR Cryptol. ePrint Arch. 2008: 417 (2008) - 2007
- [c2]David Freeman:
Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians. Pairing 2007: 152-176 - [i7]David Freeman, Kristin E. Lauter:
Computing endomorphism rings of Jacobians of genus 2 curves over finite fields. IACR Cryptol. ePrint Arch. 2007: 10 (2007) - [i6]David Freeman:
Constructing pairing-friendly genus 2 curves over prime fields with ordinary Jacobians. IACR Cryptol. ePrint Arch. 2007: 57 (2007) - 2006
- [c1]David Freeman:
Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10. ANTS 2006: 452-465 - [i5]David Freeman:
Constructing pairing-friendly elliptic curves with embedding degree 10. CoRR abs/math/0601487 (2006) - [i4]David Freeman:
Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10. IACR Cryptol. ePrint Arch. 2006: 26 (2006) - [i3]David Freeman, Michael Scott, Edlyn Teske:
A taxonomy of pairing-friendly elliptic curves. IACR Cryptol. ePrint Arch. 2006: 372 (2006) - 2005
- [i2]David Freeman:
Pairing-based identification schemes. CoRR abs/cs/0509056 (2005) - [i1]David Freeman:
Pairing-based identification schemes. IACR Cryptol. ePrint Arch. 2005: 336 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
