Blockchain-based insurance claim data sharing method and system

Abstract

The present application relates to the field of information technology, in particular to an insurance claim data sharing method and system based on a blockchain, the method comprising the following steps: establishing a claim data sharing module and deploying it in multiple insurance companies; when there is new claim information, the claim data sharing module receives the claim information of the insured person, encrypts the claim information, and extracts the hash value of the insured person's identification; the claim information associated with the hash value of the insured person is uploaded to the blockchain storage as shared information; the blockchain is queried to find all shared information matching the hash value of the insured person's identification; the shared information is decrypted to obtain all the claim information of the insured person. The substantial effect of the present application is that it realizes the safe sharing of claim data among insurance companies, can help insurance companies discover fraud and repeated claims, and maintain the order of claim business; it realizes the rapid acquisition of relevant evidence, which helps to stop payment, hold accountable or initiate litigation in a timely manner.

Description

Technical Field

[0001] This invention relates to the field of information technology, and specifically to a blockchain-based method and system for sharing insurance claims data. Background Technology

[0002] Insurance refers to a commercial insurance activity in which the policyholder pays premiums to the insurer according to the contract, and the insurer assumes the responsibility of compensating for property losses caused by accidents stipulated in the contract, or paying insurance benefits when the insured dies, becomes disabled, falls ill, or reaches the age or term stipulated in the contract. Insurance claims settlement refers to the business activities of the insurer, in accordance with the insurance contract or relevant laws and regulations, accepting the insurance claim submitted by the insured, conducting investigation, loss assessment, calculation, and payment. Insurance claims settlement generally begins with receiving the notification of an accident and goes through six stages: investigation, inspection or commissioned inspection, verification of the case, calculation of the compensation amount, and payment of compensation. After an insured event occurs, before paying insurance compensation to the insured, the insurer may require the insured to provide evidence and materials related to confirming the nature and extent of the loss. In the actual insurance claims process, duplicate claims and other problems exist. Although investigation and inspection can eliminate false insurance claim requests and ensure the normal order of insurance claims settlement. However, in the event of a real insurance claim, if the policyholder has policies with multiple insurance companies, it can easily lead to each insurance company making a payout, resulting in duplicate claims. Currently, due to the data silos existing between insurance companies, the risk of duplicate claims is difficult to detect and manage in a timely manner, affecting the normal operation of insurance claims. Furthermore, insurance claims information often involves sensitive information; therefore, it is necessary to research technologies that enable insurance companies to share claims information while ensuring its security.

[0003] Existing technology discloses a blockchain-based method for sharing commercial medical insurance claims data, including: querying key insurance information from the insurance company as first evidence data and storing it on the blockchain; querying and obtaining reimbursable expense records from the medical institution when the first evidence data is reliable, storing them on the blockchain as second evidence data; obtaining claim reporting information from the insurance company when the first and second evidence data are reliable, storing it on the blockchain as third evidence data; the claims service platform obtaining a standard medical dataset from the medical institution and storing it on the blockchain when the first, second, and third evidence data are reliable; and the insurance company obtaining medical data associated with key data fields in the standard medical dataset when the first, second, and third evidence data are reliable. This achieves secure, autonomous, and controllable data sharing between the medical institution, the claims service platform, and the insurance company. However, this technical solution cannot achieve claims information sharing between insurance companies, nor can it identify and handle duplicate claims. Summary of the Invention

[0004] The technical problem this invention aims to solve is the current lack of a claims information sharing solution. A blockchain-based insurance claims data sharing method and system enables the sharing of claims information among insurance companies, helping to resolve the data silo problem between them.

[0005] To solve the above-mentioned technical problems, the technical solution adopted by the present invention is: a blockchain-based insurance claims data sharing method, comprising the following steps:

[0006] Establish a claims data sharing module and deploy it across multiple insurance companies;

[0007] When new claim information is available, the claim data sharing module receives the insured's claim information, encrypts the claim information, and extracts the hash value of the insured's identifier;

[0008] The encrypted claims information is associated with the insured's hash value as shared information, and the shared information is uploaded to the blockchain for storage.

[0009] The claims data sharing module queries the blockchain to find all shared information that matches the hash value of the insured's identifier;

[0010] The claims data sharing module decrypts the shared information to obtain the claims information of all insured persons and displays it to the insurance company's claims agents.

[0011] Preferably, the insurance claims data sharing method further includes a claims cancellation information sharing method, which includes the following steps:

[0012] When a claim that has already been paid is withdrawn, the claim data sharing module receives the withdrawn claim information;

[0013] Extract the hash value of the revoked claim information, extract the hash value of the insured's identifier, associate the hash value of the revoked claim information and the hash value of the insured's identifier with a preset revocation identifier and use them as revocation information, then upload them to the blockchain for storage.

[0014] The claims data sharing module queries the blockchain to find all cancellation information that matches the hash value of the insured's identifier, finds the claims information that matches the cancellation information, and marks the claims information as cancelled.

