Demo Data from VLDB 2026 / reviewers in the wild / expert
George Kappos
dblp:19/10126
· DBLP profile ↗
5ranked-venue papers
2as first author
2since 2021 · last 2024
0009-0003-0170-9601ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 3 · 2 first-author · 1 since 2021Computer networks · 1 · 1 since 2021
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
4 papers |
Blockchain and cryptocurrency security · 81% Digital forensics and information hiding · 15% Privacy and data protection · 4% | |
| Computer networks
1 paper |
Network measurement and analytics · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Web and social media mining · 100% |
Topics — the 4 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Digital forensics and information hiding › cryptocurrency forensics
transaction tracing |
0.4 | 1 | 2019 | Tracing Transactions Across Cryptocurrency Ledgers · USENIX Security Symposium 2019 |
Blockchain and cryptocurrency security › privacy-preserving blockchain
cryptocurrency privacy |
0.3 | 1 | 2018 | An Empirical Analysis of Anonymity in Zcash · USENIX Security Symposium 2018 |
Web and social media mining › social media analysis
social media measurement |
0.2 | 1 | 2024 | Give and Take: An End-To-End Investigation of Giveaway Scam Conversion Rates · IMC 2024 |
Privacy and data protection
anonymity |
0.1 | 1 | 2018 | An Empirical Analysis of Anonymity in Zcash · USENIX Security Symposium 2018 |
Methods — techniques the papers use, named apart from their topics
blockchain analysis · 2.6graph analysis · 0.6address clustering · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Give and Take: An End-To-End Investigation of Giveaway Scam Conversion RatesabstractThe Internet's combination of low communication cost, global reach, and functional anonymity has allowed fraudulent scam volumes to reach new heights. Designing effective interventions requires first understanding the context: how scammers reach potential victims, the earnings they make, and any potential bottlenecks for durable interventions. In this short paper, we focus on these questions in the context of cryptocurrency giveaway scams, where victims are tricked into irreversibly transferring funds to scammers under the pretense of even greater returns. Combining data from Twitter (also known as X), YouTube and Twitch livestreams, landing pages, and cryptocurrency blockchains, we measure how giveaway scams operate at scale. We find that 1 in 1000 scam tweets, and 4 in 100,000 livestream views, net a victim, and that scammers managed to extract nearly $4.62 million from just hundreds of victims during our measurement window. Enze Liu 0001, George Kappos, Eric Mugnier, Luca Invernizzi, Stefan Savage, David Tao, Kurt Thomas, Geoffrey M. Voelker, Sarah Meiklejohn |
IMC | 2 |
| 2022 | How to Peel a Million: Validating and Expanding Bitcoin Clusters
George Kappos, Haaroon Yousaf, Rainer Stütz, Sofia Rollet, Bernhard Haslhofer, Sarah Meiklejohn |
USENIX Security Symposium | 1 |
| 2019 | Tracing Transactions Across Cryptocurrency Ledgers
Haaroon Yousaf, George Kappos, Sarah Meiklejohn |
USENIX Security Symposium | 2 |
| 2018 | An Empirical Analysis of Anonymity in Zcash
George Kappos, Haaroon Yousaf, Mary Maller, Sarah Meiklejohn |
USENIX Security Symposium | 1 |
| 2011 | A novel 3-d model for node and system trustabstractNowadays, there is an increasing demand for wireless and mobile networks that guarantee secure and reliable data communication among users. To enable data exchanges, authentication mechanisms need to be in place to dynamically verify the identity of communicating parties. Authentication is used as a base to deploy security mechanisms and exchange information. However, authentication is static and it does not provide any information regarding the trustworthiness of communicating peers. Trust is a complex issue as it lies in the complexity of human behavior. Trust has typically been evaluated by measuring individual performance on a specific functionality or generally measuring specific behavior and translating it to a trust value. In this paper we define properties and requirements for trust at the individual and system level. Contrary to previous work, we consider trust in a non-linear manner that matches behavior in social networks. In addition, trust evaluations do not only take into account individual behavior independently, but also focus on its impact on the system. Finally, we present a novel 3-d trust model that is structured to reflect the overall trustworthiness of a system and responds to changes in node behavior. It provides a simplified and concurrently dynamic way of aggregating and representing trust and can be used to guide network functionalities, such as routing, or more generally evaluate trust in collaborative modes of interaction among individuals. An example application is also provided. George C. Hadjichristofi, George Kappos, Christoforos N. Hadjicostis |
IWCMC | 2 |