#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2013

2017

- This year (2)
- Last 5 years (10)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Salman Salamatian, Amy Zhang, +5 authors Nina Taft
- 2013 IEEE Global Conference on Signal and…
- 2013

We propose a practical methodology to protect a user's private data, when he wishes to publicly release data that is correlated with his private data, in the hope of getting some utility. Our approach relies on a general statistical inference framework that captures the privacy threat under inference attacks, given utility constraints. Under this framework,… (More)

- Ali Makhdoumi, Salman Salamatian, Nadia Fawaz, Muriel Médard
- 2014 IEEE Information Theory Workshop (ITW 2014)
- 2014

We focus on the privacy-utility trade-off encountered by users who wish to disclose some information to an analyst, that is correlated with their private data, in the hope of receiving some utility. We rely on a general privacy statistical inference framework, under which data is transformed before it is disclosed, according to a probabilistic privacy… (More)

- Salman Salamatian, Amy Zhang, +5 authors Nina Taft
- IEEE Journal of Selected Topics in Signal…
- 2015

We propose a practical methodology to protect a user's private data, when he wishes to publicly release data that is correlated with his private data, to get some utility. Our approach relies on a general statistical inference framework that captures the privacy threat under inference attacks, given utility constraints. Under this framework, data is… (More)

- Salman Salamatian, Muriel Médard, Emre Telatar
- 2015 IEEE International Symposium on Information…
- 2015

We introduce a property that we call Successive Description property for Slepian Wolf coding. We show that Monotone-Chain Polar Codes can be used to construct low-complexity codes that satisfy this property. We discuss applications of this property to network coding problems.

- Salman Salamatian, Asaf Cohen, Muriel Médard
- ISITA
- 2016

—Consider a multi-source network coding problem with correlated sources. While the fundamental limits are known, achieving them, in general, involves a computational burden due to the complex decoding process. Efficient solutions, on the other hand, are by large based on source and network coding separation, thus imposing strict topological constraints on… (More)

We study the problem of a user who has both public and private data, and wants to release the public data, e.g. to a recommendation service, yet simultaneously wants to protect his private data from being inferred via big data analytics. This problem has previously been formulated as a convex optimization problem with linear constraints where the objective… (More)

- Salman Salamatian, Asaf Cohen, Muriel Médard
- ArXiv
- 2016

MIT Abstract—Consider two correlated sources X and Y generated from a joint distribution pX,Y. Their Gács-Körner Common Information, a measure of common information that exploits the combinatorial structure of the distribution pX,Y , leads to a source decomposition that exhibits the latent common parts in X and Y. Using this source decomposition we… (More)

- Wasim Huleihel, Salman Salamatian, Neri Merhav, Muriel Médard
- ArXiv
- 2017

This paper considers the problem of channel coding over Gaussian intersymbol interference (ISI) channels with a given metric decoding rule. Specifically, it is assumed that the mismatched decoder has an incorrect assumption on the impulse response function. The mismatch capacity is the highest achievable rate for a given decoding rule. Existing lower bounds… (More)

- Salman Salamatian, Asaf Cohen, Muriel Médard
- 2016 International Symposium on Information…
- 2016

Consider a multi-source multicast network coding problem with correlated sources. While the fundamental limits are known, achieving them, in general, involves a computational burden due to the complex decoding process. Efficient solutions, on the other hand, are by large based on source and network coding separation, thus imposing strict topological… (More)

- Salman Salamatian, Ahmad Beirami, Asaf Cohen, Muriel Médard
- ArXiv
- 2017

We study a notion of guesswork, where multiple agents intend to launch a coordinated brute-force attack to find a single binary secret string, and each agent has access to side information generated through either a BEC or a BSC. The average number of trials required to find the secret string grows exponentially with the length of the string, and the rate… (More)

- ‹
- 1
- ›