Title :
A different look at secure distributed computation
Author :
Syverson, Paul F.
Author_Institution :
Center for High Assurance Comput. Syst., Naval Res. Lab., Washington, DC, USA
Abstract :
We discuss various aspects of secure distributed computation and look at weakening both the goals of such computation and the assumed capabilities of adversaries. We present a new protocol for a conditional form of probabilistic coordination and present a model of secure distributed computation in which friendly and hostile nodes are represented in competing interwoven networks of nodes. It is suggested that reasoning about goals, risks, tradeoffs, etc. for this model be done in a game theoretic framework
Keywords :
distributed processing; game theory; protocols; security of data; adversaries; competing interwoven networks; conditional form; friendly nodes; game theoretic framework; hostile nodes; probabilistic coordination; protocol; secure distributed computation; Computational modeling; Computer crashes; Computer networks; Distributed computing; Game theory; Laboratories; Network topology; Protocols;
Conference_Titel :
Computer Security Foundations Workshop, 1997. Proceedings., 10th
Conference_Location :
Rockport, MA
Print_ISBN :
0-8186-7990-5
DOI :
10.1109/CSFW.1997.596797
