Sciweavers

335 search results - page 48 / 67
» Reasoning about Probabilistic Security Using Task-PIOAs
Sort
View
77
Voted
CONCUR
2007
Springer
15 years 3 months ago
Strategy Logic
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...
Krishnendu Chatterjee, Thomas A. Henzinger, Nir Pi...
DBSEC
2010
152views Database» more  DBSEC 2010»
14 years 11 months ago
Modelling Dynamic Access Control Policies for Web-Based Collaborative Systems
Abstract. We present a modelling language, called X-Policy, for webbased collaborative systems with dynamic access control policies. The access to resources in these systems depend...
Hasan Qunoo, Mark Ryan
PDSE
2000
91views more  PDSE 2000»
14 years 11 months ago
A Formalism for Hierarchical Mobile Agents
This paper presents a theoretical and practical framework for constructing and reasoning about mobile agents. The framework is formulated as a process calculus and has two contrib...
Ichiro Satoh
ATAL
2011
Springer
13 years 9 months ago
Solving Stackelberg games with uncertain observability
Recent applications of game theory in security domains use algorithms to solve a Stackelberg model, in which one player (the leader) first commits to a mixed strategy and then th...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
SIGMOD
2009
ACM
185views Database» more  SIGMOD 2009»
15 years 9 months ago
Attacks on privacy and deFinetti's theorem
In this paper we present a method for reasoning about privacy using the concepts of exchangeability and deFinetti's theorem. We illustrate the usefulness of this technique by...
Daniel Kifer