A secret sharing scheme for EBTC using steganography

In this paper, a new method based on Block Truncation Coding (BTC) and the halftoning technique is proposed for secret sharing of lossy compressed images. BTC is a simple and efficient image compression technique. However, it yields images of undesirable quality, and significant blocking effects are seen as the block size that is used increases. A modified method known as Enhanced Block Truncation Coding (EBTC) is proposed to solve these problems. For secret sharing, we propose a (2, 2) secret sharing scheme which provides authentication using DE scheme. This scheme was developed for data hiding with grayscale images, but our proposed EBTC uses bitmap images for which the DE scheme is not appropriate. We show the solution for such a problem. Moreover, we reduce the computation complexity for secret sharing using the DE algorithm because past schemes which used polynomial or interpolation algorithms require too much time for secret sharing. In addition, we show how to authenticate a cover image. Experimental results show that our proposed scheme provides secret sharing with proper authentication and acceptable computational complexity.     

A novel secret image sharing scheme using large primes

A secret image sharing scheme is any method of distributing shares of a secret image amongst a set of peers, such that the secret may be revealed only with participation of all members of a qualified set of peers. Following Shamir’s (t, n)–threshold scheme, we propose a novel lossy/lossless secret image sharing scheme, that improves existing schemes in terms of security and performance. As opposed to the usual convention of representing a digital image by a collection of 8–bit integer values, we consider 8b–bit values where b is a positive integer. This approach accommodates a larger finite field, which in turn produces a less intrusive secret image sharing scheme. Extensive empirical results are presented to demonstrate the efficiency and robustness of the proposed scheme.     

A reversible and authenticable secret sharing scheme using dual images

Multimedia Tools and Applications - Reversible data hiding (RDH) is a steganographic method that can restore the cover medium after extracting the embedded secret data. This work proposes a novel...     

Recursive hiding of biometrics-based secret sharing scheme using adversary structure

This paper first investigates the applications of recursive hiding of secret, which was originally proposed for visual cryptography to space efficient secret sharing, and then provides a novel recursive hiding of biometrics-based secret sharing scheme using adversary structure. The proposed scheme may find applications for sharing secrets with excess bits, especially in the scenarios where resources are strictly limited and the requirement of verification is demanding. Existing ways of combiner verification always just rely on exponentiation or only by hiring one-way hash function, which cannot thwart the stolen share attack, spoofing attack or discriminate an imposter who fraudulently obtains the access privileges from the genuine participant. Nonetheless, these problems can be tackled by the unique property of biometrics in our paper. Most importantly, unlike most counterpart schemes, no other random numbers are used to protect the secret pieces, hence, our scheme is simpler and more efficient, and the computation cost is relatively low.     

Medical image security and EPR hiding using Shamir's secret sharing scheme

Medical applications such as telediagnosis require information exchange over insecure networks. Therefore, protection of the integrity and confidentiality of the medical images is an important issue. Another issue is to store electronic patient record (EPR) in the medical image by steganographic or watermarking techniques. Studies reported in the literature deal with some of these issues but not all of them are satisfied in a single method. A medical image is distributed among a number of clinicians in telediagnosis and each one of them has all the information about the patient's medical condition. However, disclosing all the information about an important patient's medical condition to each of the clinicians is a security issue. This paper proposes a (k, n) secret sharing scheme which shares medical images among a health team of n clinicians such that at least k of them must gather to reveal the medical image to diagnose. Shamir's secret sharing scheme is used to address all of these security issues in one method. The proposed method can store longer EPR strings along with better authenticity and confidentiality properties while satisfying all the requirements as shown in the results.     

一种高效实用的秘密分存方案

秘密分存机制在密钥管理、数据安全等方面有非常广泛的应用,是现代密码学领域中一个非常重要的分支,也是网络信息安全方向一个重要的研究内容。本文针对校园网中教务管理的实际应用,提出一种高效实用的2人秘密分存方案,并详细介绍其原理和实现方法。该方案算法简单方便,容易编码实现,并结合对称密钥、公开密钥加密机制保护原始秘密,可为增强类似系统的安全性提供参考。     

A lossless secret image sharing scheme using a larger finite field

Recent research has made an effort to take 8b-bit value as a polynomial coefficient and use a random number as the maximum coefficient term in a Shamir’s polynomial, where b > 0. These can help improve computationl efficiency by reducing the sum of calculating polynomials, and avoid the case of the coefficient of x^k??1 being zero. However, such research still has the issues of requiring much extra storage space, lossy secret image, shadow images with large size, and storing permutation key. To solve the above issues, in this paper, we propose a novel scheme which takes 8b-bit value as a polynomial coefficient, designs a bit-level method and runs under Galois Field GF(2^8b). Experimental results show that this scheme improves existing similar schemes on several aspects, such as less extra storage space and higher computational performance.

     

Rich QR code with three-layer information using visual secret sharing scheme

Multimedia Tools and Applications - Owing to efficient machine recognition, QR codes have been widely used in many aspects such as information management, electronic identity and mobile payment....     

An image-in-image communication scheme using secret sharing and M-ary spread spectrum watermarking

Microsystem Technologies - Secret image sharing is a means of secure transmission of images on an open network through meaningful share generation that reduces suspiciousness of conventional image...     

Bayesian mechanism for rational secret sharing scheme

