Vés al contingut (premeu Retorn)

MAK Crypto Seminar

Information Inequalities, secret sharing and applications

22/04/2016 des de/d' 11:30"
Campus Nord UPC, Building C3, Room 204a (2nd floor)

Given some random variables X_1, ... , X_n, one can form a vector of size 2^n-1 with the entropies of subsets of variables: [H(X_1), H(X_2), H(X_1,X_2), ... , H(X_1,...,X_n)]. The set of all possible such vectors is an object in the Euclidean space delimited by hyperplanes: information inequalities. Perhaps the most famous inequality is Shannon's basic inequality H(A,C) + H(B,C) = H(A) + H(A,B,C). We will see which role do these inequalities play in problems like secret sharing. I will also discuss a recent result on the geometry of inequalities based on duality of polymatroid.