DocumentCode
2508001
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
fYear
1997
fDate
10-12 Jun 1997
Firstpage
109
Lastpage
115
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Security Foundations Workshop, 1997. Proceedings., 10th
Conference_Location
Rockport, MA
ISSN
1063-6900
Print_ISBN
0-8186-7990-5
Type
conf
DOI
10.1109/CSFW.1997.596797
Filename
596797
Link To Document