CN115456804A

CN115456804A - Repeated claim settlement early warning method based on block chain

Info

Publication number: CN115456804A
Application number: CN202211395046.9A
Authority: CN
Inventors: 高航; 张金琳
Original assignee: Zhejiang Shuqin Technology Co Ltd
Current assignee: Zhejiang Shuqin Technology Co Ltd
Priority date: 2022-11-09
Filing date: 2022-11-09
Publication date: 2022-12-09
Anticipated expiration: 2042-11-09
Also published as: CN115456804B

Abstract

The invention relates to the technical field of information, in particular to a repeated claim settlement early warning method based on a block chain, which comprises the following steps: the claim settlement service module adds entries in a local database to store claim payment information; receiving and storing the paid bill, and increasing the number of the claims by 1; extracting the hash values of the paid bills, the insured identification and the insurance type, and uploading the associated timestamps as the claim settlement records to a block chain; inquiring the block chain, obtaining the number of the corresponding claims records, and recording as the total claims times; updating the local database; and if the number of the driver claims, the number of the driver claims or the total number of the driver claims exceeds the corresponding early warning threshold, the repeated claims early warning is sent out. The substantial effects of the invention are as follows: under the condition that insurance service information is kept hidden, the claim settlement service data is shared, so that a claim settlement service module can effectively warn the condition of repeated claim settlement, and further the repeated claim settlement is avoided.

Description

Repeated claim settlement early warning method based on block chain

Technical Field

The invention relates to the technical field of information, in particular to a repeated claim settlement early warning method based on a block chain.

Background

At present, data islanding exists between insurance companies, and each insurance company cannot know whether client cheating insurance fraud or repeated claim settlement exists in case claim settlement flow or after claim settlement. Resulting in uncontrollable risks of fraud. The cheat insurance and the insurance cheat behavior not only bring the equity loss to the insurance company and destroy the market fairness, but also bring a series of social problems caused by cheat insurance and seriously affect the peace and peace order of the society. In order to solve the problems of cheating insurance and repeated claim settlement, information needs to be intercommunicated and shared among insurance companies. The claim settlement information not only relates to the business secrets of the insurance company, but also relates to the related information of the insured, and the sharing of the claim settlement information has problems on data security and credibility.

The blockchain is a distributed database which is maintained collectively, cannot be tampered, is transparent and can be traced, data stored on the blockchain has natural trust, and the blockchain becomes an important way for data storage and sharing in various industries. But the lack of concealment of data on the blockchain results from the transparency of the data on the blockchain.

Therefore, it is necessary to research a technology capable of ensuring the privacy and security of claim settlement data and realizing the sharing of claim settlement service data among insurance companies.

For example, chinese patent CN111754354A, published 2020, 10, 9 discloses an insurance claim anti-fraud case-off-package case identification and scoring system based on blockchain technology, which relates to the technical field of blockchain, in particular to an insurance claim anti-fraud case-off-package case identification and scoring system based on blockchain technology, comprising: s1, an insurance information collection module comprises an insurance information input port, an insurance information encryption unit, an insurance information auditing unit and an insurance information big database; s2, an accident investigation module; s3, an accident information investigation module; s4, a grading report generating module; and S5, a review module. According to the technical scheme, privacy of both parties in an accident is protected firstly by using a block chain technology, and the conditions that both parties in the accident do not go out for insurance and fall packages are avoided due to pertinence of the block chain, so that lawless persons can be prevented from carrying out claims in a fraud and fall package mode when the insurance claims are not satisfied, and losses of insurance companies are saved. But the technical scheme can not realize the problem of repeated claim settlement of different insurance companies under the real claim settlement condition.

Disclosure of Invention

The technical problem to be solved by the invention is as follows: the technical problem of effectively avoiding the repeated claim settlement condition of a plurality of insurance companies is lacked at present. The method realizes the sharing of claim settlement service information by means of the block chain, provides the insurance company for repeated claim settlement early warning, and can effectively solve the problem of repeated claim settlement.

In order to solve the technical problems, the technical scheme adopted by the invention is as follows: the repeated claim settlement early warning method based on the block chain comprises the following steps:

