Abstract: This paper presents an ideal multi-secret access structure multi-secret sharing scheme based on a one-way collision resistant Hash function. In the scheme, each participant has to carry only one share, which can be multi-use to reconstruct multiple secrets. Moreover, in order to avoid the damages caused by the dishonest dealer, each participant chooses one share by himself, and master secrets can be generated by an assigned algorithm, that is, this scheme is a secret sharing scheme without dealer, so no one can be arbitrary. Meanwhile, only Hash function and the XOR operation are used in this scheme. On the one hand, high complexity operations like modular multiplication, exponentiation and inversion are avoided, and on the other hand, Hash function provides verification for this scheme.

Key words: multi-secret sharing, no dealer, Hash function, verification

摘要： 基于单向抗碰撞Hash函数提出了一个理想的多访问结构的多秘密共享方案。方案中每个参与者只需持有一个子密钥即可用来恢复多个主密钥。为了避免分发者的不诚实行为所导致的破坏，参与者各自选择其子密钥，主密钥由一个指定的算法生成，即该方案是一个无分发者的秘密共享方案，任何人都无法进行独裁。方案只用到了Hash函数和异或运算，避开了模乘法、模方幂以及求逆等高度复杂的运算，方案具有可验证性。

关键词: 多秘密共享, 无分发者, Hash函数, 可验证性