Secret Sharing Scheme Research Articles

Space-Efficient Key-Policy Attribute-Based Encryption from Lattices and Two-Dimensional Attributes

Linear secret-sharing scheme (LSSS) is a useful tool for supporting flexible access policy in building attribute-based encryption (ABE) schemes. But in lattice-based ABE constructions, there is a subtle security problem in the sense that careless usage of LSSS-based secret sharing over vectors would lead to the leakage of the master secret key. In this paper, we propose a new method that employs LSSS to build lattice-based key-policy attribute-based encryption (KP-ABE) that resolves this security issue. More specifically, no adversary can reconstruct the master secret key since we introduce a new trapdoor generation algorithm to generate a strong trapdoor (instead of a lattice basis), that is, the master secret key, and remove the dependency of the master secret key on the total number of system attributes. Meanwhile, with the purpose of reducing the storage cost and support dynamic updating on attributes, we extended the traditional 1-dimensional attribute structure to 2-dimensional one. This makes our construction remarkably efficient in space cost, with acceptable time cost. Finally, our scheme is proved to be secure in the standard model.

An Intelligent 2D Secret Share Construction using Visual Cryptography for Secure Transmission

Data Security is the most challenging area in Internet communication, where most of the secret sharing schemes are proposed for binary images. But still it lacks in providing security for data communication, especially in image transmission. Traditional visual cryptography scheme generate meaningless diwies and the reconstruction phase leads to quality degradation over the secret image. In this work, an intelligent two dimensional secret share construction scheme is proposed. A secret image is expanded into n diwies with the choice of scheme selection. By Stacking all the qualified diwies to revert the secret image without content loss and less than s* - 1 shares could not reveal any information about the secret image. The experimental results emphasize that the proposed secret share scheme is highly secured for image transmission.

Quantum Secret Sharing Scheme with Credible Authentication based on Quantum Walk

Quantum Secret Sharing Scheme with Credible Authentication based on Quantum Walk

A New Secret Sharing Scheme Based on Polynomials over Finite Fields

In this paper, we examine a secret sharing scheme based on polynomials over finite fields. In the presented scheme, the shares can be used for the reconstruction of the secret using polynomial multiplication. This scheme is both ideal and perfect.

Access Control Based on Different User Privileges in Social Media

The emergence of social media lead to people around the world is widely using it. There are varieties of applications under this category for diverse purposes. Day by day, the security concerns related to this area is increasing since it is a medium which connect people. At present, the single access policy is present. That is whether a user can access the media content or not. Hence multi access policy can provide more user satisfaction. On the other hand video and image can be encoded into different qualities. Ciphertext Policy Attribute-Based Encryption is used for encrypting keys used in symmetric encryption. Here introducing Linear Secret Sharing Scheme (LSSS) to the scalable social media stream security. The LSSS mechanism is adopted to increase the expressiveness of the monotone access structure. By utilizing an LSS Scheme the access structure becomes more protective. This algorithm is very useful in practice as a ciphertext policy can now be intuitively expressed using a monotone Boolean formula, which has good usability, and the corresponding LSSS for an actual CP-ABE construction can then be generated accordingly using this algorithm.

Compartmented Secret Sharing Schemes and Locally Repairable Codes

Multipartite secret sharing is an important research object in the area of secret sharing schemes. Compartmented access structures are an interesting class of multipartite access structures. The constructions of ideal linear schemes realizing compartmented access structures are studied by codes in this paper. We find that compartmented secret sharing is related to a class of codes called locally repairable codes which are being used widely in distributed and cloud storage systems. We study secret sharing schemes for compartmented access structures with upper bounds, compartmented access structures with lowers bounds and compartmented access structures with upper and lower bounds. We establish the relationships between secret sharing schemes for these compartmented access structures and locally repairable codes. Based on the relationships and some locally repairable codes, we obtain ideal linear schemes realizing these compartmented access structures by efficient methods.

