Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

A Verifiable Multi-Secret Sharing Scheme for Hierarchical Access Structure

Version 1 : Received: 30 May 2024 / Approved: 30 May 2024 / Online: 30 May 2024 (13:46:21 CEST)

A peer-reviewed article of this Preprint also exists.

Alam, I.; Alali, A.S.; Ali, S.; Asri, M.S.M. A Verifiable Multi-Secret Sharing Scheme for Hierarchical Access Structure. Axioms 2024, 13, 515. Alam, I.; Alali, A.S.; Ali, S.; Asri, M.S.M. A Verifiable Multi-Secret Sharing Scheme for Hierarchical Access Structure. Axioms 2024, 13, 515.

Abstract

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.

Keywords

access structure; multi-secret; hierarchy; verification; secret sharing; polynomial

Subject

Computer Science and Mathematics, Computer Networks and Communications

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.