Dealing With Curious Players in Secure Networks
| dc.creator | Wagner, Liam | |
| dc.date | 2004-04-02 | |
| dc.date.accessioned | 2026-07-07T03:21:04Z | |
| dc.date.available | 2026-07-07T03:21:04Z | |
| dc.description | 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. | |
| dc.description | 4 pages and 1 figure | |
| dc.identifier | https://arxiv.org/abs/cs/0404004 | |
| dc.identifier | http://arxiv.org/abs/cs/0404004 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32060 | |
| dc.subject | Cryptography and Security | |
| dc.subject | Computer Science and Game Theory | |
| dc.subject | Multiagent Systems | |
| dc.subject | C.2.0; I.2.1 | |
| dc.title | Dealing With Curious Players in Secure Networks | |
| dc.type | text |