Sciweavers

300 search results - page 29 / 60
» Formal Methods for Smartcard Security
Sort
View
IPL
2006
118views more  IPL 2006»
15 years 2 months ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune
SP
2006
IEEE
147views Security Privacy» more  SP 2006»
15 years 9 months ago
A Computationally Sound Mechanized Prover for Security Protocols
We present a new mechanized prover for secrecy properties of security protocols. In contrast to most previous provers, our tool does not rely on the Dolev-Yao model, but on the co...
Bruno Blanchet
SP
1997
IEEE
112views Security Privacy» more  SP 1997»
15 years 7 months ago
Analyzing Consistency of Security Policies
This paper discusses the development of a methodology for reasoning about properties of security policies. We view a security policy as a special case of regulation which specifi...
Laurence Cholvy, Frédéric Cuppens
LICS
1999
IEEE
15 years 7 months ago
Proving Security Protocols Correct
Security protocols use cryptography to set up private communication channels on an insecure network. Many protocols contain flaws, and because security goals are seldom specified ...
Lawrence C. Paulson
147
Voted
ESORICS
2005
Springer
15 years 8 months ago
Machine-Checked Security Proofs of Cryptographic Signature Schemes
Abstract. Formal methods have been extensively applied to the certification of cryptographic protocols. However, most of these works make the perfect cryptography assumption, i.e....
Sabrina Tarento