在安全网络中处理好奇的玩家
Dealing With Curious Players in Secure Networks
摘要：
在安全通信网络中，存在大量需要处理的用户行为问题。好奇的玩家对这样一个网络的完整性构成了非常真实和严重的威胁。通过穿越网络，一个好奇的玩家可以发现秘密信息，用户不需要知道，只要假装成忠诚度检查。忠诚度检查只是为了衡量网络对恶意行为的玩家的完整性。我们希望提出一种方法，它可以处理好奇的球员试图获得“需要知道”的信息使用相结合的容错，密码学和博弈论的方法。
英文摘要：
In secure communications networks there are a great number of user behavioural problems, which need to be dealt with. Curious players pose a very real and serious threat to the integrity of such a network. By traversing a network a Curious player could uncover secret information, which that user has no need to know, by simply posing as a loyalty check. Loyalty checks are done simply to gauge the integrity of the network with respect to players who act in a malicious manner. We wish to propose a method, which can deal with Curious players trying to obtain "Need to Know" information using a combined Fault-tolerant, Cryptographic and Game Theoretic Approach.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
