An updatable XOR secret sharing scheme

The secret sharing scheme for large data scattered storage needs to solve two problems: one is the confidentiality problem in long storage, that is, to prevent the external adversaries from stealing secrets; second is for a large number of data sharing and updating operations including secret sharing and refactoring efficiency, and the amount of traffic and efficiency during updating. The existing secret sharing scheme cannot solve the above problems at the same time. To fill the research gap, an active secret sharing algorithm for updates was designed based on the exclusive or secret scheme of Lv and pseudo random sequence, which has the following advantages: first of all, it is worth emphasizing that update is the unpredictable operation. One is that each participant completes their share updating automatically with the premise of ensuring the credibility. The other is updating some quota blocks randomly under the premise of blocking. Secondly, the unpredictable updating operation can effectively prevent opponents from speculating the updated law. Last but not least, it is suitable for the storage area. © 2019, Asian Association for Agricultural Engineering. All rights reserved.