Parsimonious downgrading and decision trees applied to the inference problem
Proceedings of the 1998 workshop on New security paradigms
Typed MSR: Syntax and Examples
MMM-ACNS '01 Proceedings of the International Workshop on Information Assurance in Computer Networks: Methods, Models, and Architectures for Network Security
Broadening the Scope of Fault Tolerance within Secure Services
Revised Papers from the 8th International Workshop on Security Protocols
Group Principals and the Formalization of Anonymity
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Incentive-based modeling and inference of attacker intent, objectives, and strategies
Proceedings of the 10th ACM conference on Computer and communications security
Incentive-based modeling and inference of attacker intent, objectives, and strategies
ACM Transactions on Information and System Security (TISSEC)
Inoculation strategies for victims of viruses and the sum-of-squares partition problem
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Inoculation strategies for victims of viruses and the sum-of-squares partition problem
Journal of Computer and System Sciences
Fair Exchange Is Incomparable to Consensus
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Data access specification and the most powerful symbolic attacker in MSR
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
Strategic multiway cut and multicut games
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
A bidirectional Bluetooth authentication scheme based on game-theoretic framework
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
Network security situation assessment based on stochastic game model
ICIC'11 Proceedings of the 7th international conference on Advanced Intelligent Computing
| Hi-index | 0.00 |
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.