5 citations found. Retrieving documents...
Makarychev, K. and Y. Makarychev: 2001, `The Importance of Being Formal'. Mathematical Intelligencer 23(1), 41--42.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Keeping Secrets With Public Communication - van Ditmarsch (2002)   (Correct)

....cards openly (publicly) inform each other about their cards, without the third player learning from any of their cards who holds it This seven cards problem was originally presented at the Moscow Mathematics Olympiad in 2000. A solution and a procedural requirement for it are presented in [MM01] and various solutions are found in [vD01a, vD02] Note that we assume faultless communication: we do not study transmission protocols, but communication protocols, as used in cryptology and coding theory. Also, besides being public, all announcements are assumed to be truthful. In the next ....

....after both announcements #### holds. This is not a good solution, because the underlying protocol that Anne apparently executes mightaswell have resulted in Anne saying that she doesn t have 4, after whichCrowknows that, so ######### holds. We will come back to this later. The bad solution in [MM01] is: Anne says If you don t have 0, then I have #0# 1# 2# and Bill says If you don t have 3, then I have #3# 4# 5# . ii) Indeed, update of the current information state (# ##### # 012#345#6) with [#0 # # 012 # ] and subsequently with [#3 # # 345 # ] results in an information state where ....

[Article contains additional citation context not shown here]

K.S. Makarychev and Yu.S. Makarychev. The importance of being formal. ############ #############, 23(1):41-42, 2001.


Het zeven-kaartenprobleem: kennislogica en multiagentsystemen.. - van Ditmarsch (2002)   (Correct)

....kunnen Anna en Bert elkaar openlijk van hun kaarten op de hoogte brengen, zonder dat Cees van een van hun kaarten leert wie die kaart heeft Dit zeven kaartenprobleem werd gesteld tijdens de Wiskunde Olympiade in Moskou in 2000. Inmiddels is het ook verschenen in de Mathematical Intelligencer [12] en in Natuur Techniek [18,21] Soortgelijke problemen circuleren onder coderingstheoretici [4] Er zijn meerdere goede oplossingen. De Moskouse commissie werd destijds ook geconfronteerd met een aantal foute oplossingen die op het eerste gezicht eigenlijk niet zo onredelijk waren. Om deze te ....

....kent Berts kaarten, ######) # Bert kent Anna s kaarten, ######) # Cees kent geen van Anna s of Berts kaarten. #########) Neem nu verder aan dat de hand van Anna #0# 1# 2# is (schrijf 012) dat de hand van Bert 345 is, en dat Cees kaart 6 heeft. De foute oplossing van de Olympiade genoemd in [12] is: ######## ######## ########## ## ###### ### ######## hans cs.otago.ac.nz ### #### ### ####### #### ## ### ##### #### ### ################# 1 Anna zegt: Als jij 0 niet hebt, dan heb ik 012. en Bert zegt: Als jij 3 niet hebt, dan heb ik 345. #) Waarom lijkt dit een oplossing ....

K.S. Makarychev and Yu.S. Makarychev. The importance of being formal. ##### ######## #############, 23(1):41-42, 2001. 11


The Russian cards problem: a case study in cryptography with.. - van Ditmarsch (2002)   (1 citation)  (Correct)

....2000. I therefore propose to name it the Russian cards problem. Originally, the cards were named 0#####6. Besides being public, all announcements are assumed to be truthful. One solution (somewhat suggested by the names of the cards) and a procedural requirement for solutions are presented in [MM01] That same solution and various others are found in [vD01a, vD02b] To start with, we present one bad and one good solution. Call the players Anne, Bill and Crow, and the cards 0# #### 6, and suppose Anne holds #0# 1# 2#,Bill#3# 4# 5#,andCrow card 6. If Anne says: I or Bill have the cards ....

....whereas we compute concrete exchanges for suchdeals. The epistemic analysis of De nition 10 also applies to executions of cryptographic protocols, because these are sequences of announcements. For example, our analysis maycorrespondtoa procedural requirement for such protocols that is given in [MM01] The authors haveprovided me with a partial translation of their original work, in Russian [Mak01] The in nitary avour of what they de ne as a protocol appears to relate to the xed pointcharacter of common knowledge. Wecontinue with the presentation of solutions for the seven cards ....

K.S. Makarychev and Yu.S. Makarychev. The importance of being formal. ############ #############, 23(1):41-42, 2001.


The secret of My Success - van Ditmarsch, Kooi (2004)   (1 citation)  (Correct)

No context found.

Makarychev, K. and Y. Makarychev: 2001, `The Importance of Being Formal'. Mathematical Intelligencer 23(1), 41--42.


Safe Communication for Card Players By.. - Albert, Atkinson, .. (2003)   (Correct)

No context found.

K.S. Makarychev and Yu.S. Makarychev. The importance of being formal. Mathematical Intelligencer, 23(1):41--42, 2001.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC