Demo Data from SIGIR 2026 / reviewers in the wild / expert
Jaiden Fairoze
dblp:277/8240
· DBLP profile ↗
5ranked-venue papers
1as first author
4since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 4 · 3 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 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 |
Cryptographic protocols and secure computation · 50% Digital forensics and information hiding · 34% Cryptographic primitives and cryptanalysis · 11% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Digital forensics and information hiding › watermarking
generative model watermarking |
0.9 | 1 | 2025 | SoK: Watermarking for AI-Generated Content · SP 2025 |
Digital forensics and information hiding
watermarking |
0.9 | 1 | 2025 | SoK: Watermarking for AI-Generated Content · SP 2025 |
Cryptographic protocols and secure computation › secure messaging
double ratchet |
0.6 | 1 | 2022 | A More Complete Analysis of the Signal Double Ratchet Algorithm · CRYPTO (1) 2022 |
Cryptographic protocols and secure computation › secret sharing
robust secret sharing |
0.6 | 1 | 2022 | hbACSS: How to Robustly Share Many Secrets · NDSS 2022 |
Cryptographic protocols and secure computation
secret sharing |
0.6 | 1 | 2022 | hbACSS: How to Robustly Share Many Secrets · NDSS 2022 |
Cryptographic primitives and cryptanalysis
security analysis |
0.6 | 1 | 2022 | A More Complete Analysis of the Signal Double Ratchet Algorithm · CRYPTO (1) 2022 |
Cryptographic protocols and secure computation › secure messaging
post-compromise security |
0.4 | 1 | 2020 | Clone Detection in Secure Messaging: Improving Post-Compromise Security in Practice · CCS 2020 |
Cryptographic protocols and secure computation
secure messaging |
0.4 | 1 | 2020 | Clone Detection in Secure Messaging: Improving Post-Compromise Security in Practice · CCS 2020 |
Security and privacy of machine learning
generative model safety |
0.3 | 1 | 2025 | SoK: Watermarking for AI-Generated Content · SP 2025 |
Methods — techniques the papers use, named apart from their topics
protocol analysis · 0.6black-box experiment · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | On the Difficulty of Constructing a Robust and Publicly-Detectable WatermarkabstractThis work investigates the theoretical boundaries of creating publicly-detectable schemes to enable the provenance of watermarked imagery. Metadata-based approaches like C2PA provide unforgeability and public-detectability. ML techniques offer robust retrieval and watermarking. However, no existing scheme combines robustness, unforgeability, and public-detectability. In this work, we formally define such a scheme and establish its existence. Although theoretically possible, we find that at present, it is intractable to build certain components of our scheme without a leap in deep learning capabilities. We analyze these limitations and propose research directions that need to be addressed before we can practically realize robust and publicly-verifiable provenance. Jaiden Fairoze, Guillermo Ortiz-Jiménez, Mel Vecerík, Somesh Jha, Sven Gowal |
AISTATS | 1 |
| 2025 | SoK: Watermarking for AI-Generated ContentabstractAs the outputs of generative AI (GenAl) techniques improve in quality, it becomes increasingly challenging to distinguish them from human-created content. Watermarking schemes are a promising approach to address the problem of distinguishing between AI and human-generated content. These schemes embed hidden signals within AI -generated content to enable reliable detection. While watermarking is not a silver bullet for addressing all risks associated with GenAl, it can play a crucial role in enhancing AI safety and trustworthiness by combating misinformation and deception. This paper presents a comprehensive overview of water-marking techniques for GenAl, beginning with the need for watermarking from historical and regulatory perspectives. We formalize the definitions and desired properties of watermarking schemes and examine the key objectives and threat models for existing approaches. Practical evaluation strategies are also explored, providing insights into the development of robust watermarking techniques capable of resisting various attacks. Additionally, we review recent representative works, highlight open challenges, and discuss potential directions for this emerging field. By offering a thorough understanding of watermarking in GenAl, this work aims to guide researchers in advancing watermarking methods and applications, and support policymakers in addressing the broader implications of GenAl. Xuandong Zhao, Sam Gunn, Miranda Christ, Jaiden Fairoze, Andrés Fábrega, Nicholas Carlini, Sanjam Garg, Sanghyun Hong 0001, Milad Nasr, Florian Tramèr, Somesh Jha, Lei Li 0005, Yu-Xiang Wang 0003, Dawn Song |
SP | 4 |
| 2022 | A More Complete Analysis of the Signal Double Ratchet Algorithm
Alexander Bienstock, Jaiden Fairoze, Sanjam Garg, Pratyay Mukherjee, Srinivasan Raghuraman |
CRYPTO (1) | 2 |
| 2022 | hbACSS: How to Robustly Share Many Secrets
Thomas Yurek, Licheng Luo, Jaiden Fairoze, Aniket Kate, Andrew Miller 0001 |
NDSS | 3 |
| 2020 | Clone Detection in Secure Messaging: Improving Post-Compromise Security in PracticeabstractWe investigate whether modern messaging apps achieve the strong post-compromise security guarantees offered by their underlying protocols. In particular, we perform a black-box experiment in which a user becomes the victim of a clone attack; in this attack, the user's full state (including identity keys) is compromised by an attacker who clones their device and then later attempts to impersonate them, using the app through its user interface. Cas Cremers, Jaiden Fairoze, Benjamin Kiesl-Reiter, Aurora Naska |
CCS | 2 |