moi

Tarik Kaced



I was a post-doctoral fellow at LIP6.
I was a post-doctoral fellow at LACL.
Until Feb 2015, I was a post-doctoral fellow at the Institute of Network Coding, the Chinese University of Hong Kong (CUHK).
I completed my PhD in Dec 2012 at LIRMM (UM2) under the supervision of Alexander Shen and Andrei Romashchenko.
I studied the theories of Secret Sharing and Kolmogorov Complexity.
My thesis is available here.

Keywords:

information theory, cryptography, secret sharing, information inequalities, entropy, Kolmogorov Complexity, computability, combinatorics, matroids.

Contact

Email:
tarik DOT kaced AT ens-lyon DOT org

Research

  1. Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing , with O. Farràs, S. Martin and C. Padró, 2017 EUROCRYPT 2018, ePrint
  2. Conditional Information Inequalities and Combinatorial Applications, with A.Romashchenko and N. Vereshchagin, 2014, IEEE Transactions on Information Theory, arXiv:1501.04867 [video]
  3. Information Inequalities are not Closed Under Polymatroid Duality, 2018, IEEE Transactions on Information Theory, arXiv:1611.04109
  4. On the Information Ratio of Non-perfect Secret Sharing Schemes , with O. Farràs, T.Hansen and C. Padró, Algorithmica,
  5. Info-Clustering: A Mathematical Theory for Data Clustering, with C. Chan, A. Al-Bashabsheh, T. Liu, Q. Zhou, 2016, IEEE Transactions on Molecular, Biological, and Multi-Scale Communications
  6. Successive Omniscience, C. Chan, A. Al-Bashabsheh, J.B. Ebrahimi, S. Kadhe, T .Liu, A. Sprintson, M. Yan, Q. Zhou, 2015, NetCod, link.
  7. Multivariate Mutual Information Inspired by Secret Key Agreement, with C. Chan, A. Al-Bashabsheh, J. Ebrahimid, and T. Liu, 2015, Proc. of the IEEE, vol.103 , no.10 , link.
  8. Optimal Non-Perfect Uniform Secret Sharing Schemes, with O. Farràs, T.Hansen and C. Padró, CRYPTO 2014, link [video]
  9. Group Testing with Prior Statistics, with T. Li, C.L. Chan, W. Huang and S. Jaggi, ISIT 2014, arXiv:1401.3667
  10. Equivalence of Two Proof Techniques for Non-Shannon-type Inequalities, IEEE Proceedings ISIT 2013, pp. 236-240, arXiv:1302.2994
  11. Conditional Information Inequalities for Entropic and Almost Entropic Points, with A. Romashchenko, 2013, IEEE Transactions on Information Theory arXiv:1207.5742
  12. Conditional and unconditional information inequalities: an algebraic example, with A. Romashchenko, unpublished short note, arXiv:1201.6398
  13. On the Non-robustness of Essentially Conditional Information Inequalities, with A. Romashchenko, ITW 2012, arXiv:1207.5458
  14. On Essentially Conditional Information Inequalities, with A. Romashchenko, IEEE Proceedings ISIT 2011, pp. 1935-1939, arXiv:1103.2545
  15. Quasi-Perfect Secret Sharing, Accepted in Information and Computation, arXiv:1103.2544
  16. Almost Perfect Secret Sharing, IEEE Proceedings ISIT 2011, pp. 1603-1607, link

Teaching

html