Yanxiao Liu

Efficient (n, t, n) secret sharing schemes

Highlights? We propose an efficient (n, t, n)-VSS. ? We propose a (n, t, n)-MSS. ? We propose a (n, t, n)-VMSS. ? All our (n, t, n) SS are unconditionally secure. Recently, Harn and Lin introduced a notion of strong t-consistency of a (t, n) secret sharing scheme and proposed a strong (n, t, n) verifiable secret sharing (VSS). In this paper, we propose a strong (n, t, n) VSS which is more efficient than Harn and Lins VSS. Using the same approach, we propose a (n, t, n) multi-secret sharing scheme (MSS) to allow shareholders to share n-t+1 secrets. Also, the proposed (n, t, n) MSS can be modified to include the verifiable feature. All proposed schemes are unconditionally secure and are based on Shamirs (t, n) secret sharing scheme.

Reducing shadow size in smooth scalable secret image sharing

A (k,n)-scalable secret image sharing (SSIS) scheme shares a secret image into n independent shadow images. This (k,n)-SSIS scheme can simultaneously provide the properties of threshold (k or more shadow images are required in reconstruction; but k − 1 or less shadow images reveal no information on the secret image) and the scalability (when k or more than k shadow images participate in reconstruction, more shadow images can reveal more information amount of secret image). In this paper, we deal with (k,n)-SSIS scheme with the smooth scalability such that the information amount of revealed image is “smoothly” proportional to the number of involved shadows, the whole secret image can be reconstructed only when all the n shadow images participate in reconstruction. Comparing with the existing smooth (k,n)-SSIS schemes, the proposed scheme has the less size of shadow image. Copyright

Scalable secret image sharing scheme with essential shadows

Abstract In scalable ( k , n ) secret image sharing schemes, original secret image can be partially recovered from any set of k shadows gradually, the entire image can be recovered from n shadows. Recently, ( t , s , k , n ) secret image sharing with essential shadows were proposed where the n shadows are divided into s essential shadows and n − s normal shadows, secret image can be reconstructed only if there are k or more shadows which include at least t essential shadows. Both the scalable secret image sharing and secret image sharing with essential shadows are practical and attract adequate focus in recent years. In this paper, we propose a new scalable ( t , s , k , n ) secret image sharing scheme with essential shadows. In our scheme, k or more shadows which include at least t essential shadows can gradually reconstruct secret image, entire secret image can be reconstructed when all s essential shadows are involved. Our scheme combines both features of scalable secret image sharing and secret image sharing with essential shadows, which is reasonable and practical in many applications. The size of shadows in proposed scheme is efficient comparing with previous ( t , s , k , n ) secret image sharing schemes with essential shadows.

Progressive (k,n) secret image sharing schemes based on Boolean operations and covering codes

Abstract ( k , n ) progressive secret image sharing (PSIS) schemes were discussed frequently in recent years. A ( k , n ) PSIS scheme consists of sharing phase and reconstruction phase. During sharing phase, a secret image is encrypted into n image-shadows; while during reconstruction phase, k to n image-shadows can progressively recover the image; fewer than k image-shadows get no information on the image. Most previous PSIS schemes can be divided into two categories, polynomial based PSIS schemes and visual cryptography based PSIS schemes. Polynomial based schemes can recover high quality image with complicated cryptographic computations; visual cryptography based PSIS schemes can reconstruct image using human visual system without any cryptographic computation, however, the size of image shadow expands largely from the image and the recovered image is quality-distortion. The motivation of this work is to solving the problems in existing PSIS schemes. Thus, in this paper, we adopt three Boolean operations: bit-level XOR, C O V ( 1 , 7 , 3 ) from ( 7 , 4 ) Hamming code and C O V ( 2 , 8 , 4 ) from ( 8 , 4 ) shortened Hamming code to propose three ( k , n ) PSIS schemes. In our schemes, k to n image-shadows can decrypt randomly partial pixels on entire image, and reconstruct image progressively. Comparing with previous PSIS schemes, our schemes has smaller image-shadow size and higher quality of recovered image than visual cryptography based PSIS schemes. On the other hand, our schemes has much more efficient operations in sharing procedure and image reconstruction procedure than polynomial based PSIS schemes.

Verifiable symmetric polynomial‐based key distribution schemes

Symmetric polynomial-based key distribution scheme has been widely adopted in various communication applications. This type of key distribution consists of a server and a set of users, where the server is responsible to distribute shares for each user via a symmetric polynomial. Based on the property of symmetry of this polynomial, each pair of users can compute a common secret key using their shares for establishing a secure communication channel. However, some users may receive faulty shares from the server because of some uncertain factors in the communication environment, such as software failures and transmission errors. As a result, the users who receive faulty shares cannot share common secret keys with other users. To solve this problem, in this paper, we propose two individual verifiable key distribution schemes on the basis of a symmetric polynomial based key distribution. In both our proposed schemes, the server adopts the same approach to distribute shares for users; the users are able to verify the validity of their shares without revealing them before establishing communication channels. If all shares areverified valid, users can ensure that each pair of them possesses a common secret key, they can establishsecurecommunicationchannelswhenneeded;otherwise,allusers cancollaborate toidentifythose userswho possess faulty shares and require the server to distribute a set of valid shares for those users. Furthermore, both our proposed schemes are efficient, because the procedures of verification and identification do not involve any complicated cryptographic operation. Copyright

