
Navid Talebanfard
 (IM)

A separator theorem for hypergraphs and a CSPSAT algorithm

Abstract:

I'll show how to remove a small number of edges from a uniform hypergraph of small vertex degree to break it
into small connected components. I'll use it to give a CSPSAT algorithm for CSPs with small variable frequency.
This is joint work with Vojt?ch Rödl.

Hoeteck Wee
 (CNRS and ENS)

AttributeBased Encryption and InformationTheoretic Crypto

Abstract:

Can we encrypt data while enabling finegrained access control, as is necessary to protect big, complex data? In this talk, we will survey how addressing this question led to new lower and upper bounds in informationtheoretic cryptography and secret sharing, which in turn came from building new connections to communication complexity and private informationretrieval.
Michal Koucky, Pavel Pudlak
organizers