Sciweavers

719 search results - page 32 / 144
» Proving Security Protocols Correct
Sort
View
PODC
2010
ACM
15 years 1 months ago
Hybrid-secure MPC: trading information-theoretic robustness for computational privacy
Most protocols for distributed, fault-tolerant computation, or multi-party computation (MPC), provide security guarantees in an all-or-nothing fashion: If the number of corrupted p...
Christoph Lucas, Dominik Raub, Ueli M. Maurer
FOSAD
2009
Springer
15 years 4 months ago
The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols
We introduce the Open-source Fixed-point Model Checker OFMC for symbolic security protocol analysis, which extends the Onthe-fly Model Checker (the previous OFMC). The native inpu...
Sebastian Mödersheim, Luca Viganò
JCS
2008
109views more  JCS 2008»
14 years 9 months ago
Secrecy for bounded security protocols with freshness check is NEXPTIME-complete
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bound...
Ferucio Laurentiu Tiplea, Catalin V. Birjoveanu, C...
ADHOC
2007
133views more  ADHOC 2007»
14 years 9 months ago
Secure position-based routing protocol for mobile ad hoc networks
In large and dense mobile ad hoc networks, position-based routing protocols can offer significant performance improvement over topology-based routing protocols by using location...
Joo-Han Song, Vincent W. S. Wong, Victor C. M. Leu...
117
Voted
SCN
2011
Springer
292views Communications» more  SCN 2011»
14 years 4 months ago
Synthesis of attack actions using model checking for the verification of security protocols
Model checking cryptographic protocols have evolved to a valuable method for discovering counterintuitive security flaws, which make possible for a hostile agent to subvert the go...
Stylianos Basagiannis, Panagiotis Katsaros, Andrew...