Computer Science – Cryptography and Security
Scientific paper
2004-04-02
Computer Science
Cryptography and Security
4 pages and 1 figure
Scientific paper
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.
No associations
LandOfFree
Dealing With Curious Players in Secure Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Dealing With Curious Players in Secure Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dealing With Curious Players in Secure Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-145012