Scholarlink

<p>Pilaram and Eghlidos designed a threshold multistage secret sharing scheme (SSS) with the security relying on an approximate shortest vector problem (SVP). This scheme is quantum secure. In 2022, Yang <i>et al</i> showed that an adversary with sufficient pseudo-shares could reconstruct the unrecovered secrets. They provided countermeasures to protect the scheme from this attack but with extensions in the size of the shares. They also used <i>m</i> permutations in the modified scheme. In this study, we modify the Pilaram and Eghlidos scheme to achieve a multistage nature without any extra cost of storage consumption. We only use one hash function in share generation. Our modified version is shown to be better than Yang <i>et al</i>’s version.</p>

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

Improved lattice-based multistage secret sharing scheme

  • 期刊论文

  • 发表日期：

    2025年3月27日

查看全文
  • Ramakant Kumar,
  • Sahadeo Padhye

摘要

Pilaram and Eghlidos designed a threshold multistage secret sharing scheme (SSS) with the security relying on an approximate shortest vector problem (SVP). This scheme is quantum secure. In 2022, Yang et al showed that an adversary with sufficient pseudo-shares could reconstruct the unrecovered secrets. They provided countermeasures to protect the scheme from this attack but with extensions in the size of the shares. They also used m permutations in the modified scheme. In this study, we modify the Pilaram and Eghlidos scheme to achieve a multistage nature without any extra cost of storage consumption. We only use one hash function in share generation. Our modified version is shown to be better than Yang et al’s version.