Sciweavers

796 search results - page 59 / 160
» Generalized Commitment Alignment
Sort
View
ATAL
2008
Springer
14 years 1 days ago
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
JCS
2006
157views more  JCS 2006»
13 years 10 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
ICSE
2010
IEEE-ACM
13 years 8 months ago
Identifying crosscutting concerns using historical code changes
Detailed knowledge about implemented concerns in the source code is crucial for the cost-effective maintenance and successful evolution of large systems. Concern mining techniques...
Bram Adams, Zhen Ming Jiang, Ahmed E. Hassan
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
14 years 10 months ago
Zero-knowledge against quantum attacks
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
John Watrous
EMSOFT
2005
Springer
14 years 3 months ago
Model-based analysis of distributed real-time embedded system composition
Key challenges in distributed real-time embedded (DRE) system developments include safe composition of system components and mapping the functional specifications onto the target...
Gabor Madl, Sherif Abdelwahed