| 摘要 |
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, andg) providing second storing confirmation information by at least n-t servers. |
| 主权项 |
1. A method for storing (put) data (v) in a key value storage having a plurality of n servers (S1, S2, S3, S4), wherein t<n servers (S1, S2, S3, S4) may fail arbitrarily and wherein 3t+1=n is satisfied,
characterized by the steps of a) Generating commitment information (commit) for a secret information (secret), b) Disseminating a first message (1a) including the data (v) to be stored, a corresponding key (k) for the data (v) and the generated commitment information (commit) to the n servers, c) Storing (saving1) the information included in the first message (1a) on at least a number of servers (S1, S2, S3), d) Providing first storing confirmation information (1b) by at least n-t servers (S1, S2, S3), e) Disseminating a second message (2a) including corresponding key (k) and the secret information (secret) to the n servers (S1, S2, S3, S4), f) Storing (saving2) the information included in the second message (2a), and g) Providing second storing confirmation information (2b) by at least n-t servers (S1, S2, S3). |
