称量硬币和保守秘密
Weighing Coins and Keeping Secrets
摘要：
在这篇简短的论文中，我们讨论了一个相对较新的假币问题与一个不寻常的目标：保持隐私，而不是揭示，假币在一组假的和真的硬币。我们介绍了两类解决这个问题的方案-一个是尊重所有硬币的隐私，另一个是只尊重假硬币的隐私-并给出了关于每个的几个结果。我们描述和概括6独特的战略，属于这两类。此外，我们解释了一个解决方案的存在条件，以及显示在选择的情况下，解决方案的最优性的证明。为了准确量化给定解决方案揭示了多少信息，我们还定义了揭示因子和揭示系数;这两个值还可以作为比较不同解决方案相对有效性的手段。最重要的是，通过引入一系列新概念，我们为未来分析这个非常有趣的问题以及与隐私和信息传输有关的许多其他问题奠定了基础。
英文摘要：
In this expository paper we discuss a relatively new counterfeit coin problem with an unusual goal: maintaining the privacy of, rather than revealing, counterfeit coins in a set of both fake and real coins. We introduce two classes of solutions to this problem --- one that respects the privacy of all the coins and one that respects the privacy of only the fake coins --- and give several results regarding each. We describe and generalize 6 unique strategies that fall into these two categories. Furthermore, we explain conditions for the existence of a solution, as well as showing proof of a solution's optimality in select cases. In order to quantify exactly how much information is revealed by a given solution, we also define the revealing factor and revealing coefficient; these two values additionally act as a means of comparing the relative effectiveness of different solutions. Most importantly, by introducing an array of new concepts, we lay the foundation for future analysis of this very interesting problem, as well as many other problems related to privacy and the transfer of information.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
