Dear organizers and participants,

I will present a paper:

Zeev Dvir Sivakanth Gopi: 2--server PIR with sub-polynomial communication.

No prerequisites :).

The paper is about retrieval of the i-th bit of the database without revealing any information about i to either server. I will show you original nontrivial result for 2 servers (O(n^1/3)) and also the improvement to sub-polynomial cost.

Have a nice day, see you tomorrow, Tomáš