TW201824134A - Decentralized electronic transaction recording method and system thereof with traceability verification mechanism in which only the newest hash value of the last transaction data is maintained - Google Patents

Abstract

The present invention provides a decentralized electronic transaction recording method and system thereof with a traceability verification mechanism. In the method mentioned above, when configuring a plurality of transaction data, the hash value of the previous transaction data of the target transaction data is added to the next target transaction data to configure the hash value of the next transaction data to form a tightly configured blockchain transaction record. The transaction data is stored in one or a plurality of user ends and only the newest hash value of the last transaction data is maintained.

Description

   Decentralized electronic transaction record method and system with traceability verification mechanism   

The invention relates to a method and system for electronic transaction records, in particular to a decentralized method and system for electronic transaction records with a traceable verification mechanism.

With the continuous evolution of online trading technology and usage habits, more and more users are used to conducting various electronic transactions through the Internet. Compared with the traditional transaction mode, since the transaction information of electronic transactions is relatively easy to be modified, providing reliable transaction records is a fundamental element to ensure the operation of electronic transactions.

For example, in some more sensitive electronic transactions, such as e-commerce, bank transfer operations, stock transactions, etc., both parties conducting electronic transactions need to retain various data in the transaction process in order to facilitate the transaction. When disputes are used as the basis for arbitration, it is also very important to ensure that transaction records are not tampered with.

In summary, how to provide a solution that can solve the foregoing problems is a technical problem that needs to be solved in the art.

In order to solve the problem of previous disclosure, the object of the present invention is to provide a non-centralized electronic transaction record technical solution with a traceable verification mechanism.

To achieve the above object, the present invention proposes a block diagram of a decentralized electronic transaction record system with a traceable verification mechanism. The generator included in the foregoing system is to configure the hash value of the previous transaction data of the target transaction data plus the target transaction data to configure the hash value of the next transaction data when configuring a plurality of transaction data to form a tightly-configured transaction data. Blockchain transaction records.

To achieve the above object, the present invention proposes a decentralized electronic transaction record method with a traceable verification mechanism. The aforementioned method includes the following steps: when configuring a plurality of transaction data, the hash value of the previous transaction data of the target transaction data is added to the target transaction data to configure the hash value of the next transaction data to form a tightly arranged blockchain transaction Record.

In summary, the decentralized electronic transaction record method and its system with traceable verification mechanism in this case allocate the hash value of the next transaction data by adding the hash value of the previous transaction data of the target transaction data and the target transaction data. It is able to generate a tightly configured blockchain transaction record, and can provide more secure transaction record information.

1‧‧‧ Decentralized electronic transaction record system with traceable verification mechanism

11‧‧‧ generator

12‧‧‧Storage Module

13‧‧‧Verification Module

2‧‧‧Bank side

3‧‧‧Client

FIG. 1 is a block diagram of a decentralized electronic transaction record system with a traceable verification mechanism according to a first embodiment of the present invention.

Figure 2 shows the flow chart of the client's query of transaction records.

Figure 3 is a flowchart of a client-side storage transaction in this case.

Figure 4 is a schematic diagram of the hash configuration of the transaction data in this case.

The following describes specific embodiments to illustrate the implementation of the present invention, but it is not intended to limit the scope of the present invention.

Please refer to FIG. 1, which is a block diagram of a decentralized electronic transaction record system 1 with a traceable verification mechanism according to a first embodiment of the present invention. The generator 11 included in the foregoing system is to configure the hash value of the previous transaction data of the target transaction data plus the target transaction data to configure the hash value of the next transaction data when configuring a plurality of transaction data to form a tight configuration. Blockchain transaction records.

In another embodiment, the aforementioned system further includes a storage module 12 and a verification module 13 connected to the generator 11. The aforementioned generator 11, storage module 12, and verification module 13 can be implemented by software modules or digital circuits running on the processor.

In another embodiment, the historical data of the transaction data is excluded from being stored on the server. In another embodiment, the transaction data of the aforementioned system is stored in a distributed manner in one or more clients 3. In another embodiment, the aforementioned system only retains the new hash value of the last transaction data after calculation.

In another embodiment, the verification module 13 of the aforementioned system verifies the forward calculation of the transaction data by sequentially hashing the hash values.

This case is a second embodiment of a decentralized electronic transaction record method with a traceable verification mechanism. This method includes the following steps: when configuring a plurality of transaction data, the hash value of the previous transaction data of the target transaction data is added to the target transaction data to configure the hash value of the next transaction data to form a tightly configured blockchain transaction Record.

In another embodiment, the historical data of the transaction data is excluded from being stored on the server. In another embodiment, the transaction data of the aforementioned method is stored in one or more clients 3 in a distributed manner. In another embodiment, the aforementioned method retains only the last transaction data.

In another embodiment, the aforementioned method further includes a verification procedure, and the verification procedure verifies the transaction data forward calculation by sequentially hashing the hash values in series.

In the following, the present invention is exemplified by the decentralized electronic transaction record system 1 with a traceable verification mechanism in the first embodiment, but the decentralized electronic transaction record method with a traceable verification mechanism in the second embodiment can also achieve The same or similar technical effects are specifically explained.

In an implementation example, the decentralized electronic transaction record system 1 with a traceable verification mechanism in this case runs on a server and uses a hash function to concatenate the blockchain as a financial account record of various bank accounts to achieve The uniqueness of transaction records and the difficulty of preventing tampering with records.

