Sciweavers

300 search results - page 18 / 60
» Formal Methods for Smartcard Security
Sort
View
CSFW
2009
IEEE
14 years 2 months ago
A Method for Proving Observational Equivalence
—Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy (expressed as a reachability pr...
Véronique Cortier, Stéphanie Delaune
TYPES
2004
Springer
14 years 27 days ago
A Machine-Checked Formalization of the Random Oracle Model
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
Gilles Barthe, Sabrina Tarento
FM
1999
Springer
93views Formal Methods» more  FM 1999»
13 years 12 months ago
Group Principals and the Formalization of Anonymity
We introduce the concept of a group principal and present a number of different classes of group principals, including threshold-group-principals. These appear to naturally usefu...
Paul F. Syverson, Stuart G. Stubblebine
ASM
2010
ASM
14 years 2 months ago
Secrecy UML Method for Model Transformations
Abstract. This paper introduces the subject of secrecy models development by transformation, with formal validation. In an enterprise, constructing a secrecy model is a participato...
Waël Hassan, Nadera Slimani, Kamel Adi, Luigi...
SAFECOMP
2010
Springer
13 years 5 months ago
Experiences in Applying Formal Verification in Robotics
Formal verification efforts in the area of robotics are still comparatively scarce. In this paper we report on our experiences with one such effort, which was concerned with design...
Dennis Walter, Holger Täubig, Christoph L&uum...