高熵体积选择性加密的一种模糊编码方案

M. O. Külekci
{"title":"高熵体积选择性加密的一种模糊编码方案","authors":"M. O. Külekci","doi":"10.4230/LIPIcs.SEA.2018.7","DOIUrl":null,"url":null,"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 ≤ n ≤ τ · d · 2, for τ = d−1.44 2 , we show that the contraction of the possible message space 2 due to the public disambiguation information is accommodated by keeping the codeword set secret. We discuss possible applications of the proposed scheme in practice. 2012 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","PeriodicalId":9448,"journal":{"name":"Bulletin of the Society of Sea Water Science, Japan","volume":"11 1","pages":"7:1-7:13"},"PeriodicalIF":0.0000,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An Ambiguous Coding Scheme for Selective Encryption of High Entropy Volumes\",\"authors\":\"M. O. Külekci\",\"doi\":\"10.4230/LIPIcs.SEA.2018.7\",\"DOIUrl\":null,\"url\":null,\"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 ≤ n ≤ τ · d · 2, for τ = d−1.44 2 , we show that the contraction of the possible message space 2 due to the public disambiguation information is accommodated by keeping the codeword set secret. We discuss possible applications of the proposed scheme in practice. 2012 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\",\"PeriodicalId\":9448,\"journal\":{\"name\":\"Bulletin of the Society of Sea Water Science, Japan\",\"volume\":\"11 1\",\"pages\":\"7:1-7:13\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bulletin of the Society of Sea Water Science, Japan\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4230/LIPIcs.SEA.2018.7\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of the Society of Sea Water Science, Japan","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LIPIcs.SEA.2018.7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本研究集中于高熵卷的安全性,其中熵编码的多媒体文件或压缩文本序列是最典型的来源。我们考虑一个系统,其中加密的成本在某些指标(例如,时间,内存,能量或带宽)方面很高,因此产生瓶颈。为了降低系统的加密成本,我们提出了一种数据编码方案,在不牺牲保密性的情况下,对比原始大小更少的数据进行加密,从而达到数据安全的目的。该技术的主要思想是用非唯一可解码码字来表示输入序列。提出的编码方案将给定的输入分成两部分作为有效载荷,有效载荷由歧义码字序列和消歧信息组成,消歧信息是正确解码有效载荷所必需的知识。假设输入数据是熵编码器的输出,因此,在独立且同分布的理想情况下,有效载荷占用编码流≈(d−2)d,消歧信息占用编码流≈2 d,其中d > 2表示通常在6到20之间选择的参数。我们建议对有效载荷进行加密,并保持消歧信息的平直,以减少需要加密的数据量,其中使用所建议的编码递归表示有效载荷可以进一步减少需要加密的量。当2·2≤n≤τ·d·2时,当τ = d−1.44 2时,我们证明了由于公开消歧信息引起的可能消息空间2的收缩可以通过保持码字集的机密性来适应。我们讨论了所提出的方案在实践中的可能应用。2012 ACM学科分类信息系统→数据加密、信息系统→多媒体数据库、计算数学→组合数学、计算数学→编码理论、安全与隐私→加密数据的管理与查询
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Ambiguous Coding Scheme for Selective Encryption of High Entropy Volumes
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 ≤ n ≤ τ · d · 2, for τ = d−1.44 2 , we show that the contraction of the possible message space 2 due to the public disambiguation information is accommodated by keeping the codeword set secret. We discuss possible applications of the proposed scheme in practice. 2012 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
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Efficient Yao Graph Construction Partitioning the Bags of a Tree Decomposition Into Cliques Arc-Flags Meet Trip-Based Public Transit Routing Maximum Coverage in Sublinear Space, Faster FREIGHT: Fast Streaming Hypergraph Partitioning
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1