✦ LIBER ✦

On the Security of “A Steganographic Scheme for Secure Communications Based on the Chaos and the Euler Theorem”

✍ Scribed by Bohme, R.; Keiler, C.

Book ID: 118203394
Publisher: IEEE
Year: 2007
Tongue: English
Weight: 574 KB
Volume: 9
Category: Article
ISSN: 1520-9210
DOI: 10.1109/tmm.2007.902898

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A steganographic scheme for secure commu

A steganographic scheme for secure communications based on the chaos and euler Theorem

✍ Der-Chyuan Lou; Chia-Hung Sung 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 404 KB

A digital secure image communication sch

A digital secure image communication scheme based on the chaotic Chebyshev map

✍ Xiaofeng Liao; Xueming Li; Jun Pen; Guanrong Chen 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 196 KB

## Abstract In this paper, a simple image secure communication scheme based on the chaotic Chebyshev map and chaos synchronization is proposed. The scheme relies on the excellent correlation property of chaotic sequences, which is very desirable for secure image communication. The results obtained

On the security of a copyright protectio

On the security of a copyright protection scheme based on visual cryptography

✍ Tzung-Her Chen; Chin-Chen Chang; Chang-Sian Wu; Der-Chyuan Lou 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 611 KB

On the Security of a Practical Identific

On the Security of a Practical Identification Scheme

✍ Victor Shoup 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 84 KB

A secure anonymous internet electronic v

A secure anonymous internet electronic voting scheme based on the polynomial

✍ Cao Feng; Cao Zhenfu 📂 Article 📅 2006 🏛 Wuhan University 🌐 English ⚖ 368 KB

Some remarks on the security of the iden

Some remarks on the security of the identification scheme based on permuted kernels

✍ 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.