an insurance company deploys a claim settlement service module, adds entries in a local database to store claim payment information of an insured, wherein the claim payment information comprises the number of the driver's claims and the number of the other drivers' claims;

the claim settlement business module receives and stores the claim paid bills, identifies the bills to obtain the identification and the insurance type of the insured, and increases the number of times of the claim settlement information by 1;

respectively extracting the hash values of the paid bills, the insured identification and the insurance type, and uploading the hash values serving as the claim settlement records to a block chain for storage after associating the time stamps;

the claim settlement service module inquires the block chain, obtains the number of claim settlement records which are recorded on the block chain and are consistent with the hash value of the identification of the current insured person and the insurance type, and records the number of the claim settlement records as the total number of times of claim settlement;

updating a local database, and updating the number of other claims of the claim information into a difference value between the total number of claims and the number of the claims;

and if the number of the driver claims, the number of the driver claims or the total number of the driver claims exceeds the corresponding early warning threshold, the repeated claims early warning is sent out.

Preferably, the claim service module queries the block chain, obtains a claim record which is recorded on the block chain and conforms to the hash value and the insurance type of the identifier of the insured at this time, downloads the claim record and stores the claim record in the local database after associating the corresponding block height, and after receiving a new paid bill of the insured, queries the block chain from the highest block height recorded in the local database.

Preferably, the method further comprises a method for deleting the record of the driver's claim, when a paid ticket is cancelled, the claim service module adds an entry to the local database to store the cancellation information after receiving the cancellation information, wherein the cancellation information comprises the cancelled paid ticket and an identifier of an insured, and updates the number of times of the driver's claim and the number of times of the total claim so that the number of times of the driver's claim and the number of times of the total claim are respectively reduced by 1.

Preferably, the method of storing a paid ticket comprises:

establishing and storing a bill template, and associating the serial number of the template with the bill template, wherein the bill template is a scanned image of a blank paid bill;

calculating pixel difference values of the scanned image of the paid bill and the bill template at each pixel position, and recording a picture formed by the pixel difference values as a difference image;

and storing the difference image in association with a template number.

Preferably, the pixel difference value is represented using a preset byte length;

establishing an exception set, and recording pixel positions and pixel values of pixel difference values exceeding a preset byte length representation range;

and storing the difference image, the exception set and the template number in an associated manner.

Preferably, issuing evidence cooperative intelligent contracts on the block chains, wherein the evidence cooperative intelligent contracts distribute encryption keys for the claim settlement service modules of each insurance company;

the claim settlement service module encrypts the scanned image of the claim paid bill and records the image as a bill encrypted image;

packaging the encrypted bill image, the paid bill hash value, the insured identification hash value and the insurance type hash value as a claim settlement record, and uploading the claim settlement record to a block chain for storage;

the evidence collaborative intelligent contract receives an evidence collaborative request sent by an insurance company, wherein the evidence collaborative request comprises a paid bill hash value, an insured identity hash value, an insurance type hash value, a receiving secret key and a receiving address;

the evidence is cooperated with the intelligent contract query block chain, if a claim record with a paid bill hash value, an insured identification hash value and an insurance type hash value which all accord with each other is found, a confirmation request is sent to an insurance company which uploads the claim record, otherwise, if the corresponding claim record cannot be found, no operation is carried out;

after the evidence collaborative intelligent contract receives confirmation information fed back by the insurance company uploading the claim settlement record, decrypting the corresponding bill encryption image to obtain a scanning image of the recovered claim paid bill;

and encrypting the scanned image by using the receiving secret key and then sending the encrypted scanned image to the receiving address.

Preferably, the method of distributing the encryption key includes:

the evidence collaborates with the intelligent contract to generate a plurality of pairs of integers (di, ei), i belongs to [1, n ], n is the number of the claims service modules, and di and ei meet di × ei = ki × 256+1, wherein ki is a positive integer;

distributing di of n integer pairs (di, ei) to n claim settlement service modules as encryption keys, and taking corresponding ei as decryption keys;

the method for encrypting the scanned image of the paid ticket comprises the following steps:

converting the scanned image into a gray-scale image, wherein the value range of each pixel value m of the gray-scale image is [0,255];

