Because of the importance of digital images and their extensive application to digital watermarking, block chain, access control, identity authentication, distributive storage in the cloud and so on, ...image secret sharing (ISS) is attracting ever-increasing attention. Share authentication is an important issue in its practical application. However, most ISS schemes with share authentication ability require a dealer to participate in the authentication (namely, dealer participatory authentication). In this paper, we design an ISS for a <inline-formula> <tex-math notation="LaTeX">(k,n) </tex-math></inline-formula>-threshold with separate share authentication abilities of both dealer participatory authentication and dealer nonparticipatory authentication. The advantages of polynomial-based ISS and visual secret sharing (VSS) are skillfully fused to achieve these two authentication abilities without sending a share by using a screening operation. In addition, the designed scheme has the characteristics of low decryption (authentication) complexity, lossless decryption and no pixel expansion. Experiments and theoretical analyses are performed to show the effectiveness of the designed scheme.
With the rapid development of network media, increasing research on reversible watermarking has focused on improving its robustness to resisting attacks during digital media transmission. There are ...some other reversible watermarking schemes that work in the encrypted domain for preserving the privacy of the cover image. The robustness of the watermarking and the privacy preserving of the cover image have become the key factors of reversible watermarking. However, there are few robust reversible watermarking schemes in the encrypted domain that could resist common attacks (such as JPEG compression, noise addition) and preserve privacy at the same time. In addition, the embedding capacity of a robust watermark and the efficiency of the encryption method must be considered. Recently, cloud computing technology has led to the rapid growth of network media, and many multimedia properties are owned by multiple parties, such as a film's producer and multiple distributors. Multi-party watermarking has become an important demand for network media to protect all parties' rights. In this paper, a Robust Reversible Watermarking scheme in Encrypted Image with Secure Multi-party (RRWEI-SM) based on lightweight cryptography is first proposed. Additive secret sharing and block-level scrambling are developed to generate the encrypted image. Then, the robust reversible watermarking based on significant bit Prediction Error Expansion (PEE) is performed by Secure Multi-party Computation (SMC). For applications with high robustness, a Modified RRWEI-SM is proposed by exploiting two-stage architecture. Furthermore, both the RRWEI-SM scheme and Modified RRWEI-SM scheme are separable and can be applied to multiparty copyright protection. The experimental results and theoretical analysis demonstrate here that the RRWEI-SM and the Modified RRWEI-SM are secure, robust and effective.
To detect illegal copies of copyrighted images, recent copy detection methods mostly rely on the bag-of-visual-words (BOW) model, in which local features are quantized into visual words for image ...matching. However, both the limited discriminability of local features and the BOW quantization errors will lead to many false local matches, which make it hard to distinguish similar images from copies. Geometric consistency verification is a popular technology for reducing the false matches, but it neglects global context information of local features and thus cannot solve this problem well. To address this problem, this paper proposes a global context verification scheme to filter false matches for copy detection. More specifically, after obtaining initial scale invariant feature transform (SIFT) matches between images based on the BOW quantization, the overlapping region-based global context descriptor (OR-GCD) is proposed for the verification of these matches to filter false matches. The OR-GCD not only encodes relatively rich global context information of SIFT features but also has good robustness and efficiency. Thus, it allows an effective and efficient verification. Furthermore, a fast image similarity measurement based on random verification is proposed to efficiently implement copy detection. In addition, we also extend the proposed method for partial-duplicate image detection. Extensive experiments demonstrate that our method achieves higher accuracy than the state-of-the-art methods, and has comparable efficiency to the baseline method based on the BOW quantization.
Secret Image Sharing (SIS) is the technology that shares any given secret image by generating and distributing n shadow images in the way that any subset of k shadow images can restore the secret ...image. However, in the existing SIS schemes, the shadow images will be easily tampered and corrupted during the communication, which will pose serious security issues. Recently, blockchain has emerged as a promising paradigm in the field of data communication and information security. To securely communicate and effectively protect the secret image data in wireless networks, we propose a Blockchain-based Secure and Efficient Secret Image Sharing (BC-SESIS) scheme with outsourcing computation in wireless networks. In the proposed BC-SESIS scheme, the shadow images are encrypted and stored in the blockchain to prevent them from being tampered and corrupted. The identity authentication-enabled smart contract is deployed to achieve the ( k, n ) threshold for secret image restoring. Furthermore, to reduce the computational burden of smart contract and users, an efficient outsourcing computation method is designed to outsource the restoring task, which is securely implemented by agent miners in the encryption domain. Theoretical analysis and extensive experiments demonstrate that the BC-SESIS scheme can achieve desirable communication security and high computational efficiency in the wireless networks.
Secret Image Sharing (SIS) as a secure data sharing scheme in multiple cover images, has become an increasing researchers' concern. In traditional SIS, the cover image can't be recovered losslessly. ...The distorted cover images would reduce the practicability of the scheme, especially in medical and military images. The lossless recovery of cover images is required since all details of these images are very critical. In current Invertible SIS (ISIS), the secret image and the cover image may not be reconstructed losslessly. In addition, the authentication capability, visual quality of the stego cover image and embedding rate are limited in spatial domain-based ISIS. As an important carrier, the binary cover image is desired in real applications. Therefore, this paper proposes Transform domain-based Invertible and Lossless Secret Image Sharing schemes with Authentication (T-ILSISA), namely Integer Wavelet Transform-based ILSISA (IWT-ILSISA) and Binarization Transform-based ILSISA (BT-ILSISA) respectively. In (k,n) threshold IWT-ILSISA, the pixels of secret image and the data of cover image are regarded as the coefficients of the (k-1) degree polynomial. The values of generated share are embedded into IWT domain of the cover image. In BT-ILSISA, many different cover images are applied. The generated shares are transformed to the meaningful images since noise-like shares are easy to attract the attacker's attention, are suspected to censors and are difficult for identification and management. In the two schemes, the original secret image and the cover image can be recovered losslessly. The experimental results and theoretical analysis demonstrate that the performances of IWT-ILSISA are better than other similar schemes in the terms of embedding capacity, authentication capability and visual quality of the stego cover image. The BT-ILSISA has a lower computational complexity of the recovery.
Currently, searchable encryption is a hot topic in the field of cloud computing. The existing achievements are mainly focused on keyword-based search schemes, and almost all of them depend on ...predefined keywords extracted in the phases of index construction and query. However, keyword-based search schemes ignore the semantic representation information of users' retrieval and cannot completely match users' search intention. Therefore, how to design a content-based search scheme and make semantic search more effective and context-aware is a difficult challenge. In this paper, for the first time, we define and solve the problems of semantic search based on conceptual graphs (CGs) over encrypted outsourced data in clouding computing (SSCG). We first employ the efficient measure of "sentence scoring" in text summarization and Tregex to extract the most important and simplified topic sentences from documents. We then convert these simplified sentences into CGs. To perform quantitative calculation of CGs, we design a new method that can map CGs to vectors. Next, we rank the returned results based on "text summarization score". Furthermore, we propose a basic idea for SSCG and give a significantly improved scheme to satisfy the security guarantee of searchable symmetric encryption (SSE). Finally, we choose a real-world dataset, i.e., the CNN dataset to test our scheme. The results obtained from the experiment show the effectiveness of our proposed scheme.
A (<inline-formula> <tex-math notation="LaTeX">k </tex-math></inline-formula>, <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula>) visual cryptographic scheme (VCS) shares a ...secret image into <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula> shadow images that are distributed over <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula> involved participants. When <inline-formula> <tex-math notation="LaTeX">k </tex-math></inline-formula> participants stack their shadow images, the secret is revealed. The secret image of VCS is a visual secret. Even though black/white dots in shadows suffer from interference by noise, the color may still retain the corresponding darkness with high probability. Therefore, VCS has noise immunity for secret recovery. Hence, it seems that there is no need to design a VCS that is robust to noise interference when transmitting or storing the files of shadow images. However, some VCSs use the permutations of subpixels in shadow images as information to realize multiple decoding options. For such schemes, we absolutely should ensure the correctness of the shadows. In this article, we investigate a VCS with <inline-formula> <tex-math notation="LaTeX">t </tex-math></inline-formula>-error correcting capability (VCS-<inline-formula> <tex-math notation="LaTeX">t </tex-math></inline-formula>EC). To the best of our knowledge, VCS-<inline-formula> <tex-math notation="LaTeX">t </tex-math></inline-formula>EC is introduced for the first time. Three (<inline-formula> <tex-math notation="LaTeX">k </tex-math></inline-formula>, <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula>)-VCS-<inline-formula> <tex-math notation="LaTeX">t </tex-math></inline-formula>EC schemes are proposed: the separated scheme, the integrated scheme, and the nonsystematic scheme.
A (k,n) visual cryptographic scheme (VCS) encodes a secret image into n shadow images (printed on transparencies) distributed among n participants. When any k participants superimpose their ...transparencies on an overhead projector (OR operation), the secret image can be visually revealed by a human visual system without computation. However, the monotone property of OR operation degrades the visual quality of reconstructed image for OR-based VCS (OVCS). Accordingly, XOR-based VCS (XVCS), which uses XOR operation for decoding, was proposed to enhance the contrast. In this paper, we investigate the relation between OVCS and XVCS. Our main contribution is to theoretically prove that the basis matrices of (k,n)-OVCS can be used in (k,n)-XVCS. Meantime, the contrast is enhanced 2 (k-1) times.
Reversible Data Hiding in Encrypted Images (RDHEI) has drawn increasing concern in multimedia cloud computing scenarios. It embeds secret message into the encrypted carrier while preserving the ...confidentiality of the image. However, most RDHEI schemes have only one hider and one image carrier which are not efficient for the distributed system with multiple participants. Moreover, if the stego-image is lost, the cover image and the embedded data cannot be restored. To solve above issues, this paper proposes Reversible Data Hiding in Shared Images based on syndrome decoding and homomorphism (RDHSI). In RDHSI, the cover image and secret data are distributed using secret sharing. Multiple data hiders embed shared data into the shared images based on the Syndrome Decoding of Hamming codes and the additive homomorphism of the polynomial. On the receiver side, the lossless cover image and secret data are obtained. The reversibility and privacy preserving of the cover image, the complete extraction of secret data, and the fault-tolerance of the proposed schemes are achieved. The experimental results show that PSNR of the marked image is above 54 dB at the embedding rate of 0.43 bpp . In order to improve the payload of secret data, the Modified RDHSI is further proposed. Generally, the proposed schemes are secure, effective and fault-tolerant.
PDF