[0015] Preferably, the claims data sharing module encrypts and stores the scanned copies of the claims documents on a network storage device. The shared information also includes the scanned copies of the claims documents, the decryption key, and the hash value of the scanned copies of the claims documents.

[0016] Preferably, the claims data sharing module encrypts the scanned copies of claims documents using a time-limited encryption algorithm, and the encrypted scanned copies of claims documents are included in the shared information.

[0017] As a preferred option, a timed key distribution smart contract is published on the blockchain.

[0018] Methods for encrypting scanned claims documents using time-limited encryption algorithms include:

[0019] The timed key distribution smart contract generates a two-dimensional point coordinate group G0, G0={(x0j,y0j)}, j∈[1,m0], where m0 is the number of two-dimensional points contained in the two-dimensional point coordinate group G0;

[0020] Construct a variable i, initialize it to 1, and the timed key distribution smart contract executes the following steps at period T:

[0021] At the start of period Ti, the time-limited key distribution smart contract generates an integer Ni, where Ni > mk and k = i-1;

[0022] Generate Ni-mk two-dimensional point coordinates, and establish a polynomial function y=fi(x) such that the polynomial function y=fi(x) passes through the two-dimensional point coordinate group Gk and the generated Ni-mk two-dimensional point coordinates;

[0023] The polynomial function y=fi(x) is the encryption / decryption key. The polynomial function y=fi(x) is used to encrypt the scanned copy of the claim document.

[0024] Generate integers mi, mi>Ni, and generate mi-Ni+mk two-dimensional point coordinates that fall on the polynomial function y=fi(x), forming a two-dimensional point coordinate set Gi, Gi={(xij,yij)}, j∈[1,mi];

[0025] The timed key distribution smart contract includes a key prompt bar, which displays Nk and Ni.

[0026] As a preferred method, the method for decrypting scanned claims documents using a time-limited encryption algorithm includes:

[0027] Based on the encryption time of the scanned claim document and the current time, determine whether the encryption time is more than two periods T away from the current time. If it is more than two periods T away, issue a timeout alarm and end the decryption. If it is less than two periods T away but more than one period T away, read Nk, the two-dimensional point coordinate group Gh, and the two-dimensional point coordinate group Gk, where h=k-1. Randomly select Nk-mh two-dimensional point coordinates from the two-dimensional point coordinate group Gk, establish a restoring polynomial function y=fr(x), and pass the restoring polynomial function y=fr(x) through the two-dimensional point coordinate group Gh and the selected Nk-mh two-dimensional point coordinates. Use the restoring polynomial function y=fr(x) to decrypt and obtain the scanned claim document.

[0028] If no more than one period T is exceeded, then read Ni, the two-dimensional point coordinate group Gk, and the two-dimensional point coordinate group Gi. Randomly select Ni-mk two-dimensional point coordinates from the two-dimensional point coordinate group Gi, establish the restoration polynomial function y=fr(x), and make the restoration polynomial function y=fr(x) pass through the two-dimensional point coordinate group Gk and the selected Ni-mk two-dimensional point coordinates. The scanned copy of the claim document can be obtained by decrypting using the restoration polynomial function y=fr(x).

[0029] As a preferred method, the method of encrypting scanned claims documents using the polynomial function y=fi(x) includes:

[0030] The scanned copy of the claim document is converted into binary data, and the binary data is truncated into several binary numbers B of a preset length;

[0031] Establish a numerical set (x, b) that satisfies B = |fi(x)| + b. The numerical set (x, b) corresponding to all binary numbers B is used as the ciphertext of the scanned copy of the claim document.

[0032] Methods for decrypting scanned claims documents using the polynomial function y=fr(x) include:

[0033] Substitute the numerical group (x, b) of the ciphertext into B = |fr(x)| + b to obtain the complete binary number B;

[0034] Concatenate all the binary numbers B and convert them into a string to obtain a scanned copy of the claim document.

[0035] Preferably, the method for storing the scanned copies of the claim documents in the claims data sharing module includes:

[0036] Create and store claim form templates, and associate template numbers with claim form templates. The claim form template is a scanned image of a blank claim form.

[0037] Calculate the pixel difference at each pixel position between the scanned copy of the claim document and the corresponding claim document template, and the pixel differences constitute a difference image;

[0038] The template number associated with the difference image is stored in a network storage device.

[0039] Preferably, both the claim form template and the scanned copy of the claim form are grayscale images.

[0040] A blockchain-based insurance claims data sharing system is provided to execute a blockchain-based insurance claims data sharing method as described above. The system includes a sharing platform that receives registration requests from insurance companies and establishes a claims data sharing module. This module is deployed to the insurance companies that submitted the registration requests. When new claims information is available, the module receives the insured's claims information, encrypts it, extracts the hash value of the insured's identifier, associates the encrypted claims information with the insured's hash value as shared information, and uploads this shared information to the blockchain for storage. The module queries the blockchain to find all shared information matching the hash value of the insured's identifier, decrypts the shared information to obtain all insured's claims information, and displays it to the insurance company's claims agent.

