{"title":"联合压缩和数据保护","authors":"João Almeida, Joao Barros","doi":"10.1109/ALLERTON.2009.5394949","DOIUrl":null,"url":null,"abstract":"Breaking with the traditional modular architecture in which compression and cryptography are carried out separately, we propose an analysis-by-synthesis approach that exploits the properties of source codes to ensure a prescribed level of protection with manageable computational complexity. To illustrate the power of this methodology, we show that carefully inducing catastrophic errors in Huffman coded streams is very effective towards confusing a passive attacker.","PeriodicalId":440015,"journal":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"4 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Joint compression and data protection\",\"authors\":\"João Almeida, Joao Barros\",\"doi\":\"10.1109/ALLERTON.2009.5394949\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Breaking with the traditional modular architecture in which compression and cryptography are carried out separately, we propose an analysis-by-synthesis approach that exploits the properties of source codes to ensure a prescribed level of protection with manageable computational complexity. To illustrate the power of this methodology, we show that carefully inducing catastrophic errors in Huffman coded streams is very effective towards confusing a passive attacker.\",\"PeriodicalId\":440015,\"journal\":{\"name\":\"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)\",\"volume\":\"4 4\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ALLERTON.2009.5394949\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2009.5394949","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Breaking with the traditional modular architecture in which compression and cryptography are carried out separately, we propose an analysis-by-synthesis approach that exploits the properties of source codes to ensure a prescribed level of protection with manageable computational complexity. To illustrate the power of this methodology, we show that carefully inducing catastrophic errors in Huffman coded streams is very effective towards confusing a passive attacker.