CN114693437B - Loan approval system based on enterprise operation data time-limited sharing - Google Patents

Loan approval system based on enterprise operation data time-limited sharing Download PDF

Info

Publication number
CN114693437B
CN114693437B CN202210604663.9A CN202210604663A CN114693437B CN 114693437 B CN114693437 B CN 114693437B CN 202210604663 A CN202210604663 A CN 202210604663A CN 114693437 B CN114693437 B CN 114693437B
Authority
CN
China
Prior art keywords
time
encryption
polynomial
limited
operation data
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.)
Active
Application number
CN202210604663.9A
Other languages
Chinese (zh)
Other versions
CN114693437A (en
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 CN202210604663.9A priority Critical patent/CN114693437B/en
Publication of CN114693437A publication Critical patent/CN114693437A/en
Application granted granted Critical
Publication of CN114693437B publication Critical patent/CN114693437B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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/03Credit; Loans; Processing thereof
    • 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

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Finance (AREA)
  • General Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Hardware Design (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Accounting & Taxation (AREA)
  • Bioethics (AREA)
  • Economics (AREA)
  • Databases & Information Systems (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 loan approval system based on enterprise operation data time-limited sharing, which comprises an access unit, a time-limited encryption unit, a loan application unit, a sharing request unit and an approval unit, wherein the access unit packages operation data into daily operation data packets, the time-limited encryption unit receives the operation data calling request, makes copies of the daily operation data packets, encrypts the copies by using caller public keys after encrypting the copies by using a time-limited encryption algorithm, associates caller identification and uploads block chain storage, the loan application unit receives the loan application request, sends the operation data calling request to the time-limited encryption unit, obtains storage addresses of the copies and time-limited decryption secret keys and sends the obtained copies and time-limited decryption secret keys to the approval unit, and the approval unit provides the copies of the daily operation data packets and the time-limited decryption secret keys to an approval person. The substantial effects of the invention are as follows: and more complete and credible enterprise operation data is provided, and the safety of the operation data is considered.

Description

Loan approval system based on enterprise operation data time-limited sharing
Technical Field
The invention relates to the technical field of information, in particular to a loan approval system based on enterprise operation data time-limited sharing.
Background
Enterprise data generally refers to all information and data related to enterprise operations, including company profiles, product information, operational data, research results, etc. As a bridge between business individuals, enterprise data plays a role both for the enterprise where the data is posted and for the data retriever. The registered enterprises can enlarge the self popularity, seat business opportunities and the like, promote products and brands and increase potential business activities. The acquisition channels of enterprise data are centralized and distributed. The centralized data is generally issued by unified government departments, such as data of business offices and data of statistical offices, has authority and comprehensiveness, but has rough data content and lacks fineness. The distributed type is obtained by a business company through subordinate departments in a scattered manner through various means and is unified and arranged, and the fineness and the accuracy of data can generally meet certain requirements. But the credibility and the real-time performance of the enterprise operation data obtained by the distributed acquisition channel are low, and the more rigorous application requirements cannot be supported. And the current operation data lack one-hand data, and the enterprise information acquisition is not comprehensive enough. Credible proofs can be provided for the operation data by means of a block chain technology, but a sharing scheme capable of giving consideration to management data diffusion management and control is lacked. It is therefore necessary to develop new enterprise business data sharing schemes.
For example, chinese patent CN113240514A, published 2021, 8.10 describes a loan management method and device based on block chain, relating to the field of block chain, the method includes: receiving a loan application request sent by a client, and checking identity information and operation certificate information of the client according to the loan application request; under the condition that the identity information and the operation certificate information of the client are checked to pass, carrying out limit examination and approval operation on a loan application request of the client to obtain loan information; sending the loan information to the user and uploading the loan information to the block chain; and based on the loan information, when the user carries out a money use or payment operation, sending the money use information or payment information of the user to the user, and uploading the money use information or payment information to the block chain. The technical scheme can realize the full-flow recalling of loan transaction information and avoid the denial and repudiation of customers after the fact. It does not provide data support for approval of the loan.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: the technical problem of the lack of a scheme for sharing enterprise operation data at present. The loan approval system based on the enterprise operation data time-limited sharing is provided, an enterprise operation data sharing scheme is provided, and more valuable reference information can be provided for loan approval.
In order to solve the technical problems, the technical scheme adopted by the invention is as follows: a loan approval system based on enterprise operation data time-limited sharing comprises an access unit, a time-limited encryption unit, a loan application unit, a sharing request unit and an approval unit, wherein the access unit accesses the operation data of an enterprise, packages the operation data into daily operation data packets after associating the enterprise identification and the date identification, extracts the certificate hash value of the daily operation data packets and uploads the certificate hash value to a block chain for storage, and obtains the corresponding block height, the time-limited encryption unit receives an operation data calling request which comprises the enterprise identification, the date interval and a received public key, reads the daily operation data packets related to the calling request, makes a copy of the daily operation data packets, encrypts the storage address and the time-limited decryption secret key of the copy by using the received public key after encrypting the copy by using a time-limited encryption algorithm and associates the caller identification to upload the block chain for storage, the loan application unit receives the loan application request of the enterprise, the method comprises the steps that a hash value of a loan application request is extracted and uploaded to a block chain for storage, a sharing request unit receives an operation data sharing request of a bank, the sharing request comprises a bank identifier, a receiving public key, an enterprise identifier and a date interval, the sharing request unit sends a confirmation inquiry to an enterprise, the confirmation inquiry comprises the bank identifier and the date interval, after the enterprise confirms, the sharing request unit sends an operation data calling request to a time-limited encryption unit, the sharing request unit inquires the block chain within a preset time-limited duration to obtain a storage address of a copy and a time-limited decryption secret key, the copy and the time-limited decryption secret key are sent to an approval unit, and the approval unit provides the copy of a daily operating data packet and the time-limited decryption secret key to an approval person.
Preferably, the business data includes equipment operation information of an enterprise and sales information of products, the equipment operation information includes equipment start-stop time records, the product sales information includes information of the input quantity, the inventory quantity, the sales quantity and the daily total sales amount of each product model, and the enterprise submits daily business data to the access unit.
Preferably, the time-limited encryption unit generates an encryption polynomial which is a univariate polynomial for the copy, encrypts the copy using the encryption polynomial, replaces N term coefficients of the encryption polynomial with preset variables to obtain a transient polynomial, encrypts the transient polynomial using a received public key and uploads the transient polynomial to the blockchain for storage, generates N sample points of the encryption polynomial, the time-limited encryption unit issues an intelligent contract on a block chain, the intelligent contract displays N sample points and a time-limited residual time length, when the residual time length is 0, the intelligent contract updates the N sample points, and in the time-limited duration, the bank polls the block chain, decrypts to obtain the transient polynomial, reads N sample points displayed by the intelligent contract, uses the N sample points to calculate N item coefficients of the transient polynomial, obtains the encrypted polynomial, and uses the encrypted polynomial to decrypt to obtain a copy of the operation data.
Preferably, the method of encrypting the copy using the encryption polynomial includes: generating a symmetric encryption Key, and encrypting a copy by using the symmetric encryption Key; converting the Key Key into a binary stream, and converting the binary segment into an integer D by cutting the Key into a plurality of binary segments according to a preset length; generating a data combination (b1, x1, b2, x2, …, bN, xN, Δ), bi being a positive integer, such that D = ∑ (-1) bi ^ floor (bi/2) f (xi) positive Δ, where i ∈ [1, N ], Δ is a correction value, floor () is a floor function, f (x) is an encryption polynomial; combining the data combinations in sequence to serve as Key ciphertext, and packaging the Key ciphertext and the encrypted copy to serve as copy ciphertext; and after the bank recovers the encryption polynomial, the encryption polynomial is used for decrypting the Key ciphertext to obtain the Key Key, and the Key Key is used for decrypting to obtain the copy.
Preferably, the time-limited encryption unit sets a value sequence H for an encryption polynomial of a copy, a plurality of first values of the sequence are taken to form an encryption set H, xi belongs to H when data combination is generated, the value sequence H is uploaded to an intelligent contract after the encryption set H is removed, the intelligent contract selects N values from the value sequence H every day, a function value of the encryption polynomial is calculated to obtain N sample displays, the time-limited encryption unit obtains all values to be displayed in a time-limited time according to a preset time-limited time, calculates an encryption polynomial function value corresponding to the value, records the value as a time-limited sample set, calculates a sample set corresponding to the encryption set H, records the sample set as an encryption sample set, generates a univariate polynomial, passes through all sample points in the encryption sample set and the time-limited sample set, records the univariate polynomial as a substitute encryption polynomial, replaces N item coefficients in the substitute encryption polynomial with a preset variable to obtain a transient polynomial, the method comprises the steps that a transient polynomial is encrypted by using a receiving public key and then uploaded to a block chain for storage, a bank polls the block chain within a time-limited duration to decrypt and obtain the transient polynomial, N sample points displayed by an intelligent contract are read, N term coefficients of the transient polynomial are solved by using the N sample points to obtain an encrypted polynomial, the encrypted polynomial is used for decryption to obtain a copy of business data, and when the time-limited duration is exceeded, the N sample points displayed by the intelligent contract cannot solve a correct substitute encrypted polynomial to realize the time limit of decryption.
Preferably, the time-limited encryption unit sets a special storage space for storing the copies, checks whether the copies with the same enterprise identifier and the same date interval exist in the storage space after receiving a new operation data call request, acquires all values to be displayed by an intelligent contract in a time-limited duration if the copies exist, calculates an encryption polynomial function value corresponding to the value, records the encryption polynomial function value as a time-limited sample set, regenerates a substitute encryption polynomial according to the time-limited sample set and the encryption sample set, replaces N item coefficients in the regenerated substitute encryption polynomial with preset variables to obtain a transient polynomial, and uploads the transient polynomial to a block chain for storage after being encrypted by using a public key of the new call request.
Preferably, the examination and approval unit establishes a daily product sales trend chart, daily average product sales, daily average sales and monthly average sales of the enterprises according to all the acquired daily operating data packets, and displays the daily product sales trend chart, the daily average product sales, the daily average sales and the monthly average sales of the enterprises to the examination and approval personnel, and the examination and approval personnel complete the loan examination and approval according to the operating data displayed by the examination and approval unit and the loan application materials submitted under the enterprise line.
The substantial effects of the invention are as follows: the operation data of the enterprise is received and stored, more complete and credible enterprise operation data are provided, more reference information is provided for examination and approval of the loan, and the loan risk is better controlled; the diffusion range of the operation data is controlled through the time-limited operation data sharing, and the safety of the operation data is considered while the operation data sharing is provided.
Drawings
FIG. 1 is a schematic diagram of a loan approval system according to an embodiment.
FIG. 2 is a diagram of an embodiment of a set of data.
Fig. 3 is a schematic diagram of encryption of a time-limited encryption unit according to an embodiment.
FIG. 4 is a diagram illustrating a decrypted transaction data according to an embodiment.
FIG. 5 is a diagram illustrating an encrypted copy of an encryption polynomial according to an embodiment.
Fig. 6 is a schematic diagram of encryption of a second time-limited encryption unit according to an embodiment.
Fig. 7 is a schematic diagram of an embodiment of three-time-limited encryption smart contract encryption.
Fig. 8 is a schematic diagram of an embodiment of three-time-limited encrypted smart contract decryption.
Wherein: 10. the system comprises an access unit, 20, a block chain, 30, a loan application unit, 40, a time-limited encryption unit, 50, a sharing request unit, 60, an approval unit, 70, business data, 71, equipment operation information, 711, equipment start-stop time record, 72, sales information, 721, a goods input amount, 722, an inventory amount, 723, a sales amount, 724 and daily sales total amount information.
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:
a loan approval system based on enterprise operation data time-limited sharing is disclosed, referring to the attached figure 1, comprising an access unit 10, a time-limited encryption unit 40, a loan application unit 30, a sharing request unit 50 and an approval unit 60, wherein the access unit 10 accesses the operation data 70 of an enterprise, packages the operation data 70 into daily operation data packets after associating with enterprise identifications and date identifications, extracts certificate hash values of the daily operation data packets and uploads the certificate hash values to a block chain 20 for storage to obtain corresponding block heights, the access unit 10 stores the daily operation data packets and establishes a catalog index which records the enterprise identifications, the date identifications, the certificate hash values and the block heights of the daily operation data packets, the time-limited encryption unit 40 receives an operation data 70 calling request which comprises the enterprise identifications, the date intervals and a receiving public key, reads the daily operation data packets related to the calling request and makes copies of the daily operation data packets, after the copy is encrypted by using a time-limited encryption algorithm, the storage address and the time-limited decryption key of the copy are encrypted by using a receiving public key and stored in association with a caller identification uploading block chain 20, a loan application unit 30 receives a loan application request of an enterprise, extracts a hash value of the loan application request and stores the hash value uploading block chain 20, a sharing request unit 50 receives an operation data 70 sharing request of a bank, the sharing request comprises a bank identification, a receiving public key, an enterprise identification and a date interval, the sharing request unit 50 sends a confirmation inquiry to the enterprise, the confirmation inquiry comprises the bank identification and the date interval, after the enterprise confirms, the sharing request unit 50 sends an operation data 70 calling request to a time-limited encryption unit 40, and within a preset time-limited duration, the sharing request unit 50 inquires the block chain 20 to obtain the storage address and the time-limited decryption key of the copy, and sends the time-limited decryption key to an examination and approval unit 60, the approval unit 60 provides the approval staff with a copy of the daily operation data packet and the time-limited decryption key.
The present embodiment provides a loan aid approval system with time-limited sharing of business operations data 70. The process of carrying out loan approval on enterprises is a process of managing and controlling loan risks. The more comprehensive and detailed the enterprise data, including the qualification data and the administration data 70, the more beneficial the effective control of loan risk. When the current enterprise applies for loan, it mainly submits the relevant qualification materials, property conditions and bank flow, but lacks one hand of enterprise operation data 70. The bank lacks accurate grasp of the actual operation condition of the enterprise, and the examination and approval of the loan is influenced. The embodiment provides a credible proof of the business data 70 and facilitates searching through the access unit 10 accessing the business daily business data 70 into the certificate and establishing the directory index. As shown in table 1, the access unit 10 accesses the business data 70 of the first 2020 year of the enterprise and creates all daily operation data packets, each of which includes the business data 70, the enterprise identifier and the date identifier. The access unit 10 extracts the certificate-storing hash value of the daily operation data packet and uploads the certificate-storing hash value to the blockchain 20 for storage.
TABLE 1 Business A daily operating data packet List
Serial number Daily operation data packet
1 Daily operation data package 1: { management data 70, enterprise A identification, 1 month 1 in 2020 }
2 Daily operation data package 2: { managementData 70, business A identification, 1 month and 2 days of 2020 }
3 Daily operation data package 3: { management data 70, enterprise first identification, 1/month/3/day 2020 }
366 Daily operation data package 366 { business data 70, enterprise first identification, 31/12/2020 }
The access unit 10 creates a directory index, as shown in table 2, which records the enterprise identifier, date identifier, certificate-storing hash value, and block height of the daily data packet. Meanwhile, when the access unit 10 stores the daily operation data packet, a unique file name is assigned to the daily operation data packet, and a storage address of the daily operation data packet file is recorded.
Table 2 directory index
Daily operation data packet Enterprise identification Date mark Certificate-storing hash value Block height
Daily operation data packet 1 Enterprise nail mark Year 2020, 1 month and 1 day D1F5…DECD 235806
Daily operation data packet 2 Enterprise nail mark Year 2020, 1 month 2 days 6A15…C824 238512
Daily operation data packet 366 Enterprise nail mark 31 days 12 month in 2020 EA02…C35C 289670
The time-limited encryption unit 40 receives an administration data 70 invocation request that includes the enterprise identification, the date interval, and the received public key. If the bank B receives the loan application of the enterprise A, the bank B firstly uploads the hash value of the loan application request of the enterprise A to the blockchain 20, and the loan application is deposited. After the loan approval is complete and the loan is released, bank B will upload the hash value of the release transaction record for the loan contract to blockchain 20 for storage. The bank b sends an operation data 70 sharing request to the sharing request unit 50, and the sent sharing request comprises the bank b identifier, the public key of the bank b as a receiving public key, the enterprise a identifier and 31 days from 1/2020 to 12/2020. The share request unit 50 forwards the share request to the business a and sends a confirmation query. After the feedback of the enterprise A is confirmed, the sharing request unit 50 sends an operation data 70 calling request to the time-limited encryption unit 40. The sharing request unit 50 and the time-limited encryption unit 40 are deployed in the same network environment, and the sharing request unit 50 sends the operation data 70 calling request to the time-limited encryption unit 40, which can be completed through intranet communication. The time-limited encryption unit 40 does not have to audit the call request. The time-limited encryption unit 40 calls all daily camping data packets of the enterprise A from 1/2020 to 12/2020/31 according to the enterprise identifier and the date interval of the business data 70 calling request, and after the data packets are integrally packaged, copies are made. And storing the copy in a special storage space, and setting the time-limited encryption time to be 30 days. I.e. the bank b is asked to decrypt the operation data 70 within 30 days. If the bank b is in the position of checking the business data 70 of the enterprise a and is not decrypted in time within 30 days, the business data 70 of the enterprise a cannot be checked. The copy will also be cleaned up after 60 days of existence. The reason why the copy exists for a longer time is that when the operation data 70 of the same date interval of the same enterprise called by the call request occurs, the copy needs to be regenerated, causing extra workload.
The copy encrypted in time limited is stored in a dedicated storage space, the storage address and the time limited decryption key are encrypted using the receiving public key, and the associated caller id is uploaded to the blockchain 20 for storage. I.e. the identity of the associated bank b, and then upload the blockchain 20 for storage. The bank b polling blockchain 20 finds the data associated with the bank b identifier, and decrypts the data by using the private key to obtain the storage address of the copy and the time-limited decryption key. And reading the encrypted copy, and decrypting by using the time-limited decryption key to obtain the copy, namely the first enterprise business data 70 in the corresponding date interval.
Referring to fig. 2, the business data 70 includes device operation information 71 of the enterprise and sales information 72 of the product, the device operation information 71 includes a device start-stop time record 711, the product sales information 72 includes a purchase amount 721, an inventory amount 722, a sales amount 723 and daily sales total information 724 of each product model, and the enterprise submits the daily business data 70 to the access unit 10.
Table 3 daily menstruation data 70 recording table
Equipment or product type Recording
Equipment I { Start: 20200101-09:32:20 stop: 20200101-18:02:13}
Device two { Start: 20200101-11:05:10 stop: 20200101-18:22:41}
Product type one { stock quantity 721:0 inventory quantity 722:60 sales quantity 723:32 day sales total: 6400.00}
Product type two { stocking amount 721:10 stock 722:30 sold amount 723: total amount sold on day 12: 4800.00}
If the equipment has multiple starting and stopping, listing the starting and stopping time in the record, wherein the input quantity 721 of the products is the quantity of the products stored in the warehouse on the same day, the sold quantity 723 of the products is the quantity of the products sold on the same day, and the stock 722 is the quantity of the products left in the warehouse after the products are completely stored in the warehouse and sold out of the warehouse. The daily total sold refers to the total amount of the product sold on the day. The format of the daily operation data 70 is not required, and all fields may be included.
Referring to fig. 3, the process of performing time-limited encryption by the time-limited encryption unit 40 includes: step a 01) the time-limited encryption unit 40 generates an encryption polynomial for the copy, the encryption polynomial being a univariate polynomial; step a 02) encrypting the copy using the encryption polynomial; step A03) replacing N item coefficients of the encrypted polynomial by preset variables to obtain a transient polynomial; step A04) the transient polynomial is stored in the uploading blockchain 20 after being encrypted by using the received public key; step a 05) generating N sample points of an encryption polynomial; step a 06) the time-limited cryptographic unit 40 issues an intelligent contract on the blockchain 20; step A07) the intelligent contract displays N sample points and the time-limited residual time length, and when the residual time length is 0, the intelligent contract updates the N sample points.
Generating an encryption polynomial of f (x) =12 x ^6+2 x ^5-8 x ^4-5 x ^3+4 x ^2-6 x +8, and encrypting a copy using the encryption polynomial. In this embodiment, N is taken as 3, and 3 term coefficients in the encryption polynomial are replaced with preset variables to obtain a transient polynomial: g (x) =12 x ^6+2 x ^5+ a ^ x ^4-5 x ^3+ b ^ x ^2+ c ^ x + 8. The memory address of the copy and the transient polynomial g (x) are stored using the receive public key encryption upload blockchain 20. Generating 3 sample points of the encryption polynomial f (x), which are: (15,137785193), (20,773081488), and (30,8789988428). The smart contract issued on blockchain 20 shows these 3 sample points.
Table 4 intelligent contract display content table
Serial number Identification Sample point
1 39DF…9E02 (10,330)(12,510)(16,990)
2 698A…2BC7 (15,137785193)(20,773081488)(30,8789988428)
3 CE3D…60B4 (3,690)(5,1350)(12,950)
As shown in table 4, the table of contents is displayed for the intelligent contract on the blockchain. Where the hash value identified as the storage address of the copy. And the bank extracts the hash value of the storage address of the copy and compares the hash value with the identifier to obtain a sample point corresponding to the copy. Therefore, the method can play a role in identification and cannot reveal the storage address of the copy.
Referring to fig. 4, the method for the bank to decrypt the copy within the time-limited duration includes: step B01) in time-limited duration, the bank polls the block chain 20 and decrypts to obtain the transient polynomial; step B02) reading N sample points displayed by the intelligent contract; step B03) using N sample points to solve N item coefficients of the transient polynomial to obtain an encrypted polynomial; step B04) obtains a copy of the business data 70 using cryptographic polynomial decryption. Substituting these 3 sample points into the transient polynomial g (x) can solve the values of a, b and c, thus obtaining the encryption polynomial f (x). And simultaneously displaying the time-limited residual time length, and updating the 3 sample points to be (6,25), (10,51) and (12,36) when the time-limited residual time length is 0. The updated sample points are substituted into the transient polynomial, and the correct item coefficient value cannot be obtained. The correct encryption polynomial is then not available, preventing correct decryption of the administration data 70, achieving a time limit for decryption.
Substituting (15,56953043) into the transient polynomial yields-50625 a +225b-15c = -404190, and similar yields sample points (20,773081488) and (30,8789988428) into the transient polynomial g (x) yields equations-160000 a +400b-20c = -1278520 and-810000 a +900b-30c = -6476580. The 3 equations form a 3-dimensional linear equation set, which can be easily solved. A = -8, b =4, and c = -6 are obtained.
Referring to fig. 5, a method for encrypting a copy using an encryption polynomial includes: step C01) generating a symmetric encryption Key, and encrypting the copy by using the symmetric encryption Key; step C02) converting the Key Key into binary stream, and cutting the Key into a plurality of binary segments according to the preset length to convert the binary segments into integers D; step C03) generating a data combination (b1, x1, b2, x2, …, bN, xN, Δ), bi being a positive integer, such that D = ∑ ((-1) ^ bi floor (bi/2) × (xi) positive Δ, where i ∈ [1, N ],/Δ is a correction value, floor () is a floor function, f (x) is an encryption polynomial; step C04) combining the data combinations in order to be used as Key ciphertext, and packaging the Key ciphertext and the encrypted copy to be used as copy ciphertext; step C05), after the bank recovers the encryption polynomial, the encryption polynomial is used for decrypting the Key ciphertext to obtain the Key Key, and the Key Key is used for decrypting to obtain the copy. If the Key is "EuWk", the copy is encrypted using "EuWk". Under ASCII encoding, the string EuWk is converted to binary: 01000101011101010101011101101011, truncated into two integers according to the length of 2 bytes, D1=17781 and D2=22379 respectively. The encryption polynomial f (x) is: f (x) =15 x ^2-32 x + 64. Then D1 may be represented as D1=6 × f (7) + f (31) +844, with the corresponding data set being (12,7,2,31, 844). In the same way, a data set of integer D2 can be obtained, D2=2 × f (5) +4 × f (20) +125, corresponding to a data set of (4,5,8,20, 125). The data combination for each integer is not unique. When the bank recovers the encrypted polynomial, substituting the data combination (12,7,2,31,844) into D = ^ Σ (= 1) ^ bi floor (bi/2) × (xi) + [ delta ], and D1=17781 and D2=22379 can be obtained. The number is directly expressed in binary and is converted into characters according to ASCII code, and the Key Key is obtained as 'EuWk'. The copy is obtained using "EuWk" decryption. The symmetric encryption algorithm is adopted for encrypting and decrypting the copy by using the Key Key.
The approval unit 60 establishes a daily product sales trend graph, daily average product sales, daily average sold amount and monthly average sales of the enterprise according to all the acquired daily operating data packets, and displays the daily product sales trend graph, the daily average sold amount and the monthly average sales of the enterprise to the approval staff, and the approval staff completes loan approval according to the operation data 70 displayed by the approval unit 60 and loan application materials submitted offline by the enterprise. The manufactured product sales trend graph, daily average product sales, daily average sales and monthly average sales of the enterprise can facilitate the examination and approval personnel to know the actual operation condition of the enterprise. By directly checking the daily operation data 70 of the enterprise, the most real enterprise operation condition can be known, the material of the enterprise loan application can be verified, and the risk of loan approval is reduced.
The beneficial technical effects of this embodiment are: the operation data 70 of the enterprise is received and stored, more complete and credible enterprise operation data 70 is provided, more reference information is provided for examination and approval of the loan, and the loan risk is better controlled; the diffusion range of the management data 70 is managed through the sharing of the time-limited management data 70, and the security of the management data 70 is considered while the sharing of the management data 70 is provided.
The second embodiment:
the embodiment provides a specific improvement on the basis of the first embodiment. In the first embodiment, when a plurality of banks request to share the business data 70 in the same date interval of the same enterprise, copies of a plurality of daily business data packets are repeatedly generated, which wastes storage resources. In the embodiment, a specific technical means is adopted, so that different banks can share the same copy ciphertext for the operation data 70 sharing the same date interval of the same enterprise with different time durations respectively. Referring to fig. 6, the method includes: step D01), the time-limited encryption unit 40 sets a value sequence H for the encryption polynomial of the copy; step D02) taking the first values of the sequence to form an encryption set h, and enabling xi to be belonged to h when generating data combination; step D03) uploading the value sequence H to an intelligent contract for storage after removing the encryption set H; step D04), the intelligent contract selects N values from the value sequence H every day, calculates the function value of the encryption polynomial, and obtains N sample displays; step D05), the time-limited encryption unit 40 obtains all the values to be displayed in the time-limited duration according to the preset time-limited duration; step D06), calculating an encryption polynomial function value corresponding to the value, and recording as a time-limited sample set; step D07) calculating a sample set corresponding to the encryption set h, and recording as an encryption sample set; step D08) generating a univariate polynomial, and recording the univariate polynomial as a substitute encryption polynomial after passing through all sample points in the encryption sample set and the time-limited sample set; step D09) replacing N item coefficients in the replacing encryption polynomial by preset variables to obtain a transient polynomial, encrypting the transient polynomial by using a receiving public key and then uploading the transient polynomial to the blockchain 20 for storage; step D10), in time-limited duration, the bank polls the block chain 20, and the transient polynomial is obtained by decryption; step D11) reading N sample points displayed by the intelligent contract, and using the N sample points to calculate N item coefficients of the transient polynomial to obtain an encrypted polynomial; step D12) obtaining a copy of the operation data 70 by using the encryption polynomial, and when the time limit duration is exceeded, the N sample points displayed by the intelligent contract will not solve the correct substitute encryption polynomial, thereby realizing the time limit of decryption.
The time-limited encryption unit 40 calls all daily camping data packets of the enterprise A from 1/2020 to 12/2020/31 according to the enterprise identifier and the date interval of the business data 70 calling request, and after the data packets are integrally packaged, copies are made. Generating an encryption polynomial for the copy with f (x) =5 x ^2-20 x +30, generating a value sequence H as: (2,3,4,5,6,8,10,12,16,18,20,25,30,32,36,40,45,48,50,55,60,68), the first 4 bits being used for the encrypted copy. Namely {2,3,4,5} constitutes an encryption set h, the Key is "EuWk", and the copy is encrypted using "EuWk". Under ASCII encoding, the string EuWk is converted to binary: 01000101011101010101011101101011, truncated into two integers according to the length of 2 bytes, D1=17781 and D2=22379 respectively. Then D1 may be represented as D1=100 f (2) +60 f (3) +400 f (4) +60 f (5) + 581), with the corresponding data set being (200,2,120,3,800,4,120,5, 581). The same approach can yield a data set of integer D2, D2=200 f (2) +50 f (3) +220 f (4) +230 f (5) +379, corresponding to a data set of (400,2,100,3,440,4,460,5, 379). And N is 3, and the time limit duration is set to be 3 days. And after the encryption set H is removed from the value sequence H, sequentially displaying 3 sample points every day. The total of 9 values are shown in 3 days, namely {6,8,10,12,16,18,20,25,30}, namely the time-limited sample set is {6,8,10,12,16,18,20,25,30 }. Calculating sample points corresponding to the encryption set h and the time-limited sample set: (2,10), (3,15), (4,30), (5,55), (6,90), (8,190), (10,330), (12,510), (16,990), (18,1290), (20,1630), (25,2655) and (30,3930).
And generating a univariate polynomial, and enabling the univariate polynomial to pass through all sample points in the encrypted sample set and the time-limited sample set. The generated unitary polynomial is f (x) = 4.468665620275273 × e-14 × ^12-6.3406822477524005 × e-12 × 11+3.9165970082738594 × e-10 × ^10-1.3897464379519992 × e-8 × 9+3.1493698301890763 × e-7 × 8-0.000004794466057275043 × 7+0.00005021268081384367 × 6-0.00036412270206431785 × ^5+0.0018127786288619774 × 4-0.006036809014378974 × ^3+5.0127508396614715 × 2-20.015316063693916 × x +30.007896892720762, denoted as the alternative encryption polynomial. And replacing the 3 term coefficients in the replacing encryption polynomial by using a preset variable to obtain a transient polynomial. The transient polynomial is obtained as: g (x) = 4.468665620275273 × e-14 × 12-6.3406822477524005 × e-12 × 11+3.9165970082738594 × e-10 × 10-1.3897464379519992 × e-8 × 9+3.1493698301890763 × e-7 × 8-0.000004794466057275043 × 7+ a × 6-0.00036412270206431785 × 5+ b × 4-0.006036809014378974 × 3+ c × 2-20.015316063693916 × 30.007896892720762. The transient polynomial g (x) is stored encrypted using the received public key and then uploaded to the blockchain 20.
And (3) reading the number of the intelligent contracts from the value sequence H after the encryption set H is removed every day, calculating the value of the univariate polynomial, and forming and displaying 3 sample points. In the time-limited duration, the values of a, b and c can be solved by substituting 3 sample points of each day into the transient polynomial g (x).
On the first day, the smart contract shows 3 sample points (6,90), (8,190) and (10,330), and the transient polynomial g (x) is substituted to obtain 3 equations: 46656 a +1296 b +36 c =185.15111418685, 262144 a +4096 b +64 c =341.40414871846 and 1000000 a +10000 b +100 c = 569.61555417571. The solution after the joint resolution yields a =0.00005021268081384367, b =0.0018127786288619774 and c = 5.0127508396614715.
On the next day, the smart contract displays 3 sample points (12,510), (16,990), and (18,1290), and the transient polynomial g (x) is substituted to obtain 3 equations: 2985984 a +20736 b +144 c =909.36020775435, 16777216 a +65536 b +256 c =2244.495267447 and 34012224 a +104976 b +324 c = 3522.2777816319. After the joint, the corresponding item coefficient can be solved to obtain the restored encryption polynomial f (x).
However, by day 4, the displayed 3 sample points are not on the encryption polynomial f (x), so the decrypted values of a, b and c will be wrong, and the correct encryption polynomial cannot be obtained at this time, so that the time-limited decryption is realized. The 3 sample points shown on day 4 were (32,4510), (36,5790), and (40,7230). Substituting these three sample points into the transient polynomial g (x) yields 3 equations, respectively: 1073741824 a +1048576 b +1024 cc =60926.835222897, 2176782336 a +1679616 b +1296 cc =118306.72859824 and 4096000000 a +2560000 b +1600 cc = 213271.91789868. The solution yields a =3.48565174125 × e-12, b =16173.54094408, c = 23871706.94606636. Obviously, the correct substitution polynomial cannot be recovered, and the substitution into the data combination (200,2,120,3,800,4,120,5,581) cannot naturally obtain the correct value of D1.
Based on the above time-limited encryption method, in this embodiment, the time-limited encryption unit 40 further sets a dedicated storage space for storing a copy, after receiving a new operation data 70 call request, checks whether a copy with the same enterprise identifier and the same date interval already exists in the storage space, if so, obtains all values to be displayed by the intelligent contract within the time-limited duration, calculates an encryption polynomial function value corresponding to the value, records the encryption polynomial function value as a time-limited sample set, regenerates a substitute encryption polynomial according to the time-limited sample set and the encryption sample set, replaces N item coefficients in the regenerated substitute encryption polynomial with preset variables to obtain a transient polynomial, encrypts the transient polynomial with a new public key received by the call request, and uploads the transient polynomial to the block chain 20 for storage.
The smart contract displayed 3 sample points (12,510), (16,990), and (18,1290) the next day. At this time, the bank c also receives the loan application of the enterprise a, and therefore, the sharing request unit 50 also transmits the operation data 70 sharing request, where the transmitted sharing request includes the bank c identifier and the public key of the bank c as the receiving public key, the enterprise a identifier, and 2020 year 1/month 1 to 2020 year 12/month 31. The share request unit 50 forwards the share request to the business a and sends a confirmation query. After the feedback of the enterprise A is confirmed, the sharing request unit 50 sends an operation data 70 calling request to the time-limited encryption unit 40.
The time-limited encryption unit 40 checks whether a copy of the same business id and the same date zone already exists in the storage space after receiving the new operation data 70 calling request. A copy of the daily data package of business a during 1/2020 to 12/31/2020 was found to exist. Meanwhile, the time limit duration set for the bank handle is also 3 days.
The time-limited encryption unit 40 obtains all values to be shown by the intelligent contract within 3 days, namely {12,16,18,20,25,30,32,36,40 }. And calculating an encryption polynomial function value corresponding to the value, and recording as a time-limited sample set. The time-limited sample set is { (12,510), (16,990), (18,1290), (20,1630), (25,2655), (30,3930), (32,4510), (36,5790), (40,7230) }. The substitute encryption polynomial is regenerated from the time-limited sample set and the encrypted sample set. That is, the newly generated substitute encryption polynomial needs to pass through the following sample points: (2,10),(3,15),(4,30),(5,55),(12,510),(16,990),(18,1290),(20,1630),(25,2655),(30,3930),(32,4510),(36,5790),(40,7230). The generated univariate polynomial is: f (x) =2.5589784795167434 ^ e-14 ^ x ^12-4.977516141910853 ^ e-12 ^ x ^11+4.217441760115802 ^ e-10 ^ x ^10-2.049251468195195 ^ e-8 ^ x 9+6.32754191538489 ^ e-7 ^ x 8-0.000013003618981054493 ^ x ^7+0.00018120162179808413 ^ x ^6-0.001713435200849489 ^ x ^5+0.010841763836198837 ^ x ^4-0.04453735987604546 ^ x ^3+5.11242107096221 ^ x ^2-20.15642023296832 x + 30.090732410896486.
And selecting 3 term coefficients, and replacing the coefficients by preset variables to obtain a new transient polynomial. The transient polynomial is: g (x) =2.5589784795167434 × e-14 × 12-4.977516141910853 × e-12 × 11+4.217441760115802 × e-10 × 10-2.049251468195195 × e-8 × 9+6.32754191538489 × e-7 × 8-0.000013003618981054493 × 7+0.00018120162179808413 × 6-0.001713435200849489 × 5+ a × 4+ b × 3+5.11242107096221 × 2+ c × 30.090732410896486.
And replacing N item coefficients in the regenerated replacing encryption polynomial by using a preset variable to obtain a transient polynomial, encrypting the transient polynomial by using a received public key of a new call request, and then uploading the transient polynomial to the blockchain 20 for storage. And the bank C uses the private key for decryption to obtain the newly generated transient polynomial. If the bank B does not access the intelligent contract in time, the bank B can not obtain the encryption polynomial any more on the 4 th day, and the copy can not be decrypted. And the bank is still in the time-limited duration of the day. Bank and read 3 sample points displayed by intelligent contract on day 4: (32,4510), (36,5790), and (40,7230). Substituting the transient polynomial obtained by the bank C to obtain 3 equations: 1048576 a +32768 b +32 c =9260.1686983272, 1679616 a +46656 b +36 c =15401.580563214 and 2560000 a +64000 b +40 c = 24046.818661922. And (4) resolving to obtain the values of a, b and c, so that a substitute polynomial can be obtained, and the Key Key can be correctly decrypted. Due to errors in the calculation process, approximate evidence obtaining operation needs to be carried out on the result in the implementation process, and more effective numbers should be reserved as far as possible. When D1 is calculated as the alternative polynomial f (x) obtained from bank c, the combination of data (200,2,120,3,800,4,120,5,581) is substituted into the alternative polynomial f (x) to yield D1=100 f (2) +60 f (3) +400 f (4) +60 f (5) +581= 17781.000000151. The difference from D1=17781 is only 0.000000151, and the rounding may be performed with sufficiently high accuracy. In the embodiment, the same copy can be shared with different time-limited durations by updating the substitution polynomial and the transient polynomial, so that the utilization times of the copy are increased, and the operation of repeatedly generating the same copy is omitted.
Compared with the first embodiment, the first embodiment can share one copy for the same enterprise and the same date interval operation data 70, and meanwhile, independent sharing time-limited duration of a plurality of call requests is not influenced, so that the efficiency of sharing the operation data 70 can be improved.
Example three:
the loan approval system based on enterprise operation data time limit sharing comprises an access unit 10, a time limit encryption unit 40, a loan application unit 30, a sharing request unit 50 and an approval unit 60, wherein the access unit 10, the loan application unit 30, the sharing request unit 50 and the approval unit 60 are the same as those in the first embodiment. The difference is that the process of encrypting the copy by the time-limited encryption unit 40 in the present embodiment using the time-limited encryption algorithm includes: the time-limited encryption unit 40 issues a time-limited encrypted intelligent contract on the block chain, wherein the time-limited encrypted intelligent contract comprises an encryption receiving column, a decryption receiving column, an output column and a plurality of encryption and decryption columns. As shown in table 5, the encryption/decryption column includes a column identifier, an encryption function, and a clock, the clock records the remaining time of the encryption function, and when the remaining time of the encryption function is 0, the encryption/decryption column updates the encryption function and resets the clock. The time-limited encryption unit 40 encrypts the copy by using a symmetric encryption algorithm, taking the symmetric encryption Key as Key, and submitting the Key to the time-limited encryption intelligent contract for encryption to obtain a ciphertext of the Key. And the copy memory address of the encrypted ciphertext of the Key Key is encrypted by using the receiving public Key and uploaded to a block chain for storage by associating with the caller identification. And the bank polls the block chain, and uses the private Key to decrypt and obtain the ciphertext and the encrypted copy of the secret Key. And submitting the ciphertext of the Key Key to a time-limited encrypted intelligent contract, and decrypting to obtain the Key Key. And decrypting the copy by using the Key Key to obtain the plaintext of the copy. The encryption function is a symmetric encryption algorithm disclosed in the prior art, such as DES, 3DES (triple DES), and AES. The encryption key used by the encryption and decryption column is randomly generated by a time-limited encryption intelligent contract, and when the clock countdown is 0, the used encryption key is updated, so that the updating of the encryption function is completed.
TABLE 5 time-limited encrypted Intelligent contract schematic
Encryption and decryption column 1 { column ID 1, encryption function 1, clock 1}
Encryption and decryption column 2 { column identification 2, encryption function 2, clock 2}
Encryption and decryption bar 60 { column identification 60, encryption function 60, clock 60}
Encryption receiving column {30d,DATA1.Pub_Key1}
Decryption receiving column NULL
Output fence NULL
The data received by the encryption receiving column is {30d, data1.pub _ Key1}, the check finds that the clock of the encryption and decryption column does not conform to 30d, so the time-limited encryption intelligent contract sets the clock of the encryption and decryption column 5 in the initial state to 30d, the clock is a countdown clock, and when the clock of the encryption and decryption column 5 counts down to 0, the encryption and decryption column 5 updates the encryption function and resets the clock. Since the encryption function is not changed until the clock count down reaches 0, the DATA1 can be encrypted, and the encrypted DATA can be decrypted back to the plain text in the same manner. But once the clock of the encryption/decryption field 5 counts down to 0, the encryption function is updated. At this point, DATA1 encrypted by the old encryption function is submitted again and cannot be decrypted correctly. On day 10, the clock of the encryption/decryption column 5 counts down to 20d, and the encryption/decryption column receives the data with the time limit duration of 20 d. Then, the time-limited encryption intelligent contract transfers the newly written data to the encryption/decryption column 5 for encryption.
When the time-limited encryption intelligent contract is encrypted, please refer to fig. 7, the following steps are executed: step E01), when the data are written in the encryption receiving column, checking whether the written data contain time limit duration, data to be encrypted and a received public key, if the time limit duration, the data to be encrypted or the received public key are lacked, operating, otherwise, decrypting by using a private key of the time limit encryption intelligent contract to obtain the data to be encrypted, and entering the step E02) for encryption; step E02), checking clocks of all encryption and decryption columns, if the clocks are consistent with the time limit duration, submitting the data to be encrypted to the corresponding encryption and decryption columns in association with the encryption identifier, and obtaining the data encrypted by the encryption function of the encryption and decryption columns; and E03), the time-limited encrypted intelligent contract uses the private key signature column identification, the time-limited duration and the timestamp, the encrypted data is associated and signed to be used as a time-limited ciphertext, the time-limited ciphertext is encrypted by using a receiving public key in the encrypted receiving column and then written into the output column, the time-limited encryption unit 40 reads the output column, and the time-limited ciphertext is obtained by using the corresponding private key for decryption.
When the time-limited encrypted intelligent contract is decrypted, please refer to fig. 8, the following steps are executed: step F01), when the data is written in the decryption receiving column, checking whether the written data contains the time-limited ciphertext and the receiving public key encrypted by the time-limited encryption intelligent contract public key, if the time-limited ciphertext or the receiving public key is lacked, no operation is performed, otherwise, the step F02 is performed); step F02), decrypting by using a private key of the time-limited encrypted intelligent contract to obtain a time-limited ciphertext, decrypting a signature in the time-limited ciphertext by using a public key of the time-limited encrypted intelligent contract to obtain a column identifier, time-limited duration and a timestamp; step F03), the time-limited encrypted intelligent contract judges whether the time stamp in the current time distance signature exceeds the time-limited duration, if so, the overtime identifier is written into the output column, otherwise, the step F04 is executed); step F04), after the encrypted data is associated with the decryption identifier, the encrypted data is submitted to the encryption and decryption column corresponding to the column identifier in the signature, the data decrypted by the encryption function of the encryption and decryption column is obtained, and the data is encrypted by using the receiving public key and then written into the output column.
When the encryption receiving column, the decryption receiving column or the output column of the time-limited encryption intelligent contract are written with data, the time-limited encryption intelligent contract locks the encryption receiving column, the decryption receiving column and the output column, the encryption receiving column, the decryption receiving column and the output column do not accept the writing of new data within a preset time length, when the data written in the encryption receiving column lack the time-limited time length, the data to be encrypted or a public key, the time-limited encryption intelligent contract immediately unlocks the encryption receiving column, the decryption receiving column and the output column, and when the data written in the decryption receiving column lack the time-limited ciphertext or the public key, the time-limited encryption intelligent contract immediately unlocks the encryption receiving column, the decryption receiving column and the output column.
Compared with the first embodiment and the second embodiment, the time-limited encryption scheme described in the embodiment has higher security. However, encryption and decryption all need time-limited encryption intelligent contracts to be completed on the block chain, so that occupation of block chain resources is large. When block chain traffic is congested, the timeliness of time-limited encryption and decryption can be affected.
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 (6)

