| 摘要 |
The present invention relates to a method 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, comprising by the steps of 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. The present invention further relates to a method for reading data stored in a key value storage and a system for storing data in a key value storage and a system for reading data stored in a key value storage. |
