Verifiable database encryption retrieval method and system based on secret sharing

Abstract

The invention discloses a verifiable database encryption retrieval method based on secret sharing. The method comprises the steps that a database is established; to-be-encrypted data is stored into the database, and encryption is performed through secret sharing; a data accessor permission chart is made, data accessor permissions are determined, and the data accessor permission chart is stored into the database through Chinese remainder theorem processing; modulus solving is performed on the encrypted data, and check codes corresponding to attributes in each column are generated and uploaded to servers; and data accessors access the servers, wherein the data accessors with permissions can solve the data, and the data accessors without permissions cannot solve the data. According to the method, secret sharing and the Chinese remainder theorem are combined, the remainder of modulus solving performed by each piece of data on a corresponding allocation value is used as one check code, andon the basis of not reconstructing f(x), information on the servers is verified separately; and when part of the information has an error, which server has an error can be pointed out in combination with other servers, and error information can be corrected quickly and easily.

Description

technical field [0001] The invention relates to the research field of database encrypted retrieval, in particular to a verifiable database encrypted retrieval method and system based on secret sharing. Background technique [0002] Secret sharing technology is a method of assigning a secret to a group of participants. Under this treatment, a single shared value is meaningless, and the password must be reconstructed using some subset of the participants' shared values. [0003] The (t,n) secret sharing proposed by Shamir is mainly as follows: the secret value s needs to be processed; first, t-1 coefficients are randomly generated, which are: a 0 ,a 1 ...a t-1 ; Then, using these coefficients, construct a polynomial f(x)=a t-1 x t-1 +a t- 2 x t-2 +..+a 1 x 1 +a 0 , where a 0 =s; Next, assign an x ​​to n servers i , put x i Substitute into f(x) to get a f(x i ), and finally put f(x i ) to the server. In fact, such a process is equivalent to storing a point in t...

AI Technical Summary

Problems solved by technology

However, this method of construction is very cumbersome, and it is also very troublesome to check at the same time, and the efficiency is relatively low

Images