arrow
Return

A secure and improved self-embedding algorithm to combat digital document forgery

delete2009-12-01
delete43
PRE
AI
A
Abbas Cheddad
J
Joan Condell
K
Kevin Curran
P
Paul Mc Kevitt
DOI:10.1016/j.sigpro.2009.02.001delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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 here a solution to this real world problem through a ID hash algorithm coupled with 2D iFFT (irreversible Fast Fourier Transform) to encrypt digital documents in the 2D spatial domain. 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. This work exploits Jarvis' kernel to generate the error diffusion signal and the Wavelet-based Inverse Halftoning via De-convolution (WInHD) to recover the approximation of the original signal. Our method not only points out forgery but also allows legal or forensics expert gain access to the original document despite being manipulated. This would undoubtedly be very useful in cases of disputes or claims. (C) 2009 Elsevier B.V. All rights reserved.
Keywords:
Image processing
Steganography
Information hiding
Self-embedding
Encryption
Document forgery
Security
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Signal Processing cover
Signal Processing
IF:
3.6
Papers:
9.9K
Citations:
1.7W

Organization

No organization information available