2 search results - page 1 / 1 » Easy intruder deduction problems with homomorphisms |
IPL
2006
13 years 4 months ago
2006
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
RTA
2005
Springer
13 years 10 months ago
2005
Springer
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...