A blockchain-oriented optimistic concurrency order-preserving coding method
A coding method and blockchain technology, applied in digital data protection, instruments, calculations, etc., can solve problems such as inapplicable blockchain scenarios
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0098] The optimistic concurrent order-preserving encoding method oOPE proposed in this embodiment specifically includes the following steps:
[0099] Step 1: All nodes in the blockchain network initialize the local OPE tree;
[0100] Step 2: For a data entry that needs to be uploaded, the data owner encrypts the plaintext value of the privacy field, and then sends the ciphertext to the blockchain node to request encoding;
[0101] Step 3: The blockchain node calculates the sequence-preserving code for the received ciphertext. Since the blockchain node cannot know the plaintext, it needs to interact with the data owner to determine the size to traverse the OPE tree when performing sequence-preserving coding on the ciphertext data. . The interactive coding process specifically includes the following steps:
[0102] Step 3-1: If the root node is empty, directly calculate the median of -1 and N as the code and send it to the data owner; otherwise, the blockchain node sends the ...
Embodiment 2
[0125] The optimistic concurrency order-preserving encoding method cr-oOPE proposed in this embodiment specifically includes the following steps:
[0126] Step 1: All nodes in the blockchain network initialize the local ZOPE tree;
[0127] Step 2: For a data entry that needs to be uploaded, the data owner encrypts the plaintext value x of the privacy field with the key sk, and sends the ciphertext c to the blockchain node to request encoding;
[0128] Step 3: The node calculates the sequence-preserving code for the received ciphertext. The coding process specifically includes the following steps:
[0129] Step 3-1: Blockchain nodes and data owners traverse the ZOPE tree interactively;
[0130] Step 3-2: If the blockchain node encounters a full UDZ during the traversal process, first use the randomized coding calculation method to calculate the code y currently being coded, and then combine c and y together with all nodes in the UDZ Send to the data owner to request to sort t...
Embodiment 3
[0142] This embodiment is an encoding method for order-preserving encoding of the privacy field of the data set. Figure 5 is 4 data sets, where Glucose is a privacy field. For the convenience of illustration, it is assumed that the size of the plaintext domain is M=8, and the size of the coded domain is N=16. The current OPE tree is as follows Figure 6 (a) shown. In the concurrent encoding stage, the data owner encodes the plaintext of the privacy fields of the 4 records. Taking 6.3 as an example, first the data owner encrypts 6.3 into x18ce and sends it to the blockchain node, and the blockchain node will root the OPE tree The node sends it to the data owner for decryption. The data owner compares the size relationship between the decrypted 4.8 and 6.3, requests the right child of the root node to the blockchain node, and repeats this step. The plaintext 6.3 calculates the code 14. At the same time, the plaintext 7.5 also calculates the code 14. When computing the encodi...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


