loading...
A Different Look at Secure Distributed Computation
Rockport, Massachusetts June 10-June 12
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSFW.1997.59679710th Computer Security Foundations Wo ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Paul F. Syverson, Naval Research Laboratory
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.
Index Terms:
Byzantine failure, Security, Game Theory, Coordinated attack, Distributed Computing
Citation:
Paul F. Syverson, "A Different Look at Secure Distributed Computation," csfw, pp.109, 10th Computer Security Foundations Workshop (CSFW '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.