Authentication of LZ-77 Compressed Data

Get BibTex-formatted data

Download

PDF

Author

Mikhail Atallah, Stefano Lonardi

Tech report number

CERIAS TR 2003-14

Entry type

inproceedings

Abstract

The formidable dissemination capability allowed by the current network technology makes it increasingly important to devise new methods to ensure authenticity. Nowadays it is common practice to distribute documents in compressed form. In this paper, we propose a simple variation on the classic LZ-77 algorithm that allows one to hide, within the compressed document, enough information to warrant its authenticity. The design is based on the unpredictability of a certain class of pseudo-random generators, in such a way that the hidden data cannot be retrieved in a reasonable amount of time by an attacker (unless the secret bit-string key is known). Since it can still be decompressed by the original LZ-77 algorithm, the embedding is completely

Download

PDF

Date

2003 – 03

Booktitle

18th Annual ACM Symposium on Applied Computing (SAC)

Key alpha

Atallah

Pages

282-287

Affiliation

Purdue University, University of California

Publication Date

2003-03-01

Keywords

authentication, integrity, data compression, LZ-77, fragile watermark

Language

English

Location

A hard-copy of this is in the CERIAS Library

BibTex-formatted data

To refer to this entry, you may select and copy the text below and paste it into your BibTex document. Note that the text may not contain all macros that BibTex supports.

@Inproceedings{ Atallah,
	title = "Authentication of LZ-77 Compressed Data",
	author = "Mikhail Atallah, Stefano Lonardi",
	year = "2003",
	month = "03",
	booktitle = "18th Annual ACM Symposium on Applied Computing (SAC)",
	pages = "282-287",
	abstract = "The formidable dissemination capability allowed by the current network technology makes it increasingly important to devise new methods to ensure authenticity. Nowadays it is common practice to distribute documents in compressed form. In this paper, we propose a simple variation on the classic LZ-77 algorithm that allows one to hide, within the compressed document, enough information to warrant its authenticity. The design is based on the unpredictability of a certain class of pseudo-random generators, in such a way that the hidden data cannot be retrieved in a reasonable amount of time by an attacker (unless the secret bit-string key is known).  Since it can still be decompressed by the original LZ-77 algorithm, the embedding is completely ",
	affiliation = "Purdue University, University of California",
	keywords = "authentication, integrity, data compression, LZ-77, fragile watermark",
	language = "English",
}