A Cloud Solution for Securing Medical Image Storage

Cloud computing is an easy-to-use, affordable solution to manage and analyze medical data. Therefore, this paradigm has gained wide acceptance in the healthcare sector as a cost-efficient way for a successful Electronic Medical Records (EMR) implementation. Cloud technology is, however, subject to increasing criticism because of the numerous security vulnerabilities. In this regard, we propose a framework to protect confidential data through the development of new security measures, including compression, secret share scheme and XOR operation. The primary objective of the proposal is to achieve the right balance between security and usability. To this aim, we divide an image into several blocks and then encrypt each piece separately with different cryptographic keys. To enhance privacy and performance, we suggest DepSky architecture to keep data on various storage nodes. Simulation experiments have been conducted to prove the effectiveness of the proposed methodology.

Efficient attribute-based encryption with repeated attributes optimization

Internet of Things (IoT) is an integration of various technologies to provide technological enhancements. To enforce access control on low power operated battery constrained devices is a challenging issue in IoT scenarios. Attribute-based encryption (ABE) has emerged as an access control mechanism to allow users to encrypt and decrypt data based on an attributes policy. However, to accommodate the expressiveness of policy for practical application scenarios, attributes may be repeated in a policy. For certain policies, the attributes repetition cannot be avoided even after applying the boolean optimization techniques to attain an equivalent smaller length boolean formula. For such policies, the evaluated secret shares are also multiple for repeated attributes; hence, the ciphertext computed for those irreducible policies is long and computational effort is more. To address this issue, a new CP-ABE scheme is proposed which employs our Repeated Attributes Optimization algorithm by which the Linear Secret Sharing Scheme matrix sent along with ciphertext will contain the access structure of policy including attributes appearing multiple times, but the ciphertext will only be evaluated for unique non-repeated attributes. Security and performance analysis show that the proposed construction fulfils its goals of achieving desired security with low communication overhead and computational cost for resource-constrained devices.

Toward Improving Secret Sharing Scheme Based on Encryption in Cloud Computing Environment

Flexibility, acceptance of hire of Cloud Computing, control facilities originates a number of challenges. In precise, safety has been widely conveyed to create the key issues which stop movement to the cloud. Shamir’s Secret Sharing Scheme splits the secret message into n shares with threshold k and distribution of shares to n participants and each participant has unique share of secret message. For reconstructing the secret message, minimum k fragments are required. Threshold scheme which requires only k shares to re-construct the secret message is implemented, as collection of shares from all the n participants to reconstruct the secret message may be unfeasible. AES encryption turns out to be totally inappropriate if a password is used as an alternative of providing the key. The attacker finds file, downloads Ax crypt, and brute force/dictionary attacks it until it’s cracked. An additional security can provided to user password which of varying length by splitting the password into n shares. Advance Encryption Standard (AES) procedure is implemented to encipher the produced shares. AES with 256-bit key is applied to encode the share for every member. Covering arrangement alternative to Boolean masking established on Shamir’s Secret Sharing arrangement is suggested.

R²PEDS: A Recoverable and Revocable Privacy-Preserving Edge Data Sharing Scheme

Edge servers (ESs) are utilized to achieve the storage and sharing of IoT data. However, even if ES brings us much benefit, it also leads to many serious privacy leakage issues because users’ data in ESs are out of control. Moreover, ES providers may also disclose user’s private-sensitive data. Hence, in this article, we present a privacy-preserving, recoverable, and revocable edge data sharing scheme. In this scheme, we propose a novel attribute revocation chain based on the blockchain technology to achieve attribute revocation in ciphertext-policy attribute-based encryption (CP-ABE). Meanwhile, a secret sharing scheme (SSS) is introduced to assist the data recovery. Especially, for the situation that a single ES is hijacked, we also propose a corresponding efficient detection mechanism and key updating policy to promise the subsequent security of the whole system. Moreover, this scheme also resists Economic Denial-of-Sustainability (EDoS) attacks which are launched by some malicious users. The analysis shows that the proposed scheme can protect user’s privacy and resist many attacks. Additionally, relevant experimental results demonstrate that our scheme has low computational overhead on the user side.

