{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:37:27Z","timestamp":1760240247389,"version":"build-2065373602"},"reference-count":28,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T00:00:00Z","timestamp":1555459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004410","name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ftirma Kurumu","doi-asserted-by":"publisher","award":["117E865"],"award-info":[{"award-number":["117E865"]}],"id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>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\u2013prefix\u2013free 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\u2013UD 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.<\/jats:p>","DOI":"10.3390\/a12040078","type":"journal-article","created":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T07:58:09Z","timestamp":1555487889000},"page":"78","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Applications of Non-Uniquely Decodable Codes to Privacy-Preserving High-Entropy Data Representation"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4583-6261","authenticated-orcid":false,"given":"Muhammed O\u011fuzhan","family":"K\u00fclekci","sequence":"first","affiliation":[{"name":"Informatics Institute, Istanbul Technical University, 34469 Istanbul, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasin","family":"\u00d6zt\u00fcrk","sequence":"additional","affiliation":[{"name":"Informatics Institute, Istanbul Technical University, 34469 Istanbul, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,4,17]]},"reference":[{"key":"ref_1","first-page":"7:1","article-title":"An Ambiguous Coding Scheme for Selective Encryption of High Entropy Volumes","volume":"Volume 103","year":"2018","journal-title":"Proceedings of the 17th International Symposium on Experimental Algorithms (SEA 2018)"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Dalai, M., and Leonardi, R. (2005, January 4\u20139). Non prefix-free codes for constrained sequences. Proceedings of the International Symposium on Information Theory (ISIT), Adelaide, Australia.","DOI":"10.1109\/ISIT.2005.1523601"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1109\/TNET.2011.2165323","article-title":"Bit weaving: A non-prefix approach to compressing packet classifiers in TCAMs","volume":"20","author":"Meiners","year":"2012","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"K\u00fclekci, M.O. (2013, January 7\u201312). Uniquely decodable and directly accessible non-prefix-free codes via wavelet trees. Proceedings of the 2013 IEEE International Symposium on Information Theory (ISIT), Istanbul, Turkey.","DOI":"10.1109\/ISIT.2013.6620570"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Ada\u015f, B., Bayraktar, E., and K\u00fclekci, M.O. (2015). Huffman Codes versus Augmented Non-Prefix-Free Codes. Experimental Algorithms, Springer.","DOI":"10.1007\/978-3-319-20086-6_24"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Okanohara, D., and Sadakane, K. (2007, January 6). Practical entropy-compressed rank\/select dictionary. Proceedings of the Meeting on Algorithm Engineering & Expermiments, New Orleans, LA, USA.","DOI":"10.1137\/1.9781611972870.6"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Fredriksson, K., and Nikitin, F. (2007). Simple compression code supporting random access and fast string matching. International Workshop on Experimental and Efficient Algorithms, Springer.","DOI":"10.1007\/978-3-540-72845-0_16"},{"key":"ref_8","unstructured":"Ferragina, P., and Venturini, R. (2007, January 7\u20139). A simple storage scheme for strings achieving entropy bounds. Proceedings of the Eighteenth annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, USA."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Navarro, G. (2012). Wavelet trees for all. Annual Symposium on Combinatorial Pattern Matching, Springer.","DOI":"10.1007\/978-3-642-31265-6_2"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"357","DOI":"10.4103\/0256-4602.55276","article-title":"Energy-aware Security in M-Commerce and the Internet of Things","volume":"26","author":"Hamad","year":"2009","journal-title":"IETE Tech. Rev."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1145\/1151414.1151417","article-title":"Battery Power-aware Encryption","volume":"9","author":"Chandramouli","year":"2006","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Uragun, B. (2011, January 18\u201321). Energy efficiency for unmanned aerial vehicles. Proceedings of the IEEE 10th International Conference on Machine Learning and Applications and Workshops (ICMLA), Honolulu, HI, USA.","DOI":"10.1109\/ICMLA.2011.159"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1109\/TMC.2006.16","article-title":"A study of the energy consumption characteristics of cryptographic algorithms and security protocols","volume":"5","author":"Potlapally","year":"2006","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_14","first-page":"179290","article-title":"Overview on selective encryption of image and video: challenges and perspectives","volume":"2008","author":"Massoudi","year":"2008","journal-title":"EURASIP J. Inf. Secur."},{"key":"ref_15","unstructured":"Van Droogenbroeck, M., and Benedett, R. (2002). Techniques for a selective encryption of uncompressed and compressed images. Proceedings of Advanced Concepts for Intelligent Vision Systems (ACIVS), University of Liege."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1109\/TCE.2006.1649688","article-title":"Secure advanced video coding based on selective encryption algorithms","volume":"52","author":"Lian","year":"2006","journal-title":"IEEE Trans. Consum. Electron."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1109\/TMM.2006.879919","article-title":"Multimedia selective encryption by means of randomized arithmetic coding","volume":"8","author":"Grangetto","year":"2006","journal-title":"IEEE Trans. Multimed."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell Syst. Tech. J."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Mansour, M.F. (2007, January 15\u201320). Efficient Huffman Decoding with Table Lookup. Proceedings of the 2007 IEEE International Conference on Acoustics, Speech and Signal Processing\u2014ICASSP\u201907, Honolulu, HI, USA.","DOI":"10.1109\/ICASSP.2007.366170"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1080\/0161-117991854061","article-title":"Cryptographic aspects of data compression codes","volume":"3","author":"Rubin","year":"1979","journal-title":"Cryptologia"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BF01185434","article-title":"Complexity aspects of guessing prefix codes","volume":"12","author":"Fraenkel","year":"1994","journal-title":"Algorithmica"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1109\/18.490558","article-title":"On breaking a Huffman code","volume":"42","author":"Gillman","year":"1996","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_23","unstructured":"Muralidhar, R.B. (2011). Substitution Cipher with NonPrefix Codes. [Master\u2019s Thesis, San Jose State University]."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Dodis, Y., and Smith, A. (2005). Entropic security and the encryption of high entropy messages. Theory of Cryptography Conference, Springer.","DOI":"10.1007\/978-3-540-30576-7_30"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Russell, A., and Wang, H. (2002). How to fool an unbounded adversary with a short key. International Conference on the Theory and Applications of Cryptographic Techniques, Springer.","DOI":"10.1007\/3-540-46035-7_9"},{"key":"ref_26","first-page":"90","article-title":"A Simply Realizable Ideal Cryptographic System","volume":"36","author":"Ryabko","year":"2000","journal-title":"Probl. Peredachi Inf."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"22803","DOI":"10.1007\/s11042-017-4590-4","article-title":"Efficient and secure big data delivery in cloud computing","volume":"76","author":"Stergiou","year":"2017","journal-title":"Multimed. Tools Appl."},{"key":"ref_28","unstructured":"Kulekci, M.O. (2018). An Efficient Encryption Method to Secure Data with Reduced Number of Encryption Operations. (15\/779,853), U.S. Patent."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/4\/78\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:46:04Z","timestamp":1760186764000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/12\/4\/78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,17]]},"references-count":28,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2019,4]]}},"alternative-id":["a12040078"],"URL":"https:\/\/doi.org\/10.3390\/a12040078","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2019,4,17]]}}}