Combinatorial Solutions Providing Improved Security for the Generalized Russian Cards Problem

The authors present the first formal mathematical presentation of the generalized Russian cards problem, and provide rigorous security definitions that capture both basic and extended versions of weak and perfect security notions. In the generalized Russian cards problem, three players, Alice, Bob, and Cathy, are dealt a deck of n cards, each given a, b, and c cards, respectively. The goal is for Alice and Bob to learn each other's hands via public communication, without Cathy learning the fate of any particular card. The basic idea is that Alice announces a set of possible hands she might hold, and Bob, using knowledge of his own hand, should be able to learn Alice's cards from this announcement, but Cathy should not.

Provided by: University of Washington School of Public Health & Community Medicine Topic: Security Date Added: Jul 2012 Format: PDF

Find By Topic