Sufficient Conditions for Secrecy under Any Equational Theories

Abstract

This paper gives sufficient conditions that guarantee the secrecy property for cryptographic protocols. Intuitively, these conditions state that agents should not decrease the security level of components when they send them in the network. Moreover, the verification of this condition can be performed using the standard description of cryptographic protocols and the verification process can be made automatic.