Sciweavers

119 search results - page 16 / 24
» Formal Methods for Assuring Security of Protocols
Sort
View
CSFW
2010
IEEE
13 years 10 months ago
Strong Invariants for the Efficient Construction of Machine-Checked Protocol Security Proofs
We embed an operational semantics for security protocols in the interactive theorem prover Isabelle/HOL and derive two strong protocol-independent invariants. These invariants allo...
Simon Meier, Cas J. F. Cremers, David A. Basin
IJNSEC
2007
121views more  IJNSEC 2007»
13 years 7 months ago
Injecting Heterogeneity Through Protocol Randomization
In this paper, we argue that heterogeneity should be an important principle in design and use of cryptographic protocols. We use automated formal analysis tools to randomly genera...
Li Zhuang, J. D. Tygar, Rachna Dhamija
TYPES
2004
Springer
14 years 23 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 11 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
SACRYPT
2005
Springer
109views Cryptology» more  SACRYPT 2005»
14 years 27 days ago
Reducing Time Complexity in RFID Systems
Radio frequency identification systems based on low-cost computing devices is the new plaything that every company would like to adopt. Its goal can be either to improve the produ...
Gildas Avoine, Etienne Dysli, Philippe Oechslin