Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Tarik Kaced"'
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Universitat Politècnica de Catalunya (UPC)
We present a new improvement in the linear programming technique to derive lower bounds on the information ratio of secret sharing schemes. We obtain non-Shannon-type bounds without using information inequalities explicitly. Our new technique makes i
Autor:
Tarik Kaced
Publikováno v:
IEEE Transactions on Information Theory. 64:4379-4381
We use the notion of polymatroid duality to define the formal dual of an information inequality. We use it to show that the closure of the entropy region for $n\ge 5$ is not closed under polymatroid duality.
Publikováno v:
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2018, 64 (5), pp.3610-3615. ⟨10.1109/TIT.2018.2806486⟩
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2018, 64 (5), pp.3610-3615. ⟨10.1109/TIT.2018.2806486⟩
We show that the inequality $H(A | B,X) + H(A | B,Y) \leqslant H(A | B)$ for jointly distributed random variables $A,B,X,Y$ , which does not hold in general case, holds under some natural condition on the support of the probability distribution of $A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::11a13b0377d2992dff6eca31e31773e7
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01793775
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01793775
Publikováno v:
Advances in Cryptology – EUROCRYPT 2018 ISBN: 9783319783802
EUROCRYPT (1)
EUROCRYPT (1)
We present a new improvement in the linear programming technique to derive lower bounds on the information ratio of secret sharing schemes. We obtain non-Shannon-type bounds without using information inequalities explicitly. Our new technique makes i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e49706ab9e3d3a25332f492485a99811
https://doi.org/10.1007/978-3-319-78381-9_22
https://doi.org/10.1007/978-3-319-78381-9_22
Publikováno v:
Proceedings of the IEEE. 103:1883-1913
The capacity for multiterminal secret-key agreement inspires a natural generalization of Shannon’s mutual information from two random variables to multiple random variables. Under a general source model without helpers, the capacity is shown to be
Autor:
Tarik Kaced, Andrei Romashchenko
Publikováno v:
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2013, 59 (11), pp.7149-7167. ⟨10.1109/TIT.2013.2274614⟩
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2013, 59 (11), pp.7149-7167. ⟨10.1109/TIT.2013.2274614⟩
We study conditional linear information inequalities, i.e., linear inequalities for Shannon entropy that hold for distributions whose entropies meet some linear constraints. We prove that some conditional information inequalities cannot be extended t
We formulate an info-clustering paradigm based on a multivariate information measure, called multivariate mutual information, that naturally extends Shannon's mutual information between two random variables to the multivariate case involving more tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fcf64a9e591ac8e2796fa8afe7849bf5
Autor:
Chung Chan, Ali Al-Bashabsheh, Javad B. Ebrahimi, Tarik Kaced, Swanand Kadhe, Tie Liu, Alex Sprintson, Muxi Yan, Qiaoqiao Zhou
Publikováno v:
2015 International Symposium on Network Coding (NetCod).
Publikováno v:
ISIT
We consider a new group testing model wherein each item is a binary random variable defined by an a priori probability of being defective. We assume that each probability is small and that items are independent, but not necessarily identically distri
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Farràs, O, Hansen, T B, Kaced, T & Padró, C 2014, Optimal non-perfect uniform secret sharing schemes . in J Garay & R Gennaro (eds), Advances in Cryptology – CRYPTO 2014 : 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part II . Springer, Lecture Notes in Computer Science, vol. 8617, pp. 217-234, Annual International Cryptology Conference, Santa Barbara, United States, 17/08/2014 . https://doi.org/10.1007/978-3-662-44381-1_13
Advances in Cryptology – CRYPTO 2014 ISBN: 9783662443804
CRYPTO (2)
Recercat. Dipósit de la Recerca de Catalunya
instname
Universitat Politècnica de Catalunya (UPC)
Farràs, O, Hansen, T B, Kaced, T & Padró, C 2014, Optimal non-perfect uniform secret sharing schemes . in J Garay & R Gennaro (eds), Advances in Cryptology – CRYPTO 2014 : 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part II . Springer, Lecture Notes in Computer Science, vol. 8617, pp. 217-234, Annual International Cryptology Conference, Santa Barbara, United States, 17/08/2014 . https://doi.org/10.1007/978-3-662-44381-1_13
Advances in Cryptology – CRYPTO 2014 ISBN: 9783662443804
CRYPTO (2)
Recercat. Dipósit de la Recerca de Catalunya
instname
A secret sharing scheme is non-perfect if some subsets of participants that cannot recover the secret value have partial information about it. The information ratio of a secret sharing scheme is the ratio between the maximum length of the shares and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e122ef0ae74c0288e1aa31d414ee960a