c = m × di mod 256 is calculated as an encrypted value of each pixel value, and all the encrypted values form a bill encrypted image;

the method for decrypting the encrypted image of the bill by the evidence in cooperation with the intelligent contract comprises the following steps:

calculating m '= c ei mod 256, then m' will be necessarily the same as m, i.e. the pixel value is the recovery value;

the recovered values of all pixel values constitute a scanned image of the recovered paid ticket.

Preferably, when the evidence cooperates with the intelligent contract to generate pairs of integer pairs (di, ei), the ei values of the plurality of integer pairs are the same and the di values are different.

Preferably, the number of integer pairs (di, ei) generated by the evidence in cooperation with the intelligent contract is greater than the number of claims service modules, each claim service module is assigned a plurality of di, and when the claims service module calculates the encryption value c of the pixel value, the calculation is performed from any one of the assigned plurality of di.

Preferably, the evidence cooperates with the intelligent contract to generate an integer G, G >256, the interval [0, G-1] is divided into 256 sub-intervals, each sub-interval corresponds to one value of a pixel value, and G is sent to the claim settlement service module;

evidence synergizes intelligent contract generation di and ei to satisfy di ei = ki G +1;

when the claims service module encrypts the scanned image of the paid bill, the pixel value is replaced by any value s in the corresponding subinterval, and then c = s × di mod G is calculated and used as the encrypted value of the pixel value;

when the evidence cooperates with the intelligent contract to decrypt the encrypted image of the bill, calculating m' = c ei mod G to obtain a recovery value of each encrypted value;

and according to the subintervals into which the recovery values fall, obtaining corresponding pixel values, thereby recovering the scanned image of the paid bill.

The substantial effects of the invention are as follows: the method comprises the steps that claim information of an insured person is stored through a local database, the number of times of the claim administration is recorded, and meanwhile, hash values of an insured person identification and an insurance type are shared on a block chain, so that the sharing of claim administration service data is realized under the condition that insurance service information is kept hidden, the total number of times of the claim administration of the insured person under the same insurance type can be obtained among insurance companies, and therefore, a claim administration service module can effectively warn the condition of repeated claim administration, further, repeated claim administration is avoided, the equity loss of the insurance companies is saved, and the market fairness is maintained; by means of the improved method for storing the paid bills, the storage space occupied by the scanned images of the paid bills is reduced; through the improved scanned image encryption method, paid bills of different insurance companies are encrypted by using different encryption keys, but are decrypted by using the same decryption key, so that the evidence collaborative intelligent contract provides scanned images of the paid bills for related evidence collaborative requesters conveniently, the evidence collaborative efficiency is improved, and the behavior of repeated claims of fraudulent insurance companies is effectively prevented.

Drawings

Fig. 1 is a schematic flow chart of a repeat claims settlement early warning method according to an embodiment of the present invention.

Fig. 2 is a flowchart illustrating a method for deleting a claim record according to an embodiment of the present invention.

Fig. 3 is a flow chart illustrating a method for storing a paid ticket according to an embodiment of the present invention.

Fig. 4 is a flowchart illustrating a method for storing difference images according to an embodiment of the present invention.

FIG. 5 is a schematic diagram of a difference image according to an embodiment of the invention.

Fig. 6 is a flowchart of an evidence coordination method according to an embodiment of the present invention.

Fig. 7 is a flowchart illustrating a method for distributing encryption keys according to an embodiment of the present invention.

Fig. 8 is a flowchart illustrating a second scanned image transcoding method according to an embodiment of the present invention.

Wherein: 101. scan image, 102, ticket template, 103, difference image.

Detailed Description

The following provides a more detailed description of the present invention, with reference to the accompanying drawings.

The first embodiment is as follows:

referring to fig. 1, the repeated claim settlement early warning method based on a block chain includes the following steps:

step A01) an insurance company deploys a claim settlement service module, adds entries in a local database to store claim payment information of an insured, wherein the claim payment information comprises the number of the current claim and the number of the other claims;

step A02) the claim settlement service module receives and stores the paid bills, identifies the bills to obtain the identification and insurance type of the insured, and increases the number of times of the claim settlement of the claim information by 1;

