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

Andrew Vyrros

dblp:356/6976 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0009-0007-1839-0368ORCID · reported

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

Security and privacy · 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
1 paper
Privacy and data protection · 50% Cryptographic protocols and secure computation · 50%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › protocol composition
concurrent composition
0.712023
Concurrent Composition for Interactive Differential Privacy with Adaptive Privacy-Loss Parameters · CCS 2023
Privacy and data protection
differential privacy
0.712023
Concurrent Composition for Interactive Differential Privacy with Adaptive Privacy-Loss Parameters · CCS 2023

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

privacy odometer · 0.7privacy filter · 0.7
YearPublicationVenuePosition
2023 Concurrent Composition for Interactive Differential Privacy with Adaptive Privacy-Loss Parameters
abstract
In this paper, we study the concurrent composition of interactive mechanisms with adaptively chosen privacy-loss parameters. In this setting, the adversary can interleave queries to existing interactive mechanisms, as well as create new ones. We prove that every valid privacy filter and odometer for noninteractive mechanisms extends to the concurrent composition of interactive mechanisms if privacy loss is measured using (ε, δ)-DP, ƒ-DP, or Rényi DP of fixed order. Our results offer strong theoretical foundations for enabling full adaptivity in composing differentially private interactive mechanisms, showing that concurrency does not affect the privacy guarantees. We also provide an implementation for users to deploy in practice.
Samuel Haney, Michael Shoemate, Grace Tian, Salil P. Vadhan, Andrew Vyrros, Vicki Xu, Wanrong Zhang 0001
CCS5