Document Open Access Logo

An Ambiguous Coding Scheme for Selective Encryption of High Entropy Volumes

Author M. Oguzhan Külekci



PDF
Thumbnail PDF

File

LIPIcs.SEA.2018.7.pdf
  • Filesize: 462 kB
  • 13 pages

Document Identifiers

Author Details

M. Oguzhan Külekci
  • Informatics Institute, Istanbul Technical University, Istanbul, Turkey

Cite AsGet BibTex

M. Oguzhan Külekci. An Ambiguous Coding Scheme for Selective Encryption of High Entropy Volumes. In 17th International Symposium on Experimental Algorithms (SEA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 103, pp. 7:1-7:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.SEA.2018.7

Abstract

This study concentrates on the security of high-entropy volumes, where entropy-encoded multimedia files or compressed text sequences are the most typical sources. We consider a system in which the cost of encryption is hefty in terms of some metric (e.g., time, memory, energy, or bandwidth), and thus, creates a bottleneck. With the aim of reducing the encryption cost on such a system, we propose a data coding scheme to achieve the data security by encrypting significantly less data than the original size without sacrifice in secrecy. The main idea of the proposed technique is to represent the input sequence by not uniquely-decodable codewords. The proposed coding scheme splits a given input into two partitions as the payload, which consists of the ambiguous codeword sequence, and the disambiguation information, which is the necessary knowledge to properly decode the payload. Under the assumed condition that the input data is the output of an entropy-encoder, and thus, on ideal case independently and identically distributed, the payload occupies ~~ (d-2)/d, and the disambiguation information takes ~~ 2/d of the encoded stream, where d>2 denotes a chosen parameter typically between 6 to 20. We propose to encrypt the payload and keep the disambiguation information in plain to reduce the amount of data to be encrypted, where recursive representation of the payload with the proposed coding can decrease the to-be-encrypted volume further. When 2 * 2^d <= n <= tau * d * 2^d, for tau = (d-1.44)/2, we show that the contraction of the possible message space 2^n due to the public disambiguation information is accommodated by keeping the codeword set secret. We discuss possible applications of the proposed scheme in practice.

Subject Classification

ACM Subject Classification
  • Information systems → Data encryption
  • Information systems → Multimedia databases
  • Mathematics of computing → Combinatorics
  • Mathematics of computing → Coding theory
  • Security and privacy → Management and querying of encrypted data
Keywords
  • Non-prefix-free codes
  • selective encryption
  • massive data security
  • multimedia data security
  • high-entropy data security
  • source coding
  • security in resource-limited environments

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Boran Adaş, Ersin Bayraktar, and M Oğuzhan Külekci. Huffman codes versus augmented non-prefix-free codes. In Experimental Algorithms, pages 315-326. Springer, 2015. Google Scholar
  2. Norman L Biggs. Prefix free codes. In Codes: An Introduction to Information Communication and Cryptography, pages 1-14. Springer, 2008. Google Scholar
  3. R. Chandramouli, S. Bapatla, K. P. Subbalakshmi, and R. N. Uma. Battery power-aware encryption. ACM Trans. Inf. Syst. Secur., 9(2):162-180, 2006. URL: http://dx.doi.org/10.1145/1151414.1151417.
  4. Marco Dalai and Riccardo Leonardi. Non prefix-free codes for constrained sequences. In Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on, pages 1534-1538. IEEE, 2005. Google Scholar
  5. Yevgeniy Dodis and Adam Smith. Entropic security and the encryption of high entropy messages. In Theory of Cryptography Conference, pages 556-577. Springer, 2005. Google Scholar
  6. Aviezri S. Fraenkel and Shmuel T. Klein. Complexity aspects of guessing prefix codes. Algorithmica, 12(4-5):409-419, 1994. Google Scholar
  7. David W Gillman, Mojdeh Mohtashemi, and Ronald L Rivest. On breaking a huffman code. IEEE Transactions on Information theory, 42(3):972-976, 1996. Google Scholar
  8. Marco Grangetto, Enrico Magli, and Gabriella Olmo. Multimedia selective encryption by means of randomized arithmetic coding. IEEE Transactions on Multimedia, 8(5):905-917, 2006. Google Scholar
  9. Fadi Hamad, Leonid Smalov, and Anne James. Energy-aware security in m-commerce and the internet of things. IETE Technical review, 26(5):357-362, 2009. Google Scholar
  10. Muhammed Oğuzhan Külekci. Uniquely decodable and directly accessible non-prefix-free codes via wavelet trees. In Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on, pages 1969-1973. IEEE, 2013. Google Scholar
  11. Shiguo Lian, Zhongxuan Liu, Zhen Ren, and Haila Wang. Secure advanced video coding based on selective encryption algorithms. IEEE Transactions on Consumer Electronics, 52(2):621-629, 2006. Google Scholar
  12. Ayoub Massoudi, Frédéric Lefebvre, Christophe De Vleeschouwer, Benoit Macq, and J-J Quisquater. Overview on selective encryption of image and video: challenges and perspectives. EURASIP Journal on Information Security, 2008(1):1, 2008. Google Scholar
  13. Rashmi Bangalore Muralidhar. Substitution cipher with nonprefix codes. Master’s thesis, San Jose State University, 2011. Google Scholar
  14. Nachiketh R Potlapally, Srivaths Ravi, Anand Raghunathan, and Niraj K Jha. A study of the energy consumption characteristics of cryptographic algorithms and security protocols. IEEE Transactions on Mobile Computing, 5(2):128-143, 2006. Google Scholar
  15. Frank Rubin. Cryptographic aspects of data compression codes. Cryptologia, 3(4):202-205, 1979. Google Scholar
  16. Alexander Russell and Hong Wang. How to fool an unbounded adversary with a short key. In International Conference on the Theory and Applications of Cryptographic Techniques, pages 133-148. Springer, 2002. Google Scholar
  17. Claude Elwood Shannon. A mathematical theory of communication. Bell system technical journal, 27(3):379-423, 1948. Google Scholar
  18. Balemir Uragun. Energy efficiency for unmanned aerial vehicles. In Machine Learning and Applications and Workshops (ICMLA), 2011 10th International Conference on, volume 2, pages 316-320. IEEE, 2011. Google Scholar
  19. Marc Van Droogenbroeck and Raphaël Benedett. Techniques for a selective encryption of uncompressed and compressed images. ACIVS Advanced Concepts for Intelligent Vision Systems, Proceedings, pages 90-97, 2002. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail