Sciweavers

719 search results - page 78 / 144
» Proving Security Protocols Correct
Sort
View
FORTE
2010
14 years 11 months ago
On Efficient Models for Model Checking Message-Passing Distributed Protocols
Abstract. The complexity of distributed algorithms, such as state machine replication, motivates the use of formal methods to assist correctness verification. The design of the for...
Péter Bokor, Marco Serafini, Neeraj Suri
ATVA
2005
Springer
156views Hardware» more  ATVA 2005»
15 years 3 months ago
An EFSM-Based Intrusion Detection System for Ad Hoc Networks
Mobile ad hoc networks offer very interesting perspectives in wireless communications due to their easy deployment and their growing performances. However, due to their inherent c...
Jean-Marie Orset, Baptiste Alcalde, Ana R. Cavalli
INFOCOM
2012
IEEE
13 years 8 months ago
Expected loss bounds for authentication in constrained channels
We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a numbe...
Christos Dimitrakakis, Aikaterini Mitrokotsa, Serg...
ESORICS
2010
Springer
14 years 11 months ago
A New Framework for RFID Privacy
Formal RFID security and privacy frameworks are fundamental to the design and analysis of robust RFID systems. In this paper, we develop a new definitional framework for RFID priv...
Robert H. Deng, Yingjiu Li, Moti Yung, Yunlei Zhao
CRYPTO
2006
Springer
125views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
Automated Security Proofs with Sequences of Games
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
Bruno Blanchet, David Pointcheval