相关论文: Corrigendum to "Random grid-based visual secret sh…

In (k, n) visual secret sharing (VSS) scheme, secret image can be visually reconstructed when k or more participants printing theirs shares on transparencies and stack them together. No secret is revealed with fewer than k shares. The…

Visual cryptography schemes (VCSs) belong to a category of secret image sharing schemes that do not require cryptographic knowledge for decryption, instead relying directly on the human visual system. Among VCSs, random grid-based VCS…

Pixel expansion and the quality of the reconstructed secret image has been a major issue of visual secret sharing (VSS) schemes. A number of probabilistic VSS schemes with minimum pixel expansion have been proposed for black and white…

Visual secrete sharing (VSS) is an encryption technique that utilizes human visual system in the recovering of the secret image and it does not require any complex calculation. Pixel expansion has been a major issue of VSS schemes. A number…

In evolving access structures, the number of participants is countably infinite with no predetermined upper bound. While such structures have been realized in secret sharing, research in secret image sharing has primarily focused on visual…

Visual cryptography scheme (VCS) is an encryption technique that utilizes human visual system in recovering secret image and it does not require any complex calculation. However, the contrast of the reconstructed image could be quite low. A…

Secret sharing was proposed primarily in 1979 to solve the problem of key distribution. In recent decades, researchers have proposed many improvement schemes. Among all these schemes, the verifiable multi-secret sharing (VMSS) schemes are…

Visual cryptography encrypts the secret image into $n$ shares (transparency) so that only stacking a qualified number of shares can recover the secret image by the human visual system while no information can be revealed without a large…

With rich visual data, such as images, becoming readily associated with items, visually-aware recommendation systems (VARS) have been widely used in different applications. Recent studies have shown that VARS are vulnerable to item-image…

Inspired by Naor et al.'s visual secret sharing (VSS) scheme, a novel n out of n quantum visual secret sharing (QVSS) scheme is proposed, which consists of two phases: sharing process and recovering process. In the first process, the color…

The ability to accurately predict the contrast achieved from high contrast imagers is important for efficient scheduling and quality control measures in modern observatories. We aim to consistently predict and measure the raw contrast…

Two novel visual cryptography (VC) schemes are proposed by combining VC with single-pixel imaging (SPI) for the first time. It is pointed out that the overlapping of visual key images in VC is similar to the superposition of pixel…

A verifiable multi-secret sharing (VMSS) scheme enables the dealer to share multiple secrets, and the deception of both participants and the dealer can be detected. After analyzing the security of VMSS schemes proposed by Mashhadi and…

This paper presents a recursive hiding scheme for 2 out of 3 secret sharing. In recursive hiding of secrets, the user encodes additional information about smaller secrets in the shares of a larger secret without an expansion in the size of…

Verifiable secret sharing (VSS) is designed to allow parties to collaborate to keep secrets. We describe here a method of fabricating false secret shares that appear to other parties to be legitimate, which can prevent assembly of the…

The decrease in the rms contrast of time-averaged images with the averaging time is compared between four datasets: (1) a series of solar granulation images recorded at La Palma in 1993; (2) a series of artificial granulation images…

Recent approaches in self-supervised learning of image representations can be categorized into different families of methods and, in particular, can be divided into contrastive and non-contrastive approaches. While differences between the…

We present two experimental schemes to perform continuous variable (2,3) threshold quantum secret sharing on the quadratures amplitudes of bright light beams. Both schemes require a pair of entangled light beams. The first scheme utilizes…

In this paper, we investigate the cause of the high false positive rate in Visual Relationship Detection (VRD). We observe that during training, the relationship proposal distribution is highly imbalanced: most of the negative relationship…

Visual cryptography schemes have been introduced in 1994 by Naor and Shamir. Their idea was to encode a secret image into $n$ shadow images and to give exactly one such shadow image to each member of a group $P$ of $n$ persons. Whereas most…