Secure arithmetic coding with error detection capability

Authors:
Mahnaz Sinaie;Vahid Tabataba Vakili
Affiliations:
Department of Electrical Engineering, Iran University of Science and Technology, Narmak, Tehran, Iran;Department of Electrical Engineering, Iran University of Science and Technology, Narmak, Tehran, Iran
Venue:
EURASIP Journal on Information Security
Year:
2010

Citing 10
Cited 0

Elements of information theory

Elements of information theory
Arithmetic coding revisited

ACM Transactions on Information Systems (TOIS)
Joint Source/Channel Coding Using Arithmetic Codes

DCC '00 Proceedings of the Conference on Data Compression
Secure Embedded Error Detection Arithmetic Coding

ICITA '05 Proceedings of the Third International Conference on Information Technology and Applications (ICITA'05) Volume 2 - Volume 02
Area-Throughput Trade-Offs for Fully Pipelined 30 to 70 Gbits/s AES Processors

IEEE Transactions on Computers
Multimedia encryption with joint randomized entropy coding and rotation in partitioned bitstream

EURASIP Journal on Information Security
Joint source, channel coding, and secrecy

EURASIP Journal on Information Security
Joint source-cryptographic-channel coding based on linear block codes

AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Secure Arithmetic Coding

IEEE Transactions on Signal Processing
Multimedia Selective Encryption by Means of Randomized Arithmetic Coding

IEEE Transactions on Multimedia

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, arithmetic coding has attracted the attention of many scholars because of its high compression capability. Accordingly, this paper proposed a Joint Source-Cryptographic-Channel Coding (JSCC) based on Arithmetic Coding (AC). For this purpose, embedded error detection arithmetic coding, which is known as continuous error detection (CED), is used. In our proposed method, a random length of forbidden symbol which is produced with a key is used in each recursion. The dummy symbol is divided into two dummy symbols with a key and then is placed in random positions in order to provide security. Finally, in addition to producing secure codes, the suggested method reduced the added redundancy to half of the total redundancy added by CED. It has less complexity than cascades source, channel coding, and encryption while its key space in comparison to other joint methods has enlarged. Moreover, the coder provides a flexible switch between a standard compression model and a joint model.