{"title":"增加压缩信息检索系统的安全性","authors":"R. Milidiú, C. G. Mello, José Rodrigues Fernandes","doi":"10.1109/SPIRE.2001.989778","DOIUrl":null,"url":null,"abstract":"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 securiry 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.","PeriodicalId":107511,"journal":{"name":"Proceedings Eighth Symposium on String Processing and Information Retrieval","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Adding security to compressed information retrieval systems\",\"authors\":\"R. Milidiú, C. G. Mello, José Rodrigues Fernandes\",\"doi\":\"10.1109/SPIRE.2001.989778\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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 securiry 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.\",\"PeriodicalId\":107511,\"journal\":{\"name\":\"Proceedings Eighth Symposium on String Processing and Information Retrieval\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-11-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Eighth Symposium on String Processing and Information Retrieval\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPIRE.2001.989778\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Eighth Symposium on String Processing and Information Retrieval","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPIRE.2001.989778","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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 securiry 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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