[0041] The substantial effects of this invention are as follows: By deploying a claims data sharing module across multiple insurance companies, secure sharing of claims data between insurance companies is achieved. While ensuring the security and confidentiality of claims information, the sharing of insured claims information among insurance companies helps them detect insurance fraud and duplicate claims, maintaining order in the claims process. Furthermore, by encrypting claims documents using a time-limited encryption algorithm before sharing them among insurance companies, relevant evidence can be quickly obtained when duplicate claims are discovered, facilitating timely payment stoppage, accountability, or initiation of litigation. Finally, by establishing claims document templates and using pixel difference storage for scanned claims documents, the storage volume of claims documents is reduced, as is the network resource consumption during transmission. Attached Figure Description

[0042] Figure 1 This is a schematic diagram of the insurance claims data sharing method according to an embodiment of the present invention.

[0043] Figure 2 This is a schematic diagram of the claim cancellation information sharing method according to an embodiment of the present invention.

[0044] Figure 3 This is a schematic diagram of the method for encrypting scanned claims documents according to an embodiment of the present invention.

[0045] Figure 4 This is a schematic diagram of the method for decrypting the storage address of scanned claim documents according to an embodiment of the present invention.

[0046] Figure 5 This is a schematic diagram of the method for storing the encrypted claim document scan address according to an embodiment of the present invention.

[0047] Figure 6 This is a schematic diagram of the method for decrypting storage addresses using polynomial functions according to an embodiment of the present invention.

[0048] Figure 7 This is a schematic diagram of the method for storing scanned copies of claim documents in the claim data sharing module according to an embodiment of the present invention.

[0049] Figure 8 This is a schematic diagram of the structure of an insurance claims data sharing system according to an embodiment of the present invention.

[0050] Among them: 10. Blockchain, 21. Claims data sharing module, 22. Insurance company, 30. Sharing platform. Detailed Implementation

[0051] The specific embodiments of the present invention will be further described below with reference to the accompanying drawings.

[0052] Before introducing the technical solution of this embodiment, the application scenario of this embodiment will be introduced.

[0053] Insurance claims refer to the act of an insurance company fulfilling its liability for compensation or payment according to the contract when an insured event occurs that results in loss of property or personal injury to the insured, or when other insured events stipulated in the policy occur and insurance benefits are required. It directly reflects the insurance function and the fulfillment of insurance responsibilities. After an insured event occurs, when requesting compensation or payment of insurance benefits from the insurer according to the insurance contract, the policyholder, insured, or beneficiary should provide the insurer with all available evidence and information related to confirming the nature, cause, and extent of the loss of the insured event. The insurance company compensates the insured for their losses based on the extent of damage to the insured property at the time of the incident, up to the insured amount. Insurance compensation is indemnifying in nature, only compensating for the actual loss, at most equivalent to the value of the damaged property, and never exceeding its value.

[0054] After an insured event occurs and a claim is filed, if the insurance company deems it necessary to submit additional supporting documentation, it shall promptly notify the other party. Once all supporting documentation is complete, the insurance company shall promptly make a determination; in complex cases, the determination shall be made within 30 days. For claims that are eligible for payment, the insurance company shall pay the claim within 10 days of reaching a settlement agreement. For claims that are not eligible for payment, a notice of rejection stating the reasons shall be issued within 3 days of the determination.

[0055] Currently, there is a data silo problem among insurance companies (22-insurance companies). During and after the claims process, it is impossible for each insurance company (22-insurance company) to detect whether there has been insurance fraud or duplicate claims, leading to uncontrollable risks of fraud and posing a serious threat to the claims business of insurance companies (22-insurance companies). Fraud and duplicate claims also disrupt the normal market order and affect the fairness of business activities. To promote information sharing among insurance companies and solve the problem of duplicate claims offline, this embodiment provides a blockchain-based insurance claims data sharing method. Please refer to the appendix. Figure 1 This includes the following steps:

[0056] Step A01) Establish a claims data sharing module 21 and deploy it in multiple insurance companies 22;

[0057] Step A02) When new claim information exists, the claim data sharing module 21 receives the insured's claim information, encrypts the claim information, and extracts the hash value of the insured's identifier;

[0058] Step A03) Associate the encrypted claims information with the insured's hash value as shared information, and upload the shared information to the blockchain 10 for storage;

[0059] Step A04) Claims data sharing module 21 queries blockchain 10 to find all shared information that matches the hash value of the insured's identifier;

[0060] Step A05) Claims data sharing module 21 decrypts the shared information, obtains all the insured's claims information, and displays it to the insurance company's claims agent 22.

