Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

David Mandell Freeman

dblp:38/7225 · also David Freeman 0001 · DBLP profile ↗
← Back
17ranked-venue papers
8as first author
1since 2021 · last 2021
0009-0009-1230-892XORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 15 · 7 first-author · 1 since 2021Computer networks · 1Databases, data management, data science and information retrieval · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
12 papers
Cryptographic primitives and cryptanalysis · 45% Web and mobile security · 20% Network security · 9%
Computer networks
1 paper
Internet architecture and protocols · 50% Network measurement and analytics · 50%
Databases, data mining, and information retrieval
1 paper
Web and social media mining · 100%

Topics — the 26 heaviest of 30, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Web and mobile security › online social network abuse
malicious account detection
0.512021
Deep Entity Classification: Abusive Account Detection for Online Social Networks · USENIX Security Symposium 2021
Web and mobile security
online social network security
0.512021
Deep Entity Classification: Abusive Account Detection for Online Social Networks · USENIX Security Symposium 2021
Network measurement and analytics › internet measurement
IP address classification
0.412020
Towards A User-Level Understanding of IPv6 Behavior · Internet Measurement Conference 2020
Internet architecture and protocols
IPv6
0.412020
Towards A User-Level Understanding of IPv6 Behavior · Internet Measurement Conference 2020
Blockchain and cryptocurrency security › blockchain analysis
address clustering
0.412020
Towards A User-Level Understanding of IPv6 Behavior · Internet Measurement Conference 2020
Network security › attack modeling
attack characterization
0.412020
Towards A User-Level Understanding of IPv6 Behavior · Internet Measurement Conference 2020
Web and social media mining › malicious behavior detection
fake account detection
0.312017
Can You Spot the Fakes?: On the Limitations of User Feedback in Online Social Networks · WWW 2017
Web and social media mining
online social networks
0.312017
Can You Spot the Fakes?: On the Limitations of User Feedback in Online Social Networks · WWW 2017
Usable security › security operations
abuse detection
0.312017
Can You Spot the Fakes?: On the Limitations of User Feedback in Online Social Networks · WWW 2017
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures
0.222011
Homomorphic Signatures for Polynomial Functions · EUROCRYPT 2011
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures · ASIACRYPT 2010
Cryptographic primitives and cryptanalysis › one-way functions
trapdoor functions
0.212013
More Constructions of Lossy and Correlation-Secure Trapdoor Functions · J. Cryptol. 2013
Cryptographic primitives and cryptanalysis › encryption
deniable encryption
0.112011
Deniable Encryption with Negligible Detection Probability: An Interactive Construction · EUROCRYPT 2011
Cryptographic primitives and cryptanalysis
encryption
0.112011
Deniable Encryption with Negligible Detection Probability: An Interactive Construction · EUROCRYPT 2011
Cryptographic primitives and cryptanalysis
functional encryption
0.112011
Functional Encryption for Inner Product Predicates from Learning with Errors · ASIACRYPT 2011
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
homomorphic signatures
0.112011
Homomorphic Signatures for Polynomial Functions · EUROCRYPT 2011
Cryptographic primitives and cryptanalysis › functional encryption › predicate encryption
inner product encryption
0.112011
Functional Encryption for Inner Product Predicates from Learning with Errors · ASIACRYPT 2011
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography
0.112011
Functional Encryption for Inner Product Predicates from Learning with Errors · ASIACRYPT 2011
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography
learning with errors
0.112011
Functional Encryption for Inner Product Predicates from Learning with Errors · ASIACRYPT 2011
Cryptographic primitives and cryptanalysis
post-quantum cryptography
0.112011
Functional Encryption for Inner Product Predicates from Learning with Errors · ASIACRYPT 2011
Cryptographic primitives and cryptanalysis › public-key cryptography
public-key encryption
0.112011
Functional Encryption for Inner Product Predicates from Learning with Errors · ASIACRYPT 2011
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
blind signatures
0.112010
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures · ASIACRYPT 2010
Cryptographic primitives and cryptanalysis › pairing-based cryptography
composite-order to prime-order conversion
0.112010
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups · EUROCRYPT 2010
Cryptographic primitives and cryptanalysis › public-key cryptography
elliptic curve cryptography
0.112010
A Taxonomy of Pairing-Friendly Elliptic Curves · J. Cryptol. 2010
Cryptographic primitives and cryptanalysis
pairing-based cryptography
0.112010
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups · EUROCRYPT 2010
Cryptographic primitives and cryptanalysis › public-key cryptography › elliptic curve cryptography
pairing-friendly curves
0.112010
A Taxonomy of Pairing-Friendly Elliptic Curves · J. Cryptol. 2010
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures › blind signatures
round-optimal blind signatures
0.112010
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures · ASIACRYPT 2010

Methods — techniques the papers use, named apart from their topics

