CN116645224A - Insurance claim data sharing method and system based on blockchain - Google Patents

Insurance claim data sharing method and system based on blockchain Download PDF

Info

Publication number
CN116645224A
CN116645224A CN202310679902.1A CN202310679902A CN116645224A CN 116645224 A CN116645224 A CN 116645224A CN 202310679902 A CN202310679902 A CN 202310679902A CN 116645224 A CN116645224 A CN 116645224A
Authority
CN
China
Prior art keywords
information
dimensional point
data sharing
hash value
insured
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202310679902.1A
Other languages
Chinese (zh)
Inventor
翁远
高航
俞学劢
张金琳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhejiang Shuqin Technology Co Ltd
Original Assignee
Zhejiang Shuqin Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zhejiang Shuqin Technology Co Ltd filed Critical Zhejiang Shuqin Technology Co Ltd
Priority to CN202310679902.1A priority Critical patent/CN116645224A/en
Publication of CN116645224A publication Critical patent/CN116645224A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/08Insurance
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10File systems; File servers
    • G06F16/17Details of further file system functions
    • G06F16/176Support for shared access to files; File sharing support
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/602Providing cryptographic facilities or services
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/62Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/62Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • G06F21/6227Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database where protection concerns the structure of data, e.g. records, types, queries

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Business, Economics & Management (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Hardware Design (AREA)
  • General Health & Medical Sciences (AREA)
  • Bioethics (AREA)
  • Health & Medical Sciences (AREA)
  • Databases & Information Systems (AREA)
  • Finance (AREA)
  • Accounting & Taxation (AREA)
  • Economics (AREA)
  • Data Mining & Analysis (AREA)
  • General Business, Economics & Management (AREA)
  • Technology Law (AREA)
  • Strategic Management (AREA)
  • Marketing (AREA)
  • Development Economics (AREA)
  • Storage Device Security (AREA)

Abstract

The invention relates to the technical field of information, in particular to a block chain-based insurance claim data sharing method and system, wherein the method comprises the following steps: establishing claim data sharing modules and disposing the claim data sharing modules in a plurality of insurance companies; when new claim information exists, the claim data sharing module receives the claim information of the insured, encrypts the claim information and extracts the hash value of the insured mark; the hash value of the insured person associated with the claim information is stored as a shared information uploading block chain; querying a block chain to find all sharing information matched with the hash value identified by the insured; decrypting the shared information to obtain the claim information of all insured life. The invention has the following substantial effects: the safe sharing of the claim settlement data among the insurance companies is realized, so that the insurance companies can find out cheating insurance and repeated claim settlement conditions, and the claim settlement business order is maintained; the method realizes the quick acquisition of related evidence and is helpful for timely stopping payment, pursuing responsibility or initiating litigation.

Description

Insurance claim data sharing method and system based on blockchain
Technical Field
The invention relates to the technical field of information, in particular to a block chain-based insurance claim data sharing method and system.
Background
Insurance refers to the business insurance of paying insurance fee to insurers according to contract agreements, wherein the insurers bear the liability of reimbursement for insurance fund for property loss caused by possible accidents of the contract agreements, or the insurers die, disabled and suffer from diseases or have the liability of paying insurance fund when reaching the conditions of age, period and the like of the contract agreements. Insurance claims refer to business activities of an insurer for receiving insurance compensation requests proposed by the insured according to insurance contracts or regulations of related laws and regulations, and performing investigation, damage assessment, calculation and compensation. The settlement of insurance is typically performed by six stages, including investigation, verification or commission verification, verification of a case, settlement of an amount of compensation, and payment of compensation, from the receipt of an insurance notice. After the occurrence of the insured event, the insured may be asked to provide evidence and information regarding the nature and extent of the loss of the insured event, before the insured life pays out the insured reimbursement to the insured. In the actual insurance claim settlement process, there are repeated claim settlement phenomena and problems. Although through investigation and inspection, false insurance compensation requests can be eliminated, and normal insurance claim settlement order is ensured. However, if the insurance policy exists among a plurality of insurance companies for the truly occurring insurance accident, the insurance policy is very likely to cause each insurance company to pay, and repeated claims settlement occurs. The problem of data island exists among the insurance companies at present, so that repeated claim settlement risks are difficult to discover, manage and control in time, and normal operation of insurance claim settlement business is affected. The insurance claim information often relates to sensitive information, so that a technology for realizing sharing of the insurance company claim information on the premise of ensuring the safety of the claim information needs to be studied.
The prior art discloses a block chain-based commercial medical insurance claim data sharing method, which comprises the following steps: inquiring key insurance information from an insurance company end as first certification data and storing the first certification data into a blockchain; inquiring and acquiring reimburseable expense records in the medical institution terminal as second evidence-storing data when the first evidence-storing data is credible and storing the second evidence-storing data into the blockchain; acquiring claim settlement information from an insurance company end as third evidence storage data when the first evidence storage data and the second evidence storage data are credible, and storing the third evidence storage data into a blockchain; the claim settlement service platform acquires a standard medical data set in the medical institution end and stores the standard medical data set in the blockchain when the first certificate data, the second certificate data and the third certificate data are trusted; the insurance company side obtains medical data associated with key data fields in the standard medical data set when the first forensic data, the second forensic data and the third forensic data are trusted. The safe autonomous and controllable data sharing between the medical institution end and the claim settlement service platform and between the insurance company end is realized. However, the technical scheme cannot realize the sharing of claim information among insurance companies and cannot realize the identification and treatment of repeated claim settlement and other actions.
Disclosure of Invention
The invention aims to solve the technical problems that: the technical problem of claim information sharing schemes is lacking at present. A block chain-based insurance claim data sharing method and system can realize sharing claim information among insurance companies, and are beneficial to solving the problem of data island among the insurance companies.
In order to solve the technical problems, the invention adopts the following technical scheme: a block chain-based insurance claim data sharing method comprises the following steps:
establishing claim data sharing modules and respectively disposing the claim data sharing modules in a plurality of insurance companies;
when new claim information exists, the claim data sharing module receives the claim information of the insured, encrypts the claim information and extracts the hash value of the insured mark;
the encrypted claim information is related to the hash value of the insured person as shared information, and the shared information is uploaded to a blockchain for storage;
the claim data sharing module queries the blockchain to find all sharing information matched with the hash value identified by the insured;
and the claim data sharing module decrypts the sharing information to obtain the claim information of all insured persons and displays the claim information to claim service personnel of the insurance company.
Preferably, the insurance claim data sharing method further includes a claim revocation information sharing method, the claim revocation information sharing method including the steps of:
when the claim information of the existing claim is revoked, the claim data sharing module receives the revoked claim information;
extracting the hash value of the revoked claim information, extracting the hash value of the insured person identifier, and uploading the hash value of the revoked claim information and the hash value of the insured person identifier to be stored in a blockchain as revocation information after associating a preset revocation identifier with the hash value of the revoked claim information and the hash value of the insured person identifier;
and the claim data sharing module queries a blockchain, finds out all the revocation information matched with the hash value of the insured mark, finds out the claim information matched with the revocation information, and marks the claim information as revoked.
Preferably, the claim data sharing module encrypts and stores the claim document scanning piece to the network storage device, and the sharing information further comprises the claim document scanning piece, the decryption key and a hash value of the claim document scanning piece.
Preferably, the claim data sharing module encrypts the claim document scanning piece by using a time-limited encryption algorithm, and the claim document scanning piece encrypted by using the time-limited encryption algorithm is included in the sharing information.
Preferably, the time-limited key distribution smart contract is published on the blockchain,
the method for encrypting the claim document scanner by using the time-limited encryption algorithm comprises the following steps:
the time-limited secret key distribution intelligent contract generates a two-dimensional point coordinate set G0, G0 = { (x 0j, y0 j) }, j epsilon [1, m0], wherein m0 is the number of two-dimensional points contained in the two-dimensional point coordinate set G0;
constructing a variable i, enabling an initial value of the i to be 1, and enabling the time-limited secret key distribution intelligent contract to execute the following steps in a period T:
at the beginning of period Ti, the time-limited key distribution intelligent contract generates an integer Ni, wherein Ni is greater than mk, and k=i-1;
generating Ni-mk two-dimensional point coordinates, and establishing a polynomial function y=fi (x) so that the polynomial function y=fi (x) passes through the two-dimensional point coordinate set Gk and the generated Ni-mk two-dimensional point coordinates;
the polynomial function y=fi (x) is an encryption and decryption secret key, and the claim document scanning piece is encrypted by using the polynomial function y=fi (x);
generating an integer mi, mi > Ni, generating mi-Ni+mk two-dimensional point coordinates falling on a polynomial function y=fi (x), and forming a two-dimensional point coordinate set Gi, gi= { (xij, yij) }, j epsilon [1, mi ];
the time-limited key distribution intelligent contract comprises a key prompt bar, and Nk and Ni are displayed in the key prompt bar.
Preferably, the method for decrypting the claim document scanner using a time-limited encryption algorithm comprises:
judging whether the encryption time is more than two periods T from the current time according to the encryption time and the current time of the document scanning piece of the claim, if so, sending out a timeout alarm and ending decryption; if the period T is not more than two periods but is more than one period T, reading Nk, a two-dimensional point coordinate set Gh and a two-dimensional point coordinate set Gk, wherein h=k-1, arbitrarily selecting Nk-mh two-dimensional point coordinates from the two-dimensional point coordinate set Gk, establishing a restoration polynomial function y=fr (x), enabling the restoration polynomial function y=fr (x) to pass through the two-dimensional point coordinate set Gh and the selected Nk-mh two-dimensional point coordinates, and decrypting by using the restoration polynomial function y=fr (x) to obtain the claim document scanning piece;
if the period T is not exceeded, reading Ni, a two-dimensional point coordinate set Gk and a two-dimensional point coordinate set Gi, arbitrarily selecting Ni-mk two-dimensional point coordinates from the two-dimensional point coordinate set Gi, establishing a restoration polynomial function y=fr (x), enabling the restoration polynomial function y=fr (x) to pass through the two-dimensional point coordinate set Gk and the selected Ni-mk two-dimensional point coordinates, and decrypting by using the restoration polynomial function y=fr (x) to obtain the claim document scanning piece.
Preferably, the method for encrypting the claim document scanner using the polynomial function y=fi (x) includes:
converting the claim document scanning piece into binary data, and cutting off the binary data into a plurality of binary numbers B with preset lengths;
establishing a value group (x, B) which meets the requirement of B= |fi (x) |+b, and taking the value group (x, B) corresponding to all binary numbers B as ciphertext of the claim document scanning piece;
the method for decrypting the claim document scanner using the polynomial function y=fr (x) includes:
substituting the value group (x, B) of the ciphertext into B= |fr (x) |+b in sequence to obtain all binary numbers B;
and (3) splicing all the binary numbers B, and converting the spliced binary numbers B into character strings to obtain the claim document scanning piece.
Preferably, the method for storing the claim document scanner by the claim data sharing module includes:
establishing and storing an claim document template, associating a template number for the claim document template, wherein the claim document template is a scanning image of a blank claim document;
calculating pixel difference values of each pixel position of the claim document scanning piece and the corresponding claim document template, wherein the pixel difference values form a difference image;
and storing the template numbers corresponding to the difference images in an associated mode to a network storage device.
Preferably, the claim document template and the claim document scanner are gray level images.
The utility model provides an insurance claim data sharing system based on blockchain, is used for carrying out the insurance claim data sharing method based on blockchain as previously described, and includes sharing platform, sharing platform receives insurance company's registration request, and establishes the claim data sharing module, the claim data sharing module disposes to the insurance company who submits the registration request, when there is new claim information, the claim data sharing module receives the claim information of insured person, encrypts the claim information, draws the hash value of insured person's sign, and the claim data sharing module will encrypt the claim information of claim information correlation the hash value of insured person as shared information, will share information upload the blockchain and store, the claim data sharing module inquires the blockchain, finds all the shared information that matches with the hash value of insured person's sign, and the claim data sharing module decrypts the shared information, obtains the claim information of all insured person, demonstrates to the insured person's business personnel.
The invention has the following substantial effects: the safe sharing of the claim data among the insurance companies is realized by arranging the claim data sharing modules among the insurance companies, and the sharing of the claim information among the insurance companies by the insured person is realized under the condition of ensuring the safety and confidentiality of the claim information, so that the insurance companies can find out the cheating and repeated claim settlement conditions, and the claim settlement business order is maintained; the claim document is encrypted by using a time-limited encryption algorithm and then shared among insurance companies, so that the related evidence can be obtained quickly under the condition that an insured person is found to repeatedly settle the claim, and timely stopping payment, dressing or litigation initiation is facilitated; by establishing the claim document template and storing the claim document scanning part by using the pixel difference value, the storage occupied volume of the claim document can be reduced, and the occupation of network resources during the transmission of the claim document is reduced.
Drawings
FIG. 1 is a flow chart of an insurance claim data sharing method according to an embodiment of the invention.
Fig. 2 is a flowchart of a method for sharing claim revocation information according to an embodiment of the present invention.
FIG. 3 is a flow chart of a method for encrypting claim document scanner according to an embodiment of the present invention.
FIG. 4 is a flow chart of a method for decrypting a storage address of a claim document scanner according to an embodiment of the present invention.
FIG. 5 is a flow chart of a method for encrypting a claim document scan storage address according to an embodiment of the present invention.
FIG. 6 is a flowchart of a method for decrypting memory addresses using a polynomial function according to an embodiment of the present invention.
FIG. 7 is a schematic flow chart of a method for storing claim documents in a claim data sharing module according to an embodiment of the present invention.
FIG. 8 is a schematic diagram of an embodiment of an insurance claim data sharing system.
Wherein: 10. blockchain 21, claim data sharing module 22, insurance company 30, sharing platform.
Detailed Description
The following description of the embodiments of the present invention will be made with reference to the accompanying drawings.
Before introducing the technical scheme of the embodiment, an application scenario of the embodiment is introduced.
The insurance claims are the actions of the insurance company 22 according to contract regulation to fulfill reimbursement or pay responsibility when the insurance label generates insurance accident and causes the property of the insured person to be lost or the life of the person to be damaged or other insurance accidents agreed by the insurance policy are at risk and need to pay insurance money, and are the work of directly embodying the insurance function and fulfilling the insurance responsibility. When an insurer is requested to reimburse or pay an insurance fee according to an insurance contract after an insured event occurs, the insurer, insured person or beneficiary should provide the insurer with proof and information about the nature, cause, degree of loss, etc. of the insured event that they can provide. The insurer 22 compensates for the losses of the insured life based on the amount of the insured life. The insurance compensation is of a compensating nature, and only compensates for the part actually lost, at most, the value of the damaged property, and never exceeds the value of the damaged property.
After the insured life has an insured event and claims, the insurer 22 should notify the other party in time if it deems that the pertinent certification and material should be reimbursed. After proving that the materials are complete, the insurance company 22 should make verification in time, and the situation is complex, and verification should be made within 30 days. For claims that should be paid, the insurer 22 pays for the 10 days after the settlement agreement is reached. For claims that should not be made, a notice of refusal of claims should be issued within 3 days from the date of making the approval and the reason should be explained.
At present, the problem of data island exists between insurance companies 22, and whether the client cheats or repeats the action of claim settlement can not be known in the claim settlement process and after the claim settlement process of each insurance company 22, so that the cheating protection risk is uncontrollable. Serious risks to the claims service of the insurance company 22. Fraud and repeated claims also undermine the normal order of the market, affecting the fairness of the business. In order to promote share of insurance information and solve the problem of repeated claims under the insurance line, the embodiment provides a block chain-based insurance claim data sharing method, please refer to fig. 1, which includes the following steps:
step A01) establishing claim data sharing modules 21 and respectively disposing the claim data sharing modules in a plurality of insurance companies 22;
step A02) when new claim information exists, the claim data sharing module 21 receives the claim information of the insured, encrypts the claim information and extracts the hash value of the insured mark;
step A03), the encrypted claim information is related to the hash value of the insured as shared information, and the shared information is uploaded to the block chain 10 for storage;
step A04) the claim data sharing module 21 queries the blockchain 10 to find all sharing information matching the hash value identified by the insured;
step a 05) the claim data sharing module 21 decrypts the shared information to obtain claim information of all insured persons, and displays the claim information to claim crews of the insurer 22.
By disposing the claim data sharing module 21 among the plurality of insurance companies 22, the safe sharing of claim data among the insurance companies 22 is realized, and under the condition of ensuring the safety and confidentiality of claim information, the sharing of claim information among the insurance companies 22 by insured persons is realized, so that the insurance companies 22 can find out cheating and repeated claim settlement conditions, and the claim settlement business order is maintained. The insurance company 22 uploads the claim data of the subject to the blockchain 10 for storage through the claim data sharing module 21. During the claim processing process, the claim data of other insurers 22 for the same insured person is obtained by querying the blockchain 10. If there is a record of the same claim, the same claim event, then it indicates that the insured life has repeated claim settlement request actions, at which time the claim settlement should be aborted and verified with other insurers 22 and insureds who have related the claim settlement, and if the claim settlement is confirmed, the claim settlement is terminated. If the repeated claim settlement behavior does not exist after verification, the claim settlement is continued. By the technical scheme provided by the embodiment, a safe claim settlement data sharing way can be established between the insurance companies 22, so that data support is provided for realizing the first time of finding the risk of repeated claim settlement in the claim settlement processing process.
In this embodiment, the claim information of the insured includes the hash value of the insured name, the id code, the claim matters and the claim time. The identification code is a hash value of the identification card number, and the insured person can be identified among the insurers 22 having the same insured policy through the name hash value and the identification code of the insured person, and meanwhile, other insurers 22 can not acquire any effective personal information, and sharing of claim information among different insurers 22 is realized on the premise of guaranteeing the information security of the insured person.
A hash value is an output that transforms an input of arbitrary length into a fixed length by a hashing algorithm. When the same hash algorithm is employed, the same input has the same output, and the hash value is necessarily different for different inputs. Meanwhile, reverse input deduction through the hash value is impossible to complete, so that the safety of input information can be effectively protected. Common hashing algorithms include MD5, SHA256, SM3, etc. SHA256 was used if the hash value was 1D841BC0EE98309CB7916670B7F0FDEF5F4C35150711a41405EF3633B56322CF with name Zhang Sande. If there are three insurance policies for both insurance companies 22, the two insurance companies 22 extract hash values respectively, and then the insured person can learn that the two insurance companies 22 have insurance policies and claim records through hash value comparison. The insurer 22 without the policy cannot obtain the name of the insured through the hash value of the name in the opposite direction, so that the sharing of the claim data of the same insured is realized among different insurers 22 on the premise of protecting the name information of the insured. The main purpose of the claim data sharing is to realize the sharing of claim records, and the repeated claim settlement situation can be found through the sharing of the claim records.
On the other hand, the method for sharing the insurance claim data in this embodiment further includes a method for sharing claim revocation information, referring to fig. 2, the method for sharing claim revocation information includes the following steps:
step B01) when the claim information for which the claim has been found is revoked, the claim data sharing module 21 receives the revoked claim information;
step B02) extracting the hash value of the revoked claim information, extracting the hash value of the insured person identifier, associating the hash value of the revoked claim information and the hash value of the insured person identifier with a preset revocation identifier, and then uploading the revocation information to the blockchain 10 for storage;
step B03) the claim data sharing module 21 queries the blockchain 10 to find revocation information that all matches the hash value of the insured life, finds claim information that matches the revocation information, and marks the claim information as revoked.
By sharing the claim revocation information, a related claim revocation information can be added to the claim records that have been uploaded to the blockchain 10, so that other insurers 22 can know that the claim records have been revoked, helping other insurers 22 to correctly determine whether the insured life has repeated claim settlement.
The claim data sharing module 21 stores the claim document scanner in an encrypted form to the network storage device, and the shared information further includes the claim document scanner, the decryption key, and the hash value of the claim document scanner. When an abnormal situation such as repeated claims is found, the verification needs to be performed with other related insurance companies 22 and insured persons, and if the verification is performed with other related insurance companies 22 at all times, the workload of the insurance companies 22 is increased, and the verification efficiency is lowered. For this purpose, the present embodiment provides a scheme of incorporating the claim document scanner into shared information. When the insurance company 22 finds that there is an abnormality in the claims, such as a risk of repeated claims, it can download the claims directly to the claims document through the shared information. The downloaded claim settlement bill is used for verification with an insured person, so that the workload of the insurance company 22 can be obviously reduced, the efficiency of claim settlement risk verification is improved, the abnormal risk of claim settlement is avoided more effectively, and the normal operation of claim settlement business is ensured.
The claim data sharing module 21 encrypts the claim document scanner using a time-limited encryption algorithm, and the claim document scanner encrypted using the time-limited encryption algorithm incorporates the shared information. By sharing the claim documents between the insurers 22 after encrypting them using a time-limited encryption algorithm, it is possible to achieve rapid acquisition of relevant evidence in the event that the insured is found to repeat the claim, which is helpful for timely stopping payment, pursuing responsibility, or initiating litigation.
On the other hand, in this embodiment, a limited time key distribution smart contract is issued on the blockchain 10, referring to fig. 3, the method for encrypting the claim document scanner using the time-limited encryption algorithm includes:
step C01) the time-limited key distribution smart contract generates a two-dimensional point coordinate set G0, g0= { (x 0j, y0 j) }, j e [1, m0], where m0 is the number of two-dimensional points contained in the two-dimensional point coordinate set G0;
step C02) constructing a variable i, enabling an initial value of the i to be 1, distributing intelligent contracts by a time-limited secret key, and executing the following steps in a period T:
step C03) generating an integer Ni, ni > mk, k=i-1 by the time-limited key distribution smart contract at the beginning of the period Ti;
step C04) generating Ni-mk two-dimensional point coordinates, and establishing a polynomial function y=fi (x) so that the polynomial function y=fi (x) passes through the two-dimensional point coordinate set Gk and the generated Ni-mk two-dimensional point coordinates;
step C05) using the polynomial function y=fi (x) to encrypt the claim document scanner, wherein the polynomial function y=fi (x) is used as the encryption key;
step C06) generating integers mi, mi > Ni, generating mi-ni+mk two-dimensional point coordinates falling on the polynomial function y=fi (x), forming a two-dimensional point coordinate set Gi, gi= { (xij, yij) }, j e [1, mi ];
step C07) time-limited key distribution smart contracts include key hint columns in which Nk and Ni are displayed.
For example, in step C01), a two-dimensional point coordinate group G0 is generated, 3 two-dimensional point coordinates are included in G0, which are { (2, 10), (3, 15), (6,45) }, respectively.
After entering the first cycle, in step C03) the integer n1=5 is generated, and then in step C04) 2 two-dimensional point coordinates are generated, (4, 18), (9,85), respectively. Further, a polynomial function y=f1 (x) = -0.2448412698412677 x≡4+4.797610104619004 x≡3-30.71230158730129 x≡2+83.32142857142777 x-68.25714285714214 is generated. So that the polynomial function y=f1 (x) passes through the above-mentioned 5 two-dimensional points.
Then in step C05), the claim document scanner is encrypted using a polynomial function y=f1 (x). In step C05), m1=5 is generated, and m1—n1+m0=3 two-dimensional point coordinates (10, 43), (12, -278), (15, -1932) are again generated. Specifically, since there is a certain error in the polynomial fitting, in this embodiment, the ordinate is within ±1, and all of them are considered to fall on the polynomial function. At this time, the two-dimensional point coordinate set g1= { (4, 18), (9,85), (10, 43), (12, -278), (15, -1932) }. N1=5 is displayed in the key hint field. In the next cycle, N2>8, such as n2=10, is generated, and after regenerating two-five two-dimensional point coordinates, a polynomial function, i.e., y=f2 (x), is regenerated. And n1=5 and n2=10 are displayed in the key hint column. Assuming that n3=14 is generated in the third period, n2=10 and n3=14 are displayed in the key hint column. At this time, due to the lack of N1, the possible number of generator polynomial functions is the power of two-dimensional point coordinates using a part of a limited number of two-dimensional points. When more two-dimensional points are included in a two-dimensional point coordinate set, an exhaustive polynomial function would be a task that cannot be completed within an acceptable time. The claim document scanner encrypted by the polynomial function y=f1 (x) cannot be correctly decrypted, so that the time-limited encryption of the claim document scanner is realized.
Referring to fig. 4, a method for decrypting an claim document scanner using a time-limited encryption algorithm includes:
step D01), judging whether the encryption time is more than two periods T from the current time according to the encryption time and the current time of the document scanning piece of the claim, if so, sending out overtime alarm and ending decryption;
step D02) if the period T is not exceeded but the period T is not exceeded, reading Nk, a two-dimensional point coordinate set Gh and a two-dimensional point coordinate set Gk, wherein h=k-1, arbitrarily selecting Nk-mh two-dimensional point coordinates from the two-dimensional point coordinate set Gk, establishing a restoration polynomial function y=fr (x), enabling the restoration polynomial function y=fr (x) to pass through the two-dimensional point coordinate set Gh and the selected Nk-mh two-dimensional point coordinates, and decrypting by using the restoration polynomial function y=fr (x) to obtain the claim document scanning piece;
step D03) if the period T is not exceeded, reading Ni, the two-dimensional point coordinate set Gk and the two-dimensional point coordinate set Gi, arbitrarily selecting Ni-mk two-dimensional point coordinates from the two-dimensional point coordinate set Gi, creating a restoration polynomial function y=fr (x), enabling the restoration polynomial function y=fr (x) to pass through the two-dimensional point coordinate set Gk and the selected Ni-mk two-dimensional point coordinates, and decrypting by using the restoration polynomial function y=fr (x) to obtain the claim document scanning piece.
And if the encrypted claim document scanning piece in the first period needs to be decrypted, calculating the difference between the encryption time and the current time of the claim document scanning piece.
If the two-dimensional point coordinates are not more than two periods T but more than one period T, n1=5 is read from the key hint column, three two-dimensional point coordinates { (2, 10), (3, 15), (6,45) } are obtained by reading the two-dimensional point coordinate group G0, two-dimensional point coordinates such as (10, 43) and (12, -278) are arbitrarily read from the two-dimensional point coordinate group G1, and the recovered polynomial function y=f1' (x) can be correctly obtained by using the five two-dimensional point coordinates read. And (3) decrypting by using the restored polynomial function y=f1' (x) to obtain the claim document scanner.
If the period T is not more than one period, n1=5 is directly read, two-dimensional point coordinates are also arbitrarily read from the two-dimensional point coordinate set G1, and the two-dimensional point coordinates and the two-dimensional point coordinate set G0 selected by the polynomial function are established, so that the recovered polynomial function y=f1' (x) can be obtained.
The degree of the highest order term of the polynomial function established by the n two-dimensional point coordinates is n-1, and the polynomial function has n coefficients. The n unknown numbers and the n two-dimensional point coordinates can establish n-element one-time equations, and the n coefficients can be solved immediately. Therefore, in the present embodiment, the calculation is very fast when generating the polynomial function and restoring the polynomial function.
Referring to fig. 5, a method for encrypting a claim document scanner using a polynomial function y=fi (x) includes:
e01), converting the claim document scanning piece into binary data, and cutting the binary data into a plurality of binary numbers B with preset lengths;
step E02) establishes a value group (x, B) which meets the requirement of B= |fi (x) |+b, and the value group (x, B) corresponding to all binary numbers B is used as ciphertext of the claim document scanning piece. A portion of the binary data is: 01000101 01110101 01010111 01101011, cut into two integers according to a length of 2 bytes, d1= 17781 and d2= 22379, respectively. The polynomial function used for the encryption is y=f1 (x) = -0.2448412698412677 x≡4+4.797610104619004 x≡3-30.71230158730129 x≡2+83.32142857142777 x-68.25714285714214. D1 can be expressed as d1= 17781 = |f1 (22) | -1589, i.e. at this point x=22, b= -1589. The ciphertext of the claim document scanning piece is not unique by using the polynomial function y=fi (x), so that the encryption security of the claim document scanning piece is further improved. For example, D1 may also be represented as d1= |f1 (20) |+6301, i.e., where x=20, b=6301.
Referring to fig. 6, a method for decrypting an claim document scanner using a polynomial function y=fr (x) includes:
step F01), substituting the value group (x, B) of the ciphertext into B= |fr (x) |+b in sequence to obtain all binary numbers B;
and F02) splicing all binary numbers B, and converting the spliced binary numbers B into character strings to obtain the claim document scanning piece.
After the recovering polynomial function is obtained, substituting the value group (x, B) into the recovering polynomial function to obtain binary data B, and splicing the binary data B in sequence to obtain the original text.
In another aspect, the present embodiment provides a specific method for storing an claim document scanner in the claim data sharing module 21, referring to fig. 7, including:
step G01), establishing and storing an claim document template, associating a template number for the claim document template, and scanning images of blank claim documents for the claim document template;
step G02) calculating pixel difference values of each pixel position of the claim document scanning piece and the corresponding claim document template, wherein the pixel difference values form a difference image;
step G03) storing the template number corresponding to the difference image association into a network storage device.
The images of most areas in the claim bill are the same, and only the specific information and the contents of the areas where the bill numbers are located are different, and the pixel difference value is used for storing the claim bill scanning piece by establishing the claim bill template, so that the occupied volume of the claim bill storage can be reduced, and the occupation of network resources during the claim bill transmission is reduced.
On the other hand, the embodiment also provides a scheme for storing pixel difference values in variable lengths. The method specifically comprises the following steps: calculating a pixel difference value of each pixel position of the claim document scanning piece and the corresponding claim document template, presetting a first byte length and a second byte length, wherein the maximum value represented by the first byte length is M1, the minimum value represented by the second byte length is M2, the pixel difference value is smaller than M1 and represented by the first byte length, the pixel difference value is not smaller than M1 and represented by the second byte length, if the byte length of the adjacent pixel changes, M1 or M2 is inserted between the two pixels, and the inserted value occupies the same byte length as the occupied byte length of the previous pixel of the adjacent pixel. When the claim document scanner uses RGB to represent color. Each pixel has three channels, each occupying 1 byte, i.e. 8 bits. The range of values for each channel is [0,255]. When representing pixel differences, 5 bit representations are used, with the first bit representing the sign, i.e., increasing or decreasing the difference in the subsequent 4-bit representation over the corresponding channel value for the corresponding pixel location on the claim document template. The range represented by 4 bits is [0,15]. The value of M1 is 15 and the value of M2 is 0. For pixel points that exceed the channel value of the 5-bit energy representation range, the difference representation is no longer used, but the value of each channel is directly represented using 1 byte.
The pixel values for two pixel locations of the claim document template are (245,245,245) and (30,30,32), the pixel values for the same location claim document scanner are (240,235,239) and (242,240,242), and the corresponding pixel differences are (-5, -10, -6), and (212,210,210), respectively.
The binary representation of the adjacent two pixel values of the claim document scanner is: (10101,11010,10110), (11010100,11010010,11010010), …, (01000,00100,01001). M1 and M2 are added as intervals: (10101,11010,10110), M1: (01111,01111,01111), (11010100,11010010,11010010), …, M2: (00000000,00000000,00000000), (01000,00100,01001). The binary representation of the final several individual pixels is: 101011101010110011110111101111110101001101001011010010 … 000000000000000000000000010000010001001.
When the plurality of pixels are read, the pixel difference mode is set, namely 5x3 bits are read at a time. Then dividing into 3 binary numbers with 5 bits, which are respectively the difference value of the pixel values of the same pixel position of the first pixel relative claim document template. The first bit 1 of the 5 bits is negative, and the first bit is 0 and positive. Obtaining (-5, -10, -6), in combination with the claim document template, is capable of restoring the first pixel. The 5x3 bits are read back again and the pixel difference values for the three channels are found to all be positive 15, the value of M1, thus discarding the 5x3 bits. Then 8x3 bits are read down, i.e. the values of the 3 channels from which the next pixel is obtained are read directly, and the pixel is restored directly. Reading down continues until some 8x3 bits are read, the read values are all 0, and the 8x3 bits are discarded. And then switches to a mode of reading 5x3 bits down to continue reading. Since (0, 0) in RGB represents pure black, and the scan of the claim document is affected by the print saturation and the illumination, the black part will appear as dark gray close to black in the resulting scan of the claim document, and almost impossible to be pure black. M2 does not lead to distortion of the claim document scanner. Even if the claim document scanner has a solid black color, the claim document receiving module 10 replaces the solid black pixels with (1, 1) in batch.
On the other hand, this embodiment also provides an insurance claim data sharing system based on the blockchain 10, please refer to fig. 8, which includes a sharing platform 30, the sharing platform 30 receives a registration request of the insurance company 22 and establishes a claim data sharing module 21, the claim data sharing module 21 is deployed to the insurance company 22 submitting the registration request, when new claim information exists, the claim data sharing module 21 receives claim information of the insured person, encrypts the claim information, extracts hash values identified by the insured person, the claim data sharing module 21 associates the encrypted claim information with the hash values of the insured person as shared information, uploads the shared information to the blockchain 10 for storage, the claim data sharing module 21 queries the blockchain 10, finds all shared information matched with the hash values identified by the insured person, and the claim data sharing module 21 decrypts the shared information to obtain claim information of all the insured person and displays the claim information to the insurance company 22.
The above-described embodiment is only a preferred embodiment of the present invention, and is not limited in any way, and other variations and modifications may be made without departing from the technical aspects set forth in the claims.