[0061] By deploying a claims data sharing module 21 across multiple insurance companies 22, secure sharing of claims data among the insurance companies 22 is achieved. This ensures the security and confidentiality of claims information, enabling the sharing of insured claims information among the insurance companies 22. This helps the insurance companies 22 detect insurance fraud and duplicate claims, maintaining order in the claims process. Insurance companies 22 upload their claims data to blockchain 10 for storage through the claims data sharing module 21. During the claims processing, blockchain 10 is queried to retrieve claims data from other insurance companies 22 for the same insured. If claims records for the same time period and reason exist, it indicates duplicate claims by the insured. In this case, the claims process should be suspended, and verification should be conducted with other insurance companies 22 and the insured who have already made the claim. If a claim has indeed been made, the claims process is terminated. If, after verification, no duplicate claims are found, the claims process continues. The technical solution provided in this embodiment establishes a secure claims data sharing channel among the insurance companies 22, providing data support for the immediate detection of duplicate claims during the claims processing process.

[0062] In this embodiment, the insured's claim information includes the hash value of the insured's name, identification code, claim details, and claim time. The identification code is the hash value of the national identity card number. The insured's name hash value and identification code allow for identification among insurance companies 22 holding policies for the same insured, while preventing other insurance companies 22 from obtaining any valid personal information. This ensures the sharing of claim information among different insurance companies 22 while protecting the insured's information security.

[0063] A hash value transforms an input of arbitrary length into a fixed-length output using a hash algorithm. When using the same hash algorithm, the same input will have the same output, and different inputs will necessarily have different hash values. Furthermore, it is impossible to deduce the input from the hash value, thus effectively protecting the security of input information. Commonly used hash algorithms include MD5, SHA256, and SM3. For example, the hash value for the name Zhang San is 1D841BC0EE98309CB7916670B7F0FDEF5F4C35150711A41405EF3633B56322CF, using SHA256. If two insurance companies 22 both have policies for Zhang San, each company 22 can extract the hash value and then compare them to determine that the insured has policies and claims records with both companies 22. However, insurance company 22, which does not have a policy, cannot reverse-engineer the insured's name using the hash value of the name. This prevents the sharing of claims data for the same insured across different insurance companies 22, while protecting the insured's name information. The primary purpose of claims data sharing is to share claims records, which allows for the detection of duplicate claims.

[0064] On the other hand, the insurance claims data sharing method in this embodiment also includes a claims cancellation information sharing method, please refer to the appendix. Figure 2 The method for sharing information on claims cancellation includes the following steps:

[0065] Step B01) When a claim that has already been paid is revoked, the claim data sharing module 21 receives the revoked claim information;

[0066] Step B02) Extract the hash value of the revoked claim information, extract the hash value of the insured's identifier, associate the hash value of the revoked claim information and the hash value of the insured's identifier with the preset revocation identifier and use it as the revocation information, and upload it to the blockchain 10 for storage.

[0067] Step B03) Claims data sharing module 21 queries blockchain 10, finds all cancellation information that matches the hash value of the insured's identifier, finds the claim information that matches the cancellation information, and marks the claim information as cancelled.

[0068] By sharing claim cancellation information, a related claim cancellation information can be added to the claim record that has been uploaded to the blockchain 10, so that other insurance companies 22 can know that the claim record has been cancelled, which helps other insurance companies 22 to correctly determine whether the insured has made duplicate claims.

[0069] The claims data sharing module 21 encrypts and stores scanned copies of claims documents on a network storage device. The shared information also includes the scanned copies of the claims documents, the decryption key, and the hash value of the scanned copies. When anomalies such as duplicate claims are detected, verification with other relevant insurance companies 22 and the insured is required. However, constantly verifying with other relevant insurance companies 22 increases their workload and reduces verification efficiency. Therefore, this embodiment provides a solution that incorporates scanned copies of claims documents into the shared information. When an insurance company 22 detects anomalies in a claim, such as the risk of duplicate claims, it can directly download the claims documents through the shared information. Verification with the insured can then be done using the downloaded documents, significantly reducing the workload of the insurance company 22, improving the efficiency of claims risk verification, more effectively mitigating the risk of abnormal claims, and ensuring the normal operation of claims business.

[0070] The claims data sharing module 21 encrypts scanned copies of claims documents using a time-limited encryption algorithm, and the encrypted scanned copies of claims documents are included in the shared information. By sharing claims documents between insurance companies 22 after encrypting them using the time-limited encryption algorithm, relevant evidence can be obtained quickly if duplicate claims by the insured are discovered, which helps to stop payments, pursue accountability, or initiate litigation in a timely manner.

[0071] On the other hand, this embodiment publishes a timed key distribution smart contract on blockchain 10. Please refer to the appendix. Figure 3 Methods for encrypting scanned claims documents using time-limited encryption algorithms include:

[0072] Step C01) The timed key distribution smart contract generates a two-dimensional point coordinate group G0, G0={(x0j,y0j)}, j∈[1,m0], where m0 is the number of two-dimensional points contained in the two-dimensional point coordinate group G0;

[0073] Step C02) Construct variable i, initialize i to 1, and the timed key distribution smart contract executes the following steps in period T:

[0074] Step C03) At the beginning of period Ti, the timed key distribution smart contract generates an integer Ni, Ni>mk, k=i-1;

[0075] Step C04) Generate Ni-mk two-dimensional point coordinates, establish a polynomial function y=fi(x) such that the polynomial function y=fi(x) passes through the two-dimensional point coordinate group Gk and the generated Ni-mk two-dimensional point coordinates;

