pith. sign in

arxiv: 0812.0686 · v1 · submitted 2008-12-03 · 💻 cs.CR

Cryptanalysis of the RSA-CEGD protocol

classification 💻 cs.CR
keywords protocolfairnessrsa-cegdachieveattackcannotcertifiedcomplex
0
0 comments X
read the original abstract

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 demonstrate how this protocol cannot achieve fairness by presenting a severe attack and also pointing out some other weaknesses.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.