Applications of non-uniquely decodable codes to privacy-preserving high-entropy data representation

DOI10.3390/a12040078zbMath1461.94080OpenAlexW2937344974MaRDI QIDQ2003332

Yasin Öztürk, M. Oğuzhan Külekci

Publication date: 8 July 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a12040078

zbMATH Keywords

data compressiondata codingbig data deliverymassive data securitynon-prefix-free codesnon-UDprivacy preserving text algorithmsselective encryption

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Prefix, length-variable, comma-free codes (94A45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Complexity aspects of guessing prefix codes
• A simply realizable ideal cryptographic system
• Wavelet Trees for All
• CRYPTOGRAPHIC ASPECTS OF DATA COMPRESSION CODES
• On breaking a Huffman code
• Practical Entropy-Compressed Rank/Select Dictionary
• Simple Compression Code Supporting Random Access and Fast String Matching
• Theory of Cryptography