77 citations · 131 across the 14 of their papers we have counts for
19 papers
Continual Mean Estimation Under User-Level Privacy
Anand Jerry George, Lekshmi Ramesh, Aditya Vikram Singh +1
We consider the problem of continually releasing an estimate of the population mean of a stream of samples that is user-level differentially private (DP). At each time instant, a u…
Multiple Support Recovery Using Very Few Measurements Per Sample
Lekshmi Ramesh, Chandra R. Murthy, Himanshu Tyagi
In the problem of multiple support recovery, we are given access to linear measurements of multiple sparse samples in . These samples can be partitioned into …
Wyner-Ziv Estimators for Distributed Mean Estimation with Side Information and Optimization
Prathamesh Mayekar, Shubham Jha, Ananda Theertha Suresh +1
Communication efficient distributed mean estimation is an important primitive that arises in many distributed learning and optimization scenarios such as federated learning. Withou…
Unified lower bounds for interactive high-dimensional estimation under information constraints
Jayadev Acharya, Clément L. Canonne, Ziteng Sun +1
We consider distributed parameter estimation using interactive protocols subject to local information constraints such as bandwidth limitations, local differential privacy, and res…
Interactive Inference under Information Constraints
Jayadev Acharya, Clément L. Canonne, Yuhan Liu +2
We study the role of interactivity in distributed statistical inference under information constraints, e.g., communication constraints and local differential privacy. We focus on t…
Tracking an Auto-Regressive Process with Limited Communication per Unit Time
Rooji Jinan, Parimal Parag, Himanshu Tyagi
Samples from a high-dimensional AR[1] process are observed by a sender which can communicate only finitely many bits per unit time to a receiver. The receiver seeks to form an esti…
Universal Multiparty Data Exchange and Secret Key Agreement
Himanshu Tyagi, Shun Watanabe
Multiple parties observing correlated data seek to recover each other's data and attain omniscience. To that end, they communicate interactively over a noiseless broadcast channel…
Interactive Communication for Data Exchange
Himanshu Tyagi, Pramod Viswanath, Shun Watanabe
Two parties observing correlated data seek to exchange their data using interactive communication. How many bits must they communicate? We propose a new interactive protocol for da…
Information Complexity Density and Simulation of Protocols
Himanshu Tyagi, Shaileshh Venkatakrishnan, Pramod Viswanath +1
Two parties observing correlated random variables seek to run an interactive communication protocol. How many bits must they exchange to simulate the protocol, namely to produce a…
Universal Hashing for Information Theoretic Security
Himanshu Tyagi, Alexander Vardy
The information theoretic approach to security entails harnessing the correlated randomness available in nature to establish security. It uses tools from information theory and cod…
Secret Key Agreement: General Capacity and Second-Order Asymptotics
Masahito Hayashi, Himanshu Tyagi, Shun Watanabe
We revisit the problem of secret key agreement using interactive public communication for two parties and propose a new secret key agreement protocol. The protocol attains the secr…
Strong Converse for a Degraded Wiretap Channel via Active Hypothesis Testing
Masahito Hayashi, Himanshu Tyagi, Shun Watanabe
We establish an upper bound on the rate of codes for a wiretap channel with public feedback for a fixed probability of error and secrecy parameter. As a corollary, we obtain a stro…
Estimating Renyi Entropy of Discrete Distributions
Jayadev Acharya, Alon Orlitsky, Ananda Theertha Suresh +1
It was recently shown that estimating the Shannon entropy of a discrete -symbol distribution requires samples, a number that grows near-line…
Converses for Secret Key Agreement and Secure Computing
Himanshu Tyagi, Shun Watanabe
We consider information theoretic secret key agreement and secure function computation by multiple parties observing correlated data, with access to an interactive public communica…
How Many Queries Will Resolve Common Randomness?
Himanshu Tyagi, Prakash Narayan
A set of m terminals, observing correlated signals, communicate interactively to generate common randomness for a given subset of them. Knowing only the communication, how many dir…
Common Information and Secret Key Capacity
Himanshu Tyagi
We study the generation of a secret key of maximum rate by a pair of terminals observing correlated sources and with the means to communicate over a noiseless public com- municatio…
Distributed Function Computation with Confidentiality
Himanshu Tyagi
A set of terminals observe correlated data and seek to compute functions of the data using interactive public communication. At the same time, it is required that the value of a pr…
When is a Function Securely Computable?
Himanshu Tyagi, Prakash Narayan, Piyush Gupta
A subset of a set of terminals that observe correlated signals seek to compute a given function of the signals using public communication. It is required that the value of the func…
Capacity Region of a State Dependent Degraded Broadcast Channel with Noncausal Transmitter CSI
Himanshu Tyagi
This paper has been withdrawn due to a mistake in the previous version.