Sciweavers

1059 search results - page 85 / 212
» Modeling Security Protocols as Games
Sort
View
CTRSA
2009
Springer
179views Cryptology» more  CTRSA 2009»
15 years 7 months ago
Adaptively Secure Two-Party Computation with Erasures
In the setting of multiparty computation a set of parties with private inputs wish to compute some joint function of their inputs, whilst preserving certain security properties (l...
Andrew Y. Lindell
106
Voted
ATAL
2011
Springer
14 years 13 days 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
FORTE
2003
15 years 1 months ago
A Lightweight Formal Analysis of a Multicast Key Management Scheme
Abstract. This paper describes the analysis of Pull-Based Asynchronous Rekeying Framework (ARF), a recently proposed solution to the scalable group key management problem in secure...
Mana Taghdiri, Daniel Jackson
125
Voted
ICIW
2007
IEEE
15 years 18 days ago
Analysis of Web Services Secure Conversation with Formal Methods
Web Services Secure Conversation extends Web Services Trust to provide mechanisms for establishing security consecurity context is an abstract concept that refers an authenticated...
M. Llanos Tobarra, Diego Cazorla, Fernando Cuarter...
118
Voted
SASN
2003
ACM
15 years 5 months ago
Modeling vulnerabilities of ad hoc routing protocols
The purpose of this work is to automate the analysis of ad hoc routing protocols in the presence of attackers. To this end, a formal model of protocol behavior is developed in whi...
Shahan Yang, John S. Baras