step A03) respectively extracting hash values of the paid bills, the insured identification and the insurance type, associating the hash values with timestamps, and uploading the hash values serving as claim settlement records to a block chain for storage;

step A04) the claim settlement service module queries the block chain, obtains the number of claim settlement records recorded on the block chain and corresponding to the hash value and the insurance type of the current insured identification, and records the number as the total claim settlement times;

step A05), updating a local database, and updating the number of other claims of the claim information into the difference value between the total number of claims and the number of the claims;

and A06) setting early warning thresholds for the number of the driver claims, the number of the driver claims and the total number of the driver claims respectively, and sending out repeated claim early warning if the number of the driver claims, the number of the driver claims or the total number of the driver claims exceeds the corresponding early warning thresholds.

The claim settlement business module inquires the block chain, obtains a claim settlement record which is recorded on the block chain and conforms to the hash value and the insurance type of the current insured person identification, downloads the claim settlement record, associates the corresponding block height and stores the claim settlement record in a local database, and after receiving a new paid bill of the insured person, inquires the block chain from the highest block height recorded in the local database.

On the other hand, the embodiment provides a method for deleting the claims record, which is used for deleting the recorded claims record after the insurance company withdraws the claims to be paid. Referring to fig. 2, the method for deleting the claims record includes:

step B01) when the paid bill is cancelled, after the claim settlement service module receives the cancellation information, adding an entry in a local database to store the cancellation information, wherein the cancellation information comprises the cancelled paid bill and the insured identification;

and step B02) updating the number of the administrative claims and the total number of the administrative claims so as to respectively reduce the number of the administrative claims and the total number of the administrative claims by 1.

On the other hand, the embodiment also provides a method for storing the paid-off ticket, which considers the condition that most insureds do not have repeated claims. That is, the scanned image 101 of the paid-off ticket is not read again for use after being stored. The present embodiment thus provides a storage method for reducing the storage space occupied by the scanned image 101 of a paid-out instrument. Referring to fig. 3, the method of storing a paid ticket includes:

step C01) establishing and storing a bill template 102, associating a template number with the bill template 102, wherein the bill template 102 is a blank scanned image 101 of a paid bill;

step C02) calculating the pixel difference value of the scanned image 101 of the paid bill and the bill template 102 at each pixel position, and recording a picture formed by the pixel difference values as a difference image 103;

step C03) stores the difference image 103 in association with the template number.

The contents of the pay tickets of the same type are substantially the same, differing only in terms of insured information, the amount of the claim and the time of the claim. Pixel difference values are calculated for each pixel position of the scanned image 101 of the paid-out instrument and the instrument template 102, and the resulting pixel difference values will be small, substantially close to 0, for most pixel positions. The pixel difference is large at only a small fraction of the pixel positions. By storing the difference image 103 in association with the template number, a storage space can be saved.

Further, the present embodiment provides a method of storing the difference image 103 to further reduce the storage space occupied by the difference image 103. Referring to fig. 4, the method for storing the difference image 103 includes the following steps:

step D01) using a preset byte length to express a pixel difference value;

step D02) establishing an exception set, and recording pixel positions and pixel values of pixel difference values exceeding a preset byte length representation range;

step D03) stores the difference image 103, the exception set, and the template number in association with each other.

The pixel value has a value range of [0,255] and takes 8 bits to represent. When representing pixel difference values, 5 bits are used for representation, the first bit representing the sign. The 4 bits represent a range of [0,15]. And for the pixel points with the channel values exceeding the value range which can be represented by 5 bits, directly recording the pixel coordinates and the pixel values of the corresponding pixel points in the exception set.

Referring to fig. 5, after comparing the scanned image 101 with the established bill template 102, a difference image 103 is obtained, and the pixel values of the remaining positions of the difference image 103 are almost close to 0 except a small part of the pixel positions have higher pixel values. In this embodiment, a pixel value of 0 indicates white, and a pixel value of 255 indicates black, that is, the picture used in this embodiment is in a gray-scale pattern form.

