La lliçó inaugural, impartida per Carles Padró, professor titular de la UPC al Departament de Matemàtica Aplicada IV, portarà per títol: Alan Turing, màquines i enigmes. En el decurs de la conferència s'explicarà les dues ...

Linear information and rank inequalities as, for instance, Ingleton inequality, are useful tools in information theory and matroid theory. Even though many such inequalities have been found, it seems that most of them ...

One important result in secret sharing is the Brickell-Davenport Theorem: every ideal perfect secret sharing scheme de nes a matroid that is uniquely determined by the access structure. Even though a few attempts have been ...

Hierarchical secret sharing is among the most natural generalizations of threshold secret sharing, and it has attracted a lot of attention from the invention of secret sharing until nowadays. Several constructions of ideal ...

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. ...

We present new families of access structures that, similarly to the multilevel and compartmented access structures introduced in previous works, are natural generalizations of threshold secret sharing. Namely, they admit ...

Multiplicative linear secret sharing is a fundamental notion in the area of secure multi- party computation (MPC) and, since recently, in the area of two-party cryptography as well. In a nutshell, this notion guarantees ...