Sciweavers

Share
IPL
2006
118views more  IPL 2006»
9 years 10 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
ESORICS
2005
Springer
10 years 4 months ago
Machine-Checked Security Proofs of Cryptographic Signature Schemes
Abstract. Formal methods have been extensively applied to the certiļ¬cation of cryptographic protocols. However, most of these works make the perfect cryptography assumption, i.e....
Sabrina Tarento
books