Abstract
A Compression Cryptosystem is a single coding process, the output of which is both reduced in space and secure against unauthorized decoding. Considering Huffman coding, this pa-per proposes to apply repeatedly minor changes to the compression model, with negligible deterioration of its optimality. The cumulative impact of a large number of such changes leads to completely different ciphertexts, which can be decoded only if a given secret key is known. The security of the system is based on the NP-completeness of a problem related to breaking the code. Several variants are suggested, and their results are tested in various settings, including for security against chosen plaintext attacks.
Original language | English |
---|---|
Title of host publication | Proceedings - DCC 2022 |
Subtitle of host publication | 2022 Data Compression Conference |
Editors | Ali Bilgin, Michael W. Marcellin, Joan Serra-Sagrista, James A. Storer |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 133-142 |
Number of pages | 10 |
ISBN (Electronic) | 9781665478939 |
DOIs | |
State | Published - 2022 |
Event | 2022 Data Compression Conference, DCC 2022 - Snowbird, United States Duration: 22 Mar 2022 → 25 Mar 2022 |
Publication series
Name | Data Compression Conference Proceedings |
---|---|
Volume | 2022-March |
ISSN (Print) | 1068-0314 |
Conference
Conference | 2022 Data Compression Conference, DCC 2022 |
---|---|
Country/Territory | United States |
City | Snowbird |
Period | 22/03/22 → 25/03/22 |
Bibliographical note
Publisher Copyright:© 2022 IEEE.
Funding
The authors would like to thank the Israeli Innovation Authority and Defender Cyber Technologies LTD for their support for research under the Academic Knowledge Guidance Program (Nufar) File No. 69133 + 69098.
Funders | Funder number |
---|---|
Israeli Innovation Authority and Defender Cyber Technologies LTD | 69133 + 69098 |