使用新的安全信息隐藏算法打击数字文件伪造

A. Cheddad, J. Condell, K. Curran, P. Kevitt
{"title":"使用新的安全信息隐藏算法打击数字文件伪造","authors":"A. Cheddad, J. Condell, K. Curran, P. Kevitt","doi":"10.1109/ICDIM.2008.4746807","DOIUrl":null,"url":null,"abstract":"The recent digital revolution has facilitated communication, data portability and on-the-fly manipulation. Unfortunately, this has brought along some critical security vulnerabilities that put digital documents at risk. The problem is in the security mechanism adopted to secure these documents by means of encrypted passwords; however, this security shield does not actually protect the documents which are stored intact. We propose a solution to this real world problem through a 1D hash algorithm coupled with 2D irFFT (irreversible fast Fourier transform) to encrypt digital documents in the 2D spatial domain. This method is described elsewhere in [1]. Further by applying an imperceptible information hiding technique we can add another security layer which is resistant to noise and to a certain extent JPEG compression. We support this assertion by showing a practical example which is drawn from our set of experiments. Our proposal not only points out forgery but also lets a jury or a forensics expert have access to the original document despite being manipulated. This would undoubtedly be very useful in cases of disputes or claims.","PeriodicalId":415013,"journal":{"name":"2008 Third International Conference on Digital Information Management","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Combating digital document forgery using new secure information hiding algorithm\",\"authors\":\"A. Cheddad, J. Condell, K. Curran, P. Kevitt\",\"doi\":\"10.1109/ICDIM.2008.4746807\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The recent digital revolution has facilitated communication, data portability and on-the-fly manipulation. Unfortunately, this has brought along some critical security vulnerabilities that put digital documents at risk. The problem is in the security mechanism adopted to secure these documents by means of encrypted passwords; however, this security shield does not actually protect the documents which are stored intact. We propose a solution to this real world problem through a 1D hash algorithm coupled with 2D irFFT (irreversible fast Fourier transform) to encrypt digital documents in the 2D spatial domain. This method is described elsewhere in [1]. Further by applying an imperceptible information hiding technique we can add another security layer which is resistant to noise and to a certain extent JPEG compression. We support this assertion by showing a practical example which is drawn from our set of experiments. Our proposal not only points out forgery but also lets a jury or a forensics expert have access to the original document despite being manipulated. This would undoubtedly be very useful in cases of disputes or claims.\",\"PeriodicalId\":415013,\"journal\":{\"name\":\"2008 Third International Conference on Digital Information Management\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Third International Conference on Digital Information Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDIM.2008.4746807\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Third International Conference on Digital Information Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDIM.2008.4746807","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

最近的数字革命促进了通信、数据可移植性和实时操作。不幸的是,这带来了一些严重的安全漏洞,使数字文档处于危险之中。问题在于采用加密密码保护这些文件的安全机制;然而,这个安全屏蔽实际上并不能保护保存完好的文件。我们提出了一个解决这个现实世界问题的方法,通过1D哈希算法结合2D irFFT(不可逆快速傅立叶变换)来加密2D空间域中的数字文档。该方法在文献[1]中有描述。在此基础上,通过应用一种难以察觉的信息隐藏技术,我们可以增加一层安全层,该安全层可以抵抗噪声,并在一定程度上抑制JPEG压缩。我们通过展示从我们的一组实验中得出的一个实际例子来支持这一断言。我们的提案不仅指出了伪造,而且让陪审团或法医专家即使被篡改也能看到原始文件。这在发生争端或索赔时无疑是非常有用的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Combating digital document forgery using new secure information hiding algorithm
The recent digital revolution has facilitated communication, data portability and on-the-fly manipulation. Unfortunately, this has brought along some critical security vulnerabilities that put digital documents at risk. The problem is in the security mechanism adopted to secure these documents by means of encrypted passwords; however, this security shield does not actually protect the documents which are stored intact. We propose a solution to this real world problem through a 1D hash algorithm coupled with 2D irFFT (irreversible fast Fourier transform) to encrypt digital documents in the 2D spatial domain. This method is described elsewhere in [1]. Further by applying an imperceptible information hiding technique we can add another security layer which is resistant to noise and to a certain extent JPEG compression. We support this assertion by showing a practical example which is drawn from our set of experiments. Our proposal not only points out forgery but also lets a jury or a forensics expert have access to the original document despite being manipulated. This would undoubtedly be very useful in cases of disputes or claims.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信