deep entity classification · 0.5statistical analysis · 0.2learning with errors · 0.1transformation limitations · 0.1pairings · 0.1group conversion · 0.1
YearPublicationVenuePosition
2021 Deep Entity Classification: Abusive Account Detection for Online Social Networks
Teng Xu 0009, Gerard Goossen, Huseyin Kerem Cevahir, Sara Khodeir, Yingyezhe Jin, Frank Li 0001, Shawn Shan, David Mandell Freeman, Paul Pearce
USENIX Security Symposium9
2020 Towards A User-Level Understanding of IPv6 Behavior
abstract
IP address classification and clustering are important tools for security practitioners in understanding attacks and employing proactive defenses. Over the past decade, network providers have begun transitioning from IPv4 to the more flexible IPv6, and a third of users now access online services over IPv6. However, there is no reason to believe that the properties of IPv4 addresses used for security applications should carry over to IPv6, and to date there has not yet been a large-scale study comparing the two protocols at a user (as opposed to a client or address) level.
Frank Li 0001, David Mandell Freeman
Internet Measurement Conference2
2018 11th International Workshop on Artificial Intelligence and Security (AISec 2018)
Sadia Afroz 0001, Battista Biggio, Yuval Elovici, David Mandell Freeman, Asaf Shabtai
CCS4
2017 10th International Workshop on Artificial Intelligence and Security (AISec 2017)
abstract
Artificial Intelligence (AI) and Machine Learning (ML) provide a set of useful analytic and decision-making techniques that are being leveraged by an ever-growing community of practitioners, including many whose applications have security-sensitive elements. However, while security researchers often utilize such techniques to address problems and AI/ML researchers develop techniques for Big Data analytics applications, neither community devotes much attention to the other. Within security research, AI/ML components are usually regarded as black-box solvers. Conversely, the learning community seldom considers the security/privacy implications entailed in the application of their algorithms when they are designing them. While these two communities generally focus on different directions, where these two fields do meet, interesting problems appear. Researchers working in this intersection have raised many novel questions for both communities and created a new branch of research known as secure learning. The AISec workshop has become the primary venue for this unique fusion of research.
Battista Biggio, David Mandell Freeman, Brad Miller 0002, Arunesh Sinha
CCS2
2017 Can You Spot the Fakes?: On the Limitations of User Feedback in Online Social Networks
abstract
Online social networks (OSNs) are appealing platforms for spammers and fraudsters, who typically use fake or compromised accounts to connect with and defraud real users. To combat such abuse, OSNs allow users to report fraudulent profiles or activity. The OSN can then use reporting data to review and/or limit activity of reported accounts.
David Mandell Freeman
WWW1
2016 9th International Workshop on Artificial Intelligence and Security: AISec 2016
abstract
Artificial Intelligence (AI) and Machine Learning (ML) provide a set of useful analytic and decision-making techniques that are being leveraged by an ever-growing community of practitioners, including many whose applications have security-sensitive elements. However, while security researchers often utilize such techniques to address problems and AI/ML researchers develop techniques for Big Data analytics applications, neither community devotes much attention to the other. Within security research, AI/ML components are usually regarded as black-box solvers. Conversely, the learning community seldom considers the security/privacy implications entailed in the application of their algorithms when they are designing them. While these two communities generally focus on different directions, where these two fields do meet, interesting problems appear. Researchers working in this intersection have raised many novel questions for both communities and created a new branch of research known as secure learning. The AISec workshop has become the primary venue for this unique fusion of research. In recent years, there has been an increase of activity within the AISec/secure learning community. There are several reasons for this surge. Firstly, machine learning, data mining, and other artificial intelligence technologies play a key role in extracting knowledge, situational awareness, and security intelligence from Big Data. Secondly, companies like Google, Facebook, Amazon, and Splunk are increasingly exploring and deploying learning technologies to address Big Data problems for their customers.
David Mandell Freeman, Aikaterini Mitrokotsa, Arunesh Sinha
CCS1
2016 Who Are You? A Statistical Approach to Measuring User Authenticity
David Mandell Freeman, Sakshi Jain, Markus Dürmuth, Battista Biggio, Giorgio Giacinto
NDSS1
2013 More Constructions of Lossy and Correlation-Secure Trapdoor Functions
David Mandell Freeman, Oded Goldreich 0001, Eike Kiltz, Alon Rosen, Gil Segev 0001
J. Cryptol.1
2011 Functional Encryption for Inner Product Predicates from Learning with Errors
Shweta Agrawal 0001, David Mandell Freeman, Vinod Vaikuntanathan
ASIACRYPT2
2011 Homomorphic Signatures for Polynomial Functions
Dan Boneh, David Mandell Freeman
EUROCRYPT2
2011 Deniable Encryption with Negligible Detection Probability: An Interactive Construction
Markus Dürmuth, David Mandell Freeman
EUROCRYPT2
2010 Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
Sarah Meiklejohn, Hovav Shacham, David Mandell Freeman
ASIACRYPT3
2010 Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
David Mandell Freeman
EUROCRYPT1
2010 A Taxonomy of Pairing-Friendly Elliptic Curves
abstract
Elliptic curves with small embedding degree and large prime-order subgroup are key ingredients for implementing pairing-based cryptographic systems. Such “pairing-friendly” curves are rare and thus require specific constructions. In this paper we give a single coherent framework that encompasses all of the constructions of pairing-friendly elliptic curves currently existing in the literature. We also include new constructions of pairing-friendly curves that improve on the previously known constructions for certain embedding degrees. Finally, for all embedding degrees up to 50, we provide recommendations as to which pairing-friendly curves to choose to best satisfy a variety of performance and security requirements.
David Mandell Freeman, Michael Scott, Edlyn Teske
J. Cryptol.1
2009 On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields
Naomi Benger, Manuel Charlemagne, David Mandell Freeman
Pairing3
2008 A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties
David Mandell Freeman
Pairing1
2007 Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
David Mandell Freeman
Pairing1