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.

Jacopo Squillaci

dblp:181/9112 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · none

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

Databases, data management, data science and information retrieval · 1

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
1 paper
Privacy and data protection · 50% Web and mobile security · 50%
Databases, data mining, and information retrieval
1 paper
Web and social media mining · 100%

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

TopicWeightPapersLastEvidence papers
Web and social media mining
online social networks
0.212016
Beat the DIVa - decentralized identity validation for online social networks · ICDE 2016
Web and mobile security › online social network security
fake account detection
0.212016
Beat the DIVa - decentralized identity validation for online social networks · ICDE 2016
Privacy and data protection
online social networks
0.212016
Beat the DIVa - decentralized identity validation for online social networks · ICDE 2016
Web and social media mining
trust assessment
0.112016
Beat the DIVa - decentralized identity validation for online social networks · ICDE 2016

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

game-based evaluation · 0.5correlation learning · 0.5
YearPublicationVenuePosition
2016 Beat the DIVa - decentralized identity validation for online social networks
abstract
Fake accounts in online social networks (OSNs) have known considerable sophistication and are now attempting to gain network trust by infiltrating within honest communities. Honest users have limited perspective on the truthfulness of new online identities requesting their friendship. This facilitates the task of fake accounts in deceiving honest users to befriend them. To address this, we have proposed a model that learns hidden correlations between profile attributes within OSN communities, and exploits them to assist users in estimating the trustworthiness of new profiles. To demonstrate our method, we suggest, in this demo, a game application through which players try to cheat the system and convince nodes in a simulated OSN to befriend them. The game deploys different strategies to challenge the players and to reach the objectives of the demo. These objectives are to make participants aware of how fake accounts can infiltrate within their OSN communities, to demonstrate how our suggested method could aid in mitigating this threat, and to eventually strengthen our model based on the data collected from the moves of the players.
Leila Bahri, Amira Soliman 0001, Jacopo Squillaci, Barbara Carminati, Elena Ferrari 0001, Sarunas Girdzijauskas
ICDE3