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
A Fast and Fully Format Compliant Protection of JPEG2000 Code-Streams
MMM '09 Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling
Adaptive chosen-ciphertext attack on secure arithmetic coding
IEEE Transactions on Signal Processing
On the security of the secure arithmetic code
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
A differential cryptanalysis of Yen-Chen-Wu multimedia cryptography system
Journal of Systems and Software
Simultaneous arithmetic coding and encryption using chaotic maps
IEEE Transactions on Circuits and Systems II: Express Briefs
Scalable video encryption of H.264 SVC Codec
Journal of Visual Communication and Image Representation
Secure arithmetic coding with error detection capability
EURASIP Journal on Information Security
Improvement of security and feasibility for chaos-based multimedia cryptosystem
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part IV
A chaos-based joint image compression and encryption scheme using DCT and SHA-1
Applied Soft Computing
Journal of Real-Time Image Processing
Cryptanalysis of randomized arithmetic codes based on markov model
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
An enhanced variable-length arithmetic coding and encryption scheme using chaotic maps
Journal of Systems and Software
Fast encryption of JPEG 2000 images in wireless multimedia sensor networks
WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
A new compression scheme for secure transmission
International Journal of Automation and Computing
Hi-index | 35.69 |
Although arithmetic coding offers extremely high coding efficiency, it provides little or no security as traditionally implemented. We present a modified scheme that offers both encryption and compression. The system utilizes an arithmetic coder in which the overall length within the range [0,1) allocated to each symbol is preserved, but the traditional assumption that a single contiguous interval is used for each symbol is removed. Additionally, a series of permutations are applied at the input and the output of the encoder. The overall system provides simultaneous encryption and compression, with negligible coding efficiency penalty relative to a traditional arithmetic coder