A Different Look at Secure Distributed Computation

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1997
Accession Number
ADA465315

Entities

People

  • Paul Syverson

Organizations

  • United States Naval Research Laboratory

Tags

Communities of Interest

  • Cyber
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Agreements
  • Computations
  • Computer Network Security
  • Computers
  • Cooperative Games
  • Cybersecurity
  • Distributed Computing
  • Game Theory
  • Guarantees
  • Information Operations
  • Mathematical Models
  • Mathematics
  • Models
  • Operating Systems
  • Probability
  • Topology
  • Zero-Sum Games

Fields of Study

  • Mathematics

Readers

  • Computer Networking
  • Irregular Warfare and Special Operations Cyberspace Operations against Adversarial Threats.
  • Theoretical Analysis.