Data encryption and decryption
This disclosure relates to data encryption and decryption. In one aspect, a method includes receiving, by a second peer end computing device, first data from a first peer end computing device. The second end computing device generates a random term based on a result range pre-agreed upon with the first peer end computing device. The result range includes a minimum result value and a maximum result value. The random term is a product of a random number and an agreed upon constant. The agreed upon constant is greater than a difference between the maximum result value and the minimum result value. The second peer end computing device performs a homomorphic operation based on the first data, local private second data, and the random term to obtain an encryption result. The second peer end computing device returns the encryption result to the first peer end computing device.
1. A computer-implemented method for data encryption, comprising:
receiving, by a second peer end computing device, first data from a first peer end computing device;
generating, by the second peer end computing device, a random term R based on a result range pre-agreed upon with the first peer end computing device, wherein the result range comprises a minimum result value a and a maximum result value b, the random term R is a product of a random number r and an agreed upon constant c that is agreed upon between the first peer end computing device and the second peer end computing device, and the agreed upon constant c is greater than a first difference between the maximum result value b and the minimum result value a;
performing, by the second peer end computing device, a homomorphic operation based on the first data and local private second data thereby obtaining a first operation result;
obtaining, by the second peer end computing device, a second difference between the first operation result and the minimum result value a as a second operation result;
performing, by the second peer end computing device, homomorphic summation and encryption on the second operation result and the random term R thereby obtaining an encryption result; and
returning, by the second peer end computing device, the encryption result to the first peer end computing device.
2. The computer-implemented method of claim 1 , wherein the minimum result value a is 0, and the maximum result value b is an n-digit natural number, and wherein the agreed upon constant c is 10{circumflex over ( )}n such that last n digits in the random term R that are sorted from a high digit to a low digit are all 0s, wherein n is a natural number.
3. The computer-implemented method of claim 1 , wherein the minimum result value a is 0, the maximum result value b is 2{circumflex over ( )}n, the agreed upon constant c is 2{circumflex over ( )}(n+1), the random term R is represented in binary, and in a binary representation of the random term R, last n digits in the random term R sorted from a high digit to a low digit are all 0s, and wherein n is a natural number.
4. The computer-implemented method of claim 1 , wherein a value of the agreed upon constant c is Δ+1, and wherein Δ is the first difference between the maximum result value b and the minimum result value a.
5. The computer-implemented method of claim 1 , wherein the first data comprises encrypted data encrypted using a homomorphic encryption scheme.
6. A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform operations comprising:
receiving first data from a first peer end computing device;
generating a random term R based on a result range pre-agreed upon with the first peer end computing device, wherein the result range comprises a minimum result value a and a maximum result value b, the random term R is a product of a random number rand an agreed upon constant c that is agreed upon between the first peer end computing device and a second peer, and the agreed upon constant c is greater than a first difference between the maximum result value b and the minimum result value a;
performing a homomorphic operation based on the first data and local private second data thereby obtaining a first operation result;
obtaining a second difference between the first operation result and the minimum result value a as a second operation result;
performing homomorphic summation and encryption on the second operation result and the random term R thereby obtaining an encryption result; and
returning the encryption result to the first peer end computing device.
7. The non-transitory, computer-readable medium of claim 6 , wherein the minimum result value a is 0, and the maximum result value b is an n-digit natural number, and wherein the agreed upon constant c is 10{circumflex over ( )}n such that last n digits in the random term R that are sorted from a high digit to a low digit are all 0s, wherein n is a natural number.
8. The non-transitory, computer-readable medium of claim 6 , wherein the minimum result value a is 0, the maximum result value b is 2{circumflex over ( )}n, the agreed upon constant c is 2{circumflex over ( )}(n+1), the random term R is represented in binary, and in a binary representation of the random term R, last n digits in the random term R sorted from a high digit to a low digit are all 0s, and wherein n is a natural number.
9. The non-transitory, computer-readable medium of claim 6 , wherein a value of the agreed upon constant c is Δ+1, and wherein Δ is the first difference between the maximum result value b and the minimum result value a.
10. A computer-implemented system, comprising:
one or more computers; and
one or more computer memory devices interoperably coupled with the one or more computers and having tangible, non-transitory, machine-readable media storing one or more instructions that, when executed by the one or more computers, perform one or more operations comprising:
receiving first data from a first peer end computing device;
generating a random term R based on a result range pre-agreed upon with the first peer end computing device, wherein the result range comprises a minimum result value a and a maximum result value b, the random term R is a product of a random number r and an agreed upon constant c that is agreed upon between the first peer end computing device and a second peer end, and the agreed upon constant c is greater than a first difference between the maximum result value b and the minimum result value a;
performing a homomorphic operation based on the first data and local private second data thereby obtaining a first operation result;
obtaining a second difference between the first operation result and the minimum result value a as a second operation result;
performing homomorphic summation and encryption on the second operation result and the random term R thereby obtaining an encryption result; and
returning the encryption result to the first peer end computing device.
11. The computer-implemented system of claim 10 , wherein the minimum result value a is 0, and the maximum result value b is an n-digit natural number, and wherein the agreed upon constant c is 10{circumflex over ( )}n such that last n digits in the random term R that are sorted from a high digit to a low digit are all 0s, wherein n is a natural number.
12. The computer-implemented system of claim 10 , wherein the minimum result value a is 0, the maximum result value b is 2{circumflex over ( )}n, the agreed upon constant c is 2{circumflex over ( )}(n+1), the random term R is represented in binary, and in a binary representation of the random term R, last n digits in the random term R sorted from a high digit to a low digit are all 0s, and wherein n is a natural number.
13. The computer-implemented system of claim 10 , wherein a value of the agreed upon constant c is Δ+1, and wherein Δ is the first difference between the maximum result value b and the minimum result value a.