Sciweavers

1059 search results - page 29 / 212
» Modeling Security Protocols as Games
Sort
View
CADE
2005
Springer
14 years 9 months ago
Deduction with XOR Constraints in Security API Modelling
We introduce XOR constraints, and show how they enable a theorem prover to reason effectively about security critical subsystems which employ bitwise XOR. Our primary case study is...
Graham Steel
DAGSTUHL
2003
13 years 10 months ago
Operational Semantics of Security Protocols
Based on a concise domain analysis we develop a formal semantics of security protocols. Its main virtue is that it is a generic model, in the sense that it is parameterized over e...
Cas J. F. Cremers, Sjouke Mauw
ASM
2005
ASM
14 years 2 months ago
Verifying Security Protocols: An ASM Approach
In this paper we present a modeling technique for security protocols using Abstract State Machines [BS03,Gur95] (ASMs). We describe how we model the different agents in the scenar...
Dominik Haneberg, Holger Grandy, Wolfgang Reif, Ge...
NOSSDAV
2004
Springer
14 years 2 months ago
Low latency and cheat-proof event ordering for peer-to-peer games
We are developing a distributed architecture for massivelymultiplayer games. In this paper, we focus on designing a low-latency event ordering protocol, called NEO, for this archi...
Chris GauthierDickey, Daniel Zappala, Virginia Mar...
SCN
2008
Springer
142views Communications» more  SCN 2008»
13 years 8 months ago
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...
Yehuda Lindell, Benny Pinkas, Nigel P. Smart