Adding Security to Compressed Information Retrieval Systems

Word-based Huffman coding has widespread use in information retrieval systems. Besides its compressing power, it also enables the implementation of both indexing and searching schema in the compressed file. In this work, an algorithm that adds security to compressed data is proposed. It shows a small loss in coding, decoding and compression performances. The algorithm uses homophonic substitution, canonical Huffman codes and a secret key for enciphering.

• Type: Conference
• Year: 2001
• Where: SPIRE
• Authors: Ruy Luiz Milidiú, C. Gomes de Mello, J. Fernandes
• Keywords: Canonical Huffman Codes, Information Management, Information Retrieval Systems, SPIRE 2001, Word-based Huffman Coding