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

Riley Spahn

dblp:123/9751 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · none

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

Security and privacy · 4Software engineering, systems software and programming languages · 2 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1

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
Privacy and data protection · 100%
Databases, data mining, and information retrieval
2 papers
Machine learning and data management · 82% Data mining · 18%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

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

TopicWeightPapersLastEvidence papers
Privacy and data protection
differential privacy
0.412019
Privacy accounting and quality control in the sage differentially private ML platform · SOSP 2019
Privacy and data protection › differential privacy
privacy accounting
0.412019
Privacy accounting and quality control in the sage differentially private ML platform · SOSP 2019
Machine learning and data management
data management for machine learning
0.312017
Pyramid: Enhancing Selectivity in Big Data Protection with Count Featurization · IEEE Symposium on Security and Privacy 2017
Privacy and data protection › privacy management
data minimization
0.312017
Pyramid: Enhancing Selectivity in Big Data Protection with Count Featurization · IEEE Symposium on Security and Privacy 2017
Privacy and data protection
online targeting
0.212015
Sunlight: Fine-grained Targeting Detection at Scale with Statistical Confidence · CCS 2015
Machine learning and data management › machine learning systems
machine learning platform
0.112019
Privacy accounting and quality control in the sage differentially private ML platform · SOSP 2019
Privacy and data protection › web privacy
web tracking detection
0.112014
XRay: Enhancing the Web's Transparency with Differential Correlation · USENIX Security Symposium 2014

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

differential privacy · 0.8block composition · 0.8count featurization · 0.6statistical significance testing · 0.2multiple testing correction · 0.2hypothesis testing · 0.2
YearPublicationVenuePosition
2019 Privacy accounting and quality control in the sage differentially private ML platform
abstract
Companies increasingly expose machine learning (ML) models trained over sensitive user data to untrusted domains, such as end-user devices and wide-access model stores. This creates a need to control the data's leakage through these models. We present Sage, a differentially private (DP) ML platform that bounds the cumulative leakage of training data through models. Sage builds upon the rich literature on DP ML algorithms and contributes pragmatic solutions to two of the most pressing systems challenges of global DP: running out of privacy budget and the privacy-utility tradeoff. To address the former, we develop block composition, a new privacy loss accounting method that leverages the growing database regime of ML workloads to keep training models endlessly on a sensitive data stream while enforcing a global DP guarantee for the stream. To address the latter, we develop privacy-adaptive training, a process that trains a model on growing amounts of data and/or with increasing privacy parameters until, with high probability, the model meets developer-configured quality criteria. Sage's methods are designed to integrate with TensorFlow-Extended, Google's open-source ML platform. They illustrate how a systems focus on characteristics of ML workloads enables pragmatic solutions that are not apparent when one focuses on individual algorithms, as most DP ML literature does.
Mathias Lécuyer, Riley Spahn, Kiran Vodrahalli, Roxana Geambasu, Daniel Hsu 0001
SOSP2
2017 Pyramid: Enhancing Selectivity in Big Data Protection with Count Featurization
abstract
Protecting vast quantities of data poses a daunting challenge for the growing number of organizations that collect, stockpile, and monetize it. The ability to distinguish data that is actually needed from data collected "just in case" would help these organizations to limit the latter's exposure to attack. A natural approach might be to monitor data use and retain only the working-set of in-use data in accessible storage, unused data can be evicted to a highly protected store. However, many of today's big data applications rely on machine learning (ML) workloads that are periodically retrained by accessing, and thus exposing to attack, the entire data store. Training set minimization methods, such as count featurization, are often used to limit the data needed to train ML workloads to improve performance or scalability. We present Pyramid, a limited-exposure data management system that builds upon count featurization to enhance data protection. As such, Pyramid uniquely introduces both the idea and proof-of-concept for leveraging training set minimization methods to instill rigor and selectivity into big data management. We integrated Pyramid into Spark Velox, a framework for ML-based targeting and personalization. We evaluate it on three applications and show that Pyramid approaches state-of-the-art models while training on less than 1% of the raw data.
Mathias Lécuyer, Riley Spahn, Roxana Geambasu, Tzu-Kuo Huang, Siddhartha Sen 0001
IEEE Symposium on Security and Privacy2
2015 Sunlight: Fine-grained Targeting Detection at Scale with Statistical Confidence
abstract
We present Sunlight, a system that detects the causes of targeting phenomena on the web -- such as personalized advertisements, recommendations, or content -- at large scale and with solid statistical confidence. Today's web is growing increasingly complex and impenetrable as myriad of services collect, analyze, use, and exchange users' personal information. No one can tell who has what data, for what purposes they are using it, and how those uses affect the users. The few studies that exist reveal problematic effects -- such as discriminatory pricing and advertising -- but they are either too small-scale to generalize or lack formal assessments of confidence in the results, making them difficult to trust or interpret. Sunlight brings a principled and scalable methodology to personal data measurements by adapting well-established methods from statistics for the specific problem of targeting detection. Our methodology formally separates different operations into four key phases: scalable hypothesis generation, interpretable hypothesis formation, statistical significance testing, and multiple testing correction. Each phase bears instantiations from multiple mechanisms from statistics, each making different assumptions and tradeoffs. Sunlight offers a modular design that allows exploration of this vast design space. We explore a portion of this space, thoroughly evaluating the tradeoffs both analytically and experimentally. Our exploration reveals subtle tensions between scalability and confidence. Sunlight's default functioning strikes a balance to provide the first system that can diagnose targeting at fine granularity, at scale, and with solid statistical justification of its results.
Mathias Lécuyer, Riley Spahn, Yannis Spiliopolous, Augustin Chaintreau, Roxana Geambasu, Daniel Hsu 0001
CCS2
2014 Pebbles: Fine-Grained Data Management Abstractions for Modern Operating Systems
Riley Spahn, Jonathan Bell 0001, Sravan Bhamidipati, Roxana Geambasu, Gail E. Kaiser
OSDI1
2014 XRay: Enhancing the Web's Transparency with Differential Correlation
Mathias Lécuyer, Guillaume Ducoffe, Francis Lan, Andrei Papancea, Theofilos Petsios, Riley Spahn, Augustin Chaintreau, Roxana Geambasu
USENIX Security Symposium6
2012 NV: Nessus vulnerability visualization for the web
abstract
Network vulnerability is a critical component of network security. Yet vulnerability analysis has received relatively little attention from the security visualization community. This paper describes nv, a web-based Nessus vulnerability visualization. Nv utilizes treemaps and linked histograms to allow security analysts and systems administrators to discover, analyze, and manage vulnerabilities on their networks. In addition to visualizing single Nessus scans, nv supports the analysis of sequential scans by showing which vulnerabilities have been fixed, remain open, or are newly discovered. Nv operates completely in-browser, to avoid sending sensitive data to outside servers. We discuss the design of nv, as well as provide case studies demonstrating vulnerability analysis workflows which include a multiple-node testbed and data from the 2011 VAST Challenge.
Lane Harrison, Riley Spahn, Michael D. Iannacone, Evan Downing, John R. Goodall
VizSEC2