Claims (10)

1. A block chain-based insurance claim data sharing method is characterized in that,
the method comprises the following steps:
establishing claim data sharing modules and respectively disposing the claim data sharing modules in a plurality of insurance companies;
when new claim information exists, the claim data sharing module receives the claim information of the insured, encrypts the claim information and extracts the hash value of the insured mark;
the encrypted claim information is related to the hash value of the insured person as shared information, and the shared information is uploaded to a blockchain for storage;
the claim data sharing module queries the blockchain to find all sharing information matched with the hash value identified by the insured;
and the claim data sharing module decrypts the sharing information to obtain the claim information of all insured persons and displays the claim information to claim service personnel of the insurance company.
2. The method of claim 1, wherein,
the insurance claim data sharing method further comprises a claim revocation information sharing method, and the claim revocation information sharing method comprises the following steps:
when the claim information of the existing claim is revoked, the claim data sharing module receives the revoked claim information;
extracting the hash value of the revoked claim information, extracting the hash value of the insured person identifier, and uploading the hash value of the revoked claim information and the hash value of the insured person identifier to be stored in a blockchain as revocation information after associating a preset revocation identifier with the hash value of the revoked claim information and the hash value of the insured person identifier;
and the claim data sharing module queries a blockchain, finds out all the revocation information matched with the hash value of the insured mark, finds out the claim information matched with the revocation information, and marks the claim information as revoked.
3. A method for sharing data of claim 1 or 2, wherein,
the claim data sharing module encrypts and stores the claim document scanning piece to the network storage device, and the sharing information further comprises the claim document scanning piece, a decryption key and a hash value of the claim document scanning piece.
4. The method for sharing claim 3, wherein,
and the claim data sharing module encrypts the claim document scanning piece by using a time-limited encryption algorithm, and the claim document scanning piece encrypted by using the time-limited encryption algorithm is incorporated into the sharing information.
5. The method of claim 4, wherein,
a time-limited key distribution smart contract is issued on the blockchain,
the method for encrypting the claim document scanner by using the time-limited encryption algorithm comprises the following steps:
the time-limited secret key distribution intelligent contract generates a two-dimensional point coordinate set G0, G0 = { (x 0j, y0 j) }, j epsilon [1, m0], wherein m0 is the number of two-dimensional points contained in the two-dimensional point coordinate set G0;
constructing a variable i, enabling an initial value of the i to be 1, and enabling the time-limited secret key distribution intelligent contract to execute the following steps in a period T:
at the beginning of period Ti, the time-limited key distribution intelligent contract generates an integer Ni, wherein Ni is greater than mk, and k=i-1;
generating Ni-mk two-dimensional point coordinates, and establishing a polynomial function y=fi (x) so that the polynomial function y=fi (x) passes through the two-dimensional point coordinate set Gk and the generated Ni-mk two-dimensional point coordinates;
the polynomial function y=fi (x) is an encryption and decryption secret key, and the claim document scanning piece is encrypted by using the polynomial function y=fi (x);
generating an integer mi, mi > Ni, generating mi-Ni+mk two-dimensional point coordinates falling on a polynomial function y=fi (x), and forming a two-dimensional point coordinate set Gi, gi= { (xij, yij) }, j epsilon [1, mi ];
the time-limited key distribution intelligent contract comprises a key prompt bar, and Nk and Ni are displayed in the key prompt bar.
6. The method of claim 5, wherein,
the method for decrypting the claim document scanner by using the time-limited encryption algorithm comprises the following steps:
judging whether the encryption time is more than two periods T from the current time according to the encryption time and the current time of the document scanning piece of the claim, if so, sending out a timeout alarm and ending decryption; if the period T is not more than two periods but is more than one period T, reading Nk, a two-dimensional point coordinate set Gh and a two-dimensional point coordinate set Gk, wherein h=k-1, arbitrarily selecting Nk-mh two-dimensional point coordinates from the two-dimensional point coordinate set Gk, establishing a restoration polynomial function y=fr (x), enabling the restoration polynomial function y=fr (x) to pass through the two-dimensional point coordinate set Gh and the selected Nk-mh two-dimensional point coordinates, and decrypting by using the restoration polynomial function y=fr (x) to obtain the claim document scanning piece;
if the period T is not exceeded, reading Ni, a two-dimensional point coordinate set Gk and a two-dimensional point coordinate set Gi, arbitrarily selecting Ni-mk two-dimensional point coordinates from the two-dimensional point coordinate set Gi, establishing a restoration polynomial function y=fr (x), enabling the restoration polynomial function y=fr (x) to pass through the two-dimensional point coordinate set Gk and the selected Ni-mk two-dimensional point coordinates, and decrypting by using the restoration polynomial function y=fr (x) to obtain the claim document scanning piece.
7. The method of claim 6, wherein,
the method for encrypting the claim document scanner by using the polynomial function y=fi (x) comprises the following steps:
converting the claim document scanning piece into binary data, and cutting off the binary data into a plurality of binary numbers B with preset lengths;
establishing a value group (x, B) which meets the requirement of B= |fi (x) |+b, and taking the value group (x, B) corresponding to all binary numbers B as ciphertext of the claim document scanning piece;
the method for decrypting the claim document scanner using the polynomial function y=fr (x) includes:
substituting the value group (x, B) of the ciphertext into B= |fr (x) |+b in sequence to obtain all binary numbers B;
and (3) splicing all the binary numbers B, and converting the spliced binary numbers B into character strings to obtain the claim document scanning piece.
8. The method for sharing claim 3, wherein,
the method for storing the claim document scanning piece by the claim data sharing module comprises the following steps:
establishing and storing an claim document template, associating a template number for the claim document template, wherein the claim document template is a scanning image of a blank claim document;
calculating pixel difference values of each pixel position of the claim document scanning piece and the corresponding claim document template, wherein the pixel difference values form a difference image;
and storing the template numbers corresponding to the difference images in an associated mode to a network storage device.
9. The method of claim 8, wherein,
the claim document template and the claim document scanning piece are gray level images.
10. A block chain-based insurance claim data sharing system is characterized in that,
the system comprises a sharing platform, wherein the sharing platform receives a registration request of an insurance company and establishes a claim data sharing module, the claim data sharing module is deployed to the insurance company submitting the registration request, when new claim information exists, the claim data sharing module receives claim information of an insured person, encrypts the claim information, extracts a hash value of the insured person identification, the claim data sharing module associates the encrypted claim information with the hash value of the insured person as shared information, uploads the shared information to a block chain for storage, the claim data sharing module queries the block chain, finds shared information matched with the hash value of the insured person identification, decrypts the shared information, obtains claim information of all the insured person, and displays the claim information to a claim service member of the insurance company.
CN202310679902.1A 2023-06-09 2023-06-09 Insurance claim data sharing method and system based on blockchain Pending CN116645224A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310679902.1A CN116645224A (en) 2023-06-09 2023-06-09 Insurance claim data sharing method and system based on blockchain

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310679902.1A CN116645224A (en) 2023-06-09 2023-06-09 Insurance claim data sharing method and system based on blockchain

