#### Filter Results:

- Full text PDF available (19)

#### Publication Year

2005

2018

- This year (5)
- Last 5 years (14)
- Last 10 years (33)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Mahdi Cheraghchi, Venkatesan Guruswami
- Journal of Cryptology
- 2013

Non-malleable coding, introduced by Dziembowski et al. (ICSÂ 2010), aims for protecting the integrity of information against tampering attacks in situations where error detection is impossible.â€¦ (More)

- Mahdi Cheraghchi, Ali Hormati, Amin Karbasi, Martin Vetterli
- IEEE Transactions on Information Theory
- 2011

Identification of defective members of large populations has been widely studied in the statistics community under the name of group testing. It involves grouping subsets of items into differentâ€¦ (More)

- Mahdi Cheraghchi
- FCT
- 2009

We study combinatorial group testing schemes for learning dsparse boolean vectors using highly unreliable disjunctive measurements. We consider an adversarial noise model that only limits the numberâ€¦ (More)

We prove that a random linear code over Fq, with probability arbitrarily close to 1, is list decodable at radius 1âˆ’ 1/qâˆ’ with list size L = O(1/ ) and rate R = Î©q( 2/(log(1/ ))). Up to theâ€¦ (More)

We show that all non-negative submodular functions have high noise-stability. As a consequence, we obtain a polynomial-time learning algorithm for this class with respect to any product distributionâ€¦ (More)

- Mahdi Cheraghchi, Amin Karbasi, Soheil Mohajer, Venkatesh Saligrama
- IEEE Transactions on Information Theory
- 2010

Nonadaptive group testing involves grouping arbitrary subsets of n items into different pools. Each pool is then tested and defective items are identified. A fundamental question involves minimizingâ€¦ (More)

- Mahdi Cheraghchi
- Algorithmica
- 2010

The basic goal in combinatorial group testing is to identify a set of up to d defective items within a large population of size nâ‰«d using a pooling strategy. Namely, the items can be grouped togetherâ€¦ (More)

- Mahdi Cheraghchi, Venkatesan Guruswami
- IEEE Transactions on Information Theory
- 2013

Non-malleable codes, introduced by Dziembowski, Pietrzak and Wichs (ICS 2010), encode messages <i>s</i> in a manner so that tampering the codeword causes the decoder to either output <i>s</i> or aâ€¦ (More)

- Mahdi Cheraghchi, FrÃ©dÃ©ric Didier, Amin Shokrollahi
- IEEE Transactions on Information Theory
- 2009

A wiretap protocol is a pair of randomized encoding and decoding functions such that knowledge of a bounded fraction of the encoding of a message reveals essentially no information about the message,â€¦ (More)

- Mahdi Cheraghchi
- Electronic Colloquium on Computational Complexity
- 2005

The rigidity function of a matrix is defined as the minimum number of its entries that need to be changed in order to reduce the rank of the matrix to below a given parameter. Proving a strong enoughâ€¦ (More)