Generating logistic chaotic sequence using geometric pattern to decompose and recombine the pixel values

The Secret Sharing Scheme plays a vital role in cryptography which allows to transmit the secret digital information (image, video, audio, handwriting, etc.,) over a communication channel. This cryptographic technique involves encrypting the secret images into noisy shares and transmitted. The transmitted image shares are reconstructed using simple logical computation. In this paper, we propose a secure (n, n)- Multi-Secret-Sharing (MSS) scheme using image scrambling algorithm which is based on the logistic chaotic sequence generated using the secret key which is retrieved from the geometric pattern named as spirograph which drawn by the users with their private values. Also, decomposition and recombination of image pixels which points to change the position and values of the pixels. The experimental results estimate that the standard metrics NPCR, UACI, Entropy, Coefficient Correlation values proves the rigidness of the implemented algorithm.

Deteksi dan Identifikasi Pelaku Kecurangan Skema Pembagian Rahasia Linear Berbasis Skema Shamir

The method that can be used to maintain security of secret in the form of cryptographic keys is by using secret sharing scheme (SSS). This method is first proposed by Adi Shamir in 1979, where the proposed scheme is a (k, n) threshold scheme. Shamir scheme is a perfect scheme under the assumption that all shareholders present their original share. However, if there are dishonest shareholders who present faked shares then the honest shareholders get nothing but a faked secret. Secret sharing scheme based on linear scheme is a scheme that can detect and identify cheaters who submit faked shares at the secret reconstruction. Detectability of this scheme when and identifiability when under the assumption that all shareholders present their shares randomly. After conducting a security analysis of the proposed scheme, it is obtained that to succeed in attack with cheaters who work together to fool honest shareholders then a new polynomial g(x) such that g(1) = , g(2) = , …, g(k - 1) = and a new detector that has the same value as detector d are needed.

New generalized secret-sharing schemes with points on a hyperplane using a Wronskian matrix

A new secret-sharing scheme is constructed using elementary tools from different fields of mathematics. A method is introduced which uses the assignment of points on a hyperplane, serving as terminal points of vectors which meet an outlined criterion for linear independence. Submatrices of a Wronskian matrix are used in the assignment of these points. This method is also generalized to include a weighted scheme and a multilevel hierarchical model.

A Group Identification Protocol with Leakage Resilience of Secret Sharing Scheme

Secret sharing has been study for many years and has had a number of real-word applications. There are several methods to construct the secret-sharing schemes. One of them is based on coding theory. In this work, we construct a secret-sharing scheme that realizes an access structure by using linear codes, in which any element of the access structure can reconstruct the secret key. We prove that our scheme is a multiprover zero-knowledge proof system in the random oracle model, which shows that a passive adversary gains no information about the secret key. Our scheme is also a leakage-resilient secret-sharing scheme (LRSS) in the bounded-leakage model, which remain provably secure even if the adversary learns a bounded amount of leakage information about their secret key. As an application, we propose a new group identification protocol (GID-scheme) from our LRSS. We prove that our GID-scheme is a leakage-resilient scheme. In our leakage-resilient GID-scheme, the verifier believes the validity of qualified group members and tolerates l bits of adversarial leakage in the distribution protocol, whereas for unqualified group members, the verifier cannot believe their valid identifications in the proof protocol.

A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme

A linear code based on resilient maps on vector spaces over finite fields is introduced and lower bounds for its minimal distance are given. The dual code is used to define a secret sharing scheme (SSS) according to Massey construction. Since the dual code satisfies the conditions stated by Padró and Sáez, the generalization to a vector space SSS is robust against cheaters.

An Antiquity to the contemporary of Secret Sharing Scheme

