Authentication of parties in piggy bank cryptography

This paper considers authentication issues and security analysis of a CA-based authentication of parties using the Piggy Bank model of cryptography. The PB model as originally described did not deal with the question of how Alice and Bob authenticate each other. This problem is considered in this paper and authentication using a certification authority (CA) is proposed. A formal proof of the protocol is modeled using input-output finite automata.