检索结果-内蒙古大学图书馆

joint compression and encryption using chaotically mutated Huffman trees

COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION 2010年第10期15卷 2987-2999页

作者： Hermassi, Houcemeddine Rhouma, Rhouma Belghith, Safya Ecole Natl Ingenieurs Tunis Syscom Lab Tunis 1002 Tunisia

This paper introduces a new scheme for joint compression and encryption using the Huffman codec. A basic tree is first generated for a given message and then based on a key-stream generated from a chaotic map and depending from the input message, the basic tree is mutated without changing the statistical model. Hence a symbol can be coded by more than one codeword having the same length. The security of the scheme is tested against the known plaintext attack and the brute force attack. Performance analysis including encryption/decryption speed, additional computational complexity and compression ratio are given. (C) 2009 Elsevier B.V. All rights reserved.

关键词： joint compression and encryption Huffman tree Chaotic encryption

来源：评论

学校读者我要写书评

暂无评论

joint compression and encryption of Distributed Sources Based on Wavelet Transform and Semi-Tensor Product Compressed Sensing

引用

IEEE SENSORS JOURNAL 2022年第16期22卷 16451-16463页

作者： Xu, Bo Xie, Zhenglin Zhang, Zhi Han, Tailin Liu, Hong Ju, Mingchi Liu, Xuan Changchun Univ Sci & Technol Dept Informat & Commun Engn Changchun 130022 Peoples R China Changchun Univ Sci & Technol Sch Optoelect & Informat Changchun 130022 Peoples R China

Aiming at the shortage of data transmission security and efficiency in wireless distributed transient pressure testing system, a new distributed information source joint compression and encryption scheme is proposed in this paper by combining wavelet transform, semi-tensor product compressed sensing and hash chain. Firstly, the signals are decomposed into different components by wavelet transform. Then, the measurement matrix of semi-tensor product compressed sensing is updated with the hash chain related to plaintext, and its used to compress and encrypt the different wavelet components. Finally, the measurement results of the previous steps are scrambled by hash sequences for further encryption. In this paper, simulation test is carried out by using the shockwave signal measured in practice. The simulation results show that the scheme has good reconstruction accuracy and security. When the compression rate reaches 0.25, the scheme can reduce the storage space and the computing resources required by the measurement matrix to 1/32 and 1/8 of traditional distributed compressed sensing. The proposed scheme is a flexible and efficient joint compression and encryption framework, which can flexibly adjust the measurement number of different types of components to ensure important information is effectively measured, balance reconstruction quality, compression rate and system resource consumption.

关键词： Compressed sensing encryption Sensors Wavelet transforms Wireless sensor networks Sparse matrices Wireless communication Wavelet transform semi-tensor product compressed sensing distributed source joint compression and encryption plaintext correlation

来源：评论

学校读者我要写书评

暂无评论

Design Prototype and Security Analysis of a Lightweight joint compression and encryption Scheme for Resource-Constrained IoT Devices

引用

IEEE INTERNET OF THINGS JOURNAL 2022年第1期9卷 165-181页

作者： Kuldeep, Gajraj Zhang, Qi Aarhus Univ Dept Elect & Comp Engn DIGIT DK-8200 Aarhus Denmark

Compressive sensing (CS) can provide joint compression and encryption, which is promising to address the challenges of massive sensor data and data security in the Internet of Things (IoT). However, as IoT devices have constrained memory, computing power, and energy, in practice the CS-based computationally secure scheme is shown to be vulnerable to ciphertext-only attack for short-signal length. Although the CS-based perfectly secure scheme has no such vulnerabilities, its practical realization is challenging. In this article, we propose an energy concealment (EC) encryption scheme, a practical realization of the perfectly secure scheme by concealing energy, thereby removing the requirement of an additional secure channel. We propose three different methods to generate sensing matrix to improve energy efficiency using linear feedback shift registers and lagged Fibonacci sequences. Leveraging the signal's maximum energy in the EC scheme, we design a new measure to evaluate reconstructed signal quality without the knowledge of the original signal. Furthermore, a new CS decoding algorithm is designed by incorporating the knowledge of maximum energy at the decoder, which improves the signal reconstruction quality while reducing the number of measurements. Additionally, our comprehensive security analysis shows that the EC scheme is secure against various cryptographic attacks. We implement the EC scheme using the three different ways of generating the sensing matrix in the resource-constrained TelosB mote using the Contiki operating system. The experimental results demonstrate that the EC scheme outperforms advanced encryption standard in terms of code memory footprint and total energy consumption.

关键词： Sensors encryption Energy measurement Sparse matrices Internet of Things Length measurement Encoding Compressive sensing (CS) energy efficiency information security Internet of Things (IoT) joint compression and encryption sensing matrix generation signal reconstruction

来源：评论

学校读者我要写书评

暂无评论