[0076] Step C05) The polynomial function y=fi(x) is the encryption / decryption key. Use the polynomial function y=fi(x) to encrypt the scanned claim document.

[0077] Step C06) Generate integers mi, mi>Ni, and generate mi-Ni+mk two-dimensional point coordinates that fall on the polynomial function y=fi(x), forming a two-dimensional point coordinate group Gi, Gi={(xij,yij)}, j∈[1,mi];

[0078] Step C07) The timed key distribution smart contract includes a key hint bar that displays Nk and Ni.

[0079] For example, in step C01), a two-dimensional point coordinate group G0 is generated, which includes three two-dimensional point coordinates, namely {(2,10),(3,15),(6,45)}.

[0080] After entering the first cycle, in step C03), the integer N1 = 5 is generated, and then in step C04), two two-dimensional point coordinates are generated, namely (4, 18) and (9, 85). This leads to the generation of the polynomial function y = f1(x) = -0.2448412698412677*x^4 + 4.797619047619004*x^3 - 30.71230158730129*x^2 + 83.32142857142777*x - 68.25714285714214. This ensures that the polynomial function y = f1(x) passes through the aforementioned five two-dimensional points.

[0081] Then, in step C05), the polynomial function y = f1(x) is used to encrypt the scanned claim document. In step C05), m1 = 5 is generated, and then three two-dimensional point coordinates (m1 - N1 + m0) are generated, which are (10, 43), (12, -278), and (15, -1932), respectively. Specifically, since there is a certain error in polynomial fitting, in this embodiment, the difference between the ordinates within ±1 is considered to fall on the polynomial function. At this time, the two-dimensional point coordinate group G1 = {(4, 18), (9, 85), (10, 43), (12, -278), (15, -1932)}. N1 = 5 is displayed in the key prompt bar. In the next cycle, N2 > 8 is generated, such as N2 = 10, and after generating two or five more two-dimensional point coordinates, the polynomial function, i.e., y = f2(x), is regenerated. N1 = 5 and N2 = 10 are displayed in the key prompt bar. Assuming N3=14 is generated in the third cycle, the key hint bar will display N2=10 and N3=14. At this point, due to the lack of N1, using a subset of a finite number of two-dimensional points, the possible number of possible polynomial functions generated is a power of the two-dimensional point coordinates. When the set of two-dimensional point coordinates includes a large number of two-dimensional points, exhaustively enumerating the polynomial function becomes an unacceptable task within an acceptable timeframe. Using the polynomial function y=f1(x) to encrypt scanned claims documents will prevent correct decryption, thus achieving time-limited encryption of scanned claims documents.

[0082] Please see the appendix Figure 4 Methods for decrypting scanned claims documents using time-limited encryption algorithms include:

[0083] Step D01) Based on the encryption time of the scanned claim document and the current time, determine whether the encryption time is more than two cycles T away from the current time. If it is more than two cycles T away, issue a timeout alarm and end the decryption process.

[0084] Step D02) If it does not exceed two periods T but is greater than one period T, then read Nk, the two-dimensional point coordinate group Gh and the two-dimensional point coordinate group Gk, where h=k-1. Randomly select Nk-mh two-dimensional point coordinates from the two-dimensional point coordinate group Gk, establish the restoration polynomial function y=fr(x), and make the restoration polynomial function y=fr(x) pass through the two-dimensional point coordinate group Gh and the selected Nk-mh two-dimensional point coordinates. Use the restoration polynomial function y=fr(x) to decrypt and obtain the scanned copy of the claim document;

[0085] Step D03) If no more than one period T is exceeded, then read Ni, the two-dimensional point coordinate group Gk, and the two-dimensional point coordinate group Gi. Randomly select Ni-mk two-dimensional point coordinates from the two-dimensional point coordinate group Gi, establish the restoration polynomial function y=fr(x), and make the restoration polynomial function y=fr(x) pass through the two-dimensional point coordinate group Gk and the selected Ni-mk two-dimensional point coordinates. Use the restoration polynomial function y=fr(x) to decrypt and obtain the scanned copy of the claim document.

[0086] If we need to decrypt the encrypted scanned copies of claim documents from the first period, we calculate the difference between the encryption time of the scanned copies of the claim documents and the current time.

[0087] If the condition falls within the range of less than two periods T but greater than one period T, then read N1=5 from the key prompt bar, read the two-dimensional point coordinate group G0 to obtain three two-dimensional point coordinates {(2,10),(3,15),(6,45)}, and read any two two-dimensional point coordinates from the two-dimensional point coordinate group G1, such as (10,43) and (12, -278). Using the five two-dimensional point coordinates read, the restored polynomial function y=f1'(x) can be correctly obtained. The restored polynomial function y=f1'(x) can then be used to decrypt and obtain the scanned copy of the claim document.

