A case study in almost-perfect security for unconditionally secure communication

Esteban Landerreche, David Fernández-Duque

In the Russian cards problem, Alice, Bob and Cath draw $a$, $b$ and $c$ cards, respectively, from a publicly known deck. Alice and Bob must then communicate their cards to each oth…