一种用于纸牌游戏机的安全附加协议
A secure additive protocol for card players
摘要：
考虑三个玩家Alice、Bob和Cath，他们分别持有a、b和c张牌，这三张牌来自一副d = a + b + c的牌。牌都是不同的，玩家只知道自己的牌。假设Alice和Bob希望在Cath不知道Alice或Bob是否持有特定卡片的情况下相互传递他们的卡片。把牌看作连续的自然数0，1，.我们研究了当Alice或Bob可以安全地宣布他们所持有的卡的总和模一个适当选择的整数时的一般条件。我们证明了这在a，b> 2和c = 1时成立。因为Cath只拿一张牌，这也意味着Alice和Bob会从其他玩家的公告中得知牌的处理。
英文摘要：
Consider three players Alice, Bob and Cath who hold a, b and c cards, respectively, from a deck of d=a+b+c cards. The cards are all different and players only know their own cards. Suppose Alice and Bob wish to communicate their cards to each other without Cath learning whether Alice or Bob holds a specific card. Considering the cards as consecutive natural numbers 0,1,..., we investigate general conditions for when Alice or Bob can safely announce the sum of the cards they hold modulo an appropriately chosen integer. We demonstrate that this holds whenever a,b>2 and c=1. Because Cath holds a single card, this also implies that Alice and Bob will learn the card deal from the other player's announcement.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
