A Formal Analysis of Fairness and Non-repudiation in the RSA-CEGD Protocol

Recently, Nenadi´c et al. (2004) proposed the RSA-CEGD protocol for certified delivery of e-goods. This is a relatively complex scheme based on verifiable and recoverable encrypted signatures (VRES) to guarantee properties such as strong fairness and non-repudiation, among others. In this paper, we illustrate how an extended logic of beliefs can be helpful to analyze in a formal manner these security properties. This approach requires the previous definition of some novel constructions to deal with evidences exchanged by parties during the protocol execution. The study performed within this framework reveals the lack of non-repudiation in RSA-CEGD and points out some other weaknesses.

• Type: Conference
• Year: 2005
• Where: ICCSA
• Authors: Almudena Alcaide, Juan M. Estévez-Tapiador, Antonio Izquierdo, José María Sierra
• Keywords: Applied Computing, Et Al, ICCSA 2005, Recoverable Encrypted Signatures, RSA-CEGD Protocol