Sciweavers

335 search results - page 22 / 67
» Reasoning about Probabilistic Security Using Task-PIOAs
Sort
View
JCS
2006
157views more  JCS 2006»
13 years 7 months ago
Analysis of probabilistic contract signing
We present three case studies, investigating the use of probabilistic model checking to automatically analyse properties of probabilistic contract signing protocols. We use the pr...
Gethin Norman, Vitaly Shmatikov
ENTCS
2007
110views more  ENTCS 2007»
13 years 7 months ago
A Bayesian Model for Event-based Trust
The application scenarios envisioned for ‘global ubiquitous computing’ have unique requirements that are often incompatible with traditional security paradigms. One alternativ...
Mogens Nielsen, Karl Krukow, Vladimiro Sassone
IJCSA
2007
88views more  IJCSA 2007»
13 years 7 months ago
A New Quantitative Trust Model for Negotiating Agents using Argumentation
In this paper, we propose a new quantitative trust model for argumentation-based negotiating agents. The purpose of such a model is to provide a secure environment for agent negot...
Jamal Bentahar, John-Jules Ch. Meyer
UTP
2010
13 years 5 months ago
Unifying Theories of Confidentiality
Abstract. This paper presents a framework for reasoning about the security of confidential data within software systems. A novelty is that we use Hoare and He's Unifying Theor...
Michael J. Banks, Jeremy L. Jacob
ENTCS
2007
129views more  ENTCS 2007»
13 years 7 months ago
Protocol Composition Logic (PCL)
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
Anupam Datta, Ante Derek, John C. Mitchell, Arnab ...