joint image compression and encryption using a novel column-wise scanning and optimization algorithm

Joint image compression and encryption using a novel column-...

引用

International Conference on Computational Intelligence and Data Science (ICCIDS)

作者： Chaudhary, Pratibha Gupta, Ritu Singh, Abhilasha Majumder, Pramathesh Pandey, Ayushi Amity Univ Uttar Pradesh Dept Informat Technol Noida 201301 Uttar Pradesh India

In this research, a joint image compression and encryption scheme is presented which works for different image dimensions 256X256, 512X512 and 1024X1024 and different image sizes. The proposed scheme is efficient as compression and encryption is done simultaneously which makes computations faster and secure at the same time. The compression scheme deployed is like JPEG compression but uses column-wise scanning and optimization instead of zigzag scanning. In entropy phase coding, Huffman coding of JPEG compression is replaced with Arithmetic coding. Image encrypted using XOR encryption is unbreakable, as used earlier in one-time pad. Compressed data is XORed with randomly generated number. The proposed scheme is implemented for grayscale images using MATLAB software version 2016a. The experimental results showed that the scheme provides good compression ratio, secures against attacks and takes less computation time. This can be further extended for RGB images of different dimension 256X256, 512X512 and 1024X1024 and different image sizes. (C) 2020 The Authors. Published by Elsevier B.V.

关键词： Column-wise scanning and optimization algorithm DCT (Discrete cosine transform) joint compression and encryption JPEG compression Quantization XOR encryption

来源：评论

学校读者我要写书评

暂无评论

A joint compression and encryption scheme for color JPEG image

引用

ACTA PHYSICA SINICA 2013年第24期62卷 240508-1-240508-1-240508-11页

作者： Xiao Di Xie Yi-Jun Chongqing Univ Coll Comp Sci Minist Educ Key Lab Dependable Serv Comp Cyber Phys Soc Chongqing 400044 Peoples R China

To research the encryption algorithm for color joint photographic expert group (JPEG) image, by comprehensively choosing the selective encryption and the joint compression and encryption, an encryption algorithm combining with spatial domain and frequent domain for color JPEG image is proposed. The 8 x 8 blocks are first diffused on spatial domain, then the edge-detection method is utilized to find out the significant blocks containing abundant details. After encrypting all the direct current coefficients, part of alternating current (AC) coefficients in significant blocks are chosen to be encrypted. Finally the information about marking the significance of the blocks is embedded into AC coefficients for transmission. Theoretical analyses and experimental results show that the proposed algorithm is compatible with JPEG format. The cipher image has good visual quality and uniform color distribution. The algorithm possesses huge key space, strong key-sensitivity and good security.

关键词： color JPEG image edge-detection selective encryption joint compression and encryption

来源：评论

学校读者我要写书评

暂无评论

joint video compression and encryption using parallel compressive sensing and improved chaotic maps

引用

DIGITAL SIGNAL PROCESSING 2022年第0期130卷

作者： Sethi, Jagannath Bhaumik, Jaydeb Chowdhury, Ananda S. Jadavpur Univ Dept Elect & Telecommun Engn Kolkata 700032 India

In this paper, we propose a method for joint compression and encryption of video using parallel compressive sensing (PCS) and improved chaotic maps. The method is shown to be computationally efficient without compromising the quality of the recovered video. The processing of the video frames are carried out at group of pictures (GOP) level which consists of both reference and non-reference frames. We apply DCT for sparsification of the reference frames and permute the DCT coefficients to improve the quality of the reconstructed video. We introduce a Logistic Tent Infinite Collapse Map (LT-ICM) which has a higher chaotic range and complex behavior, unpredictability, and sensitivity towards initial values and controlling parameters. The measurement matrix for PCS is generated by using one-dimensional LT-ICM. A novel substitution method is introduced using circular shift, xor, and modular addition operations. We finally shuffle the substituted frames using frame dependent two-dimensional LT-ICM chaotic sequence. Experimental analysis including comparisons with state-of-the-art approaches establishes the effectiveness of the proposed solution.(c) 2022 Elsevier Inc. All rights reserved.

关键词： joint compression and encryption Logistic tent infinite collapse chaotic map Parallel compressive sensing Data dependent shuffling

来源：评论

学校读者我要写书评

暂无评论

joint SPIHT compression and selective encryption

引用

APPLIED SOFT COMPUTING 2014年 21卷 159-170页

作者： Xiang, Tao Qu, Jinyu Xiao, Di Chongqing Univ Coll Comp Sci Chongqing 400044 Peoples R China

