Information-Based Security Protocols for Ideal Agents
Final rept., 1 Oct 2004-1 Oct 2005
OTAGO UNIV DUNEDIN (NEW ZEALAND)
Pagination or Media Count:
The objective to model check properties of protocols for card playing agents has been met. Beyond the objectives we are pleased to report that we have made a state-of-the-art comparison of epistemic model checkers. We have paid some attention to other protocols, namely different generalizations of card playing protocols. We applied model checking tools to a rather different protocol that has the form of a riddle about natural numbers. We did not get to the promised library of protocols. The reason for that is that the computational complexity of model checking protocols is far higher than we anticipated. For example, the most basic generalization of the five-hands protocol takes up to 5 hours to model check - and this can only be achieved by real hacking, a proper structural programming approach has too high complexity. Some theoreticaltechnical progress would be necessary before further challenges can be undertaken. We think the project results are appreciated by the academic community. Publications have already been quoted in research proposals, other publications or submissions, and have directed other researchers to use the compared model checkers.
- Operations Research
- Computer Systems Management and Standards