Automatic Proofs of Deniable Authentication Protocols With a Probabilistic Polynomial Calculus in Computational Model
During the past few decades deniable authentication protocol has been studied. A lot of deniable authentication protocols have been proposed which claimed that have the security properties, for example, authentication, deniability and so on. To the authors' knowledge, these security properties and deniable authentication protocols are analyzed with informal method or with symbolic method by hand which depends on experts' knowledge and skill and are prone to make mistakes. So analysis of security properties and deniable authentication protocols with automatic tool in symbolic model or computational model plays an important role in security protocol world and is a significant work.