Wanrong Zhang

Wanrong Zhang

Auto-generated profile, based on publicly available information

Wanrong Zhang

Harvard University, Cambridge, MA, USA

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 May 2024 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
MBMark Bun
Mark Bun
MGMarco Gaboardi
Marco Gaboardi
MNMarcel Neunhoeffer
Marcel Neunhoeffer
WZWanrong Zhang
Wanrong Zhang
Motivated by privacy concerns in long-term longitudinal studies in medical and social science research, we study the problem of continually releasing differentially private synthetic data from longitudinal data collections. We introduce a model where, in every time step, each individual reports a new data element, and the goal of the synthesizer is to incrementally update a synthetic dataset in a consistent way to capture a rich class of statistical properties. We give continual synthetic data generation algorithms that preserve two basic types of queries: fixed time window queries and cumulative time queries. We show nearly tight upper bounds on the error rates of these algorithms and demonstrate their empirical performance on realistically sized datasets from the U.S. Census Bureau's Survey of Income and Program Participation.

15 November 2023
Verified
Conference Paper
Open access
SHSamuel Haney
Samuel Haney
MSMichael Shoemate
Michael Shoemate
GTGrace Tian
Grace Tian
SVSalil Vadhan
Salil Vadhan
AVAndrew Vyrros
Andrew Vyrros
WZWanrong Zhang
Wanrong Zhang
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.

1 June 2018 in Fish & Shellfish Immunology
Verified
Journal Article
Closed access
HXHaisheng Xu
Haisheng Xu
JZJing Zhao
Jing Zhao
YZYiyi Zou
Yiyi Zou
BLBinjie Lu
Binjie Lu
HCHanxiang Chen
Hanxiang Chen
JYJinjin Yang
Jinjin Yang

1 January 2011 in Chinese Physics B
Verified
Journal Article
Closed access
LCLiang Chen
Liang Chen
WZWan-Rong Zhang
Wan-Rong Zhang
DJDong-Yue Jin
Dong-Yue Jin
PSPei Shen
Pei Shen
HXHong-Yun Xie
Hong-Yun Xie
RWRen-Qing Wang
Ren-Qing Wang

1 October 2018
Verified
Conference Paper
Closed access
PMPei Ma
Pei Ma
HXHong-Yun Xie
Hong-Yun Xie
QCQuan-Xiu Chen
Quan-Xiu Chen
RLRui Liu
Rui Liu
LCLiang Chen
Liang Chen
WZWan-Rong Zhang
Wan-Rong Zhang
The effect of different base structural parameters on SiGe Heterojunction Phototransistor (HPT) performance is analyzed in this paper. It proposes a reference for designing SiGe HPT with both high responsivity and high characteristic frequency. Responsivity of 5.58 A/W and characteristic frequency of 21.29 GHz for 850 nm light are achieved when the thickness of base layer is 70 nm with the doping concentration of 1.0×10 19 cm -3 .

31 August 2025 in Journal of Privacy and Confidentiality
Verified
Journal Article
Open access
PDF file
SHSamuel Haney
Samuel Haney
MSMichael Shoemate
Michael Shoemate
GTGrace Tian
Grace Tian
SVSalil Vadhan
Salil Vadhan
AVAndrew Vyrros
Andrew Vyrros
WZWanrong Zhang
Wanrong Zhang
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 $(\epsilon, \delta)$-DP, $f$-DP, or R\'enyi 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.