1. A loan approval system based on enterprise operation data time-limited sharing is characterized in that,
the system comprises an access unit, a time-limited encryption unit, a loan application unit, a sharing request unit and an approval unit, wherein the access unit accesses the business data of an enterprise, packages the business data into a daily operation data packet after associating the business identification and the date identification with the business data, extracts the certificate-storing hash value of the daily operation data packet, uploads the certificate-storing hash value to a block chain for storage, and obtains the corresponding block height,
the time-limited encryption unit receives the operation data call request and the public key, reads the daily operation data packet related to the call request, makes a copy of the daily operation data packet, encrypts the copy by using a time-limited encryption algorithm, encrypts a storage address of the copy and a time-limited decryption key by using the received public key, and uploads the encrypted copy to a block chain for storage by associating with a caller identifier,
the loan application unit receives a loan application request of an enterprise, the sharing request unit receives an operation data sharing request and a public key of a bank, the sharing request unit sends an operation data calling request to the time-limited encryption unit, the sharing request unit inquires a block chain within a preset time-limited duration to obtain a storage address and a time-limited decryption key of a copy, the copy and the time-limited decryption key are sent to the approval unit, and the approval unit provides the copy of a daily operation data packet and the time-limited decryption key to an approval person;
the time-limited encryption unit generates an encryption polynomial for the copy, the encryption polynomial is a univariate polynomial, the copy is encrypted by using the encryption polynomial, N term coefficients of the encryption polynomial are replaced by preset variables to obtain a transient polynomial, the transient polynomial is encrypted by using a received public key and then uploaded to a block chain for storage, and N sample points of the encryption polynomial are generated, the time-limited encryption unit issues an intelligent contract on a block chain, the intelligent contract displays N sample points and a time-limited residual time length, when the residual time length is 0, the intelligent contract updates the N sample points, and in the time-limited duration, the bank polls the block chain, decrypts to obtain the transient polynomial, reads N sample points displayed by the intelligent contract, uses the N sample points to calculate N item coefficients of the transient polynomial, obtains the encrypted polynomial, and uses the encrypted polynomial to decrypt to obtain a copy of the operation data.
2. The system of claim 1, wherein the system is configured to perform a loan approval based on the time-limited sharing of the business operations data,
the operation data comprises equipment operation information and product sale information of an enterprise, the equipment operation information comprises equipment start-stop time records, the product sale information comprises the information of the input quantity, the inventory quantity, the sale quantity and the total daily sale amount of each product type, and the enterprise submits daily operation data to the access unit.
3. The system for loan approval based on the time-limited sharing of business operations data according to claim 1,
the method of encrypting a copy using an encryption polynomial includes:
generating a symmetric encryption Key, and encrypting a copy by using the symmetric encryption Key;
converting the Key into a binary stream, cutting the binary stream into a plurality of binary segments according to a preset length, and converting the binary segments into an integer D;
generating a combination of data (b1, x1, b2, x2, …, bN, xN, Δ), bi being a positive integer, such that D = ∑ (-1) bi ^ floor (bi/2) × (xi) + [ Δ, where i ∈ [1, N ], [ Δ ] being a correction value, floor () being a floor function, f (xi) being an encrypted polynomial;
combining the data combinations in sequence to serve as Key ciphertext, and packaging the Key ciphertext and the encrypted copy to serve as copy ciphertext;
and after the bank recovers the encryption polynomial, the encryption polynomial is used for decrypting the Key ciphertext to obtain the Key Key, and the Key Key is used for decrypting to obtain the copy.
4. The system for loan approval based on the time-limited sharing of business operations data according to claim 3,
the time-limited encryption unit sets a value sequence H for the encryption polynomial of the copy, takes the first plurality of values of the sequence to form an encryption set H, enables xi to be epsilon with H when generating data combination, uploads the intelligent contract for storage after removing the encryption set H from the value sequence H, selects N values from the value sequence H by the intelligent contract every day, calculates the function values of the encryption polynomial, obtains N sample displays,
the time-limited encryption unit obtains all values to be displayed in the time-limited duration according to the preset time-limited duration, calculates an encryption polynomial function value corresponding to the value, records the value as a time-limited sample set, calculates a sample set corresponding to an encryption set h, records the sample set as an encryption sample set, generates a univariate polynomial, enables the univariate polynomial to pass through all sample points in the encryption sample set and the time-limited sample set, records the univariate polynomial as a substitute encryption polynomial, replaces N term coefficients in the substitute encryption polynomial with preset variables to obtain a transient polynomial, encrypts the transient polynomial by using a receiving public key, uploads the transient polynomial to a block chain for storage, polls the block chain by a bank in the time-limited duration, obtains the transient polynomial by decryption, reads N sample points displayed by an intelligent contract, calculates N term coefficients of the transient polynomial by using the N sample points, obtains the encryption polynomial, and obtains a copy of the operation data by using the encryption polynomial for decryption, and when the time limit duration is exceeded, the N sample points displayed by the intelligent contract cannot solve a correct substitute encryption polynomial, so that the time limit of decryption is realized.
5. The system for loan approval based on the time-limited sharing of business operations data according to claim 4,
the time-limited encryption unit is used for setting a special storage space for storing the copies, checking whether the copies with the same enterprise identification and the same date interval exist in the storage space after receiving a new operation data calling request, if so, acquiring all values to be displayed by an intelligent contract in a time-limited duration, calculating an encryption polynomial function value corresponding to the value, recording the encryption polynomial function value as a time-limited sample set, regenerating a substitution encryption polynomial according to the time-limited sample set and the encryption sample set, replacing N item coefficients in the regenerated substitution encryption polynomial by using preset variables to obtain a transient polynomial, and uploading the transient polynomial to a block chain for storage after being encrypted by using a new public key for receiving the calling request.
6. The system for loan approval based on the time-limited sharing of business administration data according to claim 1 or 2,
the approval unit establishes a daily product sales trend graph, daily average product sales, daily average sold amount and monthly average sold amount of an enterprise according to all acquired daily operation data packets, displays the daily product sales trend graph, the daily average sold amount and the monthly average sold amount of the enterprise to an approval person, and the approval person completes loan approval according to the operation data displayed by the approval unit and loan application materials submitted offline by the enterprise.
CN202210604663.9A 2022-05-31 2022-05-31 Loan approval system based on enterprise operation data time-limited sharing Active CN114693437B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210604663.9A CN114693437B (en) 2022-05-31 2022-05-31 Loan approval system based on enterprise operation data time-limited sharing

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210604663.9A CN114693437B (en) 2022-05-31 2022-05-31 Loan approval system based on enterprise operation data time-limited sharing

Publications (2)

Publication Number Publication Date
CN114693437A CN114693437A (en) 2022-07-01
CN114693437B true CN114693437B (en) 2022-09-16

Family

ID=82131209

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210604663.9A Active CN114693437B (en) 2022-05-31 2022-05-31 Loan approval system based on enterprise operation data time-limited sharing

Country Status (1)

Country Link
CN (1) CN114693437B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114881772B (en) * 2022-07-05 2022-09-23 浙江数秦科技有限公司 Loan processing method based on block chain
CN116450593B (en) * 2023-06-16 2023-09-01 杭州知享信息科技有限公司 Multi-department collaborative office data sharing method, system and storage medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110490723A (en) * 2018-05-15 2019-11-22 全球智能股份有限公司 Loan administration method and system under block chain
CN111161030A (en) * 2019-12-30 2020-05-15 山东爱城市网信息技术有限公司 Block chain-based dealer supply chain finance implementation method, equipment and medium
CN111768296A (en) * 2020-06-29 2020-10-13 江苏苏宁银行股份有限公司 Block chain-based small and micro enterprise loan approval method and device
CN114417391A (en) * 2022-03-31 2022-04-29 浙江数秦科技有限公司 Laboratory thesis certificate storage system based on block chain
CN114510737A (en) * 2022-04-21 2022-05-17 浙江数秦科技有限公司 Operation data time-limited open system based on block chain

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2020127100A (en) * 2019-02-03 2020-08-20 株式会社bitFlyer Blockchain Method for storing transaction representing asset transfer in distributed network having multiple nodes, program therefor, and node for configuring distributed network
CN113516473B (en) * 2021-07-23 2023-03-10 西南交通大学 Block chain escrow threshold wallet method based on biological characteristics

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110490723A (en) * 2018-05-15 2019-11-22 全球智能股份有限公司 Loan administration method and system under block chain
CN111161030A (en) * 2019-12-30 2020-05-15 山东爱城市网信息技术有限公司 Block chain-based dealer supply chain finance implementation method, equipment and medium
CN111768296A (en) * 2020-06-29 2020-10-13 江苏苏宁银行股份有限公司 Block chain-based small and micro enterprise loan approval method and device
CN114417391A (en) * 2022-03-31 2022-04-29 浙江数秦科技有限公司 Laboratory thesis certificate storage system based on block chain
CN114510737A (en) * 2022-04-21 2022-05-17 浙江数秦科技有限公司 Operation data time-limited open system based on block chain

Also Published As

Publication number Publication date
CN114693437A (en) 2022-07-01

Similar Documents

Publication Publication Date Title
CN114693437B (en) Loan approval system based on enterprise operation data time-limited sharing
EP0472521B1 (en) Information distribution system
CN102236766B (en) Security data item level database encryption system
US6523116B1 (en) Secure personal information card database system
CN1191643A (en) System and method for access control for data storage media
CN114510737B (en) Operation data time-limited open system based on block chain
CN102667845A (en) Electronic price-proposing system, electronic price-proposing device, and electronic price-proposing method
CN114638697B (en) Small loan management system based on block chain
US20140281576A1 (en) Information providing system, information processing apparatus, computer readable medium, and information providing method
US20200134205A1 (en) Data processing apparatus and data processing method for internet of things system
US8638938B2 (en) Symmetric key subscription
CN104182525B (en) Using the electronic records management device of the close algorithm of multimedia file and state for having copyright protection function
CN106022159A (en) ERP data processing method based on cloud computing
CN114757789A (en) Insurance claim settlement system based on block chain
CN117725626A (en) Real estate information security protection method and system based on security audit mechanism
JP4216914B2 (en) Network system
CN116450593B (en) Multi-department collaborative office data sharing method, system and storage medium
AU774704B2 (en) Electronic information inquiring method
CN114820175B (en) Loan purpose supervision method based on block chain
JPH1021302A (en) User's information collecting system
CN114785814A (en) File management system based on block chain
JP2000286831A (en) Method for managing key recovery right, its system and program recording medium
KR20220048880A (en) The safe and convenient method to transfer trade account receivable
CN114757766B (en) Poverty relief loan approval system based on block chain
JP7250390B1 (en) Data sharing system, data sharing method, and data sharing program

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
GR01 Patent grant
GR01 Patent grant