We consider the cooperation of rational parties in secret sharing. We present a new methodology for rational secret sharing both in two-party and multi-party settings based on Bayesian game. Our approach can resolve the impossible solutions to a rational secret sharing model. First, we analyze the 2-out-of-2 rational secret sharing using Bayesian game, which makes us able to consider different classes of the protocol player(for“good” and “bad” players) and model attributes such as any other parties’ preferences and beliefs that may affect the outcome of the game. Thus, the new model makes us able to reason rational secret sharing from the perspective of Bayesian rationality, a notion that may be in some scenarios more appropriate than that defined as per pure rational. According to these analyses, we propose a Bayesian rational protocol of 2-out-of-2 secret sharing. Also, our techniques can be extended to the case of t-out-of-n Bayesian rational secret sharing easily.Our protocol is adopted only by the parties in their decision-making according to beliefs and Bayes rule, without requiring simultaneous channels and can be run over asynchronous networks.     

A novel multiple-level secret image sharing scheme

Multimedia Tools and Applications - In this paper, a novel multiple-level secret image sharing scheme is proposed, which achieves the additional steganography, the authentication, and the scalable...     

A cellular automata-based multi-stage secret image sharing scheme

Multimedia Tools and Applications - A new Multi-Stage Multi-Secret Image Sharing (MSMSIS) scheme, based on polynomial sharing and cellular automata, is proposed in this paper. The proposed scheme...     

Efficient visual secret sharing scheme for color images

A k-out-of-n visual secret sharing scheme (VSSS) resolves the visual variant of the k-out-of-n secret sharing problem where only k or more out of n participants can reveal the secret by human visual system without any cryptographic computation. The best pixel expansion of the general k-out-of-n VSSS for c-colored images was c×m by Yang and Laih [New colored visual secret sharing schemes, Des Codes Cryptogr. 24 (2000) 325-335] where m is the pixel expansion of an existing binary k-out-of-n VSSS. Regarding the c-colored n-out-of-n scheme, the best pixel expansion is (c-1)2^n-1-c+2 and c(c-1)2^n-2-c when n is odd and even, respectively, by Blundo et al. [Improved schemes for visual cryptography, Des Codes Cryptogr. 24 (2001) 255-278]. In this paper, we propose a new c-colored k-out-of-n VSSS by using a pixel expansion of that is more efficient than ever.     

Hierarchical threshold secret sharing scheme for color images

Multimedia Tools and Applications - The applications that use pattern recognition via secret sharing are seldom linear, straightforward and uncomplicated. The layers of complexity grows as the...     

Reversible secret image sharing scheme in encrypted images

The previous secret image sharing schemes did not provide a copyright and privacy for cover images. The reason is that a dealer selects a cover image by itself and embeds directly the secret data into the cover image. In this paper, a reversible secret image sharing scheme in encrypted images is proposed in order to provide the copyright and privacy of the cover image. We divide a role of the dealer into an image provider and a data hider. The image provider encrypts the cover image and transmits the encrypted image to the data hider, and the standard stream cipher as one-time pad (OTP) with a random secret key is used. The data hider embeds the secret data into the encrypted image, and the encrypted shadow images are transmitted to the corresponding participant. We utilize the polynomial arithmetic operation over GF(2⁸) during the sharing of the encrypted shadow images, and the coefficient of the highest-order term is fixed to one in order to prevent the overflow and the security problem. In the reconstruction procedure, the secret data can be extracted and the cover image can be reconstructed exactly from t or more encrypted shadow images with Lagrange interpolation. In experimental results, the proposed method shows that the PSNR is sustained close to 44 dB regardless of the embedding capacity, where the embedding capacity is 524,288 bits on average.     

A novel secret image sharing scheme in color images using small shadow images

Over the past several years, secret image sharing techniques have become another branch of the effort to prevent secret images from being eavesdropped on, in addition to traditional cryptography. Because smaller shadows can speed up the transmission of a secret color image, in this paper we combine Chang and Wu’s gradual search algorithm for a single bitmap BTC (GSBTC) and Shamir’s (k, n) threshold concept to propose a novel secret color image sharing scheme that generates smaller shadows. Experimental results confirm that the proposed scheme successfully reduces shadow size and that each shadow behaves as a random-like image that prevents leakage of information about the secret color image. Furthermore, the correlation between two vertically or horizontally adjacent pixels in each shadow is significantly less than those in a color secret image, and the presented scheme also achieves, on average, an NPCR = 0.414% and AUCI = 32.78%. Thus, with our scheme one-pixel difference could cause a significant difference in the corresponding shadows. Therefore, the security of the presented scheme is also confirmed.     

A new image secret sharing scheme to identify cheaters

A verifiable image secret sharing scheme, which is based on the Thien-Lin scheme and the intractability of the discrete logarithm, is proposed in this paper. The new scheme can identify the cheaters no matter if she/he is the original secret image holder or the participant; because each participant chooses her/his own secret shadow by her/himself, the new system doesn't need a security channel; Due to the same fact, the secret shadow of each participant can be reused. In addition, the size of each shadow image, same as the Thien-Lin scheme, is smaller than that of the original secret image.     

基于部分广播通道的可验证秘密共享方案

借鉴Amos方案中重构秘密的思想对Rei方案进行了完善,提出一种基于部分广播通道的可验证秘密共享方案.在该方案的秘密分发阶段,秘密分发者与参与者之间使用部分广播通道进行通信,秘密重构阶段使用广播通道进行通信.该方案可处理不诚实秘密分发者与参与者情况,具有可验证性.通过对该方案的分析可知,该方案的通道数和总的通信量比已知的两个方案具有明显的优势.此外,该方案中各参与者的秘密份额可反复使用.