The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper proposes a method that incorporates secret image sharing with progressive transmission based on the integer discrete cosine transform (IntDCT). The idea is to apply IntDCT coefficients after a combination process as input of the (r, n)-threshold model instead of directly sharing the secret pixels. A coarse version of the secret image can be decrypted by Lagrange interpolation with a small...
In order to effectively evaluate the system security, a quantitative information security evaluation method which combine analytic hierarchy process (AHP) and fuzzy comprehensive evaluation were proposed. Firstly, referring to Common Criteria (CC), we established security evaluation hierarchy model. Then, the analytic hierarchy process (AHP) method was used to calculate the security factors' weights...
This paper proposes a method to encrypt an image in two shares with following properties. (1) The method is suitable for binary, gray level or color image encryption. (2) The bit error rates are adjustable, and thus the secret image can be recovered to different extents including lossless and nearly lossless. (3) Sizes of the share images are flexible to be changed, and thus the method can be used...
Image hashing function maps an image into a bit string which can be used to authenticate the originality of the image. In this paper, we propose a perceptual image hashing scheme that is secure and robust to visually insignificant changes but fragile enough to detect and precisely locate malicious attacks. The proposed image hashing method is based on the outlines of one-dimensional signals re-arranged...
This paper proposes a visual secret sharing scheme for color image encryption with robust and progressive decryption abilities. Robust decryption means the secret content can be still decrypted from shares even the shares are corrupted with intentional or unintentional alterations. In progressive decryption, three levels quality of secret images can be decrypted with the same shares. A lower visual...
This paper proposes a scheme to hide multiple watermarks in transparencies of visual cryptography. On one hand, the main properties of the traditional visual cryptography are still maintained. On the other hand, not only the encrypted image can be visible when stacking the transparencies, but also two extra watermarks can be extracted with simple computations. The scheme can be applied to hide some...
This paper proposes two transparency authentication schemes used in visual cryptography, which are based on watermarking techniques. In the first scheme, a secret image can be perceptible when stacking two transparencies. In addition, another watermark image is visible when shifting one transparency to an appropriate position and stacking it with the other transparency. In the second scheme, both...
This paper proposes a scheme to hide two watermarks in visual secret sharing of a gray level image. One watermark is embedded during secret image halftoning, and the other watermark is hidden during the halftone image encryption. A non-expansion visual secret sharing model is used to encrypt the halftone image. In data extraction, only exclusive-OR operation is needed. Experimental results show the...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.