A different look at secure distributed computation
- 22 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 109-115
- https://doi.org/10.1109/csfw.1997.596797
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
This publication has 11 references indexed in Scilit:
- The design and implementation of a secure auction servicePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Applying the dependability paradigm to computer securityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A network pumpIEEE Transactions on Software Engineering, 1996
- Programming Satan's computerPublished by Springer Nature ,1995
- Knowledge, probability, and adversariesJournal of the ACM, 1993
- Knowledge and common knowledge in a distributed environmentJournal of the ACM, 1990
- Evolution and the Theory of GamesPublished by Cambridge University Press (CUP) ,1982
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980
- Notes on data base operating systemsPublished by Springer Nature ,1978