Skip to Main Content
Provable security is one of the important techniques for analyzing the security of the cryptographic protocols, while manual proof is difficult and hard to estimate. Automatical proof with the help of the computers is a hot spot. We designed a tool which can satisfy much more cryptographic protocols for the automatical proof. This paper introduced the framework of the attack game and then two examples was given. We used our tool to prove the semantic security of the encryption scheme ElGamal and its hashed version.