Gleer: A Novel Gini-Based Energy Balancing Scheme for Mobile Botnet Retopology

Mobile botnet has recently evolved due to the rapid growth of smartphone technologies. Unlike legacy botnets, mobile devices are characterized by limited power capacity, calculation capabilities, and wide communication methods. As such, the logical topology structure and communication mode have to be redesigned for mobile botnets to narrow energy gap and lower the reduction speed of nodes. In this paper, we try to design a novel Gini-based energy balancing scheme (Gleer) for the atomic network, which is a fundamental component of the heterogeneous multilayer mobile botnet. Firstly, for each operation cycle, we utilize the dynamic energy threshold to categorize atomic network into two groups. Then, the Gini coefficient is introduced to estimate botnet energy gap and to regulate the probability for each node to be picked as a region C&C server. Experimental results indicate that our proposed method can effectively prolong the botnet lifetime and prevent the reduction of network size. Meanwhile, the stealthiness of botnet with Gleer scheme is analyzed from users’ perspective, and results show that the proposed scheme works well in the reduction of user’ detection awareness.

Progressive (k,n) secret image sharing Scheme with meaningful shadow images by GEMD and RGEMD

Abstract In ( k , n ) progressive secret image sharing (PSIS) schemes, a secret image is shared into n shadows in such way that: (1) fewer than k - 1 shadows get no information on the secret image; (2) k to n shadows can progressively recover the secret image. In most PSIS schemes, the shadows are noise-like images which would cause suspicious of attackers. The combination of secret image sharing and steganography can share a secret image into meaningful shadow images that can reduce attention of attackers. However most existing secret image sharing schemes with meaningful shadow images do not possess progressive property, a group of shadow images can either reconstruct entire secret image or get nothing on it. In this paper, we construct a new ( k , n ) PSIS with meaningful shadow images using GEMD and RGEMD. The property of progressive reconstruction is proved both in theoretical analysis and experimental results. The approaches of GEMD and RGEMD enable our Scheme high embedding capacity and resistance of RS detection. Comparing with other PSISs with meaningful shadow images, our Scheme has advantages in shadow size and shadow visual quality.

Exploiting error control in matrix coding-based data hiding over lossy channel

A steganographic scheme, matrix coding-based data hiding (MCDH), is constructed from covering function to enhance embedding efficiency, and, meanwhile, decrease the required changed bits. However, the MCDH may be compromised when using it as steganography over lossy channel. In this paper, we consider the so-called error spreading problem that one-bit error in MCDH may give rise to multi-bit errors when extracting the hidden data. In this paper, we present new MCDH to overcome error spreading problem based on constant weight code. Our new approach uses small lookup table to reduce embedding/extracting complexity. Experimental results demonstrate a better performance than previously proposed MCDHs in terms of spreading errors against lossy channel.

Cheating identifiable secret sharing scheme using symmetric bivariate polynomial

Abstract In ( k, n ) secret sharing scheme, any m out of the n users ( m  ≥  k ) can reconstruct the secret and any less than k users cannot get any information on the secret. However, some cheaters can submit fake shares to fool other honest users during secret reconstruction. Cheating identification is an important technical to prevent such cheating behavior. In this paper, we consider cheating problem in bivariate polynomial based secret sharing scheme, and propose two cheating identification algorithms respectively. The first algorithm can identify cheaters by the m users who participate in secret reconstruction; the second algorithm can achieves stronger capability of cheater identification with the collaboration of the rest n − m users who are not involved in secret reconstruction. In our scheme, the cheating identification is only based on the symmetry property of bivariate polynomial and linearity of interpolated polynomial. Both the two algorithms are efficient with respect of cheater identification capabilities.

Efficient group authentication in RFID using secret sharing scheme

Radio frequency identification (RFID) systems become more popular in recent years due to its low cost and high efficiency in identification. Authentication between tags and server is a key technology to protect the security of RFID systems. Most previous authentication approaches adopt hash functions or public cryptography, they need multiple rounds of communications between tags and sever. In this paper, we use threshold secret sharing scheme to propose a novel group authentication method in RFID. In our scheme, a group of tags can be authenticated by the sever with only need one-round communication, and the sever can identify the unqualified tags using the approach of cheater identification in secret sharing. The proposed authentication has efficient computation which is fit for RFID. More importantly, it can greatly reduce the cost of communication and also the risk of been attacked through the communication channel.