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

Suppakit Waiwitlikhit

dblp:373/4571 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2024
0009-0009-8734-9961ORCID · reported

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Systems, architecture and hardware · 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 · 46% Security and privacy of machine learning · 39% Privacy and data protection · 15%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs
1.522024
Trustless Audits without Revealing Data or Models · ICML 2024
ZKML: An Optimizing System for ML Inference in Zero-Knowledge Proofs · EuroSys 2024
Privacy and data protection › privacy-preserving accountability
privacy-preserving auditing
0.812024
Trustless Audits without Revealing Data or Models · ICML 2024
Security and privacy of machine learning
privacy-preserving inference
0.812024
ZKML: An Optimizing System for ML Inference in Zero-Knowledge Proofs · EuroSys 2024
Cryptographic protocols and secure computation
verifiable computation
0.812024
Trustless Audits without Revealing Data or Models · ICML 2024
Security and privacy of machine learning › verifiable machine learning
verifiable inference
0.812024
ZKML: An Optimizing System for ML Inference in Zero-Knowledge Proofs · EuroSys 2024
Security and privacy of machine learning › training data protection
dataset copyright auditing
0.212024
Trustless Audits without Revealing Data or Models · ICML 2024
Security and privacy of machine learning › machine learning auditing
model auditing
0.212024
Trustless Audits without Revealing Data or Models · ICML 2024

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

zk-SNARK · 0.8stochastic gradient descent · 0.8optimization · 0.8cryptographic commitment · 0.8
YearPublicationVenuePosition
2024 ZKML: An Optimizing System for ML Inference in Zero-Knowledge Proofs
abstract
Machine learning (ML) is increasingly used behind closed systems and APIs to make important decisions. For example, social media uses ML-based recommendation algorithms to decide what to show users, and millions of people pay to use ChatGPT for information every day. Because ML is deployed behind these closed systems, there are increasing calls for transparency, such as releasing model weights. However, these service providers have legitimate reasons not to release this information, including for privacy and trade secrets. To bridge this gap, recent work has proposed using zero-knowledge proofs (specifically a form called ZK-SNARKs) for certifying computation with private models but has only been applied to unrealistically small models.
Bing-Jyue Chen, Suppakit Waiwitlikhit, Ion Stoica, Daniel Kang 0001
EuroSys2
2024 Trustless Audits without Revealing Data or Models
abstract
There is an increasing conflict between business incentives to hide models and data as trade secrets, and the societal need for algorithmic transparency. For example, a rightsholder who currently wishes to know whether their copyrighted works have been used during training must convince the model provider to allow a third party to audit the model and data. Finding a mutually agreeable third party is difficult, and the associated costs often make this approach impractical. In this work, we show that it is possible to simultaneously allow model providers to keep their models and data secret while allowing other parties to trustlessly audit properties of the model and data. We do this by designing a protocol called ZkAudit in which model providers publish cryptographic commitments of datasets and model weights, alongside a zero-knowledge proof (ZKP) certifying that published commitments are derived from training the model. Model providers can then respond to audit requests by privately computing any function F of the dataset (or model) and releasing the output of F alongside another ZKP certifying the correct execution of F. To enable ZkAudit, we develop new methods of computing ZKPs for SGD on modern neural nets for recommender systems and image classification models capable of high accuracies on ImageNet. Empirically, we show it is possible to provide trustless audits of DNNs, including copyright, censorship, and counterfactual audits with little to no loss in accuracy.
Suppakit Waiwitlikhit, Ion Stoica, Yi Sun 0010, Tatsunori B. Hashimoto, Daniel Kang 0001
ICML1