On the other hand, the present embodiment provides another scheme of saving the storage space occupied by the difference image 103. The method specifically comprises the following steps: 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 then represented by the first byte length, the pixel difference value is not smaller than M1 and then represented by the second byte length, if the byte length of the adjacent pixel is changed, M1 or M2 is inserted between the two pixels, the byte length occupied by the inserted value is the same as the byte length occupied by the previous pixel of the adjacent pixel, and when the scanned image 101 is read, the pixel difference value is superposed with the bill template 102 to obtain the restored scanned image 101.

The pixel value has a value range of [0,255]. When representing pixel difference values, 5 bits are used for representation, the first bit represents the sign, i.e. the difference value of the subsequent 4-bit representation is increased or decreased on the corresponding channel value of the corresponding pixel position on the archive template. The range of 4 bits is [0,15]. The value of M1 is 15 and the value of M2 is 0. For a pixel point with a channel value exceeding the value range which can be represented by 5 bits, the difference value representation is not used, and 1 byte is used for directly representing the pixel value.

TABLE 1 representation of neighboring pixel values

Bill template 102	245,245,245,30,30,32,…,205,215,208
		Scanning an image 101	240,235,239,242,240,242,…,213,219,217
Pixel difference value	-5,-10,-6,212,210,210,…,8,4,9

The binary representation of the above-mentioned adjacent pixel values of the file scanner is:

10101,11010,10110,11010100,11010010,11010010,…,01000,00100,01001。

adding M1 and M2 as spacers: 10101,11010,10110, M1,01111, 11010100,11010010, 8230; M2,00000000, 01000,00100,01001.

The final binary representation of several pixel values is:

101011101010110011110111101111110101001101001011010010…000000000000000000000000010000010001001。

when the reading of the pixels is set to be performed, the pixel difference mode is set, i.e. 5 bits are read at a time. The binary number is regarded as 5 bits, i.e. the difference between the pixel value of the first pixel and the pixel position relative to the file template. The first 1 of the 5 bits is a negative value, and the first 0 is a positive value. The pixel value difference values for the first three pixel positions are obtained as-5, -10 and-6, respectively, and in conjunction with the document template 102, the pixel value of the first pixel can be recovered. Reading the 5 bits back again, the pixel difference is found to be a positive 15, i.e. a value of M1, so the 5 bits are discarded. Then 8 bits are read downwards, namely the pixel value of the next pixel is directly read and obtained, and the pixel is directly recovered. The read-down is continued until some 8 bits are read, all the read values are 0, and the 8 bits are discarded. Then switches to the mode of reading 5 bits down to continue reading. Since 0 in the pixel values represents pure white, the 0 pixel value in the scanned image 101 should be changed to a small pixel value, such as 1, to make a0 value for representing M2, so that the scanned image 101 will not be distorted.

The substantial effect of the embodiment is as follows: the method comprises the steps that claim information of an insured person is stored through a local database, the number of times of the claim administration is recorded, and meanwhile, hash values of an insured person identification and an insurance type are shared on a block chain, so that the sharing of claim administration service data is realized under the condition that insurance service information is kept hidden, the total number of times of the claim administration of the insured person under the same insurance type can be obtained among insurance companies, and therefore, a claim administration service module can effectively warn the condition of repeated claim administration, further, repeated claim administration is avoided, the equity loss of the insurance companies is saved, and the market fairness is maintained; by means of the improved method for storing the paid-off ticket, the storage space occupied by the scanned image 101 of the paid-off ticket is reduced.

Example two:

compared with the first embodiment, the embodiment provides a further technical scheme to improve the attack strength on the repeated claim settlement behavior and further inhibit the behavior of the fraud insurance company in the repeated claim settlement.

In the embodiment, the scanned image 101 of the paid bill is shared among different insurance companies, so that sharing and sharing of evidence are realized, and the effect of protecting the rights and interests of the insurance companies is realized. Referring to fig. 6, the method for evidence collaboration includes the following steps:

step E01) issuing an evidence collaborative intelligent contract on the block chain, wherein the evidence collaborative intelligent contract distributes encryption keys for the claim settlement service modules of each insurance company;

