Next Article in Journal
Speech Act Theory as an Evaluation Tool for Human–Agent Communication
Next Article in Special Issue
Lyndon Factorization Algorithms for Small Alphabets and Run-Length Encoded Strings
Previous Article in Journal
Embedding Equality Constraints of Optimization Problems into a Quantum Annealer
Previous Article in Special Issue
Permuted Pattern Matching Algorithms on Multi-Track Strings
Open AccessArticle

Applications of Non-Uniquely Decodable Codes to Privacy-Preserving High-Entropy Data Representation

Informatics Institute, Istanbul Technical University, 34469 Istanbul, Turkey
*
Author to whom correspondence should be addressed.
A less extensive preliminary version of this work has appeared in 17th International Symposium on Experimental Algorithms (SEA 2018).
Algorithms 2019, 12(4), 78; https://doi.org/10.3390/a12040078
Received: 28 February 2019 / Revised: 4 April 2019 / Accepted: 11 April 2019 / Published: 17 April 2019
(This article belongs to the Special Issue String Matching and Its Applications)
  |  
PDF [344 KB, uploaded 17 April 2019]
  |  

Abstract

Non-uniquely-decodable (non-UD) codes can be defined as the codes that cannot be uniquely decoded without additional disambiguation information. These are mainly the class of non–prefix–free codes, where a code-word can be a prefix of other(s), and thus, the code-word boundary information is essential for correct decoding. Due to their inherent unique decodability problem, such non-UD codes have not received much attention except a few studies, in which using compressed data structures to represent the disambiguation information efficiently had been previously proposed. It had been shown before that the compression ratio can get quite close to Huffman/Arithmetic codes with an additional capability of providing direct access in compressed data, which is a missing feature in the regular Huffman codes. In this study we investigate non-UD codes in another dimension addressing the privacy of the high-entropy data. We particularly focus on such massive volumes, where typical examples are encoded video or similar multimedia files. Representation of such a volume with non–UD coding creates two elements as the disambiguation information and the payload, where decoding the original data from these elements becomes hard when one of them is missing. We make use of this observation for privacy concerns. and study the space consumption as well as the hardness of that decoding. We conclude that non-uniquely-decodable codes can be an alternative to selective encryption schemes that aim to secure only part of the data when data is huge. We provide a freely available software implementation of the proposed scheme as well. View Full-Text
Keywords: non-UD; non-prefix-free codes; selective encryption; massive data security; data coding; data compression; privacy preserving text algorithms; big data delivery non-UD; non-prefix-free codes; selective encryption; massive data security; data coding; data compression; privacy preserving text algorithms; big data delivery
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Külekci, M.O.; Öztürk, Y. Applications of Non-Uniquely Decodable Codes to Privacy-Preserving High-Entropy Data Representation. Algorithms 2019, 12, 78.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top