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

William Lin

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

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

Security and privacy · 2 · 2 since 2021Artificial 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
Cryptographic protocols and secure computation · 63% Digital forensics and information hiding · 37%
Artificial intelligence
1 paper
Trustworthy machine learning · 100%
Computer graphics and multimedia
1 paper
Audio and music processing · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.912025
I Can Hear You: Selective Robust Training for Deepfake Audio Detection · ICLR 2025
Digital forensics and information hiding › deepfake detection
audio deepfake detection
0.912025
I Can Hear You: Selective Robust Training for Deepfake Audio Detection · ICLR 2025
Cryptographic protocols and secure computation › verifiable computation
incrementally verifiable computation
0.512021
Proof-Carrying Data Without Succinct Arguments · CRYPTO (1) 2021
Cryptographic protocols and secure computation › verifiable computation
proof-carrying data
0.512021
Proof-Carrying Data Without Succinct Arguments · CRYPTO (1) 2021
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs
succinct arguments
0.512021
Proof-Carrying Data Without Succinct Arguments · CRYPTO (1) 2021
Audio and music processing › audio security
speech anti-spoofing
0.312025
I Can Hear You: Selective Robust Training for Deepfake Audio Detection · ICLR 2025

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

voice augmentation · 2.6frequency-selective training · 2.6adversarial training · 2.6cryptographic commitment · 0.5collision-resistant hashing · 0.5
YearPublicationVenuePosition
2025 I Can Hear You: Selective Robust Training for Deepfake Audio Detection
abstract
Recent advances in AI-generated voices have intensified the challenge of detecting deepfake audio, posing risks for scams and the spread of disinformation. To tackle this issue, we establish the largest public voice dataset to date, named DeepFakeVox-HQ, comprising 1.3 million samples, including 270,000 high-quality deepfake samples from 14 diverse sources. Despite previously reported high accuracy, existing deepfake voice detectors struggle with our diversely collected dataset, and their detection success rates drop even further under realistic corruptions and adversarial attacks. We conduct a holistic investigation into factors that enhance model robustness and show that incorporating a diversified set of voice augmentations is beneficial. Moreover, we find that the best detection models often rely on high-frequency features, which are imperceptible to humans and can be easily manipulated by an attacker. To address this, we propose the F-SAT: Frequency-Selective Adversarial Training method focusing on high-frequency components. Empirical results demonstrate that using our training dataset boosts baseline model performance (without robust training) by 33%, and our robust training further improves accuracy by 7.7% on clean samples and by 29.3% on corrupted and attacked samples, over the state-of-the-art RawNet3 model.
Aroon Sankoh, William Lin, Emanuel Mendiola-Ortiz, Chengzhi Mao
ICLR4
2022 CostCO: An automatic cost modeling framework for secure multi-party computation
abstract
The last decade has seen an explosion in the number of new secure multi-party computation (MPC) protocols that enable collaborative computation on sensitive data. No single MPC protocol is optimal for all types of computation. As a result, researchers have created hybrid-protocol compilers that translate a program into a hybrid protocol that mixes different MPC protocols. Hybrid-protocol compilers crucially rely on accurate cost models, which are handwritten by the compilers' developers, to choose the correct schedule of protocols. In this paper, we propose CostCO, the first automatic MPC cost modeling framework. CostCO develops a novel API to interface with a variety of MPC protocols, and leverages domain-specific properties of MPC in order to enable efficient and automatic cost-model generation for a wide range of MPC protocols. CostCO employs a two-phase experiment design to efficiently synthesize cost models of the MPC protocol's runtime as well as its memory and network usage. We verify CostCO's modeling accuracy for several full circuits, characterize the engineering effort required to port existing MPC protocols, and demonstrate how hybrid-protocol compilers can leverage CostCO's cost models.
Vivian Fang, Lloyd Brown, William Lin, Wenting Zheng, Aurojit Panda, Raluca A. Popa
EuroS&P3
2021 Proof-Carrying Data Without Succinct Arguments
Benedikt Bünz, Alessandro Chiesa, William Lin, Pratyush Mishra 0001, Nicholas Spooner
CRYPTO (1)3