When the aforementioned system generator 11 (calculates the hash value and generates an electronic file) receives the transaction data from the bank 2 ①, it will make a hash value of the previous hash value in the storage module 12 and the latest transaction data to form a new hash value. The "block" is transmitted to the client 3 for display ③, and the calculated hash value is stored back in the storage module 12 to replace the previous value ②, in other words, the composition of each "block" will include the latest transaction The hash value of the message and the previous transaction record, so the generation of the hash block in each area has reconfirmed all the blocks in history (only one chain can create the next block that is valid after the hash), so it is not easy Tampered with. The storage module 12 is configured to store the latest hash transaction value as identification data.

When the client 3 transmits the demand for storing data ④, the generator 11 sends the last transaction record of all the transaction details returned as a hash value to the verification module 13 for comparison. Whether the hash value is equal to ⑤. When it is matched, the hash value and the transaction data of the transaction record value are respectively taken out, and the hash value is retained in the storage module 12. If there is a previous transaction record, it will continue to verify the transaction data, take the previous transaction record as the hash value, verify whether it is equal to the hash value in the storage module 12, and push back the transaction record hash value one by one to confirm the transaction. The information has not been tampered with. After verification, all transaction details are transmitted to the generator 11⑥, and the electronic file is generated and transmitted to the client 3 for storage. The purpose of data privacy and transmission security is achieved.

Please refer to FIG. 2, which is a flowchart showing the query history of the client 3. In the figure, the method receives a transaction data S101 from the bank 2 and checks whether a previous hash value (Hpre) S102 exists in the storage module 12. If not, the transaction record is the first data, and the server will This data is stored as a hash value in the storage module 12 and transmitted to the client 3 to display the transaction record S104. If the Hpre value already exists in the storage module 12, the generator 11 concatenates Hpre with this transaction record to form a new block as a hash value (Hpre + 1) and stores it in S103 in the storage module 12.

Please refer to FIG. 3, which is a flowchart of a client 3 storing a transaction. The steps are explained as follows:

S201: When the client 3 wants to send transaction record storage requirements, the client 3 will return all transaction records.

S202: The generator 11 compares the hash value in the storage module 12 with the hash value of the last transaction record returned to verify whether they are the same? If they are the same, execute S203; if they are different, execute S206.

S203: Take out the hash value and transaction data of the transaction record value, and keep the hash value in the storage module.

S204: Determine whether there is a previous transaction record? If yes, execute S207; if not, execute S205.

S205: All transaction records are converted into electronic files, and the files are returned to the client 3.

S206: Return error information to the client 3.

S207: The server will take the hash value of each transaction record and verify whether the hash value of each transaction record is equal to the hash value generated by concatenating the previous hash value with this data. If yes, execute S203; if not, execute S206.

In this case, a new hash value is created by using each transaction data and the hash value generated by the previous transaction record, and then concatenating each financial transaction record to form a closely related blockchain to ensure the continuity and integrity of transaction details.

Please refer to FIG. 4, which is a schematic diagram of hash configuration of transaction data. When the client 3 sends a query transaction query request to the server, the server returns the transaction record to the client 3 after the hash value calculation. At this time, the client 3 sends a request to store transaction records and sends all transaction details to the server. After the server verifies that the data is not suspected of tampering, it converts it to an electronic file and sends it back to the client 3 for retention.

To further explain, the server receives the transaction data from the bank 2 and checks whether the previous hash value (Hpre) exists in the storage module 12. If it exists, the generator 11 in the server connects Hpre to it. After the first transaction data from the bank 2 is formed, a new block is formed as a hash value (Hpre + 1) and stored in the storage module 12 and the transaction record is transmitted to the client 3 for display; if the storage module There is no hash value in 12. The first transaction data is directly hashed and stored and transmitted to the user terminal 3 for display.

If there is more than one transaction data, repeat step (1) until all the data is updated. The client sends a storage request to the server, and the server will verify all the transaction details sent. After confirmation, the generator 11 converts it into an electronic file and sends it back to the client 3 to provide the client 3 for storage.

The above detailed description is a specific description of a feasible embodiment of the present invention, but this embodiment is not intended to limit the patent scope of the present invention. Any equivalent implementation or change that does not depart from the technical spirit of the present invention should be included in Within the scope of the patent in this case.

Claims (10)

    A non-centralized electronic transaction record method with a traceable verification mechanism includes: when configuring a plurality of transaction data, adding a hash value of the previous transaction data of the target transaction data and the target transaction data to configure the next transaction The hash value of the data to form a tightly configured blockchain transaction record.         The decentralized electronic transaction record method with a traceable verification mechanism as described in claim 1, wherein the historical data of the transaction data is excluded from being stored on the server.         The decentralized electronic transaction record method with a traceable verification mechanism as described in claim 1, wherein the transaction data is stored decentrally in one or more clients.         As described in claim 1, the non-centralized electronic transaction record method with a traceable verification mechanism retains only the latest hash transaction record value of the last transaction data.         The decentralized electronic transaction record method with a traceable verification mechanism as described in claim 1, further includes a verification procedure, which uses the hash value serially connected to calculate the transaction data forward. verification.         A non-centralized electronic transaction record system with a traceable verification mechanism includes: a generator, when a plurality of transaction data are configured, a hash value of the previous transaction data of the target transaction data is added to the target transaction data to configure the following A hash value of the transaction data is used to form a tightly configured blockchain transaction record.         The decentralized electronic transaction record system with a traceable verification mechanism as described in claim 6, wherein the historical data of the transaction data is excluded from being stored on the server side.         The decentralized electronic transaction record system with a traceable verification mechanism as described in claim 6, wherein the transaction information is stored in a distributed manner in one or more clients.         As described in claim 6, the decentralized electronic transaction record system with a traceable verification mechanism retains only the latest hash transaction record value of the last transaction data.         As described in claim 6, the decentralized electronic transaction record system with a traceable verification mechanism further includes a verification module connected to the generator, and the verification module serially connects the hash value to the Transaction data is calculated back for verification.