A Verifiable Dynamic Multi-secret Sharing Obfuscation Scheme Applied to Data LakeHouse

In the context of the evolving Data LakeHouse distributed architecture and the inescapable challenges posed by DM-Crypt, a verifiable dynamic multi-secret sharing obfuscation scheme applied to the Data LakeHouse is proposed. In the proposed scheme, participants select their shadows using a secure one-way function and hide their true identities for self-protection. This scheme can conceal the actual key within any dimension of the homogeneous linear equation system. It can verify whether the distributor, participant, or key restorer has committed fraud by comparing the hash information published by the previous operator on the public bulletin board with the hash information calculated by the current operator. Enables dynamic addition or deletion of participants, dynamic key modification, and periodic key updates. Among these dynamic operations, it is fully dynamic only when participants are added or deleted, as long as the remaining participants meet the minimum decryption threshold. In other cases, the process is semi-dynamic, requiring modifications to information related to other participants. The security of the scheme is based on the Shamir threshold scheme, the asymmetric key encryption system (RSA), a secure and tamper-resistant hash function, and a secure one-way computation function.