step E02) the claim settlement service module encrypts the scanned image 101 of the claim paid bill and records the image as a bill encrypted image;

step E03) packaging the encrypted bill image, the paid bill hash value, the insured identification hash value and the insurance type hash value to be used as a claim settlement record, and uploading the claim settlement record to a block chain for storage;

step E04) the evidence collaborative intelligent contract receives an evidence collaborative request sent by an insurance company, wherein the evidence collaborative request comprises a paid bill hash value, an insured identity hash value, an insurance type hash value, a receiving secret key and a receiving address;

step E05), inquiring a block chain by the evidence collaborative intelligent contract, if a claim record with the corresponding claim bill hash value, insured identification hash value and insurance type hash value is found, sending a confirmation request to an insurance company which uploads the claim record, otherwise, if the corresponding claim record cannot be found, not operating;

step E06) after the evidence collaborative intelligent contract receives the confirmation information fed back by the insurance company uploading the claim settlement record, decrypting the corresponding bill encryption image to obtain the recovered scanned image 101 of the claim paid bill;

step E07) sends the scanned image 101 to the receiving address after being encrypted with the receiving key.

The evidence is cooperated with the intelligent contract to share the paid bills among different insurance companies, so that the evidence sharing is realized. Meanwhile, the scanned image 101 of the paid bill exists in an encrypted form on the block chain, and the decryption key is stored by the evidence-collaborative intelligent contract and is decrypted by the evidence-collaborative intelligent contract, so that the security and the privacy of the scanned image 101 are ensured. While also ensuring authenticity and trustworthiness of the scanned image 101.

In another aspect, the present embodiment provides a method for distributing an encryption key, referring to fig. 7, including:

step F01) the evidence cooperates with the intelligent contract to generate a plurality of pairs of integer pairs (di, ei), i belongs to [1, n ], n is the number of the claims service modules, and di and ei meet di ei = ki 256+1, wherein ki is a positive integer;

step F02) distributes di of the n integer pairs (di, ei) to the n claim settlement service modules as encryption keys, and the corresponding ei is used as decryption keys.

Generating integer pairs (di, ei) is very easy to implement because the probability that ki 256+1 is a prime number is not large. And di and ei also need not be prime numbers. E.g., d1=3427, e1=75. When d1 × e1=3427 × 75=257025=1004 × 256+1, i.e. k1=1004. D1 is sent to the first claim settlement service module, and e1=75 is reserved in the evidence collaborative intelligent contract.

The method for encrypting the scanned image 101 of the paid ticket comprises the following steps:

step F03) converting the scanned image 101 into a gray-scale image, wherein the value range of each pixel value m of the gray-scale image is [0,255];

step F04) calculates c = m × di mod 256 as the encrypted value of each pixel value, all the encrypted values constituting the bill encrypted image.

If the pixel value m1=120 at a certain pixel position in the grayscale map, c1= m1 × d1 mod 256=120 × 3427 mod 256=104 is calculated, and c1=104 is uploaded to the block chain as the cryptographic value. Pixel value m2=38, then c2= m2 × d1 mod 256=38 × 3427 mod 256=178 is calculated, and c2=178 is uploaded to the block chain as the cryptographic value.

step F05) calculating m '= c × ei mod 256, then m' will be inevitably the same as m, i.e. the pixel value is the restored value;

step F06) the restored values of all the pixel values constitute the scanned image 101 of the restored paid-out instrument.

The decryption process for c1=104 is to calculate m1' = c1 × e1 mod 256=104 × 75 mod 256=120. The decryption process for c2=178 is to calculate m2' = c2 × e1 mod 256=178 × 75 mod 256=38. It can be seen that m1 'and m2' are exactly equal to m1 and m2, respectively. When the recovery values of all the pixel values are calculated, the scanned image 101 of the paid-off ticket is recovered.

On the other hand, the present embodiment provides a scheme for improving decryption efficiency. When an evidence collaborates with a smart contract to generate pairs of integer pairs (di, ei), the ei values of the multiple integer pairs are made the same and the di values are made different.

As shown in Table 2, pairs of integers (di, ei) are generated for this example, where ei is the same and di is different from each other. And distributing the plurality of di values to a plurality of claim service modules. Different di are used for encryption, but the decryption can be completed by using the same ei value during decryption.

