An efficient multi-use multi-secret sharing scheme based on hash function

TL;DR

This paper introduces a secure, efficient multi-use multi-secret sharing scheme utilizing hash functions, enabling participants to verify information and resist conspiracy attacks without complex computations.

Contribution

It presents a novel multi-secret sharing scheme based on hash functions that improves security and efficiency over existing methods.

Findings

Scheme is secure against conspiracy attacks.

Participants can verify exchanged information.

Avoids complex modular operations.

Abstract

In this paper, a renewable, multi-use, multi-secret sharing scheme for general access structure based on one-way collision resistant hash function is presented in which each participant has to carry only one share. By applying collision-resistant one-way hash function, the proposed scheme is secure against conspiracy attacks even if the pseudo-secret shares are compromised. Moreover, high complexity operations like modular multiplication, exponentiation and inversion are avoided to increase its efficiency. Finally, in the proposed scheme, both the combiner and the participants can verify the correctness of the information exchanged among themselves.