Multi-stage multi-secret sharing scheme for hierarchical access structure

Basit, Abdul; Kumar, Nitin; Venkaiah, V. Ch.; Moiz, Salman Abdul; Tentu, Appala Naidu; Naik, Wilson

doi:10.1109/ccaa.2017.8229863

Cited by 19 publications

(9 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• It aspires to the ideal situation in which each token holder has the same priority or participation in the secret reconstruction phase. Several pieces of literature to overcome the drawbacks of Shamir's secret sharing schemes [31]- [33] for multi-stage and multiple secret sharing schemes. Similarly, others are used to verify the participant's tokens [34].…”

Section: A the (T N) Threshold Scheme Of Shamirmentioning

confidence: 99%

A novel authentication scheme for group based communication for IoT oriented infrastructure in smart cities

Alam

Kumar

2022

Preprint

View full text Add to dashboard Cite

As a result of the rapid developments in digital technologies, smart cities have been adorned with several digital gadgets based on the Internet of Things (IoT). The essential part of smart city operations is IoT communications. IoT devices generate, process, and exchange a large amount of security-critical and privacy-sensitive data regularly, resulting in attractive targets for threats and attacks. Group-oriented communication, such as data gathering and area monitoring, is critical in the IoT World. It enables users to manage various IoT devices simultaneously. Conventional one-to-one authentication techniques donot consider the resource constraints of IoT devices in grouped communication. They also do not solve the issue of massive machinecommunication (mMTC) scalability. Many to Many (M2M)authentication approach of group authentication makes grouporientedcommunication and mMTC very secure. The lower timecomplexity of Group-based authentication (GBA) makes theseprotocols very popular for efficient and secured communication.This paper uses a polynomial-based group authentication schemeand membership verification to ensure efficient and threat-freecommunication among IoT devices. Bi-variate polynomials havebeen used instead of single variable functions in the proposedscheme. The protected nature of the bi-variate polynomial makesthe proposed scheme very secure and reliable. Furthermore,establishing the session key makes the proposed scheme effectiveand efficient. Security analysis of the proposed work shows itsefficiency over existing schemes.

show abstract

Section: A the (T N) Threshold Scheme Of Shamirmentioning

confidence: 99%

A novel authentication scheme for group based communication for IoT oriented infrastructure in smart cities

Alam

Kumar

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…In 2015, Chanu et al [10] used Two variable one-way functions to verify the correctness of the received share. Further, in 2017, Basit et al [4] used Shamir's scheme with the successive application of one-way function and shifted and key technique to propose Multi-stage, Multi-secret sharing for hierarchical Access Structure. Apart from the above papers, the Hierarchical secret sharing (HSSS) scheme are discussed in [3,4,10,17,28,29,47], but his scheme lacks fairness.…”

Section: Introductionmentioning

confidence: 99%

A Verifiable Multi-Secret Sharing Scheme for Hierarchical Access Structure

Alam,

Alali,

Ali

et al. 2024

Preprint

View full text Add to dashboard Cite

Sharing confidential information is a critical concern in today’s world. Secret sharing schemes facilitate the sharing of secrets in a way that ensures only authorized participants (shareholders) can access the secret using their allocated shares. Hierarchical secret sharing schemes (HSSSs) build upon Shamir’s scheme by organizing participants into different levels based on priority. Within HSSS, participants at each level can reconstruct the secret if a specified number, denoted as the threshold value (t), or more of them are present. Each level has a predetermined threshold value. If the number of participants falls below the threshold at any level, higher-level participants must be involved in reconstructing the secret at lower levels. Our paper proposes schemes that implement hierarchical access structures and enable the sharing of multiple secrets. Additionally, our proposed scheme includes share verification. We have analyzed potential attacks and demonstrated the scheme’s resistance against them. Through security analysis and comparison with existing schemes, we highlight the novelty and superiority of our proposed approach, contributing to advancements in secure information sharing practices.

show abstract

“…This idea has since been continuously improved. [14][15][16][17][18][19] In response to the verifiability of participant identity and shadow, researchers also proposed a verifiable ISS on the polynomial-based ISS [20][21][22][23]. In 2017, Adnan Gutub et al proposed a counting-based secret sharing technique for multimedia applications [24].…”

Section: Introductionmentioning

confidence: 99%

“…A simple way to implement Lagrange's interpolation and construct the polynomial is by solving a linear system of equations. Many researchers just simply adopted this method in the revealing process of the SIS scheme [1][2][3]5,8,[10][11][12]16,17,19,22,23]. In practice, many secret image pixels and a large amount of data require solving many linear systems until all pixels are recovered.…”

Section: Introductionmentioning

confidence: 99%

An Implementation of Image Secret Sharing Scheme Based on Matrix Operations

2022

View full text Add to dashboard Cite

The image secret sharing scheme shares a secret image as multiple shadows. The secret image can be recovered from shadow images that meet a threshold number. However, traditional image secret sharing schemes generally reuse the Lagrange’s interpolation in the recovery stage to obtain the polynomial in the sharing stage. Since the coefficients of the polynomial are the pixel values of the secret image, it is able to recover the secret image. This paper presents an implementation of the image secret sharing scheme based on matrix operations. Different from the traditional image secret sharing scheme, this paper does not use the method of Lagrange’s interpolation in the recovery stage, but first identifies the participants as elements to generate a matrix and calculates its inverse matrix. By repeating the matrix multiplication, the polynomial coefficients of the sharing stage are quickly derived, and then the secret image is recovered. By theoretical analysis and the experimental results, the implementation of secret image sharing based on matrix operation is higher than Lagrange’s interpolation in terms of efficiency.

show abstract

Multi-stage multi-secret sharing scheme for hierarchical access structure

Cited by 19 publications

References 14 publications

A novel authentication scheme for group based communication for IoT oriented infrastructure in smart cities

A novel authentication scheme for group based communication for IoT oriented infrastructure in smart cities

A Verifiable Multi-Secret Sharing Scheme for Hierarchical Access Structure

An Implementation of Image Secret Sharing Scheme Based on Matrix Operations

Contact Info

Product

Resources

About