An ambiguous coding scheme for selective encryption of high entropy volumes

DOI10.4230/LIPICS.SEA.2018.7MaRDI QIDQ5140715zbMATH OpenFDO

Authors M. Oğuzhan Külekci

Publication date 16 December 2020

Full work available at URL https://doi.org/10.4230/LIPICS.SEA.2018.7

zbMATH Keywords

high-entropy data securitymassive data securitymultimedia data securitynon-prefix-free codessecurity in resource-limited environmentsselective encryptionsource coding

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Applications of non-uniquely decodable codes to privacy-preserving high-entropy data representation
• A secure and efficient entropy coding based on arithmetic coding
• Theory of Cryptography
• scientific article; zbMATH DE number 1487949
• A secure arithmetic coding based on Markov model

Cites work

• A Mathematical Theory of Communication
• Complexity aspects of guessing prefix codes
• CRYPTOGRAPHIC ASPECTS OF DATA COMPRESSION CODES
• scientific article; zbMATH DE number 2086703 (Why is no real title available?)
• On breaking a Huffman code
• Theory of Cryptography

Cited in

(1)

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

This page was built for publication: An ambiguous coding scheme for selective encryption of high entropy volumes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140715)