Selective scalable secret image sharing with verification
TL;DR: The Salient map is introduced to develop a new method, in which the ROIs (region of interesting) of secret image can be revealed progressively, and to the best of the authors' knowledge, this is the first SSIS that employs a meaningful shadow.
Abstract: Scalable secret image sharing (SSIS) is a new secret image sharing technique. The feature of scalability refers to the fact that the revealed secret information is proportional to the number of gathered shadows. Once all of the valid shadows are collected, the complete secret can be revealed easily. The kernel of secret information, however, may be leaked out with a few shadows collected in the existing SSIS mechanisms. This is because researchers seldom concerned about secret distribution. Thus, we introduce the Salient map to develop a new method, in which the ROIs (region of interesting) of secret image can be revealed progressively. Additionally, we introduce the concepts of meaningful shadow and verification to SSIS. To the best of our knowledge, this is the first SSIS that employs a meaningful shadow. The leading adoption can greatly help reduce the attention of attackers in order to enhance the security, while the second concept can avoid malicious behaviors from outside attackers or dishonest members.
Citations
More filters
TL;DR: A general analysis of the current status of CAD systems according to the used image modalities and the machine learning based classifiers is provided.
245 citations
TL;DR: This study proposes and validates a new theoretical model that extends the parasocial relationship (PSR) theory and verified the robustness of the proposed model by introducing new antecedents reflecting risk-related attributes, which has not been investigated in prior PSR research.
Abstract: The purpose of this paper is to develop a comprehensive research model that can explain customers’ continuance intentions to adopt and use intelligent personal assistants (IPAs).,This study proposes and validates a new theoretical model that extends the parasocial relationship (PSR) theory. Partial least squares analysis is employed to test the research model and corresponding hypotheses on data collected from 304 survey samples.,Interpersonal attraction (task attraction, social attraction, and physical attraction) and security/privacy risk are important factors affecting the adoption of IPAs.,First, this is the first empirical study to examine user acceptance of IPAs. Second, to the authors’ knowledge, no research has been conducted to test the role of PSR in the context of IPAs. Third, this study verified the robustness of the proposed model by introducing new antecedents reflecting risk-related attributes, which has not been investigated in prior PSR research. But this study has limitations that future research may address. First, key findings of this research are based only on data from users in the USA. Second, individual differences among the survey respondents were not examined.,To increase the adoption of IPAs, manufacturers should focus on developing “human-like” and “professional” assistants, in consideration of the important role of PSR and task attraction. R&D should continuously strive to realize artificial intelligence technology advances so that IPAs can better recognize the user’s voice and speak naturally like a person. Collaboration with third-party companies or individual developers is essential in this field, as manufacturers are unable to independently develop applications that support the specific tasks of various industries. It is also necessary to enhance IPA device design and its user interface to enhance physical attraction.,This study is the first empirical attempt to examine user acceptance of IPAs, as most of the prior literature has concerned analysis of usage patterns or technical features.
156 citations
TL;DR: A color image chaos encryption algorithm combining Cyclic Redundancy Check (CRC) and nine palace map that has the advantages of large key space, high key sensitivity, anti-robust attack, and feasible encryption efficiency is proposed.
Abstract: The color image encryption algorithm based on the chaos theory is not strong enough. In this paper, we proposed a color image chaos encryption algorithm combining Cyclic Redundancy Check (CRC) and nine palace map. Firstly, the pixel data of the plain image were moved and shuffled based on the theory of nine palace map. And the R, G and B components were extracted and converted into a binary sequence matrix that was then cyclically shifted based on the technology of generating CRC code. Finally, the encrypted image was derived from the XOR operation with random key matrix. The average entropy of encrypted image by our algorithm is 7.9993, which is slight improved compared with the coupled hyper chaotic Lorenz algorithm in previous studies. In addition, the algorithm has the advantages of large key space, high key sensitivity, anti-robust attack, and feasible encryption efficiency.
127 citations
TL;DR: In this survey, WiFi-based indoor positioning techniques are divided into the active positioning technique and the passive positioning technique based on whether the target carries certain devices.
Abstract: With the rapid development of wireless communication technology, various indoor location-based services (ILBSs) have gradually penetrated into daily life. Although many other methods have been proposed to be applied to ILBS in the past decade, WiFi-based positioning techniques with a wide range of infrastructure have attracted attention in the field of wireless transmission. In this survey, the authors divide WiFi-based indoor positioning techniques into the active positioning technique and the passive positioning technique based on whether the target carries certain devices. After reviewing a large number of excellent papers in the related field, the authors make a detailed summary of these two types of positioning techniques. In addition, they also analyse the challenges and future development trends in the current technological environment.
116 citations
TL;DR: Under the proposed framework, the proposed encryption scheme is highly sensitive to minor differences in both secret key and plain image, resulting in resisting chosen/known plaintext attacks effectively, comparing with existing approaches in literature.
96 citations
References
More filters
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
Abstract: In this paper we show how to divide data D into n pieces in such a way that D is easily reconstructable from any k pieces, but even complete knowledge of k - 1 pieces reveals absolutely no information about D. This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
14,340 citations
"Selective scalable secret image sha..." refers background in this paper
...We introduce ART and Shamir’s secret sharing technique in Section 2....
[...]
...The (t, n) threshold mechanism was firstly proposed by Shamir [9] in 1979....
[...]
...In 1979, Shamir first proposed the concept of (t,n) threshold secret sharing to mitigate this problem [9]....
[...]
23 Jun 2013
TL;DR: This paper regards saliency map computation as a regression problem, which is based on multi-level image segmentation, and uses the supervised learning approach to map the regional feature vector to a saliency score, and finally fuses the saliency scores across multiple levels, yielding the salency map.
Abstract: Salient object detection has been attracting a lot of interest, and recently various heuristic computational models have been designed. In this paper, we regard saliency map computation as a regression problem. Our method, which is based on multi-level image segmentation, uses the supervised learning approach to map the regional feature vector to a saliency score, and finally fuses the saliency scores across multiple levels, yielding the saliency map. The contributions lie in two-fold. One is that we show our approach, which integrates the regional contrast, regional property and regional background ness descriptors together to form the master saliency map, is able to produce superior saliency maps to existing algorithms most of which combine saliency maps heuristically computed from different types of features. The other is that we introduce a new regional feature vector, background ness, to characterize the background, which can be regarded as a counterpart of the objectness descriptor [2]. The performance evaluation on several popular benchmark data sets validates that our approach outperforms existing state-of-the-arts.
1,057 citations
[...]
TL;DR: A method such that a secret image is shared by n shadow images, and any r shadow images of them can be used to restore the whole secret image, and the size of each shadow image is smaller than the secret image in this method.
777 citations
"Selective scalable secret image sha..." refers background in this paper
...Nevertheless, neither [10] nor [6] can provide a meaningful shadow image....
[...]
...Thien and Lin later extended this concept to protect confidential images [10]....
[...]
TL;DR: A novel approach to secret image sharing based on a (k, n)-threshold scheme with the additional capabilities of steganography and authentication with the capability of authenticating the fidelity of each processed camouflage image, called a stego-image is proposed.
454 citations
"Selective scalable secret image sha..." refers background or methods in this paper
...Lin and Tsai offered a version, in which each shadow is meaningful [7]....
[...]
...To highlight the ability to mitigate the potential risk of attackers’ consciousness, we conducted simulations of related state-of-the-art works [7, 15], which are (2, 4) scalable secret image sharing methods....
[...]
...4 Shadow evaluation for the (2, 4) secret image sharing schemes: a the shadows of [15]; b the shadows of [7]; c the shadows of the proposed scheme 8 Multimed Tools Appl (2017) 76:1–11...
[...]
TL;DR: A scheme to improve authentication ability that prevents dishonest participants from cheating is presented and the arrangement of embedded bits is defined to improve the quality of stego-image.
287 citations
"Selective scalable secret image sha..." refers background or methods in this paper
...To highlight the ability to mitigate the potential risk of attackers’ consciousness, we conducted simulations of related state-of-the-art works [7, 15], which are (2, 4) scalable secret image sharing methods....
[...]
...Yang and Huang extended SSIS to a t-out-of-n version in 2010 [11, 13, 15, 17], where a qualified group of participants includes t participants and 2≤t≤n....
[...]
...4 Shadow evaluation for the (2, 4) secret image sharing schemes: a the shadows of [15]; b the shadows of [7]; c the shadows of the proposed scheme 8 Multimed Tools Appl (2017) 76:1–11...
[...]