Insurance claims system based on blockchain
Through blockchain technology and smart contracts, combined with hash value proof storage and limited-time encryption, the problem of difficult to guarantee the authenticity of documents and bills in the insurance claim system is solved, an efficient and secure claim processing process is achieved, and private information is protected.
Patent Information
- Application Number
- CN202210356497.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-04-06
- Publication Date
- 2024-12-10
- Estimated Expiration
- 2042-04-06
AI Technical Summary
The existing insurance claims system is inefficient and difficult to guarantee in reviewing the authenticity of claims documents and notes, and is prone to forgery.
Adopt a blockchain-based insurance claim system to ensure the authenticity of service documents and bills through smart contracts and hash value storage, and realize the claims requests and claims of the insured subjects through the collaborative work of the archive subsystem and the claims service subsystem. Evidence and verification of business files.
It improves the efficiency and security of the claims process, eliminates forgery, protects private information, and controls the spread of business files through limited-time encryption technology, enhancing security.
Smart Images
Figure CN114757789B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of information technology, and in particular to an insurance claims system based on blockchain. Background Art
[0002] Insurance claims refer to the behavior of the insurance company to perform the compensation or payment obligations according to the contract when an insurance accident occurs to the subject matter of insurance and the insured's property is damaged or his life is harmed, or when other insurance accidents stipulated in the policy occur and the insurance money needs to be paid. It is a work that directly reflects the insurance function and the performance of insurance responsibilities. The claims procedure generally includes filing an investigation, reviewing certificates and materials, determining insurance liabilities and fulfilling the obligation to pay. During the review of certificates and materials, the insured needs to provide a large number of service documents and bills, which contain a large amount of personal information. In order to prevent false claims, insurance service agencies also need to obtain these documents and bills for review. Such a review method is not only not conducive to protecting the privacy of the insured, but also provides opportunities for the forgery or false issuance of documents and bills. Therefore, it is necessary to study new insurance claims solutions.
[0003] For example, Chinese patent CN110276693A, published on September 24, 2019, is an insurance claim method and system, the insurance claim method includes: obtaining the business contract and claim request data stored in the blockchain node in the blockchain network; reconciling the amount corresponding to the amount in the claim request data through the insurance claim amount in the business contract to generate reconciliation data; generating actual claim data according to the business contract and the reconciliation data; synchronizing the actual claim data to the blockchain node in the blockchain network, and after the synchronization is completed, controlling the insured to transfer the amount indicated by the actual claim data to the insured. Its technical solution helps to improve the efficiency and security of insurance claims by automatically executing business data and claim data with the help of blockchain smart contracts. However, its technical solution cannot solve the problem of difficulty in ensuring the authenticity of relevant documents and bills during the insurance claims process. Summary of the invention
[0004] The technical problem to be solved by the present invention is that there is currently a lack of efficient solutions for verifying the authenticity of claim documents and bills. A blockchain-based insurance claim system is proposed, which can verify the authenticity of relevant service documents and bills with the help of blockchain technology, and help improve the efficiency of data review.
[0005] In order to solve the above technical problems, the technical solution adopted by the present invention is: an insurance claim settlement system based on blockchain, including an archive subsystem and a claim settlement business subsystem, the claim settlement business subsystem includes an acceptance subsystem, an association subsystem and a claim settlement subsystem. When a claim settlement event occurs to an insured subject, the insured subject sends a claim settlement request to the acceptance subsystem, the acceptance subsystem creates a new claim settlement task, assigns a task number, extracts the hash value of the insured subject identifier as an identification code, the acceptance subsystem publishes a smart contract on the blockchain, the smart contract discloses the identification code and the public key of the association subsystem, the archive subsystem is deployed on a service subject that provides services to the insured subject, collects and manages the service subject's business archives, and when the service subject generates a new business When obtaining a service file, the archive subsystem extracts the hash value of the business file, uploads it to the blockchain as the evidence hash value, obtains the type of the business file and the service subject, and associates the business file with the evidence hash value, type and service subject for storage. The archive subsystem extracts the hash value of the identification of the service subject and queries the blockchain. If a matching identification code exists, the business file corresponding to the service subject is encrypted using the public key of the association subsystem and uploaded to the blockchain for storage. The association subsystem polls the blockchain, decrypts to obtain all business files, verifies the evidence hash value, and associates the business file with the claim task. After a preset period of time, the claim subsystem obtains the total claim amount of the insured subject based on all business files associated with the claim task and completes the claim task.
[0006] Preferably, the archive subsystem formulates a regional division plan according to the type of business archives, divides the business archives into several areas, each area contains at most one field area, numbers the areas and associates the names of the fields contained therein, extracts the hash value of the area and records it as the regional hash value, incorporates the regional hash value set, extracts the hash value of the regional hash value set as the evidence hash value and uploads it to the blockchain for storage, associates the business archives and the regional hash value set for storage, and when the archive subsystem queries the blockchain and finds a matching identification code, generates a masking color to mask the field area of the business archive except for the service subject identification and the summary amount, encrypts the masked archive together with the regional hash value set using the public key of the association subsystem, and uploads it to the blockchain for storage, the association subsystem polls the blockchain, decrypts to obtain all business archives, verifies that the regional hash value of the visible area is in the regional hash value set and that the hash value of the regional hash value set matches the evidence hash value, and then associates the business archive with the claim task.
[0007] Preferably, the archive subsystem uses a time-limited encryption algorithm to encrypt the business archive to obtain a time-limited ciphertext, and then uses the public key of the associated subsystem to encrypt the time-limited ciphertext and upload it to the blockchain for storage. The associated subsystem polls the blockchain, decrypts it to obtain the time-limited ciphertext, and decrypts the time-limited ciphertext within the time limit to obtain the business archive.
[0008] Preferably, the file subsystem publishes a time-limited encrypted smart contract on the blockchain. The time-limited encrypted smart contract includes a number of public notice boards. Each public notice board includes a board number, a remaining update duration, and a public notice area. The public notice area displays m sample points (xi, yi), where i ∈ [1, m]. When the remaining update duration is 0, the sample points in the public notice area are updated and the remaining update duration is reset to the initial value. The file subsystem selects a public notice board whose remaining update duration matches the time limit, reads the board number and the m sample points, generates an integer n, where n < m, generates a unary polynomial that passes through n of the m sample points. The file subsystem calculates the distances between the remaining m - n sample points and the unary polynomial, and the sum of the distances is denoted as the sample distance. By exhaustively searching for unary polynomials that pass through n of the m sample points, the unary polynomial with the minimum sample distance is the encryption polynomial. The file subsystem uses the encryption polynomial to encrypt the business file, and after associating the board number, it is used as the time-limited ciphertext. The association subsystem polls the blockchain to obtain the time-limited ciphertext and the corresponding board number. Within the time limit, it reads the m sample points in the public notice area corresponding to the board number, obtains the unary polynomial with the minimum sample distance as the restoration polynomial, and uses the restoration polynomial to decrypt and obtain the business file.
[0009] Preferably, the method of encrypting data using an encryption polynomial includes: converting the data into a binary stream, padding it according to a preset rule, and then truncating the binary stream into a number of binary numbers with a fixed length. The value of the binary number is denoted as D; generating a data combination (b1, x1, b2, x2, …, bN, xN, △) such that B = ∑(-1)^bi * f(xi) + △, where i ∈ [1, N], and △ is a correction value; the data combinations corresponding to all binary numbers form the ciphertext.
[0010] Preferably, the file subsystem exhaustively searches for unary polynomials that pass through n of the m sample points, arranges the unary polynomials in ascending order of the sample distance, selects one of the unary polynomials as the encryption polynomial, records the serial number s of the encryption polynomial in the sorting, uses the encryption polynomial to encrypt the business file, and packages the encrypted business file, the associated board number, and the serial number s as the time-limited ciphertext. The association subsystem polls the blockchain to obtain the time-limited ciphertext and the corresponding board number. Within the time limit, it reads the m sample points in the public notice area corresponding to the board number, exhaustively searches for unary polynomials that pass through n of the m sample points, arranges the unary polynomials in ascending order of the sample distance, and the unary polynomial corresponding to the serial number s is used as the restoration polynomial.
[0011] The substantial effects of the present invention are as follows: by using blockchain to store and fix relevant business files of the service subject, the possibility of forging business files is eliminated, and the business files are obtained directly from the service subject to ensure the authenticity of the business files; by dividing the business files into areas and shielding and hiding the information involving privacy, privacy information can be effectively protected without affecting the review and verification of claims materials; by using time-limited encryption technology to control the scope of business file diffusion, it helps to improve the security of business files. BRIEF DESCRIPTION OF THE DRAWINGS
[0012] Figure 1 This is a schematic diagram of an insurance claims system according to Example 1.
[0013] Figure 2 This is a schematic diagram of the business archive area division in Example 1.
[0014] Figure 3 This is a schematic diagram of a time-limited encryption method according to Embodiment 1.
[0015] Figure 4 This is a schematic diagram of a method for encrypting data using an encryption polynomial according to Embodiment 1.
[0016] Figure 5 This is a schematic diagram of the time-limited encryption method of Example 2.
[0017] Among them: 10. Archive subsystem, 20. Insured entity, 30. Claim business subsystem, 31. Acceptance subsystem, 32. Related subsystem, 33. Claim subsystem. DETAILED DESCRIPTION
[0018] The specific implementation of the present invention will be further described below through specific examples in conjunction with the accompanying drawings.
[0019] Embodiment 1:
[0020] For the insurance claim settlement system based on blockchain, please refer to the attached Figure 1, including an archive subsystem 10 and a claims business subsystem 30. The claims business subsystem 30 includes an acceptance subsystem 31, an association subsystem 32 and a claims subsystem 33. When a claim event occurs to the insured subject 20, the insured subject 20 sends the claim request to the acceptance subsystem 31. The acceptance subsystem 31 creates a claim task and assigns a task number. The hash value of the insured subject 20 identifier is extracted as an identification code. The acceptance subsystem 31 publishes a smart contract on the blockchain. The smart contract discloses the identification code and the public key of the association subsystem 32. The archive subsystem 10 is deployed on the service subject that provides services to the insured subject 20. It collects and manages the service subject's business archives. When the service subject generates a new business archive, the archive subsystem 10 extracts the hash value of the business file, uploads it to the blockchain storage as the evidence hash value, obtains the type and service subject of the business file, associates the business file with the evidence hash value, type and service subject for storage, the file subsystem 10 extracts the hash value of the identification of the service subject, queries the blockchain, and if there is a matching identification code, the business file corresponding to the service subject is encrypted using the public key of the association subsystem 32 and uploaded to the blockchain storage, the association subsystem 32 polls the blockchain, decrypts to obtain all business files, verifies the evidence hash value, and associates the business file with the claim task. After a preset time, the claim subsystem 33 obtains the total claim amount of the insured subject 20 based on all business files associated with the claim task, and completes the claim task. When a claim event occurs to the insured subject 20, such as when the vehicle of the auto insurance policyholder is damaged in a collision accident, the vehicle needs to be repaired. In the prior art, the car owner needs to provide the damage assessment form, repair form and invoice provided by the repair shop. The insurance company needs to review the authenticity of the damage assessment form, repair form and invoice. However, the lack of documentary proof for damage assessment forms, repair orders and invoices makes them prone to forgery, which poses risks to insurance companies and reduces the efficiency of claims settlement.
[0021] In this embodiment, the archive subsystem 10 is deployed in the repair shop, and the damage assessment form, repair form and invoice provided by the repair shop are uploaded to the blockchain for evidence storage, so that the damage assessment form, repair form and invoice cannot be changed or deleted, which greatly increases the cost of forging the damage assessment form, repair form and invoice, and can be easily checked afterwards, thereby eliminating the forgery of damage assessment forms, repair forms and invoices and improving the efficiency of claims. If the car owner has different items repaired at different repair shops, the different repair shops will extract the hash value of the car owner's name, compare it with the identification code, and share the corresponding business files with the insurance company. In the end, the insurance company will obtain a complete repair-related file, so as to identify the claim items and claim amounts.
[0022] The archive subsystem 10 formulates a regional division plan according to the type of business archives and divides the business archives into several areas. Figure 2Each area contains at most one field area. The area is numbered and associated with the names of the fields it contains. The hash value of the area is extracted and recorded as the area hash value. The area hash value is included in the area hash value set. The hash value of the area hash value set is extracted and uploaded to the blockchain storage as the evidence hash value. The business file and the area hash value set are associated and stored. When the archive subsystem 10 queries the blockchain and finds a matching identification code, a masking color is generated to mask the field area of the business file except for the service subject identification and the summary amount. The masked file is encrypted together with the area hash value set using the public key of the association subsystem 32 and uploaded to the blockchain storage. The association subsystem 32 polls the blockchain, decrypts to obtain all business files, verifies that the area hash value of the visible area is in the area hash value set and the hash value of the area hash value set matches the evidence hash value, and then associates the business file with the claim task. Figure 2 The recorded vehicle maintenance service sheet records the maintenance items, costs and total costs involved. The owner's information needs to be disclosed to the insurance company, and the maintenance technician can use a masking color to cover it. The specific maintenance items and costs can also be covered with a masking color, and only the total cost can be disclosed to the insurance company.
[0023] The archive subsystem 10 uses a time-limited encryption algorithm to encrypt the business archive to obtain a time-limited ciphertext, and then uses the public key of the association subsystem 32 to encrypt the time-limited ciphertext, and then uploads it to the blockchain for storage. The association subsystem 32 polls the blockchain, decrypts the time-limited ciphertext, and decrypts the time-limited ciphertext within the time limit to obtain the business archive. After encryption using the time-limited encryption algorithm, the business archive can only be decrypted and obtained by the insurance company within the time limit. After the time limit is exceeded, the business archive will remain confidential, effectively controlling the scope of business archive leakage.
[0024] Please see attached Figure 3, The method of time-limited encryption includes: Step A01) The file subsystem 10 publishes a time-limited encryption smart contract on the blockchain. The time-limited encryption smart contract includes several public notice boards. Each public notice board includes a board number, a remaining update duration, and a public notice area. The public notice area displays m sample points (xi, yi), where i ∈ [1, m]. When the remaining update duration is 0, update the sample points in the public notice area and reset the remaining update duration to the initial value; Step A02) The file subsystem 10 selects a public notice board whose remaining update duration matches the time limit; Step A03) Read the board number and m sample points, generate an integer n, where n < m, and generate a univariate polynomial that passes through n of the m sample points; Step A04) The file subsystem 10 calculates the distances between the remaining m - n sample points and the univariate polynomial, and the sum of the distances is recorded as the sample distance; Step A05) Exhaustively search for univariate polynomials that pass through n of the m sample points. The univariate polynomial with the smallest sample distance is the encryption polynomial; Step A06) The file subsystem 10 encrypts the business file using the encryption polynomial and associates the board number to obtain the time-limited ciphertext; Step A07) The association subsystem 32 polls the blockchain to obtain the time-limited ciphertext and the corresponding board number; Step A08) Within the time limit, read the m sample points in the public notice area corresponding to the board number; Step A09) Obtain the univariate polynomial with the smallest sample distance as the restoration polynomial, and use the restoration polynomial to decrypt to obtain the business file.
[0025] The content recorded in the time-limited encryption smart contract is shown in Table 1. A total of 60 public notice boards are recorded, which can provide 60 groups of time-limited encryption with different time limits.
[0026] Table 1 Time-limited encryption smart contract
[0027] Notice Board 1 {Column number 1, remaining update time 1, public notice area 1} Notice Board 2 {Column number 2, remaining update time 2, public notice area 2} Notice Board 3 {Column number 3, remaining update time 3, public notice area 3} … … Notice Board 60 {Column number 60, remaining update time 60, public notice area 60}
[0028] The sample points recorded in the public notice area of public notice board 2 are 4, namely: (2, 16), (4, 24), (8, 36), and (12, 64). When n takes the value of 2, the univariate polynomials passing through 2 of the 4 sample points are shown in Table 2. Take the univariate polynomial y = 5x + 4 with the smallest sample distance as the encryption polynomial.
[0029] Table 2 Table of univariate polynomials and sample distances when n = 2
[0030] Serial number Univariate Polynomial Sample distance 1 y=4x+8 12 2 3y=10x+28 16 3 y=4.8x+6.4 10.4 4 y=3x+12 18 5 y=5x+4 10 6 y=7x+-20 38
[0031] Please refer to the appendix Figure 4, the method for encrypting data using an encryption polynomial includes: step B01) converting the data into a binary stream, and after padding according to a preset rule, truncating the binary stream into a number of binary numbers of fixed length, the value of the binary number is recorded as D; step B02) generating a data combination (b1, x1, b2, x2, ..., bN, xN, △), so that B = ∑ (-1) ^ bi * f (xi) + △, i ∈ [1, N], △ is a correction value; step B03) the data combination corresponding to all binary numbers constitutes a ciphertext. The encryption polynomial is: f (x) = 9 * x ^ 3-26 * x ^ 2 + 35 * x-6. The data to be encrypted is the string 'eDuW'. The string 'eDuW' is converted into ASCII-encoded binary: 01100101 01000100 01110101 01010111. Truncated into two binary segments with a length of two bytes, the corresponding integers are D1=25924 and D2=30039. D1 can be expressed as D1=f(16)-f(9)+1906, and the corresponding data combination is (0,16,1,10,1906). D2 can be expressed as D2=f(22)-f(19)-969, and the corresponding data combination is (0,22,1,19,-969). Substituting the data combination into D=∑(-1)^bi*f(xi)+△, D1 and D2 can be calculated respectively. The binary representations of D1 and D2 are concatenated and converted into strings to restore the string 'eDuW', completing the encryption and decryption process. The data combination of each integer is not unique.
[0032] The substantial effects of this embodiment are: with the help of blockchain, the relevant business files of the service subject are recorded and fixed, eliminating the possibility of forging business files, and obtaining business files directly from the service subject to ensure the authenticity of the business files; by dividing the business files into areas, the information involving privacy is shielded and hidden, which can effectively protect privacy information without affecting the review and verification of claims information; through time-limited encryption technology, the scope of business file diffusion can be controlled, which helps to improve the security of business files.
[0033] Embodiment 2:
[0034] The blockchain-based insurance claims system, based on the first embodiment, further improves the time-limited encryption algorithm.
[0035] In the time-limited encryption algorithm described in Example 1, if the correct value of n is not obtained, m univariate polynomials can be restored through m sample points. To improve the security of time-limited encryption, the public notice column should disclose multiple sample points, such as 512 or 1024 sample points. However, even if the number of sample points is increased, the encrypted polynomial can be easily cracked by exhaustive attempts.
[0036] Please see attached Figure 5 In this embodiment, the time-limited encryption algorithm includes: step C01) the archive subsystem 10 exhaustively enumerates univariate polynomials of n sample points among m sample points; step C02) the univariate polynomials are arranged in ascending order according to the sample distance; step C03) one of the univariate polynomials is selected as the encryption polynomial, and the sequence number s of the encryption polynomial in the sorting is recorded; step C04) the business archive is encrypted using the encryption polynomial, and the encrypted business archive is associated with the column number and the sequence number s. Packed as a time-limited ciphertext; step C05) the association subsystem 32 polls the blockchain to obtain the time-limited ciphertext and the corresponding column number; step C06) within the time limit, read the m sample points in the public display area corresponding to the column number; step C07) exhaustively enumerates univariate polynomials of n sample points among the m sample points, and arranges the univariate polynomials in ascending order according to the sample distance; step C08) the univariate polynomial corresponding to the sequence number s is used as the recovery polynomial.
[0037] If the sequence number s is set to 5, as shown in Table 2, the univariate polynomial corresponding to the sample distance in ascending order of 5 is y=3x+12. In this embodiment, when the public area has m=6 sample points, a total of 64 possible univariate polynomials can be generated. When the public area discloses 1024 sample points, 2^1024 univariate polynomials can be generated, which is a very large number, significantly increasing the difficulty of exhaustive cracking.
[0038] The above-described embodiment is only a preferred solution of the present invention and does not limit the present invention in any form. There are other variations and modifications without exceeding the technical solution described in the claims.
Claims
1. The insurance claims system based on blockchain is characterized by: Including archive subsystem and claims business subsystem, The claim settlement business subsystem includes an acceptance subsystem, an association subsystem and a claim settlement subsystem. When a claim settlement event occurs to an insured subject, the insured subject sends a claim settlement request to the acceptance subsystem. The acceptance subsystem creates a claim settlement task and assigns a task number. It extracts the hash value of the insured subject's identifier as an identification code. The acceptance subsystem publishes a smart contract on the blockchain. The smart contract discloses the identification code and the public key of the association subsystem. The archive subsystem is deployed on a service subject that provides services to the insured subject, collects and manages the service subject's business archives. When a service subject generates a new business archive, the archive subsystem extracts the hash value of the business archive as a storage The evidence hash value is uploaded to the blockchain for storage, the type of the business file and the service subject are obtained, and the business file is associated with the evidence hash value, type and service subject for storage. The file subsystem extracts the hash value of the identification of the service subject, queries the blockchain, and if there is a matching identification code, the business file corresponding to the service subject is encrypted using the public key of the association subsystem and uploaded to the blockchain for storage. The association subsystem polls the blockchain, decrypts to obtain all business files, verifies the evidence hash value, and associates the business file with the claim task. After a preset period of time, the claim subsystem obtains the total claim amount of the insured subject based on all business files associated with the claim task, and completes the claim task; The archive subsystem formulates a regional division plan according to the type of business archives, divides the business archives into several areas, each area contains at most one field area, numbers the areas and associates the names of the fields contained therein, extracts the hash value of the area, records it as the regional hash value, incorporates the regional hash value set, extracts the hash value of the regional hash value set as the evidence hash value and uploads it to the blockchain for storage, associates the business archives and the regional hash value set for storage, and when the archive subsystem queries the blockchain and finds a matching identification code, generates a masking color to mask the field area of the business archive except for the service subject identification and the summary amount, encrypts the masked archive together with the regional hash value set using the public key of the association subsystem, and uploads it to the blockchain for storage, the association subsystem polls the blockchain, decrypts to obtain all business archives, verifies that the regional hash value of the visible area is in the regional hash value set and that the hash value of the regional hash value set matches the evidence hash value, and then associates the business archive with the claim settlement task; The archive subsystem uses a time-limited encryption algorithm to encrypt the business archive to obtain a time-limited ciphertext, and then uses the public key of the associated subsystem to encrypt the time-limited ciphertext and upload it to the blockchain for storage. The associated subsystem polls the blockchain, decrypts it to obtain the time-limited ciphertext, and decrypts the time-limited ciphertext within the time limit to obtain the business archive; The file subsystem publishes a time-limited encrypted smart contract on the blockchain. The time-limited encrypted smart contract includes a number of bulletin boards. Each bulletin board includes a board number, a remaining update duration, and a publicity area. The publicity area displays m sample points (xi, yi), where i ∈ [1, m]. When the remaining update duration is 0, the sample points in the publicity area are updated and the remaining update duration is reset to the initial value. The file subsystem selects the bulletin board whose remaining update duration matches the time limit, reads the board number and m sample points, generates an integer n, where n < m, generates a unary polynomial that passes through n of the m sample points. The file subsystem calculates the distances between the remaining m - n sample points and the unary polynomial, and the sum of the distances is recorded as the sample distance. It exhaustively enumerates the unary polynomials that pass through n of the m sample points, and the unary polynomial with the smallest sample distance is the encryption polynomial. The file subsystem uses the encryption polynomial to encrypt the business file, and after associating the board number, it is used as the time-limited ciphertext. The association subsystem polls the blockchain to obtain the time-limited ciphertext and the corresponding board number. Within the time limit, it reads the m sample points in the publicity area corresponding to the board number, obtains the unary polynomial with the smallest sample distance as the restoration polynomial, and uses the restoration polynomial to decrypt and obtain the business file; The method for encrypting data using an encryption polynomial includes: Converting the data into a binary stream, padding it according to a preset rule, and then truncating the binary stream into a number of binary numbers with a fixed length. The value of the binary number is denoted as D; Generating a data combination (b1, x1, b2, x2, …, bN, xN, △) such that B = ∑(-1)^bi * f(xi)+△, where i ∈ [1, N], and △ is a correction value; The data combinations corresponding to all the binary numbers form the ciphertext; The file subsystem exhaustively enumerates the unary polynomials that pass through n of the m sample points, arranges the unary polynomials in ascending order of the sample distance, selects one of the unary polynomials as the encryption polynomial, records the serial number s of the encryption polynomial in the sorting, uses the encryption polynomial to encrypt the business file, and packages the encrypted business file associated with the board number and the serial number s as the time-limited ciphertext. The association subsystem polls the blockchain to obtain the time-limited ciphertext and the corresponding board number. Within the time limit, it reads the m sample points in the publicity area corresponding to the board number, exhaustively enumerates the unary polynomials that pass through n of the m sample points, arranges the unary polynomials in ascending order of the sample distance, and the unary polynomial corresponding to the serial number s is used as the restoration polynomial.