A New Source Coding Scheme with Small Expected Length and Its Application to Simple Data Encryption
IEEE Transactions on Computers
A privacy-preserving protocol for neural-network-based computation
MM&Sec '06 Proceedings of the 8th workshop on Multimedia and security
A secure multidimensional point inclusion protocol
Proceedings of the 9th workshop on Multimedia & security
Joint source, channel coding, and secrecy
EURASIP Journal on Information Security
Joint encryption and compression of correlated sources with side information
EURASIP Journal on Information Security
Protection and retrieval of encrypted multimedia content: when cryptography meets signal processing
EURASIP Journal on Information Security
Robust video transmission with distributed source coded auxiliary channel
IEEE Transactions on Image Processing
Titan-R: A Multigigabit Reconfigurable Combined Compression/Decompression Unit
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Composite signal representation for fast and storage-efficient processing of encrypted signals
IEEE Transactions on Information Forensics and Security
Robust distributed multiview video compression for wireless camera networks
IEEE Transactions on Image Processing
Efficient compression of encrypted grayscale images
IEEE Transactions on Image Processing
Synergistic integration of code encryption and compression in embedded systems
Proceedings of the great lakes symposium on VLSI
An efficient image homomorphic encryption scheme with small ciphertext expansion
Proceedings of the 21st ACM international conference on Multimedia
Efficient reversible data hiding in encrypted images
Journal of Visual Communication and Image Representation
| Hi-index | 0.00 |
When it is desired to transmit redundant data over an insecure and bandwidth-constrained channel, it is customary to first compress the data and then encrypt it. In this paper, we investigate the novelty of reversing the order of these steps, i.e., first encrypting and then compressing, without compromising either the compression efficiency or the information-theoretic security. Although counter-intuitive, we show surprisingly that, through the use of coding with side information principles, this reversal of order is indeed possible in some settings of interest without loss of either optimal coding efficiency or perfect secrecy. We show that in certain scenarios our scheme requires no more randomness in the encryption key than the conventional system where compression precedes encryption. In addition to proving the theoretical feasibility of this reversal of operations, we also describe a system which implements compression of encrypted data.