Verifiable Secret Share for file storage with cheater identification

摘要

Verifiable Secret Share (VSS) is a branch of Secret Share (SS) that allowVerifiable Secret Share (VSS) is a branch of Secret Share (SS) that allows verifying the correctness of recomposed files. VSS techniques usually check the correctness of secrets at the end of the re-composition process, therefore, in case of errors, a lot of computational resources and time are wasted. In this paper, we propose an innovative VSS model that is able to verify the correctness of SS fragments before the ending of the recomposition task, thus increasing efficiency and response time. The basic idea behind the proposed approach is to make use of a Hash function to validate fragments, thus to decide if the recomposition task can be performed or not. The experimental result validates our model and proves its applicability in distributed storage systems.