计算机科学与探索 ›› 2023, Vol. 17 ›› Issue (5): 1189-1200.DOI: 10.3778/j.issn.1673-9418.2109006

• 网络·安全 • 上一篇    下一篇

一般存取结构上可公开验证的多级秘密共享

宋云,王宁宁,肖孟林,邵志毅   

  1. 陕西师范大学 计算机科学学院,西安 710062
  • 出版日期:2023-05-01 发布日期:2023-05-01

Publicly Verifiable Multi-stage Secret Sharing on General Access Structures

SONG Yun, WANG Ningning, XIAO Menglin, SHAO Zhiyi   

  1. School of Computer Science, Shaanxi Normal University, Xi??an 710062, China
  • Online:2023-05-01 Published:2023-05-01

摘要: 可公开验证的秘密共享允许任何人仅从公开信息中发现分发者或参与者的欺诈行为。为扩展多秘密共享应用范围,首先提出一个可公开验证的多级秘密共享(PVMSSS)方案模型,而后基于单调张成方案及安全多方计算,构造一般存取结构上可公开验证多用的可更新的多级秘密共享方案。秘密分发阶段,方案中各参与者秘密份额由自己计算,分发者不需向参与者传送任何秘密信息,且每个参与者只需维护一个秘密份额即可实现对多个秘密的重构。利用双线性对的性质,任何人均可验证更新前后秘密份额的正确性及公开信息的有效性,从而有效防止分发者和参与者的欺诈。秘密重构阶段,利用安全多方计算构造伪份额,保证每个参与者的真实份额永远不会暴露,实现了份额的多用性。在秘密的每一次更新中,分发者只需公布更新临时份额的相应公开信息,即可实现对参与者秘密份额的更新。最后对方案的正确性和安全性进行详细分析,在计算Diffie-Hellman和判定双线性Diffie-Hellman问题及假设下,该方案是可证明安全的。

关键词: 单调张成方案(MSP), 多级秘密共享, 双线性对, 计算Diffie-Hellman和判定双线性Diffie-Hellman问题, 可证明安全

Abstract: A publicly verifiable secret sharing allows anyone to detect the cheating of dealer or participants only from the public information. In order to expand the application scope of multi-secret sharing, firstly, a publicly verifiable multi-stage secret sharing (PVMSSS) scheme is proposed, and then based on the monotone span program (MSP) and secure multi-party computation, a renewable multi-stage secret sharing scheme that can be publicly verified and used in general access structures is proposed. In the secret distribution stage, the secret share of the participants in the scheme is calculated by each participant, and the dealer does not need to transmit any secret information to the participants. Moreover, each participant only needs to maintain one secret share to realize the reconstruction of multiple secrets. Using bilinear pairing properties, anyone can verify the correctness of the secret shares before and after the update and the validity of the public information, thereby effectively preventing fraud by dealer and participants. In the secret reconstruction phase, the pseudo-share is constructed by using secure multi-party computation to ensure that the real share of each participant will never be exposed, and the versatility of the scheme is realized. In each update of the secret, the dealer only needs to announce the related public information of updated temporary shares to update the participants' secret share. Finally, the correctness and security of the scheme are analyzed. Analysis shows that under the computational Diffie-Hellman and decisional bilinear Diffie-Hellman problems and assumptions, the proposed scheme is provably secure.

Key words: monotone span program (MSP), multi-stage secret sharing, bilinear pairing, computational Diffie-Hellman and decisional bilinear Diffie-Hellman problems, provably secure