Name
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. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/DCC52660.2022.00021 | 2022 Data Compression Conference (DCC) |
Keywords | DocType | ISSN |
single coding process,decoding,compression model,ciphertexts,NP-completeness,Huffman code based cryptosystem,compression cryptosystem,plaintext attacks | Conference | 1068-0314 |
ISBN | Citations | PageRank |
978-1-6654-7894-6 | 0 | 0.34 |
References | Authors | |
6 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yoav Gross | 1 | 0 | 1.01 |
| Shmuel T. Klein | 2 | 434 | 77.80 |
| Elina Opalinsky | 3 | 0 | 0.68 |
| Rivka Revivo | 4 | 0 | 0.34 |
| Dana Shapira | 5 | 144 | 32.15 |