Table 2 list of integer pairs generated by this embodiment

di	ei	ki	Equation of
				2261	125	1104	2261125=1104256+1=282625
2517	125	1229	2517125=1229256+1=314625
				2773	125	1354	2773125=1354256+1=346625
3029	125	1479	3029125=1479256+1=378625
				3285	125	1604	3285125=1604256+1=410625
3541	125	1729	3541125=1729256+1=442625
				3797	125	1854	3797125=1854256+1=474625
4053	125	1979	4053125=1979256+1=506625
				4309	125	2104	4309125=2104256+1=538625
4565	125	2229	4565125=2229256+1=570625

On the other hand, the embodiment provides a scheme for improving encryption security. The method specifically comprises the following steps: the number of integer pairs (di, ei) generated by the evidence in cooperation with the intelligent contract is more than the number of the claim service modules, each claim service module is allocated with a plurality of di, and when the claim service module calculates the encryption value c of the pixel value, the calculation is carried out on any one of the allocated plurality of di.

Such as assigning d1=2261, d2=2517, and d3=2773 to the first claims service module. The first claim service module encrypts the pixel values m1=120 and m2=38 using d1=2261 and d3=2773, respectively. The encryption results were c1=123 × 2261 mod 256=87, c2=45 × 2773 mod 256=113, respectively. Pixel values 123 and 45 are encrypted to 87 and 113, respectively, and then uploaded to the blockchain. Decryption is performed by using e = 125. M1'= c1 × e mode 256=87 × 125 mod 256=123 and m2' = c2 × e mode 256=113 × 125 mod 256=45 are calculated, respectively, that is, the original pixel values of the scanned image 101 of the paid ticket are restored.

On the other hand, the present embodiment provides a scheme for transcoding the scanned image 101 into a larger value, thereby improving the encryption security. Referring to fig. 8, a transcoding method for a scanned image 101 includes:

g01) generating an integer G, G >256 by the evidence in cooperation with an intelligent contract, dividing the interval [0, G-1] into 256 sub-intervals, wherein each sub-interval corresponds to one value of a pixel value, and sending G to a claim settlement service module;

step G02) evidence is cooperated with di and ei generated by the intelligent contract to satisfy di ei = ki G +1;

step G03) when the scanned image 101 of the claim bill is encrypted by the claim settlement service module, replacing the pixel value with any value s in the corresponding subinterval, and then calculating c = s × di mod G as the encrypted value of the pixel value;

step G04) when the evidence cooperates with the intelligent contract to decrypt the encrypted images of the bill, calculating m' = c ei mod G, and obtaining a recovery value of each encrypted value;

step G05) obtaining corresponding pixel values according to the subintervals into which the recovery values fall, thereby recovering the scanned image 101 of the paid bill.

This embodiment generates an integer G =3089, and as shown in table 3, the section [0,3088] is divided into 256 sub-sections, each section corresponding to one pixel value.

TABLE 3 subinterval division Table

Pixel value	Sub-interval
		255	[2937,3089]
254	[2805,2936]
		253	[2766,2804]
…	…
		123	[1306,1459]
…	…
		1	[13,65]
0	[0,12]

D1=1631, e1=125 as an integer pair, d1 and e1 satisfying d1 × e1=1631 × 125=203875=3089 × 66+1, i.e., k1=66. When the pixel value m1=123 is encrypted using d1=1631 and e1=125, 123 is replaced with any value in the sub-interval [1306,1459], such as 1400 instead of m1=123. The encrypted value c1=1400 × 1631 mod 3089=629 is calculated, and c1=629 is uploaded to the block chain as the pixel value of the encrypted image. At decryption, m1' = c1 × ei mod G =629 × 125 mod 3089=1400 is calculated. Looking up table 2, the pixel value corresponding to the subinterval in which 1400 falls is 123. Thereby achieving restoration of the pixel value. Encrypting pixel value 123 to pixel value 629 makes the encryption of the image more secure.

