Scholarlink

<p>A secret sharing scheme involves dividing a confidential piece of information among multiple users, and a specific number of these users can work together to recover the original secret. In this article, we propose an innovative secret sharing scheme that is dynamic and hierarchical, relying on elliptic curves and pairings. The primary motivation for incorporating bilinear pairings with elliptic curves is to maintain a high level of security while reducing the key size, as seen in various existing schemes. The proposed scheme is computationally secure, efficient and verifiable. The time computation for the proposed scheme has been determined. We have included explicit examples using SageMath.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Dynamic Disjunctive Hierarchical Secret Sharing Scheme Using Elliptic Curves

  • 期刊论文

  • 发表日期：

    2026年4月3日

查看全文
  • Mohan Chintamani,
  • Prabal Paul,
  • Laba Sa

摘要

A secret sharing scheme involves dividing a confidential piece of information among multiple users, and a specific number of these users can work together to recover the original secret. In this article, we propose an innovative secret sharing scheme that is dynamic and hierarchical, relying on elliptic curves and pairings. The primary motivation for incorporating bilinear pairings with elliptic curves is to maintain a high level of security while reducing the key size, as seen in various existing schemes. The proposed scheme is computationally secure, efficient and verifiable. The time computation for the proposed scheme has been determined. We have included explicit examples using SageMath.