𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Comments on the security of Chen’s authenticated encryption scheme

✍ Scribed by Mohamed Rasslan; Amr Youssef


Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
169 KB
Volume
37
Category
Article
ISSN
0045-7906

No coin nor oath required. For personal study only.

✦ Synopsis


Chen (Computers and Electrical Engineering, vol. 30, 2004) illustrated that Tseng et al.'s authenticated encryption schemes, with message linkages for message flows, do not achieve their claimed integrity and authenticity properties. Furthermore, Chen presented some modified schemes to repair these flaws. In this paper, we show that the modified schemes proposed by Chen are not secure. In particular, we present an attack that allows a dishonest referee, in case of a dispute, to decrypt all the future and past authenticated ciphertext between the contended parties. We also present a simple fix to prevent this attack.


📜 SIMILAR VOLUMES


On the security of image encryption meth
✍ Jan Jinn-Ke; Tseng Yuh-Min 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 457 KB

Alexopoulos, Bourbakis and Ioannou proposed two cryptographic schemes for encrypting 2-D gray scale images by using a large family of fractals respectively. Their schemes are based on a transposition of the image elements. However, their schemes will be vulnerable in case that they employ the unique

On the security of metering scheme
✍ Huang Lin; Zhenfu Cao 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 223 KB

## In 2001, Harn and Lin [4] proposed a non-repudiation metering scheme. In this paper, we reveal two security weaknesses in their scheme, which could make the scheme either too inefficient or incapable of presenting the exact visiting number of a server. An improved scheme will be presented in th

On the concealability of messages by the
✍ S. Kothari; S. Lakshmivarahan 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 665 KB

A (plaintext) message is said to be unconcealable if the encrypted message is the same as the original plaintext message. An analysis of the Williams public-key encryption scheme from the point of view of (un) concealability of messages is presented.

Some remarks on the security of the iden
✍ Jean Georgiades 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 219 KB

We present in this paper an idea ofhow to reduce the number of possible permutations when trying to solve the permuted kernels problem. We refer to the identification scheme of Shamir [2] and we also show how a dishonest prover can maximize his prospects to pass the test.

On the security of an identity based mul
✍ Hu Xiong; Jianbin Hu; Zhong Chen; Fagen Li 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 208 KB

In a multi-proxy signature scheme, an original signer could authorize a proxy group as his proxy agent. Then only the cooperation of all the signers in the proxy group can generate the proxy signatures on behalf of the original signer. Recently, Cao and Cao gave the first formal definition and secur