[0088] If the period does not exceed one period T, then N1=5 is read directly. Similarly, two two-dimensional point coordinates are read arbitrarily from the two-dimensional point coordinate group G1. The polynomial function is established by selecting two two-dimensional point coordinates and the two-dimensional point coordinate group G0. The restored polynomial function y=f1'(x) can still be obtained.

[0089] The highest-degree term of the polynomial function established using n two-dimensional point coordinates has a degree of n-1, and the polynomial function has n coefficients. That is, n unknowns. The n two-dimensional point coordinates can establish n linear equations in n variables, and the n coefficients can be quickly solved simultaneously. Therefore, in this embodiment, the calculation of generating and restoring the polynomial function is very fast.

[0090] Please see the appendix Figure 5 Methods for encrypting scanned claims documents using the polynomial function y=fi(x) include:

[0091] Step E01) Convert the scanned claim document into binary data, and truncate the binary data into several binary numbers B of a preset length;

[0092] Step E02) Create a numerical group (x, b) that satisfies B = |fi(x)| + b. The numerical group (x, b) corresponding to all binary numbers B is used as the ciphertext of the scanned claim document. Part of the binary data is: 01000101 01110101 0101011101101011, which is truncated into two integers of 2 bytes each, namely D1 = 17781 and D2 = 22379. The polynomial function used for encryption is y = f1(x) = -0.2448412698412677*x^4 + 4.797619047619004*x^3 - 30.71230158730129*x^2 + 83.32142857142777*x - 68.25714285714214. Then D1 can be expressed as D1=17781=|f1(22)| -1589, that is, x=22 and b=-1589. The ciphertext of the scanned claim document encrypted with the polynomial function y=fi(x) is not unique, which further improves the security of the encrypted claim document. For example, D1 can also be expressed as D1=|f1(20)|+6301, that is, x=20 and b=6301.

[0093] Please see the appendix Figure 6 Methods for decrypting scanned claims documents using the polynomial function y=fr(x) include:

[0094] Step F01) Substitute the numerical group (x, b) of the ciphertext into B = |fr(x)| + b to obtain the complete binary number B;

[0095] Step F02) Concatenate all binary numbers B and convert them into a string to obtain a scanned copy of the claim document.

[0096] After obtaining the restoring polynomial function, substitute the numerical set (x,b) into it to obtain the binary data B. Concatenate the data in order to obtain the original text.

[0097] On the other hand, this embodiment provides a specific method for the claims data sharing module 21 to store scanned copies of claims documents. Please refer to the appendix. Figure 7 ,include:

[0098] Step G01) Create and store a claim form template, associate a template number with the claim form template, and the claim form template is a scanned image of a blank claim form;

[0099] Step G02) Calculate the pixel difference between each pixel position of the scanned claim document and the corresponding claim document template. The pixel differences form a difference image.

[0100] Step G03) Associate the difference image with the corresponding template number and store it in the network storage device.

[0101] Most areas of the claims document have the same image, with differences only in the specific information and document number areas. By creating a claims document template and using pixel difference storage for scanned claims documents, the storage volume of claims documents can be reduced, as can the network resources occupied during claims document transmission.

[0102] On the other hand, this embodiment also provides a scheme for storing pixel differences with variable length. Specifically, it includes: calculating the pixel difference between each pixel position of the scanned claim document and the corresponding claim document template; presetting a first byte length and a second byte length; the maximum value represented by the first byte length is M1, and the minimum value represented by the second byte length is M2; if the pixel difference is less than M1, the first byte length is used; if the pixel difference is not less than M1, the second byte length is used. If the byte length of adjacent pixels changes, M1 or M2 is inserted between the two pixels, and the inserted value occupies the same byte length as the adjacent pixel occupies the previous pixel. When the scanned claim document uses RGB to represent color, each pixel has three channels, each channel occupies 1 byte, i.e., 8 bits. The value range of each channel is [0, 255]. When representing the pixel difference, 5 bits are used. The first bit represents the sign, that is, adding or subtracting the following 4 bits representing the difference to the corresponding channel value at the corresponding pixel position on the claim document template. The range of the 4 bits is [0, 15]. The value of M1 is 15, and the value of M2 is 0. For pixels with channel values ​​exceeding the range that can be represented by 5 bits, the difference is no longer used; instead, one byte is used to directly represent the value of each channel.

[0103] For example, the pixel values ​​of two positions in the claim form template are (245,245,245) and (30,30,32), while the pixel values ​​of the scanned claim form at the same position are (240,235,239) and (242,240,242), and the corresponding pixel differences are (-5,-10,-6) and (212,210,210), respectively.

[0104] The binary representation of two adjacent pixel values ​​in the scanned copy of the claim document is: (10101,11010,10110), (11010100,11010010,11010010), ..., (01000,00100,01001). Adding M1 and M2 as intervals: (10101,11010,10110), M1: (01111,01111,01111), (11010100,11010010,11010010), ..., M2: (00000000,0000000,00000000), (01000,00100,01001). The final binary representation of a number of pixels is: 1010111010101100111101111101111110101001101001011010010…0000000000000000000000000010000010001001001.

