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

Olive Franzese-McLaughlin

dblp:359/4725 · also Olive Franzese · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
0000-0001-9773-8017ORCID · verified

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Security and privacy · 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
3 papers
Cryptographic protocols and secure computation · 64% Privacy and data protection · 28% Security and privacy of machine learning · 8%
Artificial intelligence
2 papers
Trustworthy machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs
1.722025
Secure and Confidential Certificates of Online Fairness · NeurIPS 2025
Confidential Guardian: Cryptographically Prohibiting the Abuse of Model Abstention · ICML 2025
Machine learning › Trustworthy machine learning
fairness
0.912025
Secure and Confidential Certificates of Online Fairness · NeurIPS 2025
Machine learning › Trustworthy machine learning › fairness › fairness auditing
fairness certification
0.912025
Secure and Confidential Certificates of Online Fairness · NeurIPS 2025
Machine learning › Trustworthy machine learning › uncertainty estimation
selective classification
0.912025
Confidential Guardian: Cryptographically Prohibiting the Abuse of Model Abstention · ICML 2025
Privacy and data protection
differential privacy
0.912025
Secure Noise Sampling for Differentially Private Collaborative Learning · CCS 2025
Cryptographic protocols and secure computation
secure multiparty computation
0.312025
Secure Noise Sampling for Differentially Private Collaborative Learning · CCS 2025
Security and privacy of machine learning › verifiable machine learning
verifiable inference
0.312025
Confidential Guardian: Cryptographically Prohibiting the Abuse of Model Abstention · ICML 2025

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

online fairness certificates · 1.7cut-and-choose protocol · 1.7calibration metrics · 1.7zero-knowledge proofs · 0.9zero-knowledge proof · 0.9secure multiparty computation · 0.9DP-SGD · 0.9
YearPublicationVenuePosition
2025 Secure Noise Sampling for Differentially Private Collaborative Learning
abstract
Differentially private stochastic gradient descent (DP-SGD) trains machine learning (ML) models with formal privacy guarantees for the training set by adding random noise to gradient updates. In collaborative learning (CL), where multiple parties jointly train a model, noise addition occurs either (i) before or (ii) during secure gradient aggregation. The first option is deployed in distributed DP methods, which require greater amounts of total noise to achieve security, resulting in degraded model utility. The second approach preserves model utility but requires a secure multiparty computation (MPC) protocol. Existing methods for MPC noise generation require tens to hundreds of seconds of runtime per noise sample because of the number of parties involved. This makes them impractical for collaborative learning, which often requires thousands or more samples of noise in each training step.
Olive Franzese-McLaughlin, Congyu Fang, Radhika Garg 0002, Xiao Wang 0012, Somesh Jha, Nicolas Papernot, Adam Dziedzic
CCS1
2025 Confidential Guardian: Cryptographically Prohibiting the Abuse of Model Abstention
abstract
Cautious predictions—where a machine learning model abstains when uncertain—are crucial for limiting harmful errors in safety-critical applications. In this work, we identify a novel threat: a dishonest institution can exploit these mechanisms to discriminate or unjustly deny services under the guise of uncertainty. We demonstrate the practicality of this threat by introducing an uncertainty-inducing attack called Mirage, which deliberately reduces confidence in targeted input regions, thereby covertly disadvantaging specific individuals. At the same time, Mirage maintains high predictive performance across all data points. To counter this threat, we propose Confidential Guardian, a framework that analyzes calibration metrics on a reference dataset to detect artificially suppressed confidence. Additionally, it employs zero-knowledge proofs of verified inference to ensure that reported confidence scores genuinely originate from the deployed model. This prevents the provider from fabricating arbitrary model confidence values while protecting the model’s proprietary details. Our results confirm that Confidential Guardian effectively prevents the misuse of cautious predictions, providing verifiable assurances that abstention reflects genuine model uncertainty rather than malicious intent.
Stephan Rabanser, Ali Shahin Shamsabadi, Olive Franzese-McLaughlin, Xiao Wang 0012, Adrian Weller, Nicolas Papernot
ICML3
2025 Secure and Confidential Certificates of Online Fairness
abstract
The "black-box service model" enables ML service providers to serve clients while keeping their intellectual property and client data confidential. Confidentiality is critical for delivering ML services legally and responsibly, but makes it difficult for outside parties to verify important model properties such as fairness. Existing methods that assess model fairness confidentially lack either (i) *reliability* because they certify fairness with respect to a static set of data, and therefore fail to guarantee fairness in the presence of distribution shift or service provider malfeasance; and/or (ii) *scalability* due to the computational overhead of confidentiality-preserving cryptographic primitives. We address these problems by introducing *online fairness certificates*, which verify that a model is fair with respect to data received by the service provider *online* during deployment. We then present OATH, a deployably efficient and scalable zero-knowledge proof protocol for confidential online group fairness certification. OATH exploits statistical properties of group fairness via a "cut-and-choose" style protocol, enabling scalability improvements over baselines.
Olive Franzese-McLaughlin, Ali Shahin Shamsabadi, Carter Luck, Hamed Haddadi 0001
NeurIPS1