October 16th at 17:30, in ILLC Seminar Room (F1.15)
In the Russian cards problem, Alice, Bob and Cath draw a,b and c, respectively, from a publicly known deck. Alice and Bob must then communicate their cards to each other without Cath learning who holds a single card. It is possible to construct a geometric solution for an infinite amount of card deals, exchanging information securely in a way that ignores notions of complexity. To ensure an even higher level of security, we can also bound the probabilistic information that Cath recieves as a consequence of the exchange. We will then have constructed an unconditionally secure information exchange protocol.