Compared with the first embodiment, in the embodiment, through the improved scanned image 101 encryption method, paid bills of different insurance companies are encrypted by using different encryption keys, but are decrypted by using the same decryption key, so that the evidence-based collaborative intelligent contract provides the scanned image 101 of the paid bill for a related evidence-based collaborative requester, the evidence-based collaborative efficiency is improved, and the behavior of repeated claims of fraudulent insurance companies is effectively prevented.

The above-described embodiments are only preferred embodiments of the present invention, and are not intended to limit the present invention in any way, and other variations and modifications may be made without departing from the spirit of the invention as set forth in the claims.

Claims

1. The repeated claim settlement early warning method based on the block chain is characterized in that,

the method comprises the following steps:

the claim settlement service module receives and stores the paid bills, identifies the bills to obtain the insured identification and insurance type, and increases the number of the claims of the claim settlement information by 1;

respectively extracting hash values of the paid bills, the insured identification and the insurance type, associating the hash values with timestamps, and uploading the associated timestamp as a claim settlement record to a block chain for storage;

the claim settlement business module inquires the block chain, obtains the number of claim settlement records which are recorded on the block chain and are consistent with the hash value and the insurance type of the current insured identification, and records the number of the claim settlement records as the total claim number;

updating a local database, and updating the number of the other claims of the claim information into a difference value between the total number of the claims and the number of the other claims;

2. The repeated claims early warning method based on block chains as claimed in claim 1,

the claim settlement service module inquires the block chain, obtains a claim settlement record which is recorded on the block chain and is consistent with the hash value and the insurance type of the identification of the insured person, downloads the claim settlement record, associates the corresponding block height and stores the result in the local database, and after receiving a new paid bill of the insured person, inquires the block chain from the highest block height recorded in the local database.

3. The repeated claims early warning method based on block chains as claimed in claim 1,

when a paid bill is cancelled, the claim service module adds an entry to a local database to store the cancellation information after receiving the cancellation information, wherein the cancellation information comprises the cancelled paid bill and an insured identifier, and updates the times of the local claims and the total claims so that the times of the local claims and the total claims are respectively reduced by 1.

4. The repeated claims early warning method based on block chains as claimed in claim 1,

the method for storing the paid ticket comprises the following steps:

establishing and storing a bill template, and associating template numbers with the bill template, wherein the bill template is a blank scanned image of a paid bill;

and storing the difference image in association with the template number.

5. The repeated claims early warning method based on block chains as claimed in claim 4,

representing the pixel difference value using a preset byte length;

6. The repeated claims early warning method based on block chain as claimed in claim 1 or 2,

issuing an evidence collaborative intelligent contract on the block chain, wherein the evidence collaborative intelligent contract distributes encryption keys for the claim settlement service modules of each insurance company;

7. The repeated claim settlement early warning method based on block chains as claimed in claim 6,

the method for distributing the encryption key comprises the following steps:

the evidence collaborates with the intelligent contract to generate a plurality of pairs of integers (di, ei), i belongs to [1, n ], n is the number of the claim service modules, and di and ei meet the condition that di = ki = 256+1, wherein ki is a positive integer;

distributing di of n integer pairs (di, ei) to n claim service modules as encryption keys, and taking corresponding ei as decryption keys;

calculating m '= c ei mod 256, then m' will necessarily be the same as m, i.e. the pixel value is the restored value;

8. The repeated claims early warning method based on block chains as claimed in claim 7,

when an evidence collaborates with a smart contract to generate pairs of integer pairs (di, ei), the ei values of the multiple integer pairs are made the same and the di values are made different.

9. The repeated claims early warning method based on block chain as claimed in claim 8,

the number of integer pairs (di, ei) generated by the evidence in cooperation with the intelligent contract is more than the number of the claim service modules, each claim service module is allocated with a plurality of di, and when the claim service module calculates the encryption value c of the pixel value, the calculation is carried out on any one of the allocated plurality of di.

10. The repeated claims early warning method based on block chains as claimed in claim 6,

the evidence cooperates with the intelligent contract to generate an integer G, G >256, an interval [0, G-1] is divided into 256 sub-intervals, each sub-interval corresponds to one value of a pixel value, and G is sent to the claim settlement service module;