JCSE-SPIHT, an algorithm of joint compression and selective encryption based on set partitioning in hierarchical trees (SPIHT), is proposed to achieve image encryption and compression simultaneously. It can protect SPIHT compressed images by only fast scrambling a tiny portion of crucial data during the coding process while keeping all the virtues of SPIHT intact. Intensive experiments are conducted to validate and evaluate the proposed algorithm;the results show that the efficiency and the compression performance of JCSE-SPIHT are very close to original SPIHT. In security analysis, JCSE-SPIHT is proved to be immune to various attacks not only from traditional cryptanalysis, but also by utilizing sophisticated image processing techniques. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Selective encryption joint compression and encryption Set partitioning in hierarchical trees

来源：评论

学校读者我要写书评

暂无评论

Secure MQ coder: An efficient way to protect JPEG 2000 images in wireless multimedia sensor networks

引用

SIGNAL PROCESSING-IMAGE COMMUNICATION 2014年第9期29卷 1015-1027页

作者： Xiang, Tao Yu, Chenyun Chen, Fei Chongqing Univ Coll Comp Sci Chongqing 400044 Peoples R China Chinese Univ Hong Kong Dept Comp Sci & Engn Hong Kong Hong Kong Peoples R China

This paper presents a secure MQ coder (SMQ) for efficient selective encryption of JPEG 2000 images. Being different from existing schemes where encryption overhead is proportional to the size of plain image, SMQ only selectively encrypts tiny and constant volume of data in JPEG 2000 coding regardless of image size. It is extremely fast and suitable for protecting JPEG 2000 images in wireless multimedia sensor networks (WMSNs). Theoretical analysis and experimental results show that SMQ can achieve a balance between security and efficiency, while keeping comparable compression performance and energy consumption with standard JPEG 2000 coding. (C) 2014 Elsevier B.V. All rights reserved.

关键词： JPEG 2000 MQ coder Selective encryption joint compression and encryption Wireless multimedia sensor networks

来源：评论

学校读者我要写书评

暂无评论

Degradative encryption: An efficient way to protect SPIHT compressed images

引用

OPTICS COMMUNICATIONS 2012年第24期285卷 4891-4900页

作者： Xiang, Tao Qu, Jinyu Yu, Chenyun Fu, Xinwen Chongqing Univ Coll Comp Sci Chongqing 400044 Peoples R China Univ Massachusetts Dept Comp Sci Lowell MA 01854 USA

Degradative encryption, a new selective image encryption paradigm, is proposed to encrypt only a small part of image data to make the detail blurred but keep the skeleton discernible. The efficiency is further optimized by combining compression and encryption. A format-compliant degradative encryption algorithm based on set partitioning in hierarchical trees (SPIHT) is then proposed, and the scheme is designed to work in progressive mode for gaining a tradeoff between efficiency and security. Extensive experiments are conducted to evaluate the strength and efficiency of the scheme, and it is found that less than 10% data need to be encrypted for a secure degradation. In security analysis, the scheme is verified to be immune to cryptographic attacks as well as those adversaries utilizing image processing techniques. The scheme can find its wide applications in online try-and-buy service on mobile devices, searchable multimedia encryption in cloud computing, etc. (C) 2012 Elsevier B.V. All rights reserved.

关键词： Selective encryption Degradative encryption Set partitioning in hierarchical trees joint compression and encryption

来源：评论

学校读者我要写书评

暂无评论

Perturbation meets key-based interval splitting arithmetic coding: security enhancement and chaos generalization

引用

SECURITY AND COMMUNICATION NETWORKS 2016年第1期9卷 43-53页

作者： Zhang, Yushu Xiao, Di Wong, Kwok-Wo Zhou, Jiantao Bai, Sen Su, Moting Southwest Univ Sch Elect & Informat Engn Chongqing 400715 Peoples R China Chongqing Univ Coll Comp Sci Chongqing 400044 Peoples R China City Univ Hong Kong Dept Elect Engn Kowloon Hong Kong Peoples R China Univ Macau Fac Sci & Technol Dept Comp & Informat Sci Taipa Macau Peoples R China Chongqing Commun Inst Dept Informat Engn Chongqing 400035 Peoples R China Chongqing Univ Sch Econ & Business Adm Chongqing 400044 Peoples R China

Key-based interval splitting arithmetic coding (KAC) possesses both encryption and compression capabilities. However, it possesses vulnerability to chosen-plaintext attack because the attacker can explore the relationship between the key and the codeword to deduce the secret key. In order to resist this attack, we propose to introduce perturbation into KAC. The perturbation-based KAC not only avoids the flaw of KAC that the splitting keys are usually located at the endpoint of certain codeword or at the border of two codewords but also removes the restriction that the keys are only allowed in certain sub-intervals, which result in great convenience to the key scheduler. In addition, based on generalized arithmetic coding using Generalized Luroth Series, we study the phase-space splitting of a chaotic map for generalized KAC and suggest the generalized perturbation-based KAC. This leads to the design of a joint compression and encryption scheme with more powerful cryptographic features. Copyright (C) 2015 John Wiley & Sons, Ltd.

关键词： arithmetic coding perturbation joint compression and encryption chaotic map

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：