[0105] When reading the aforementioned number of pixels, the system is set to pixel difference mode, meaning it reads 5x3 bits at a time. These are then divided into three 5-bit binary numbers, representing the difference between the first pixel and the pixel value at the same position in the claim document template. A first bit of 1 indicates a negative value, and a first bit of 0 indicates a positive value. The resulting values ​​are (-5, -10, -6), which, combined with the claim document template, allow the reconstruction of the first pixel. Reading another 5x3 bits reveals that the pixel differences across all three channels are positive 15, the value of M1, so these 5x3 bits are discarded. Then, 8x3 bits are read downwards, directly obtaining the values ​​of the three channels for the next pixel, thus reconstructing that pixel. This process continues downwards until an 8x3 bit is read where all values ​​are 0, at which point it is discarded. The system then switches back to reading 5x3 bits downwards to continue reading. Since (0,0,0) represents pure black in RGB, and the scanning of claim documents is affected by printing saturation and lighting, the black parts in the resulting scanned claim documents will appear as a dark gray close to black, and almost never pure black. Therefore, M2 will not cause distortion in the scanned claim documents. Even if pure black pixels exist in the scanned claim documents, the claim document receiving module 10 can simply replace them with (1,1,1) in batches.

[0106] On the other hand, this embodiment also provides an insurance claims data sharing system based on blockchain 10. Please refer to the appendix. Figure 8The system includes a sharing platform 30, which receives registration requests from insurance companies 22 and establishes a claims data sharing module 21. The claims data sharing module 21 is deployed to the insurance companies 22 that submitted the registration requests. When new claims information exists, the claims data sharing module 21 receives the insured's claims information, encrypts the claims information, extracts the hash value of the insured's identifier, associates the encrypted claims information with the insured's hash value as shared information, and uploads the shared information to blockchain 10 for storage. The claims data sharing module 21 queries blockchain 10 to find all shared information that matches the hash value of the insured's identifier, decrypts the shared information, obtains all the insured's claims information, and displays it to the claims agent of the insurance company 22.

[0107] The embodiments described above are merely preferred embodiments of the present invention and are not intended to limit the present invention in any way. Other variations and modifications are possible without departing from the technical solutions described in the claims.

Claims

1. A blockchain-based method for sharing insurance claims data, characterized in that, Includes the following steps: Establish a claims data sharing module and deploy it across multiple insurance companies; When new claim information is available, the claim data sharing module receives the insured's claim information, encrypts the claim information, and extracts the hash value of the insured's identifier; The encrypted claims information is associated with the insured's hash value as shared information, and the shared information is uploaded to the blockchain for storage. The claims data sharing module queries the blockchain to find all shared information that matches the hash value of the insured's identifier; The claims data sharing module decrypts the shared information to obtain the claims information of all insured persons and displays it to the insurance company's claims agents; The claims data sharing module encrypts and stores scanned copies of claims documents on a network storage device. The shared information also includes the scanned copies of claims documents, a decryption key, and the hash value of the scanned copies of claims documents. The claims data sharing module encrypts the scanned copies of the claims documents using a time-limited encryption algorithm, and the scanned copies of the claims documents encrypted using the time-limited encryption algorithm are included in the shared information; Publish a timed key distribution smart contract on the blockchain. Methods for encrypting scanned claims documents using time-limited encryption algorithms include: The timed key distribution smart contract generates a two-dimensional point coordinate group G0, G0={(x0j,y0j)}, j∈[1,m0], where m0 is the number of two-dimensional points contained in the two-dimensional point coordinate group G0; Construct a variable i, initialize it to 1, and the timed key distribution smart contract executes the following steps at period T: At the start of period Ti, the time-limited key distribution smart contract generates an integer Ni, where Ni > mk and k = i-1; Generate Ni-mk two-dimensional point coordinates, and establish a polynomial function y=fi(x) such that the polynomial function y=fi(x) passes through the two-dimensional point coordinate group Gk and the generated Ni-mk two-dimensional point coordinates; The polynomial function y=fi(x) is the encryption / decryption key. The polynomial function y=fi(x) is used to encrypt the scanned copy of the claim document. Generate integers mi, mi>Ni, and generate mi-Ni+mk two-dimensional point coordinates that fall on the polynomial function y=fi(x), forming a two-dimensional point coordinate set Gi, Gi={(xij,yij)}, j∈[1,mi]; The timed key distribution smart contract includes a key prompt bar, which displays Nk and Ni.

2. The blockchain-based insurance claims data sharing method according to claim 1, characterized in that, The insurance claims data sharing method also includes a claims cancellation information sharing method, which includes the following steps: When a claim that has already been paid is withdrawn, the claim data sharing module receives the withdrawn claim information; Extract the hash value of the revoked claim information, extract the hash value of the insured's identifier, associate the hash value of the revoked claim information and the hash value of the insured's identifier with a preset revocation identifier and use them as revocation information, then upload them to the blockchain for storage. The claims data sharing module queries the blockchain to find all cancellation information that matches the hash value of the insured's identifier, finds the claims information that matches the cancellation information, and marks the claims information as cancelled.

