Anzeige
Erschienen in:
2018 | OriginalPaper | Buchkapitel
Towards Video Compression in the Encrypted Domain: A Case-Study on the H264 and HEVC Macroblock Processing Pipeline
verfasst von : Donald Nokam Kuate, Sebastien Canard, Renaud Sirdey
Erschienen in: Cryptology and Network Security
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
Image/video compression is a widely used operation in our everyday life. Such an operation usually proceeds independantly on small rectangular portions, so-called macroblocks, and is mainly divided into four operations: color conversion, Discrete Cosine Transform (DCT), quantization and entropic encoding. This operation is carried out easily on non-encrypted image. In this paper, we consider the case where such an execution is done in the encrypted domain. In fact, this is today one central question related to individuals’ privacy since such image/video compression is most of the time done on the premises of a service provider data center, and pictures are potentially sensitive personal data. Thus, the capacity for such entity to perform an action “blindfolded”, that is not knowing the underlying input in plain, is an important topic since it permits to obtain both individual privacy and data usability.
In this context, one of the main cryptographic tool is (fully) homomorphic encryption (FHE), that permits to perform operations while keeping the data encrypted. We here consider two different instantiations of FHE, one for which the plaintext space is binary (\(\mathbb {Z}_2\)) and the other a modular space (\(\mathbb {Z}_p\) for an integer \(p> 2 \)), and compare them when running the well-known H264 and HEVC macroblock processing pipelines.
Our contribution is twofold. On one hand, we provide an exhaustive comparison between FHEs over \(\mathbb {Z}_2\) and FHEs over \(\mathbb {Z}_p\) (\(p>2\)) in terms of functional capabilities, multiplicative depth and real performances using several existing FHE implementations, over libraries such as
Cingulata, SEAL and TFHE. On the other hand, we apply this to image compression in the encrypted domain, being the first to “crypto-compress” a full encrypted photograph with practically relevant performances.