Ni Ding | DeepAI

AI Chat

Featured Co-authors

Farhad Farokhi
41 publications
Parastoo Sadeghi
35 publications
David Smith
20 publications
Thierry Rakotoarivelo
13 publications
Yucheng Liu
11 publications
Rodney A. Kennedy
2 publications
Mohammad Amin Zarrabian
2 publications

∙ 01/19/2022

Kantorovich Mechanism for Pufferfish Privacy

Pufferfish privacy achieves ϵ-indistinguishability over a set of secret ...

0 Ni Ding, et al. ∙

∙ 10/10/2021

Enhancing Utility in the Watchdog Privacy Mechanism

This paper is concerned with enhancing data utility in the privacy watch...

0 Mohammad Amin Zarrabian, et al. ∙

∙ 01/26/2021

α-Information-theoretic Privacy Watchdog and Optimal Privatization Scheme

This paper proposes an α-lift measure for data privacy and determines th...

0 Ni Ding, et al. ∙

∙ 01/24/2021

A Linear Reduction Method for Local Differential Privacy and Log-lift

This paper considers the problem of publishing data X while protecting c...

0 Ni Ding, et al. ∙

∙ 10/19/2020

On Properties and Optimization of Information-theoretic Privacy Watchdog

We study the problem of privacy preservation in data sharing, where S is...

0 Parastoo Sadeghi, et al. ∙

∙ 04/23/2020

Measuring Information Leakage in Non-stochastic Brute-Force Guessing

We propose an operational measure of information leakage in a non-stocha...

0 Farhad Farokhi, et al. ∙

∙ 01/19/2020

Privacy-Utility Tradeoff in a Guessing Framework Inspired by Index Coding

This paper studies the tradeoff in privacy and utility in a single-trial...

0 Yucheng Liu, et al. ∙

∙ 12/26/2019

Part II: A Practical Approach for Successive Omniscience

In Part I, we studied the communication for omniscience (CO) problem and...

0 Ni Ding, et al. ∙

∙ 12/26/2019

Part I: Improving Computational Efficiency of Communication for Omniscience

Communication for omniscience (CO) refers to the problem where the users...

0 Ni Ding, et al. ∙

∙ 11/12/2019

Developing Non-Stochastic Privacy-Preserving Policies Using Agglomerative Clustering

We consider a non-stochastic privacy-preserving problem in which an adve...

0 Ni Ding, et al. ∙

∙ 03/03/2019

Improving Computational Efficiency of Communication for Omniscience and Successive Omniscience

For a group of users in V where everyone observes a component of a discr...

0 Ni Ding, et al. ∙

∙ 02/11/2019

Attaining Fairness in Communication for Omniscience

This paper studies how to attain fairness in communication for omniscien...

0 Ni Ding, et al. ∙

∙ 01/20/2019

A Submodularity-based Agglomerative Clustering Algorithm for the Privacy Funnel

For the privacy funnel (PF) problem, we propose an efficient iterative a...

0 Ni Ding, et al. ∙

∙ 05/04/2018

Fairness in Multiterminal Data Compression: A Splitting Method for The Egalitarian Solution

This paper proposes a novel splitting (SPLIT) algorithm to achieve fairn...

0 Ni Ding, et al. ∙

∙ 04/05/2018

Fairness in Multiterminal Data Compression: Decomposition of Shapley Value

We consider the problem of how to determine a fair source coding rate al...

0 Ni Ding, et al. ∙

∙ 04/05/2018

Distributed Data Compression in Sensor Clusters: A Maximum Independent Flow Approach

Let a cluster (network) of sensors be connected by the communication lin...

0 Ni Ding, et al. ∙

∙ 08/21/2015

On Monotonicity of the Optimal Transmission Policy in Cross-layer Adaptive m-QAM Modulation

This paper considers a cross-layer adaptive modulation system that is mo...

0 Ni Ding, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world