3. The method for sharing insurance claims data based on blockchain according to claim 1, characterized in that, Methods for decrypting scanned claims documents using time-limited encryption algorithms include: Based on the encryption time of the scanned claim document and the current time, determine whether the encryption time is more than two periods T away from the current time. If it is more than two periods T away, issue a timeout alarm and end the decryption. If it is less than two periods T away but more than one period T away, read Nk, the two-dimensional point coordinate group Gh, and the two-dimensional point coordinate group Gk, where h=k-1. Randomly select Nk-mh two-dimensional point coordinates from the two-dimensional point coordinate group Gk, establish a restoring polynomial function y=fr(x), and pass the restoring polynomial function y=fr(x) through the two-dimensional point coordinate group Gh and the selected Nk-mh two-dimensional point coordinates. Use the restoring polynomial function y=fr(x) to decrypt and obtain the scanned claim document. If no more than one period T is exceeded, then read Ni, the two-dimensional point coordinate group Gk, and the two-dimensional point coordinate group Gi. Randomly select Ni-mk two-dimensional point coordinates from the two-dimensional point coordinate group Gi, establish the restoration polynomial function y=fr(x), and make the restoration polynomial function y=fr(x) pass through the two-dimensional point coordinate group Gk and the selected Ni-mk two-dimensional point coordinates. The scanned copy of the claim document can be obtained by decrypting using the restoration polynomial function y=fr(x).

4. The blockchain-based insurance claims data sharing method according to claim 2, characterized in that, Methods for encrypting scanned claims documents using the polynomial function y=fi(x) include: The scanned copy of the claim document is converted into binary data, and the binary data is truncated into several binary numbers B of a preset length; Establish a numerical set (x, b) that satisfies B = |fi(x)| + b. The numerical set (x, b) corresponding to all binary numbers B is used as the ciphertext of the scanned copy of the claim document. Methods for decrypting scanned claims documents using the polynomial function y=fr(x) include: Substitute the numerical group (x, b) of the ciphertext into B = |fr(x)| + b to obtain the complete binary number B; Concatenate all the binary numbers B and convert them into a string to obtain a scanned copy of the claim document.

5. The method for sharing insurance claims data based on blockchain according to claim 1, characterized in that, The method for storing the scanned copies of the claim data sharing module includes: Create and store claim form templates, and associate template numbers with claim form templates. The claim form template is a scanned image of a blank claim form. Calculate the pixel difference at each pixel position between the scanned copy of the claim document and the corresponding claim document template, and the pixel differences constitute a difference image; The template number associated with the difference image is stored in a network storage device.

6. The blockchain-based insurance claims data sharing method according to claim 5, characterized in that, Both the claim form template and the scanned copy of the claim form are grayscale images.

7. A blockchain-based insurance claims data sharing system, characterized in that, The system includes a sharing platform that receives registration requests from insurance companies and establishes a claims data sharing module. This module is deployed to the insurance companies that submitted the registration requests. When new claims information is available, the module receives the insured's claims information, encrypts it, extracts the hash value of the insured's identifier, associates the encrypted claims information with the insured's hash value as shared information, and uploads the shared information to the blockchain for storage. The module queries the blockchain to find all shared information that matches the hash value of the insured's identifier, decrypts the shared information to obtain all the insured's claims information, and displays it to the insurance company's claims agent. The claims data sharing module encrypts and stores scanned copies of claims documents on a network storage device. The shared information also includes the scanned copies of claims documents, a decryption key, and the hash value of the scanned copies of claims documents. The claims data sharing module encrypts the scanned copies of the claims documents using a time-limited encryption algorithm, and the scanned copies of the claims documents encrypted using the time-limited encryption algorithm are included in the shared information; Publish a timed key distribution smart contract on the blockchain. Methods for encrypting scanned claims documents using time-limited encryption algorithms include: The timed key distribution smart contract generates a two-dimensional point coordinate group G0, G0={(x0j,y0j)}, j∈[1,m0], where m0 is the number of two-dimensional points contained in the two-dimensional point coordinate group G0; Construct a variable i, initialize it to 1, and the timed key distribution smart contract executes the following steps at period T: At the start of period Ti, the time-limited key distribution smart contract generates an integer Ni, where Ni > mk and k = i-1; Generate Ni-mk two-dimensional point coordinates, and establish a polynomial function y=fi(x) such that the polynomial function y=fi(x) passes through the two-dimensional point coordinate group Gk and the generated Ni-mk two-dimensional point coordinates; The polynomial function y=fi(x) is the encryption / decryption key. The polynomial function y=fi(x) is used to encrypt the scanned copy of the claim document. Generate integers mi, mi>Ni, and generate mi-Ni+mk two-dimensional point coordinates that fall on the polynomial function y=fi(x), forming a two-dimensional point coordinate set Gi, Gi={(xij,yij)}, j∈[1,mi]; The timed key distribution smart contract includes a key prompt bar, which displays Nk and Ni.

Images