基于多重随机酉变换的安全稀疏编码设计

T. Nakachi, Y. Bandoh
{"title":"基于多重随机酉变换的安全稀疏编码设计","authors":"T. Nakachi, Y. Bandoh","doi":"10.1109/ISPACS51563.2021.9651079","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a design method of secure sparse coding via multiple random unitary transforms (RUTs). The proposed method operates as an Encryption-then-Compression (EtC) system. The multiple RUTs will increase the security strength of the secure sparse coding. Despite the improvement in security strength, the rate-distortion performance does not deteriorate. It provides the same rate-distortion performance as that of sparse coding without encryption. We demonstrate its performance via simulation.","PeriodicalId":359822,"journal":{"name":"2021 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Designing Secure Sparse Coding via Multiple Random Unitary Transforms\",\"authors\":\"T. Nakachi, Y. Bandoh\",\"doi\":\"10.1109/ISPACS51563.2021.9651079\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a design method of secure sparse coding via multiple random unitary transforms (RUTs). The proposed method operates as an Encryption-then-Compression (EtC) system. The multiple RUTs will increase the security strength of the secure sparse coding. Despite the improvement in security strength, the rate-distortion performance does not deteriorate. It provides the same rate-distortion performance as that of sparse coding without encryption. We demonstrate its performance via simulation.\",\"PeriodicalId\":359822,\"journal\":{\"name\":\"2021 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)\",\"volume\":\"76 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPACS51563.2021.9651079\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPACS51563.2021.9651079","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种基于多重随机酉变换的安全稀疏编码设计方法。提出的方法作为加密-压缩(EtC)系统运行。多个rut将提高安全稀疏编码的安全强度。尽管安全强度有所提高,但速率失真性能并未下降。它提供了与没有加密的稀疏编码相同的率失真性能。通过仿真验证了其性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Designing Secure Sparse Coding via Multiple Random Unitary Transforms
In this paper, we propose a design method of secure sparse coding via multiple random unitary transforms (RUTs). The proposed method operates as an Encryption-then-Compression (EtC) system. The multiple RUTs will increase the security strength of the secure sparse coding. Despite the improvement in security strength, the rate-distortion performance does not deteriorate. It provides the same rate-distortion performance as that of sparse coding without encryption. We demonstrate its performance via simulation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信