Secret Sharing (SS) scheme divides a secret image into shadow images (referred to as shares) in a way that requires the shadows in a certain privileged coalition for the secret reconstruction. However, the secret image cannot be revealed if they are not combined in a prescribed way. In this paper, the evolution of the traditional secret sharing scheme to the contemporary of secret sharing scheme has been presented based on its technology adoption. The basic comparison between the traditional secret sharing scheme and Visual cryptography is presented. The image-based share generation process has been explained in the context of pixel sharing patterns and its process. The reconstruction image is obtained by the XOR /OR Boolean operation. The threshold-based share generation schemes are explained mathematically and the comparative analysis of these schemes also presented.

A Multisecret-Sharing Scheme Based on LCD Codes

Secret sharing is one of the most important cryptographic protocols. Secret sharing schemes (SSS) have been created to that end. This protocol requires a dealer and several participants. The dealer divides the secret into several pieces ( the shares), and one share is given to each participant. The secret can be recovered once a subset of the participants (a coalition) shares their information. In this paper, we present a new multisecret-sharing scheme inspired by Blakley’s method based on hyperplanes intersection but adapted to a coding theoretic situation. Unique recovery requires the use of linear complementary (LCD) codes, that is, codes in which intersection with their duals is trivial. For a given code length and dimension, our system allows dealing with larger secrets and more users than other code-based schemes.

Two polynomials based (t, n) threshold secret sharing scheme with cheating detection

A two-polynomial based threshold secret sharing (SS) scheme is proposed by Liu et al., where two functions for detection of share cheating are used. It is found that the scheme is weak as the equations formed by at most (t – 1) dishonest participants in term of unknowns are not equivalent to the cheating detection function, and if one polynomial is kept fixed and other with two cheating detection equations are taken, a set of equations with unknowns exist, and are found to be easily solvable. In this paper, we also propose a two-polynomial based (t, n) threshold SS scheme; however, the polynomials are taken in such a way that they have an arbitrary common coefficient and as a result, both the polynomials are to be modified simultaneously for cheating of shares and incorporates higher cheating detection capability. Some analytical proofs and comparison with other schemes in support of our claims are provided.

Threshold changeable secret sharing with secure secret reconstruction

(t,n) threshold secret sharing (SS) is an important cryptographic primitive in which a secret is divided into n shares, and then any t or more shareholders can exchange shares to reconstruct the secret without help of any trusted third party. However, if an illegal participant, without any valid share, impersonates a shareholder to recover the secret with m (m≥t) legal shareholders in a traditional (t,n) threshold SS scheme, it may obtain the secret. Therefore, this paper utilizes a bivariate symmetry polynomial to propose a basic threshold changeable secret sharing (TCSS) scheme which is cheating immune and thwarts the above illegal participant attack. In the basic TCSS scheme, threshold is allowed to increase from t to the exact number of all participants during secret reconstruction. In this way, the secret can be recovered only if all the participants have valid shares. However, each shareholder has to keep t coefficients of its share. Then, an improved TCSS scheme based on both univariate polynomial and bivariate symmetry polynomial is proposed to reduce coefficients of shares for each shareholder.

Quality improved (k, n) priority based progressive visual secret sharing

Progressive Visual Secret Sharing (PVSS) is a Visual Secret Sharing scheme which shares a secret image among multiple users and during the decryption this secret image can be reconstructed in a progressive manner. Recently, PVSS has been extended for priority users by giving different importance to different shares. Thus, the higher priority user holding higher importance shares obtains better visual quality compared to the lower priority users. However, existing priority based visual secret sharing suffers from the problem of inconsistent contrast and degraded visual quality. Hence, this paper uses two different approaches namely Codebook approach and Random grid approach to construct (k, n) Priority based Progressive Visual Secret Sharing (PPVSS) without pixel expansion to provide consistent contrast and better visual quality of reconstructed image. Experimental results show the effectiveness of proposed scheme compared to the existing scheme.