| 摘要 |
A method and system for storing data in a key value storage having a plurality of n servers, wherein t<n servers may fail arbitrarily and wherein 3t+1=n is satisfied, the method includes: a) generating commitment information for a secret information, b) disseminating a first message including the data to be stored, a corresponding key for the data and the generated commitment information to the n servers, c) storing the information included in the first message on at least a number of servers, d) providing first storing confirmation information by at least n-t servers, e) disseminating a second message including corresponding key and the secret information to the n servers, f) storing the information included in the second message, and g) providing second storing confirmation information by at least n-t servers. |
