Augmenting LZ‐77 with authentication and integrity assurance capabilities

Atallah, Mikhail J.; Lonardi, Stefano

doi:10.1002/cpe.804

Cited by 3 publications

(3 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The side-channel is general purpose and it may carry any useful data. In previous work, it has been used for information hiding, or steganography [2], for authentication [1], for error detection or correction [9], and for bit recycling [4], [6], [13]. This last application is described in greater detail next.…”

Section: Data Embedding Via Match Selectionmentioning

confidence: 98%

Constructing optimal whole-bit recycling codes

Dube

Beaudoin

2009

2009 IEEE Information Theory Workshop on Networking and Information Theory

View full text Add to dashboard Cite

Bit recycling aims at improving the rates achieved by compression techniques, such as LZ77, that suffer from the redundancy caused by the multiplicity of the encodings. The performance of bit recycling depends crucially on the recycling codes that it uses. A recipe for the construction of optimal recycling codes has been mentioned in previous work. However, no efficient algorithm and proof of optimality were given. We present both here.

show abstract

Section: Data Embedding Via Match Selectionmentioning

confidence: 98%

Constructing optimal whole-bit recycling codes

Dube

Beaudoin

2009

2009 IEEE Information Theory Workshop on Networking and Information Theory

View full text Add to dashboard Cite

show abstract

“…At most log 2 (r) additional bits can be embedded by selecting one of the r pointer options. These additional bits can be used for various purposes, such as authentication [21] or bit error repair.…”

Section: A Lzsr Algorithmmentioning

confidence: 99%

Repair and Restoration of Corrupted LZSS Files

2019

View full text Add to dashboard Cite

Data compression and decompression have been widely used in modern communication and data transmission. But how to decompress the corrupted lossless compressed files remains a challenge. Aiming at the Lempel-Ziv-Storer-Szymanski (LZSS), a lossless data compression algorithm widely used in the field of general coding, this paper proposes an effective method to repair the errors and decompress and restore the corrupted LZSS files, and provides the theoretical basis for the method. By using the residual redundancy left by the LZSS encoder to carry the check information, the method can repair the errors in LZSS compressed data without any loss of compression performance. The proposed method neither requires additional bits nor changes coding rules or data formats. It is fully compatible with standard algorithms. That is, the data compressed by LZSS with error repair capability can still be decompressed by the standard LZSS decoder. The experimental results verify the validity and practicability of the proposed method.

show abstract

“…1). These additional bits can be used for various purposes such as authentication [2] or error correction as described next. In passing, we should acknowledge that the idea of detecting multiple matches of the longest LZ'77 prefix was already considered by Fiala and Greene [6] as a strategy to improve compression.…”

Section: A Redundant Information In Lzs'77mentioning

confidence: 99%

Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments

Lonardi

Szpankowski

Ward

2007

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

Abstract-We propose a joint source-channel coding algorithm capable of correcting some errors in the popular Lempel-Ziv'77 (LZ'77) scheme without introducing any measurable degradation in the compression performance. This can be achieved because the LZ'77 encoder does not completely eliminate the redundancy present in the input sequence. One source of redundancy can be observed when an LZ'77 phrase has multiple matches. In this case, LZ'77 can issue a pointer to any of those matches, and a particular choice carries some additional bits of information. We call a scheme with embedded redundant information the LZS'77 algorithm. We analyze the number of longest matches in such a scheme and prove that it follows the logarithmic series distribution with mean 1=h (plus some fluctuations), where h is the source entropy. Thus, the distribution associated with the number of redundant bits is well concentrated around its mean, a highly desirable property for error correction. These analytic results are proved by a combination of combinatorial, probabilistic, and analytic methods (e.g., Mellin transform, depoissonization, combinatorics on words). In fact, we analyze LZS'77 by studying the multiplicity matching parameter in a suffix tree, which in turn is analyzed via comparison to its independent version, called trie. Finally, we present an algorithm in which a channel coder (e.g., Reed-Solomon (RS) coder) succinctly uses the inherent additional redundancy left by the LZS'77 encoder to detect and correct a limited number of errors. We call such a scheme the LZRS'77 algorithm. LZRS'77 is perfectly backward-compatible with LZ'77, that is, a file compressed with our error-resistant LZRS'77 can still be decompressed by a generic LZ'77 decoder.

show abstract

Augmenting LZ‐77 with authentication and integrity assurance capabilities

Cited by 3 publications

References 29 publications

Constructing optimal whole-bit recycling codes

Constructing optimal whole-bit recycling codes

Repair and Restoration of Corrupted LZSS Files

Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments

Contact Info

Product

Resources

About