10 citations · 10 across the 2 of their papers we have counts for
2 papers
cs.LG2020★ 10 cited
Quantifying Membership Inference Vulnerability via Generalization Gap and Other Model Metrics
Jason W. Bentley, Daniel Gibney, Gary Hoppenworth +1
We demonstrate how a target model's generalization gap leads directly to an effective deterministic black box membership inference attack (MIA). This provides an upper bound on how…
cs.CC2020
Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree Isomorphism
Daniel Gibney, Gary Hoppenworth, Sharma V. Thankachan
The CNF formula satisfiability problem (CNF-SAT) has been reduced to many fundamental problems in P to prove tight lower bounds under the Strong Exponential Time Hypothesis (SETH).…