{"title":"使用跳键增强的多霍夫曼表(MHT)加密方案","authors":"Dahua Xie, C.-C. Jay Kuo","doi":"10.1109/ISCAS.2004.1329725","DOIUrl":null,"url":null,"abstract":"Efficient multimedia encryption algorithms play a key role in multimedia security protection. One algorithm known as the MHT (multiple Huffman tables) method was recently developed by Wu and Kuo (2001; 2000). Although MHT has many desirable advantages, it is vulnerable under the chosen-plaintext attack (CPA). In this work, an enhanced MHT encryption scheme is proposed to remedy this drawback using the idea of key hopping. It is demonstrated by mathematical analysis that our proposed scheme is secure against chosen plaintext attack.","PeriodicalId":6445,"journal":{"name":"2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)","volume":"32 1","pages":"V-V"},"PeriodicalIF":0.0000,"publicationDate":"2004-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"Enhanced multiple Huffman table (MHT) encryption scheme using key hopping\",\"authors\":\"Dahua Xie, C.-C. Jay Kuo\",\"doi\":\"10.1109/ISCAS.2004.1329725\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Efficient multimedia encryption algorithms play a key role in multimedia security protection. One algorithm known as the MHT (multiple Huffman tables) method was recently developed by Wu and Kuo (2001; 2000). Although MHT has many desirable advantages, it is vulnerable under the chosen-plaintext attack (CPA). In this work, an enhanced MHT encryption scheme is proposed to remedy this drawback using the idea of key hopping. It is demonstrated by mathematical analysis that our proposed scheme is secure against chosen plaintext attack.\",\"PeriodicalId\":6445,\"journal\":{\"name\":\"2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)\",\"volume\":\"32 1\",\"pages\":\"V-V\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCAS.2004.1329725\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No.04CH37512)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCAS.2004.1329725","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Enhanced multiple Huffman table (MHT) encryption scheme using key hopping
Efficient multimedia encryption algorithms play a key role in multimedia security protection. One algorithm known as the MHT (multiple Huffman tables) method was recently developed by Wu and Kuo (2001; 2000). Although MHT has many desirable advantages, it is vulnerable under the chosen-plaintext attack (CPA). In this work, an enhanced MHT encryption scheme is proposed to remedy this drawback using the idea of key hopping. It is demonstrated by mathematical analysis that our proposed scheme is secure against chosen plaintext attack.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
