S. Malladi and S.J. Rosenberg (USA)
Communication Security, Cryptographic Protocols
In this paper, we extend constraint solving for protocol analysis with two non-standard attacker inference rules that are possible when using the CBC method for symmetric key encryption and the RSA method for asymmetric key encryption. We explain our technique and implementa tion using some examples which include previously un known attacks on popular protocols. We also simplify the framework of constraint solving as presented by Millen and Shmatikov.
Important Links:
Go Back