Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Safe communication for card players by combinatorial designs for two-step protocols
 

Summary: Safe communication for card players by
combinatorial designs for two-step protocols
M. H. Albert  R. E. L. Aldred y M. D. Atkinson 
H. P. van Ditmarsch  C. C. Handley 
October 1, 2003
Abstract
Two parties A and B select a cards and b cards from a known deck
and a third party C receives the remaining c cards. We consider methods
whereby A can, in a single message, publicly inform B of her hand without
C learning any card held by A or by B. Conditions on a; b; c are given for
the existence of an appropriate message.
1 Introduction
At the Moscow 2000 Mathematical Olympiad the following problem was posed:
From a pack of seven known cards two players each draw in turn
three cards. A third player gets the remaining card. How can the
players with three cards openly inform each other about their cards
without the third player learning any of the cards in their hands?
This type of problem (with the same \card" terminology) has been studied in
[1] as a model for communication among a team of computationally unlimited
(perfectly rational) players including an eavesdropper, and this has been further

  

Source: Atkinson, Mike - Department of Computer Science, University of Otago

 

Collections: Computer Technologies and Information Sciences