Results 161 to 170 of about 3,112 (196)
Hybrid quantum-chaotic key expansion enhances QKD rates using the Lorenz system. [PDF]
Danvirutai P +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Computers & Graphics, 2002
Abstract In this paper, we propose a method such that a secret image is shared by n shadow images, and any r shadow images (r⩽n) of them can be used to restore the whole secret image. The size of each shadow image is smaller than the secret image in our method.
Chih-Ching Thien, Ja-Chen Lin
openaire +1 more source
Abstract In this paper, we propose a method such that a secret image is shared by n shadow images, and any r shadow images (r⩽n) of them can be used to restore the whole secret image. The size of each shadow image is smaller than the secret image in our method.
Chih-Ching Thien, Ja-Chen Lin
openaire +1 more source
Signal Processing: Image Communication, 2007
In this paper, we propose an innovative scheme, namely the scalable secret image sharing scheme, for sharing an image O among n participants such that the clarity of the reconstructed image (i.e., the amount of information therein) scales with proportion with the number of the participants.
Ran-Zan Wang, Shyong-Jian Shyu
openaire +1 more source
In this paper, we propose an innovative scheme, namely the scalable secret image sharing scheme, for sharing an image O among n participants such that the clarity of the reconstructed image (i.e., the amount of information therein) scales with proportion with the number of the participants.
Ran-Zan Wang, Shyong-Jian Shyu
openaire +1 more source
Relations Between Secret Sharing and Secret Image Sharing
2019Secret sharing (SS) for (k, n) threshold generates secret data into n shadows, where any k or more shadows can reconstruct the secret while any \(k-1\) or less shadows reconstruct nothing of the secret. SS is useful for cloud computing security, block chain security and so on.
Xuehu Yan +5 more
openaire +1 more source
Construction-Based Secret Image Sharing
2020Most secret image sharing (SIS) schemes output noise-like shadows and are fragile to any noise due to their restoring methods are based on mathematical operations. A noise-like shadow increases the suspicion of an attacker and the fragileness leads to the secret pixel is wrongly restored even if a bit error occurs.
Xuehu Yan +4 more
openaire +1 more source
Computationally secure secret image sharing
2017 Iranian Conference on Electrical Engineering (ICEE), 2017A secret image sharing scheme is used to protect the confidentiality of important images and also to safeguard them against single point of failure. the first proposed secret image sharing scheme used a technique to reduce the size of shares to 1/t of the secret, the benefits of small share size drawn the attention of many researchers to that technique
Amir M. Ahmadian, Maryam Amirmazlaghani
openaire +1 more source
Multiple Secret Images Sharing Scheme
2008 IEEE Region 10 and the Third international Conference on Industrial and Information Systems, 2008Secret sharing is an efficient method of transmitting the image securely. This paper discusses an efficient secret sharing scheme for multiple secret images. It has been shown through the experimental result that the proposed scheme transmits the images secretly and then efficiently recovers the same at the receiver end.
Vinay Rishiwal +3 more
openaire +1 more source
Visual Cryptography and Secret Image Sharing
2017With rapid progress in Internet and digital imaging technology, there are more and more ways to easily create, publish, and distribute images. Considered the first book to focus on the relationship between digital imaging and privacy protection, Visual Cryptography and Secret Image Sharing is a complete introduction to novel security methods and ...
S. Cimato, C. N. Yang
openaire +2 more sources
An Image Secret Sharing Method
2006 9th International Conference on Information Fusion, 2006This paper presents an image secret sharing method which essentially incorporates two k-out-of-n secret sharing schemes: i) Shamir's secret sharing scheme and ii) matrix projection secret sharing scheme. The technique allows a secret image to be divided as n image shares so that: i) any k image shares (k ? n) can be used to reconstruct the secret image
Li Bai +3 more
openaire +1 more source

