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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Marco Lancini

dblp:123/3304 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

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

Security and privacy · 2Artificial intelligence and machine learning · 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
2 papers
Security and privacy of machine learning · 68% Usable security · 22% Authentication and access control · 10%
Artificial intelligence
1 paper
Face, body and person analysis · 100%

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

TopicWeightPapersLastEvidence papers
Security and privacy of machine learning
large language model security
0.912025
Gandalf the Red: Adaptive Security for LLMs · ICML 2025
Security and privacy of machine learning › adversarial defense
prompt injection defense
0.912025
Gandalf the Red: Adaptive Security for LLMs · ICML 2025
Security and privacy of machine learning
red teaming
0.912025
Gandalf the Red: Adaptive Security for LLMs · ICML 2025
Authentication and access control › knowledge-based authentication › graphical password
image-based authentication
0.212014
Faces in the Distorting Mirror: Revisiting Photo-based Social Authentication · CCS 2014
Authentication and access control › user authentication
social authentication
0.212014
Faces in the Distorting Mirror: Revisiting Photo-based Social Authentication · CCS 2014
Computer vision › Face, body and person analysis
face recognition
0.112014
Faces in the Distorting Mirror: Revisiting Photo-based Social Authentication · CCS 2014

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

red-teaming · 0.9dynamic security utility threat model · 0.9image comparison · 0.4
YearPublicationVenuePosition
2025 Gandalf the Red: Adaptive Security for LLMs
abstract
Current evaluations of defenses against prompt attacks in large language model (LLM) applications often overlook two critical factors: the dynamic nature of adversarial behavior and the usability penalties imposed on legitimate users by restrictive defenses. We propose D-SEC (Dynamic Security Utility Threat Model), which explicitly separates attackers from legitimate users, models multi-step interactions, and expresses the security-utility in an optimizable form. We further address the shortcomings in existing evaluations by introducing Gandalf, a crowd-sourced, gamified red-teaming platform designed to generate realistic, adaptive attack. Using Gandalf, we collect and release a dataset of 279k prompt attacks. Complemented by benign user data, our analysis reveals the interplay between security and utility, showing that defenses integrated in the LLM (e.g., system prompts) can degrade usability even without blocking requests. We demonstrate that restricted application domains, defense-in-depth, and adaptive defenses are effective strategies for building secure and useful LLM applications.
Niklas Pfister, Václav Volhejn, Manuel Knott 0003, Santiago Arias, Julia Bazinska, Mykhailo Bichurin, Alan Commike, Janet Darling, Peter Dienes, Matthew Fiedler, David Haber, Matthias Kraft, Marco Lancini, Max Mathys, Damián Pascual-Ortiz, Jakub Podolak, Adrià Romero-López, Kyriacos Shiarlis, Andreas Signer, Zsolt Terek, Athanasios Theocharis, Daniel Timbrell, Samuel Trautwein, Samuel Watts, Yun-Han Wu, Mateo Rojas-Carulla
ICML13
2014 Faces in the Distorting Mirror: Revisiting Photo-based Social Authentication
abstract
In an effort to hinder attackers from compromising user accounts, Facebook launched a form of two-factor authentication called social authentication (SA), where users are required to identify photos of their friends to complete a log-in attempt. Recent research, however, demonstrated that attackers can bypass the mechanism by employing face recognition software. Here we demonstrate an alternative attack. that employs image comparison techniques to identify the SA photos within an offline collection of the users' photos.
Iasonas Polakis, Panagiotis Ilia, Federico Maggi 0001, Marco Lancini, Georgios Kontaxis, Stefano Zanero, Sotiris Ioannidis, Angelos D. Keromytis
CCS4
2012 All your face are belong to us: breaking Facebook's social authentication
abstract
Two-factor authentication is widely used by high-value services to prevent adversaries from compromising accounts using stolen credentials. Facebook has recently released a two-factor authentication mechanism, referred to as Social Authentication, which requires users to identify some of their friends in randomly selected photos. A recent study has provided a formal analysis of social authentication weaknesses against attackers inside the victim's social circles. In this paper, we extend the threat model and study the attack surface of social authentication in practice, and show how any attacker can obtain the information needed to solve the challenges presented by Facebook. We implement a proof-of-concept system that utilizes widely available face recognition software and cloud services, and evaluate it using real public data collected from Facebook. Under the assumptions of Facebook's threat model, our results show that an attacker can obtain access to (sensitive) information for at least 42% of a user's friends that Facebook uses to generate social authentication challenges. By relying solely on publicly accessible information, a casual attacker can solve 22% of the social authentication tests in an automated fashion, and gain a significant advantage for an additional 56% of the tests, as opposed to just guessing. Additionally, we simulate the scenario of a determined attacker placing himself inside the victim's social circle by employing dummy accounts. In this case, the accuracy of our attack greatly increases and reaches 100% when 120 faces per friend are accessible by the attacker, even though it is very accurate with as little as 10 faces.
Iasonas Polakis, Marco Lancini, Georgios Kontaxis, Federico Maggi 0001, Sotiris Ioannidis, Angelos D. Keromytis, Stefano Zanero
ACSAC2