Publications (1)

Publication Number Publication Date
CN116645224A true CN116645224A (en) 2023-08-25

Family

ID=87618709

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310679902.1A Pending CN116645224A (en) 2023-06-09 2023-06-09 Insurance claim data sharing method and system based on blockchain

Country Status (1)

Country Link
CN (1) CN116645224A (en)

Similar Documents

Publication Publication Date Title
AU707639B2 (en) Root key compromise recovery
EP2301185B1 (en) Format-preserving cryptographic systems
US20150356306A1 (en) Systems and methods for qr code validation
US20150358164A1 (en) Systems and methods for qr code validation
CN112804218A (en) Data processing method, device and equipment based on block chain and storage medium
CN1382332A (en) Method of data protection
JP2002514799A (en) Electronic transmission, storage and retrieval system and method for authenticated documents
US20120210406A1 (en) Forming credentials
CN109190399B (en) Anti-counterfeiting method, system and storage medium based on block chain
KR20130129478A (en) Method for securely drawing up a virtual multiparty contract capable of being physically represented
CN110601848A (en) Appointment information processing method, device and system based on block chain and electronic equipment
TWI724667B (en) System of identity management and authorization and method thereof
CN102231181B (en) Computer system used for file encryption and file encryption method
CN114757789A (en) Insurance claim settlement system based on block chain
CN113904832A (en) Data encryption method, device, equipment and storage medium
CN116645224A (en) Insurance claim data sharing method and system based on blockchain
CN114792270B (en) Loan contract online signing system based on block chain
CN111861485A (en) Block chain-based digital currency control method and equipment
CN116756750A (en) Medical sensitive data acquisition desensitization method
CN115456804B (en) Repeated claim settlement early warning method based on block chain
KR100932545B1 (en) Electronic insurance system for insurance subscriptions using certified electronic document archives and certified digital signatures
CN114401132A (en) Data encryption method, device, equipment and storage medium
CN115774885B (en) Account checking method and device based on homomorphic encryption, electronic equipment and storage medium
CN110912802B (en) E-mail data processing method and device
CN111046406B (en) Storage system and method for document structure

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination