A new signature scheme based on the DSA giving message recovery
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem
Designs, Codes and Cryptography - Special issue dedicated to Gustavus J. Simmons
An ElGamal-Like Cryptosystem for Enciphering Large Messages
IEEE Transactions on Knowledge and Data Engineering
Convertible Undeniable Signatures
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Comments on the security of Chen's authenticated encryption scheme
Computers and Electrical Engineering
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Authenticated encryption schemes are cryptographic primitives that are used to simultaneously protect the confidentiality and authenticity of communications. In 2003, Tseng et al. proposed two efficient authenticated encryption schemes with message linkages for message flows. Two years later, Zhang et al. pointed out that these two schemes lack the non-repudiation property and presented a new authenticated encryption scheme to surmount these weaknesses. Besides, in 2006, Hwang et al. presented another forgery attack against the original schemes and proposed some modified schemes to repair these flaws. In this paper, we show that the new authenticated encryption scheme proposed by Zhang et al. does not satisfy its claimed non-repudiation and authentication properties. We also present an attack against Hwang et al.'s scheme that allows a dishonest referee to decrypt all the future and past authenticated ciphertext between the contending parties. Furthermore, we present a simple fix to prevent these attacks.