TY - GEN
T1 - A Verifiable Dynamic Multi-secret Sharing Obfuscation Scheme Applied to Data LakeHouse
AU - Tang, Shuai
AU - Mu, Tianshi
AU - Zheng, Jun
AU - Fu, Yurong
AU - Zhang, Quanxin
AU - Yang, Jie
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.
PY - 2024
Y1 - 2024
N2 - 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.
AB - 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.
KW - Data LakeHouse
KW - Key Management
KW - Threshold scheme
KW - Verifiable Dynamic Multi-Secret Sharing
UR - http://www.scopus.com/inward/record.url?scp=85185715158&partnerID=8YFLogxK
U2 - 10.1007/978-981-99-9785-5_22
DO - 10.1007/978-981-99-9785-5_22
M3 - Conference contribution
AN - SCOPUS:85185715158
SN - 9789819997848
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 316
EP - 327
BT - Artificial Intelligence Security and Privacy - 1st International Conference on Artificial Intelligence Security and Privacy, AIS and P 2023, Proceedings
A2 - Vaidya, Jaideep
A2 - Gabbouj, Moncef
A2 - Li, Jin
PB - Springer Science and Business Media Deutschland GmbH
T2 - 1st International Conference on Artificial Intelligence Security and Privacy, AIS and P 2023
Y2 - 3 December 2023 through 5 December 2023
ER -