License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SEA.2018.7
URN: urn:nbn:de:0030-drops-89424
URL: https://drops.dagstuhl.de/opus/volltexte/2018/8942/
Go to the corresponding LIPIcs Volume Portal


K├╝lekci, M. Oguzhan

An Ambiguous Coding Scheme for Selective Encryption of High Entropy Volumes

pdf-format:
LIPIcs-SEA-2018-7.pdf (0.5 MB)


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.

BibTeX - Entry

@InProceedings{klekci:LIPIcs:2018:8942,
  author =	{M. Oguzhan K{\"u}lekci},
  title =	{{An Ambiguous Coding Scheme for Selective Encryption of High Entropy Volumes}},
  booktitle =	{17th International Symposium on Experimental Algorithms  (SEA 2018)},
  pages =	{7:1--7:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-070-5},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{103},
  editor =	{Gianlorenzo D'Angelo},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8942},
  URN =		{urn:nbn:de:0030-drops-89424},
  doi =		{10.4230/LIPIcs.SEA.2018.7},
  annote =	{Keywords: Non-prefix-free codes, selective encryption, massive data security, multimedia data security, high-entropy data security, source coding, security in r}
}

Keywords: Non-prefix-free codes, selective encryption, massive data security, multimedia data security, high-entropy data security, source coding, security in r
Collection: 17th International Symposium on Experimental Algorithms (SEA 2018)
Issue Date: 2018
Date of publication: 19.06.2018


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI