A joint signal processing and cryptographic approach to multimedia encryption

Mao, Yinian; Wu, Min

doi:10.1109/tip.2006.873426

Cited by 109 publications

(4 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, selective encryption algorithms for video content protection should be considered. Selective encryption is carried out on the most significant information at a choice of different stages of the codec, such as on the original pixels, the transform coefficients, the quantization indexes, the bit-planes, the entropy coder, or the final bit-stream [14]. We can select only the most important coefficients from either final or intermediate steps of a compression process [28] and encrypt those coefficients.…”

Section: Selective Encryptionmentioning

confidence: 99%

“…However, the computational overhead of naive encryption is great, so it is only suitable for highly confidential and low efficient requirements applications. SE only encrypts on some essential parts of the entire video stream, such as on the original pixels, the transform coefficients, the quantization indexes, the bitplanes, the entropy coder, or the final bit-stream [14], which due to a reduced confidentiality and combined with a reduction in computational cost.…”

mentioning

confidence: 99%

See 1 more Smart Citation

The efficiency improved scheme for secure access control of digital video distribution

et al. 2015

Multimed Tools Appl

View full text Add to dashboard Cite

The application of digital video distribution is reaching a wider spectrum of customers, in which secure access control of video content during rendering and transmission has become more and more necessary and urgent. Considering the limited computing power and the real-time requirement of set-top boxes, the efficiency of the decryption process is particularly significant. In this paper, we try to search for a scheme to improve the efficiency of the exist schemes for access control of digital video in set-top boxes mainly from three approaches. Firstly, with the specific comparison between AES and RC6, we conclude that RC6 provides sufficient security for set-top boxes, and the decryption process of RC6 is more efficient. Secondly, we improve the efficiency of the codecs process by adopting a latest more efficient video codec VP9, which is an open and royalty free video codec and is proved to be more efficient than H.264. Finally, we could only selective encrypt and decrypt some essential parts of the entire video stream during the codecs process to further improve the efficiency. In a conclusion, we propose a more efficient idea to provide access control of digital video in settop boxes. This scheme is proved to be more efficient and more practical.

show abstract

Section: Selective Encryptionmentioning

confidence: 99%

mentioning

confidence: 99%

The efficiency improved scheme for secure access control of digital video distribution

et al. 2015

Multimed Tools Appl

View full text Add to dashboard Cite

show abstract

“…In order to protect data privacy, images need to be encrypted before being transferred to a remote server. Image encryption can be done using state-of-the-art ciphers such as AES or RSA by treating images as ordinary data, or using image specific encryption such as selective and formatcompliant encryption [17]- [19] to enable post-processing such as transcoding. As these techniques are built upon established cryptographic encryption tools, it is computationally difficult for an adversary to decrypt the encrypted image files.…”

Section: Problem Formulationmentioning

confidence: 99%

Confidentiality-Preserving Image Search: A Comparative Study Between Homomorphic Encryption and Distance-Preserving Randomization

Varna

2014

IEEE Access

View full text Add to dashboard Cite

Recent years have seen increasing popularity of storing and managing personal multimedia data using online services. Preserving confidentiality of online personal data while offering efficient functionalities thus becomes an important and pressing research issue. In this paper, we study the problem of content-based search of image data archived online while preserving content confidentiality. The problem has different settings from those typically considered in the secure computation literature, as it deals with data in rank-ordered search, and has a different security-efficiency requirement. Secure computation techniques, such as homomorphic encryption, can potentially be used in this application, at a cost of high computational and communication complexity. Alternatively, efficient techniques based on randomizing visual feature and search indexes have been proposed recently to enable similarity comparison between encrypted images. This paper focuses on comparing these two major paradigms of techniques, namely, homomorphic encryptionbased techniques and feature/index randomization-based techniques, for confidentiality-preserving image search. We develop novel and systematic metrics to quantitatively evaluate security strength in this unique type of data and applications. We compare these two paradigms of techniques in terms of their search performance, security strength, and computational efficiency. The insights obtained through this paper and comparison will help design practical algorithms appropriate for privacy-aware cloud multimedia systems.INDEX TERMS Content based image retrieval, secure search, secure cloud computing, homomorphic encryption, visual words, min-hash, random projection, order preserving encryption.

show abstract

“…[1,4] Currently, the discussion about arithmetic encryption is mainly dedicated to the issue of only data encryption or the arithmetic compression encryption with all kinds of simple models. [4][5][6][7] Their common feature is that the arithmetic coding model is relatively simple. For example, the fixed probability distribution of symbols from a source or a simple firstorder Markov source is assumed, so that it is easy to draw meaningful results.…”

Section: Introductionmentioning

confidence: 99%

An image joint compression-encryption algorithm based on adaptive arithmetic coding

Deng¹,

Hai-tao²

2013

Chinese Phys. B

View full text Add to dashboard Cite

Through a series of studies on arithmetic coding and arithmetic encryption, a novel image joint compression-encryption algorithm based on adaptive arithmetic coding is proposed. The contexts produced in the process of image compression are modified by keys in order to achieve image joint compression encryption. Combined with the bit-plane coding technique, the discrete wavelet transform coefficients in different resolutions can be encrypted respectively with different keys, so that the resolution selective encryption is realized to meet different application needs. Zero-tree coding is improved, and adaptive arithmetic coding is introduced. Then, the proposed joint compression-encryption algorithm is simulated. The simulation results show that as long as the parameters are selected appropriately, the compression efficiency of proposed image joint compression-encryption algorithm is basically identical to that of the original image compression algorithm, and the security of the proposed algorithm is better than the joint encryption algorithm based on interval splitting.

show abstract

A joint signal processing and cryptographic approach to multimedia encryption

Cited by 109 publications

References 32 publications

The efficiency improved scheme for secure access control of digital video distribution

The efficiency improved scheme for secure access control of digital video distribution

Confidentiality-Preserving Image Search: A Comparative Study Between Homomorphic Encryption and Distance-Preserving Randomization

An image joint compression-encryption algorithm based on adaptive arithmetic coding

Contact Info

Product

Resources

About