Secret sharing scheme security and performance analysis

Abdallah, Aisha; Salleh, Mazleena

doi:10.1109/iccneee.2015.7381357

Cited by 5 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Md Kausar Alam et al [15] introduced the uses of multi-cloud and data security, to reduce the security risks and its affect on cloud users by using a Shamir's Secret sharing algorithm. The security and performance of a secret sharing scheme based on storage requirement, the time consumed for splitting and recovering the data analyzed by Aisha Abdallah et al [24]. It also reduces the required capital investment to store the share and ensures the security of each secret's share.…”

Section: Related Workmentioning

confidence: 99%

“…The number of shares involved in this reconstruction should be at least 85% of n of the secret, while shares with less than t will not reveal any secret. This merging of shares is done with the help of Lagrange's interpolation method [24]. This methodology presents confidentiality, secure key sharing among groups and secure data from unauthorized access of valid insiders within the group.…”

Section: A Mathematical Definitionsmentioning

confidence: 99%

See 1 more Smart Citation

Security Enhancement in Cloud Environment using Secure Secret Key Sharing

Chhabra

Singh

2020

J. commun. softw. syst. (Online)

View full text Add to dashboard Cite

Cloud Computing has achieved long dreamed vision of developments in IT industry such as remote storage services or privacy solutions. It is a data storage model in which data is preserved, controlled and presented over the network users. However, cloud storage gives rise to security concerns. Preserving the secrecy in a group is one of the major research issue in cloud store. This paper is focused on Secure Secret Sharing (SSS) technique which is being recognized as one of the leading method to secure the sensitive data. The proposed methodology shares encrypted data over cloud and generated secret key is split into different parts are given to qualified participants (Qn) only which is analyzed by the index buffer and the malicious checkers. This malicious checker verifies the clients based on their previous performances, whether these users prove authorized participant or not. The key share is stored by trusted third party called Key handler (KH) i.e. an integrated approach for managing, reconstruction and decrypting the key’s shares. If Key Handler (KH) gets part > 80% of the secret key then cloud share their secret data to the owners and if KH gets part 90% of the key then cloud only shares one of the top secret. The Lagrange’s interpolation method is used to reconstruct the secret from shares. The authors have considered two benchmarks in our experiment for testing and analysis of the results. The performance is evaluated based on time consumption and probability computation to prove the efficacy of our algorithm. It shows the key generation time for 128 shares by more than 100 clients is 96.1265 ms and the computation time in the whole process is 1176.35 ms. The results show that our algorithm reduces the risks and improves the security upto 43.82% over all types of analysis for secure data sharing inclouds.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: A Mathematical Definitionsmentioning

confidence: 99%

Security Enhancement in Cloud Environment using Secure Secret Key Sharing

Chhabra

Singh

2020

J. commun. softw. syst. (Online)

View full text Add to dashboard Cite

show abstract

“…Note that, if all secrets share a fixed threshold value, the security of the scheme reduces. In [19]- [21], the main research focuses on the secret and share updates, as well as the addition of new individuals or the deletion of participants, and it does not involve changes in threshold values. In this paper, a verifiable threshold multi-secret sharing scheme with different stages was presented.…”

Section: Introductionmentioning

confidence: 99%

An Efficient Verifiable Threshold Multi-Secret Sharing Scheme With Different Stages

Dong

Xing

et al. 2019

IEEE Access

View full text Add to dashboard Cite

Secret sharing is one of the most important cryptographic primitives used for data outsourcing. The threshold-based secret sharing scheme is one of the well-known secret sharing schemes in cryptography. A single secret sharing scheme has low efficiency and multiple secret sharing schemes can greatly improve the efficiency of secret sharing. We present an efficient verifiable threshold multi-secret sharing scheme with different stages in which multiple secrets are shared among participants during one sharing process. In such a way, some qualified subsets of participants can collectively recover these secrets. The verifiable nature means that the participant can verify his/her own share. Our proposed scheme can share multiple secrets and each secret has its own threshold access structure. Moreover, each participant only keeps one share, and however they can reconstruct all secrets in recovery stages. This scheme is a multi-stage-use secret sharing scheme, in which the size of the participant's share is the same as that of each secret and the amount of information disclosed reaches the optimal lower bound. Compared with the previous verifiable (t, n)-threshold multisecret sharing scheme, this scheme is of stronger computational security and practicability. INDEX TERMS Verifiable, threshold, multi-secret sharing, multi-stage-use.

show abstract

Multitiered Dynamic Threshold-Based Mobile Agents Secure Migration Using Lagrange Polynomial and Chinese Remainder Theorem

Singhal

Kumar²

2022

Lecture Notes in Electrical Engineering

View full text Add to dashboard Cite

Secret sharing scheme security and performance analysis

Cited by 5 publications

References 12 publications

Security Enhancement in Cloud Environment using Secure Secret Key Sharing

Security Enhancement in Cloud Environment using Secure Secret Key Sharing

An Efficient Verifiable Threshold Multi-Secret Sharing Scheme With Different Stages

Multitiered Dynamic Threshold-Based Mobile Agents Secure Migration Using Lagrange Polynomial and Chinese Remainder Theorem

Contact Info

Product

Resources

About