Fast recovery of unknown coefficients in DCT-transformed images

The advancement of cryptography and cryptanalysis has driven numerous innovations over years. Among them is the treatment of cryptanalysis on selectively encrypted content as a recovery problem. Recent research has shown that linear programming is a powerful tool to recover unknown coefficients in DCT-transformed images. While the time complexity is polynomial, it is still too high for large images so faster methods are still desired. In this paper, we propose a fast hierarchical DCT coefficients recovery method by combining image segmentation and linear programming. In theory the proposed method can reduce the overall time complexity by a linear factor which is the number of image segments used. Our experimental results showed that, for 100 test images of different sizes and using a naive image segmentation method based on Otsu’s thresholding algorithm, the proposed method is faster for more than 92% cases and the maximum improvement observed is more than 19 times faster. While being mostly faster, results also showed that the proposed method can roughly maintain the visual quality of recovered images in both objective and subjective terms

A Novel Sketch Attack for H.264/AVC Format-Compliant Encrypted Video

In this paper, we propose a novel sketch attack for H.264 advanced video coding (H.264/AVC) format-compliant encrypted video. We briefly describe the notion of sketch attack, review the conventional sketch attacks designed for discrete cosine transform (DCT)-based compressed image, and identify their shortcomings when applied to attack compressed video. Specifically, the conventional DCT-based sketch attacks are incapable in sketching outlines for inter frame, which is deployed to significantly reduce temporal redundancy in video compression. To sketch directly from inter frame, we put forward a sketch attack by considering the partially decoded information of the H.264/AVC compressed video, namely, the number of bits spent on coding a macroblock. To evaluate the sketch image, we consider the Canny edge map as the ideal outline image. Experiments are conducted to verify the performance of the proposed sketch attack using ICADR2013, High Efficiency Video Coding dash, and Xiph video data sets. Results suggest that the proposed sketch attack can generate the outline image of the original frame for not only intra frame but also inter frame