Systems and methods for compact recording protocols

By generating and storing hash tree roots of interactive data on the blockchain, the problem of easy forgery and tampering of records by central management agencies is solved, achieving secure and efficient recording and verification, and improving the trustworthiness and security of records.

CN116599677BActive Publication Date: 2026-11-17VISA INTERNATIONAL SERVICE ASSOCIATION
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202310584485.2
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2017-03-10
Publication Date
2026-11-17
Estimated Expiration
2037-03-10

AI Technical Summary

Technical Problem

In existing technologies, personal records maintained by central management agencies are easily forged and tampered with, and it is difficult to guarantee security and efficiency. The record verification and copying process is cumbersome, and current decentralized attempts are not secure or efficient enough.

Method used

By receiving the hash and interactive identifier of the interactive data from the computer, the root hash of the hash tree is generated and stored in the database and on the public blockchain, providing interactive verification services and utilizing the immutability and distributed nature of the blockchain for recording and verification.

Benefits of technology

It enables a secure and efficient recording and verification process, improves the trustworthiness and security of records, simplifies the verification process, and reduces the risk of records being forged and tampered with.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116599677B_ABST
    Figure CN116599677B_ABST
Patent Text Reader

Abstract

This disclosure relates to compact record protocols. The invention discloses a method for efficiently storing and verifying records. The method may include receiving a first hash of first interaction data, determining an interaction identifier associated with the first hash, then storing the first hash and the interaction identifier together in a database and determining the root hash of a hash tree. Additionally, the method may also include providing the root hash of the hash tree to a public blockchain. Embodiments of the invention also allow users to easily present records to third parties or querying entities. Furthermore, interactions can be processed faster than previous blockchain methods that publish to blocks during each individual interaction.
Need to check novelty before this filing date? Find Prior Art

Description

[0001] This application is a divisional application of the invention patent application entitled "Compact Recording Agreement", with an international filing date of March 10, 2017, international application number PCT / US2017 / 021870, and Chinese national phase application number 201780088189.6. Background Technology

[0002] In today's technological environment, governments or other central agencies typically track important documents and records about individuals. These central agencies may maintain paper records or electronic records in centralized databases. The documents and records created by these central agencies are generally considered trustworthy and can be used by others to verify information about individuals. Individuals are responsible for ensuring the security of their records, or must contact the relevant central agency if they wish to have their records copied or submitted to a third party.

[0003] For example, when an individual is born, a birth certificate is created for that person, proving that he or she was born at a specific time and place. This birth certificate can then be used to verify the individual's citizenship and issue them a government ID and Social Security number. The government ID and Social Security number can later be submitted to a bank to verify the individual's identity and issue them a bank account. Funds deposited into the bank account and the credit extended to the individual can be used by the individual to make transactions using debit and credit cards that bear or store user credentials. Typically, user credentials are linked to the individual, and transactions made using these credentials are recorded in a central database as a means of providing official accounting records. These records can be referenced later to verify fund transfers between the transacting parties. Furthermore, if an individual wishes to travel internationally, they may provide a birth certificate, government ID, and / or Social Security card to government agencies to obtain a passport, which is then used to record and verify the individual's travel activities.

[0004] In all the examples above, criminals can still alter or forge records, a problem requiring significant financial and human resources to address. Furthermore, records maintained by a central authority whose trustworthiness is based on the trustworthiness of the central governing body, which could act maliciously. Moreover, record security is difficult to guarantee, potentially leading to identity theft. Records can also be lost, destroyed, or tampered with. Verification and / or duplication of records can be cumbersome, as central governing bodies typically have only a limited number of locations to serve the large number of individuals seeking to obtain and / or create records. Meanwhile, current attempts to maintain decentralized records have proven insufficient in terms of the security and efficiency required for practical use.

[0005] The embodiments of the present invention address these and other problems individually and collectively. Summary of the Invention

[0006] Embodiments of this disclosure relate to systems and methods for securely and efficiently recording and verifying data.

[0007] One embodiment of the present invention relates to a method comprising receiving, by a computer, first interaction data or a first hash of the interaction data of a first interaction between a user and an interactive entity, and determining an interaction identifier associated with the first interaction data or the first hash of the first interaction data. The method may further comprise storing, by the computer, the first hash of the first interaction data together with the interaction identifier in a database, and determining a root hash of a hash tree, the hash tree including the hash of the first interaction data and hashes of other interaction data of other interactions with other users. Additionally, the method may further comprise providing the root hash of the hash tree to a public blockchain by the computer.

[0008] Another embodiment of the present invention relates to the above-described method, further comprising a computer receiving a request from a query device to verify an interaction between a user and an interactive entity, and providing a verification result or a root hash, the verification result indicating that an interaction between the user and the interactive entity has occurred. Furthermore, the method may include determining a first hash from first interaction data in the verification request, using the first hash and hashes of other interaction data from other users to determine a hash tree, and determining a root hash. The method may also include a computer comparing the root hash with a corresponding root hash on a public blockchain and providing a verification result based on the comparison.

[0009] Another embodiment of the present invention relates to a server computer configured to perform the above-described methods.

[0010] Another embodiment of the present invention relates to an interactive device for interacting with a user device. The interactive device includes: a processor; a network interface coupled to the processor; and a non-transient computer-readable medium coupled to the processor. The computer-readable medium includes code for instructing the processor to implement a method comprising: receiving interactive data from a user's user device; generating a hash of the interactive data; sending a request to a server computer to generate a record, the request including the interactive data or the hash of the interactive data; and receiving a response from the server computer confirming the record of the interactive data or the hash of the interactive data, wherein the server computer stores the interactive data or the hash of the interactive data in a database and then provides the root hash of a hash tree to a public blockchain, the hash tree including the hash of the interactive data and hashes of other interactive data from other interactions with other users.

[0011] These and other embodiments of the invention are described in further detail below. Attached Figure Description

[0012] Figure 1A block diagram of a system for recording and verifying interactions according to an embodiment of the present invention is shown.

[0013] Figure 2 A block diagram of a processing server computer according to an embodiment of the present invention is shown.

[0014] Figure 3 An illustration of a data storage device according to an embodiment of the present invention is shown.

[0015] Figure 4 A swimlane diagram recording interactions is shown according to an embodiment of the present invention.

[0016] Figure 5 A swimlane diagram for verifying interactions is shown according to an embodiment of the present invention. Detailed Implementation

[0017] Embodiments of the present invention relate to a system for recording and verifying interactions.

[0018] Before discussing the details of some embodiments of the present invention, a description of some terms may help to understand the various embodiments.

[0019] A "server computer" can comprise a powerful computer or cluster of computers. For example, a server computer can be a mainframe, a small cluster of computers, or a group of servers operating like cells. In one example, a server computer can be a database server coupled to a web server. A server computer may be coupled to a database and may contain any hardware, software, other logic, or a combination of the foregoing for serving requests from one or more client computers. A server computer may include one or more computing devices and may use any of a variety of computing architectures, arrangements, and compilations to serve requests from one or more client computers.

[0020] An "application server" can be any computing device configured to provide remote support for a user device. An application server can be associated with a set of computer-executable instructions (e.g., a mobile application) installed on and executed from the user device. An application server can provide any appropriate services and / or processing to the user device. For example, an application server can perform calculations on behalf of the user device. In some embodiments, an application server can maintain accounts for one or more users. In some cases, an application server may be able to generate electronic identities for individuals, which can be used to authenticate individuals during interactions. An application server may also store any protocols and / or user preferences related to the operation of the user device.

[0021] "User equipment" can be any electronic device capable of establishing a communication session with another electronic device (e.g., an application server) and transmitting / receiving data from said device. User equipment may include the ability to download and / or execute mobile applications. User equipment may include mobile communication devices (e.g., mobile phones), personal computers, laptops, wearable devices, and / or Internet of Things (IoT) devices, such as smart TVs, refrigerators, thermostats, etc. Other examples of user equipment may include mobile vehicles (e.g., cars, motorcycles, ships, etc.) with remote communication capabilities.

[0022] "Mobile communication device" can be any portable electronic device with primary communication-related functions. For example, a mobile communication device can be a smartphone, a personal data assistant (PDA), or any other suitable handheld device.

[0023] A "blockchain" can be a distributed database that maintains a constantly growing list of records to prevent tampering and revision. A blockchain can contain multiple blocks of interacting records. Each block in a blockchain can also contain a timestamp and a link to the previous block. For example, each block can contain or be appended to a hash of the previous block. In other words, transaction records in a blockchain can be stored as a series of "blocks" or a persistent file containing records of several transactions that occurred within a given time period. After a block is completed and verified, it can be appended to the blockchain by the appropriate node. In embodiments of the invention, the blockchain can be distributed, and a copy of the blockchain can be maintained at each node in the verification network. Any node in the verification network can then use the blockchain to verify transactions. The security of the blockchain can be achieved using cryptographic schemes.

[0024] A "block header" can be the header of a data block in a blockchain. The block header can be serialized in an 80-byte format and then hashed as part of the blockchain's block writing algorithm. The block header can include memory allocation for the block version number and a link to the previous block to ensure that the previous block is not altered while the current block header is being changed. The block header can also include a Merkle root, derived from all hashes of all interactions or transactions contained in the block, ensuring that any recorded interaction data cannot be modified without modifying the block header. The block can also include a timestamp specifying the time when the processing computer began writing the block header.

[0025] A hash tree can be a data structure comprising multiple hashes organized into a hierarchical tree structure. The hashes contained within a hash tree can be concatenated and further hashed in a specified order to produce a root hash that can be referenced later. For example, a hash tree can be organized according to a binary tree structure. A Merkle tree can be a hash tree constructed by hashing paired data, then pairing and hashing the results until a single root hash is still retained, with the remaining root hash being the Merkle root.

[0026] A "Merkle root" can be the root node or root hash of a Merkle tree, as well as a descendant of all hash pairs in the tree. In a given blockchain, each block header of each block in the blockchain may need to include a valid Merkle root derived from all transactions or interactions in that block.

[0027] A "cryptographic key" can be any bit string used by cryptographic algorithms to transform plaintext into ciphertext or ciphertext into plaintext. A cryptographic key can contain both symmetric and asymmetric keys. The cryptographic key can be used to sign and / or verify signed transactions. For example, a private key can be used to sign a cryptocurrency transaction. The signed transaction can then be verified using the public key corresponding to the private key.

[0028] An “electronic identity” can be any suitable string of characters or symbols used to identify an entity (e.g., an individual or device). In some embodiments, an electronic identity can be derived mathematically from information associated with a user. For example, in some embodiments, an electronic identity can be a value calculated by hashing one or more input values ​​(customer name, country code, etc.) available to multiple entities. In this way, an electronic identity can be independently generated by any entity with prerequisite information. An electronic identity can be information associated with a user that has been altered (e.g., hashed and / or encrypted). For example, in some embodiments, an electronic identity can be derived from a combination of a country code, customer name, date of birth, and the last four digits of a social security number, such as SHA256 (USA*JOHNSMITH*19700101*1234). Hashting this value may result in a seemingly random string, such as 754WD2E2513BF546050C2D079FF5D65AB6E318E, which could be an electronic identity. In some embodiments, an electronic identity is associated with a password provided for accessing any interaction records associated with the electronic identity. Electronic identity is sometimes referred to as “eID”, electronic identifier, or electronic identification data.

[0029] An “electronic record” can be any record of one or more transactions or interactions stored electronically. For example, an electronic record may include a plurality of interaction records associated with an electronic identity. In some embodiments, an electronic record can be compiled by identifying each interaction record recorded in a distributed environment associated with a particular electronic identity. In some embodiments, an electronic record may include a portion generated by a user associated with an electronic identity and signed using a private key associated with said user. In some embodiments, an electronic record may be in the form of a blockchain or may be included in a blockchain.

[0030] An “interaction log” can be any indication of a transaction or interaction that occurs between a user associated with an electronic identity and another entity. Examples of interactions can include entering a building, accessing a transportation area, accessing sensitive data, making a payment transaction, voting, etc. Interaction logs can include verifiable information related to the parties involved and the interaction that occurred.

[0031] A "private key" is a cryptographic key that is kept secret by one party. Public and private keys can be used in public-private encryption schemes or digital signature schemes such as Public Key Infrastructure (PKI).

[0032] A "public key" can be a type of cryptographic key distributed to an entity or available for use by an entity (rather than the party holding the corresponding private key). In some embodiments, the key may be publicly available, while in others it may be distributed among specific nodes in a network. The public key can be used to encrypt or verify information, depending on the encryption scheme.

[0033] The term "verification" and its derivatives can refer to the process of using information to determine whether underlying subject matter is valid under a given set of conditions. Verification can involve any comparison of information to ensure that certain data or information is correct, valid, accurate, legitimate, and / or credible. In some examples of verification described in this disclosure, electronic records may be signed using a private key and verified using a public key.

[0034] A "verification network" can be any set of nodes (computer systems and components) configured to provide verification of transactions. A verification network may include a distributed computing environment utilizing several nodes interconnected via communication links using one or more computer networks or direct connections. A verification network can be implemented on any suitable network, including intranets, the Internet, cellular networks, local area networks, or any other such networks or combinations thereof. In some embodiments, each node in the verification network may be a computing device belonging to a particular group or organization.

[0035] Details of some embodiments of the present invention will now be described.

[0036] Figure 1A block diagram of a system 100 according to an embodiment of the present invention is shown. System 100 may include a user device 102, which a user 101 may use to interact with other devices within system 100. Interaction can occur through the use of an application stored on the user device 102, which may be supported by an application server 110. For example, the application may be an electronic passport application, a digital wallet application, a mobile banking application, an electronic ticketing application, or any other application that can be used for interaction and / or recording user activity.

[0037] System 100 may also include an interaction device 121A for facilitating interactions or transactions between user 101 and interaction entity 120A. Examples of interaction device 121A may include a POS terminal, personal computer, self-service machine, mobile device, or any other device capable of generating, transmitting, and receiving data to and from user device 102 during interaction with user 101. Interaction device 121A may include an interaction API 122A for performing tasks during the interaction, such as generating, receiving, or transmitting interaction data according to embodiments of the present invention. For example, interaction API 122A may be software provided to interaction entity 120A by a payment processing network or mobile application developer, so that interaction entity 120A can accept payments from user 101. Examples of interaction entity 120A may include merchants, government agencies, transportation providers, individual users, etc.

[0038] System 100 may further include a query device 121B, which may be a device for querying and / or verifying records according to embodiments of the present invention. Query device 121B may include a query API 122B to perform tasks during record verification, such as generating a query or verification request according to embodiments of the present invention. Query device 122B may be a query entity 120B, which may be any entity seeking interaction to verify records. Examples of query entity 120B may include government agencies, banks, merchants, payment processors, real estate developers, etc.

[0039] According to embodiments of the present invention, interactive device 121A and query device 121B can communicate with one or more processing server computers, such as a first processing server computer 141 and an nth processing server computer 142, via network 130. The first processing server computer 141 can maintain one or more databases, such as a first database 141, and similarly, the nth processing server computer 142 can maintain one or more databases, such as an nth database 142. According to one embodiment, the one or more processing server computers can be a payment processing network, such as VisaNet. System 100 may also include a blockchain 150, which can be a publicly distributed database or ledger composed of encrypted data blocks. Any number of devices in system 100, such as application server 110, user device 102, interactive device 122A, query device 121B, first processing server computer 141, and / or nth processing server computer 142, can store at least a portion of the blockchain 150. Each block in the blockchain 150 may contain data related to one or more interactions, references to a set of interactions, or hashes thereof. Each block in Blockchain 150 can be unique, immutable, and verifiable across devices in System 100.

[0040] According to an embodiment of the present invention, user 101 can first register an account by establishing communication with application server 110 using user device 102. This can be accomplished by an application stored on user device 102 provided and / or supported by application server 110. The application can be used to store data identifying user 101 on user device 102. The data identifying user 101 may include information unique to the user, such as name, address, telephone number, social security number, email address, etc., and / or its hash. The data identifying user 101 can be securely stored on user device 102 using hardware and / or software security modules, for example, by managing digital authentication keys and / or password processing. The application may further include instructions for receiving and transmitting data related to the interaction performed between user 101 and interaction entity 120A, such as timestamps, interaction locations, interaction identifiers, issuer identifiers, account identifiers, user IDs, transaction IDs, transaction amounts, device IDs, eIDs, merchant category codes, and / or their hashes.

[0041] During interaction, user 101 may present user device 102 to interaction device 121A of interaction entity 120A. The interaction may be initiated by user 101 and / or interaction entity 120A, and interaction device 121A may generate a request for data from user 101. The data request may be transmitted from interaction device 121A to user device 102. Communication between user device 102 and interaction device 121A can be achieved through any number of data transmission methods, such as any contactless (e.g., Bluetooth, NFC, RFID, WiFi, etc.) or electrical contact connection. For example, user device 102 may include an NFC chip, and interaction device 121A may be coupled to or include an NFC reader, and data can be transmitted to and received from user device 102 when it is in close proximity to the reader. User device 102 may receive data requests from interaction device 121A by executing instructions stored in an application stored in user device 102. For example, user device 102 could be a mobile device running a passport application, and user 101 could be a passenger undergoing security screening at an airport. In this example, interaction entity 120A could be a security agency, and could request user 101 to transmit its identification data from user device 102 to interaction device 121A for access to the terminal.

[0042] User equipment 102 can be configured to receive requests for data and to generate and transmit a response including the requested data. For example, user equipment 102 can be configured to receive a request for an electronic identity or eID identifying user 101, and can be further configured to transmit the eID to interactive device 121A in a data response message. In one embodiment, the transmission of the requested data can be initiated by a representation of user 101's authentication data, such as a biometric sample or password.

[0043] Interaction device 121A can be configured to receive requested data from user equipment 102 and can be further configured to transmit interaction data and / or its hash associated with the interaction to a processing server computer, such as a first processing server computer 141 or an nth processing server computer 142. In one embodiment, the interaction can be generated as interaction records, which are digitally signed by the parties involved using a digital signature cryptographic scheme. Interaction device 121A can generate, hash, and transmit the interaction data to the processing server computer via network 130 by executing instructions provided by interaction API 122A. The processing server computer can receive the interaction data and / or the hash of the interaction data and can store the interaction data in a database, such as a first database 141 or an nth database 142. The processing server computer can then further determine an interaction identifier associated with the interaction data or the hash of the interaction data and can store the interaction identifier in the database and link it to the interaction data. For example, the processing server computer can be a government server computer that can store the names, dates of birth, addresses, flight details, and interaction timestamps of flight passengers. Hashes can be linked by the processing server computer to interactive identifiers that can be referenced later at a later point in time.

[0044] The first processing server computer 141 and / or the nth processing server computer 142 may also be configured to determine the root hash of a hash tree. The hash tree may include hashes of first interaction data for a first interaction (i.e., the interaction between user 101 and interaction entity 120A) and hashes of other interaction data for other interactions performed by other users. In one embodiment, the other interaction data for other interactions performed by other users may be data corresponding to interactions performed at a similar time and place as the first interaction. The processing server computer may receive interaction data or hashes of interaction data and may store the interaction data in a database, such as the first database 141 or the nth database 142. The root hash may be the hash of the stored hashes that constitute the hash tree and may be provided by the first processing server computer 141 or the nth processing server computer 142 to a public blockchain so that the hash tree can be referenced at a later time. The root hash may, for example, be associated with a Merkle root in the header of a block that can be written to the blockchain 150. Blockchain 150 can then be updated, and the update can be broadcast or transmitted to one or more nodes that store at least a portion of a copy of blockchain 150. For example, the update can be transmitted to application server 110, which can update its copy of blockchain 150, and the update can be transmitted to user device 102.

[0045] At a later point in time, query entity 120B may wish to query or verify one or more interactions performed by user 101. For example, query entity 120B may be a government agency wishing to verify the identity and travel activities of user 101. Query entity 120B may request or ask user 101 to provide proof of their identity and may use query device 121B to query, retrieve, and verify records related to the interactions performed by user 101. The interaction may be one in which user 101 passes through a security checkpoint or passport control area, and the hash of the interaction data may have been stored in a database such as first database 141 or nth database 142. The hash may be further hashed into a root hash by other interactions performed with other users, and these hashes may have been published to blockchain 150 by first processing server computer 141 or nth processing server computer 142.

[0046] According to an embodiment of the present invention, user 101 may use user equipment 102 to provide and send identification data to query device 121B. The requested data may be, for example, an electronic record of a previous interaction and may include interaction data, including first interaction data or a hash thereof for a first interaction between user 101 and interaction entity 121A. Query device 121B may be configured to receive interaction data or a hash of interaction data, generate a verification request message including the interaction data or the hash of interaction data, and send the verification request to a processing server computer, such as a first processing server computer 141 or an nth processing server computer 142. The processing server computer may receive the verification request message including the interaction data or the hash of interaction data and may determine and / or identify the hash. For example, the processing server computer may read the data contained in the verification request message and may identify that the data corresponds to the hash "05901ALSKDJF12" linked to the interaction ID "2142512".

[0047] The processing server computer can then use this hash, along with other hashes of other interactive data corresponding to other users, to determine the hash tree. For example, the processing server computer can query a database to find hashes of other interactive data and compare the queried hashes with a mapping table specifying the order in which the first hash and the queried hash are hashed together. The processing server computer can then retrieve the queried hashes and hash them according to the hashing order of the hash tree to determine the root hash. For example, the processing server computer can determine whether the first and second hashes should be hashed together by concatenating hashes and inputting them into SHA256(). The processing server computer can further determine that the output obtained by hashing the first and second hashes should be input into SHA256() along with the hashes of the third and fourth hashes to output the root hash.

[0048] The root hash can then be compared with the corresponding root hash on blockchain 150. If a data block containing the determined root hash exists on blockchain 150, the interaction data can be considered verified. Otherwise, if no root hash exists on blockchain 150, the interaction data may be invalid and therefore unverified. The verification result based on the comparison can be generated by the processing server computer and sent to the query device 121B.

[0049] According to an alternative embodiment, the processing server computer can be configured to send the determined root hash to the query device 121B, and the query device 121B can compare the received root hash with blockchain 150 or a portion of blockchain 150 to determine if a match exists, and thus determine the verification result.

[0050] Figure 2 A block diagram of a processing server computer according to an embodiment of the present invention is shown. The processing server computer 200 may be configured to process and verify, for example... Figure 1 The first processing server computer 141 and the nth processing server computer 142 are any processing server computer whose interaction records are recorded. The processing server computer 200 may include a processor 210 for processing or executing instructions stored in a computer-readable medium 230. The processing server computer 200 may also include one or more network interfaces 220, which may act as a connection between the processing server computer 200 and a network (such as...). Figure 1 The software and / or hardware interface for connection points between other nodes in the network (130).

[0051] Computer-readable medium 230 may be a non-transient computer component that can be coupled to processor 210 and can store instructions executable by said processor. For example, computer-readable medium 230 may be a memory, such as random access memory (RAM) or read-only memory (ROM), which includes code for implementing methods according to embodiments of the present invention. Computer-readable medium 230 may include one or more modules, such as a communication module 230A, an authorization module 230B, a hashing module 230C, a mapping module 230D, a root determination module 230E, a block writing module 230F, a tree determination module 230G, and a verification module 230H. Processing server computer 200 may also be coupled to one or more databases, such as a secure database 200A and a public blockchain 200B. Secure database 200A may be, for example, Figure 1The first database 141 or the nth database 142 can be configured to only process data stored on the server computer 200 before it is written to the public blockchain 200B. The secure database 200A can be, for example, a relational database. The public blockchain 200B can be, for example, a relational database. Figure 1 It is a public, distributed database of blockchain 150, and can include immutable data that can be verified by network nodes.

[0052] According to an embodiment of the present invention, the communication module 230A may include instructions for receiving, generating, formatting, and transmitting standardized messages through the network interface 220. For example, the communication module 230A may include instructions for receiving messages including interactive data, and may also include instructions for receiving verification request messages and sending verification response messages related to the interaction of querying records.

[0053] The authorization module 230B may include instructions for authorizing interactions based on a set of predetermined criteria. For example, the authorization module 230B may include logic for accepting or rejecting the receipt of interaction records by assessing relevant risks and / or comparing interaction data with known characteristics of illegal activities.

[0054] Hash module 230C may include instructions for hashing interactive data or hashes of interactive data using a hashing algorithm. For example, hash module 230C may include instructions for inputting a first hash and a second hash into SHA256() to output an intermediate hash. Hash module 230C may also include instructions for inputting an intermediate hash of the first hash and the second hash into SHA256() in addition to the intermediate hashes of the third hash and the fourth hash, to produce the root hash of the hash tree. The hash tree may be a tree of hashes (such as a Merkle tree) and may include the first, second, third, and fourth hashes and their intermediate hashes stored in the secure database 200A.

[0055] Mapping module 230D may include instructions for determining an interaction identifier associated with received interaction data or a hash of the interaction data. Mapping module 230D may also include instructions for determining identifiers of hashed interaction data and linking them to each other in a mapping table or relational database. For example, mapping module 230D may include instructions for assigning identifiers to a first hash of first interaction data, and may also include instructions for assigning identifiers to intermediate hashes of first and second interaction data. Mapping module 230D may store the hashes of the interaction data and their intermediate hashes in columns of a database table, and may link each hash to its assigned identifier in another column of the database table. Mapping module 230D may also include instructions for determining how a given set of identifiers is hashed together to form a given hash tree, such as “ID1+ID2=ID5; ID3+ID4=ID6; ID5+ID6=ID7.” According to one embodiment, the mapping table determined by mapping module 230D may be stored in a secure database such as secure database 200A.

[0056] The root determination module 230E may include executable instructions for the instruction processing server computer 200 to determine the root hash of a given hash tree. For example, the root determination module 230E may include instructions for determining multiple hashes of a mapping table and hashing them together according to the order specified by the mapping module 230D to produce the root hash. The root hash may later be associated with the Merkle root included in the header of a block in the public blockchain.

[0057] The block writing module 230F may include executable instructions for publishing data to a blockchain (e.g., a public blockchain 200B). For example, the block writing module 230F may include instructions for providing the root hash of the hash tree to the public blockchain. The root hash can be provided to the blockchain by associating it with a Merkle root included in the header of the newly generated block. The header of the new block may further include the hash of the previous block (i.e., the Merkle root stored in the header of the previous block) and a transaction timestamp. The block writing module 230F may include instructions for generating a new block, determining the Merkle root of the previous or most recent block in the blockchain, and determining a timestamp based on the current time. The block writing module 230F may also include instructions for writing data, such as a timestamp, the root hash, and the Merkle root of the previous block, to the header of the new block, and instructions for broadcasting the new block over the network.

[0058] The tree determination module 230G may include instructions for determining a hash tree using received hashes. For example, the processing server computer 200 may receive a verification request message including interactive data or hashes of interactive data, and the tree determination module 230G may include instructions for referencing a mapping table of intermediate hashes of a set of hashes for other interactive data and / or hashes of other interactive data. The processing server computer 200 may further use the received hashes and the intermediate hashes of that set of hashes and / or hashes of other interactive data to determine the hash tree, and may determine the root hash of the hash tree. According to one embodiment, the tree determination module 230G may determine the root hash of the hash tree by concatenating hashes and inputting them into SHA256().

[0059] Verification module 230H may include instructions for comparing data to produce a verification result. For example, verification module 230H may include instructions for comparing the determined root hash of the determined hash tree with the corresponding root hash on a public blockchain such as public blockchain 200B. Verification module 230H may also include instructions for providing a verification result based on the comparison, in which a first interaction between the user and the interacting entity is considered verified if the comparison produces a match. In one embodiment, verification module 230H may include instructions for providing the determined root hash to a querying device, enabling the querying entity to perform a comparison and determine a match. The verification result and / or the root hash may be included in a verification response message.

[0060] Figure 3 An illustration of a data storage device according to an embodiment of the present invention is shown. Figure 3 Multiple interaction data for multiple interactions are illustrated, such as interaction data 301A, 301B, 301C, 301D, 305A, 305B, 305C, 305D, 309A, 309B, 309C, and 309D. According to embodiments of the invention, each of the multiple interaction data can be hashed and stored in a database. For example, an interactive device can perform a first set of interactions with a first group of users and can generate hashes for each corresponding interaction data, such as hashes 301a, 301b, 301c, and 301d. The hashes can be transmitted by the interactive device to a first processing server computer and stored in a first database, such as database 301X. The first processing server computer can further generate intermediate hashes from the stored hashes, such as intermediate hashes 301ab and 301cd. The first processing server computer can then concatenate and hash intermediate hashes 301ab and 301cd to generate a root hash 301.

[0061] Once the root hash 301 is generated, the first processing server computer can provide root hash 301 to block 301Y of the public blockchain. Block 301Y may include a block header 301H, which may include links to the previous block 310 and the Merkle root 311. The Merkle root may include one or more reference hashes, such as reference 303, reference 302, and root hash 301, each of which may refer to one or more recorded transactions or transactions performed or processed by other interacting entities or by the processing computer using the public blockchain. Reference hashes may represent individual hashes of individual transactions, groups of transactions, or any representative data associated with interactions with one or more interacting entities. This may include root hashes published to the public blockchain, as explained in the description contained herein, or may also include any other hashed data published to the blockchain by some other means that may not be discussed herein but may still represent publicly verifiable data. According to one embodiment, references 303, 302, and root hash 301 can be hashed together in a Merkle tree to produce a Merkle root 311. Embodiments of the invention can allow the root of hash tree 301 to be incorporated into a typical blockchain with hashes of individual transaction data, thus making the embodiments of the invention adaptive and flexible.

[0062] The interactive device can engage in a second set of interactions with a second group of users and can generate hashes for each corresponding interaction data, such as hashes 305a, 305b, 305c, and 305d. These hashes can be transmitted by the interactive device to a second processing server computer and stored in a second database, such as database 305X. The second processing server computer can further generate intermediate hashes from the stored hashes, such as intermediate hashes 305ab and 305cd. The second processing server computer can then concatenate and hash the intermediate hashes 305ab and 305cd to generate the root hash 305.

[0063] Once the root hash 305 is generated, the second processing server computer can provide the root hash 305 to block 305Y of the public blockchain. Block 305Y may include a block header 305H, which may include a link to the previous block 311. The link to the previous block 311 may be the Merkle root 311 included in the block header 301Y of the previous block. The block header 305Y may further include a Merkle root 312. The Merkle root 312 of block 305Y may include one or more reference hashes, such as reference 306, root hash 305, and reference 304. According to one embodiment, reference 306, root hash 305, and reference 304 may be hashed together in the Merkle tree to produce the Merkle root 312.

[0064] The interactive device can engage in a third set of interactions with a third group of users and can generate hashes for each corresponding interaction data, such as hashes 309a, 309b, 309c, and 309d. These hashes can be transmitted by the interactive device to a third processing server computer and stored in a third database, such as database 309X. The third processing server computer can further generate intermediate hashes from the stored hashes, such as intermediate hashes 309ab and 309cd. The third processing server computer can then concatenate and hash the intermediate hashes 309ab and 309cd to generate the root hash 309.

[0065] Once the root hash 309 is generated, the third processing server computer can provide the root hash 309 to block 309Y of the public blockchain. Block 309Y may include a block header 409H, which may include a link to the previous block 312. The link to the previous block 312 may be the Merkle root 312 included in the block header 305Y of the previous block. The block header 305Y may further include a Merkle root 313. The Merkle root 313 of block 309Y may include one or more reference hashes, such as root hash 309, reference 308, and reference 307. According to one embodiment, root hash 309, reference 308, and reference 308 may be hashed together in the Merkle tree to produce Merkle root 313.

[0066] When a querying entity wants to verify whether an interaction has occurred and is valid, it can use a querying device to generate a verification request message. The verification request may include interaction data corresponding to an interaction subjected to a query or its hash. In one embodiment, the querying device receives the interaction data or a hash of the interaction data from a user's user device. The querying device can then send the message to a processing server computer, such as... Figure 2 The processing server computer 200 sends a verification request message that includes interactive data or a hash of the interactive data. The processing server computer can receive the verification request message and can determine and / or identify the hash from the data contained therein. For example, the processing server computer can receive the verification request message and determine that the verification request message includes hash 301a, which can be linked to a specific transaction ID or interactive identifier. In an alternative embodiment, the processing server computer can receive the interactive data in the verification request message and can input the interactive data into SHA256() to determine hash 301a.

[0067] The processing server computer can then use hash 301a and the hashes of other interactive data to determine the hash tree. For example, the processing server computer can query a mapping table to determine a list of transaction IDs linked to other hashes of other interactive data for other users' interactions included in the hash tree that includes hash 301a. The processing server computer can determine that the hash tree including hash 301a also includes hash 301b, hash 301c, hash 301d, and intermediate hashes. The processing server computer can then determine the root hash of the determined hash tree. For example, the processing server computer can concatenate hash 301a and hash 301b and input them into SHA256() to produce hash 301ab. The processing server computer can also concatenate hash 301ab and hash 301cd and input them into SHA256() to produce root hash 301.

[0068] The processing server computer can then determine the verification result by comparing the determined root hash with the corresponding root hash on the public blockchain. In one embodiment, the processing server computer can query or scan the public blockchain to discover blocks that include headers containing the Merkle root associated with the determined root hash. For example, the processing server computer can scan the public blockchain and determine that the Merkle root 311 of block 301Y is associated with root hash 301. The processing server computer can then compare the data associated with the block to determine whether the block includes a root hash that matches the determined root hash. For example, the processing server computer can compare each character of the determined root hash 301 with each character in each of the reference hashes 303, 302, 301 to determine a match. According to one embodiment, the processing server computer can also determine whether other data in the data block matches the expected result, such as links to previous blocks. It is understood that additional verification checks, such as checksum verification and digital signature verification, can also be performed.

[0069] If the determined root hash matches the corresponding root hash on the public blockchain, a "verified" verification result can be generated. Otherwise, a "no match" or "invalid data" verification result may be generated. The processing server computer can generate a verification response message including the verification result and can send the verification response message to the querying device so that the querying entity can take appropriate action. According to one embodiment, the verification result may include the determined root hash, and the querying device can receive the determined root hash and compare it with the public blockchain to determine the verification result.

[0070] Figure 4 A swimlane diagram recording interactions is shown according to an embodiment of the present invention. Specifically, Figure 4This describes the data transmission and storage between user 401, user device 402, application server 410, interaction device 421A, processing server computer 440, and blockchain 450. User 401, user device 402, application server 410, interaction device 421A, processing server computer 440, and blockchain 450 can respectively correspond to user 101, user device 102, application server 110, interaction device 121A, first processing server computer 141 or nth processing server computer 142, and... Figure 1 Blockchain 150.

[0071] according to Figure 4 User 401 initiates a first interaction by providing or transmitting information to their user device 402 in S401. For example, user device 402 may be a mobile device, and user 401 may open an application stored on the device to input information related to the interaction into provided data fields. For example, the application may be a mobile voting application that provides data fields in the form of a ballot displayed to the user and allows the user to enter or select the name of a candidate they wish to vote for. User device 402 may receive the information conveyed by user 401 and may generate data from the received information.

[0072] In step S402, user equipment 402 can determine from the information provided by user 401 that user S401 intends to initiate an interaction, and can generate and send an interaction request message to interaction device 421A. For example, user 401 can determine that user 401 has made a voting choice, and can then generate an interaction request message and send it to interaction device 421A, so that the user's vote can be cast or recorded.

[0073] Interactive device 421A can receive interaction request messages and can request interactive data from user equipment 402 by sending a data request message in S403. For example, interactive device 421A can be a voting machine that can receive voting requests and can continue to send requests to obtain necessary interactive data such as voter identification and vote selection.

[0074] In S404, user equipment 402 can receive a data request message and request credentials from user 401 for authentication. For example, user equipment 402 can prompt user 401 to provide their biometric identification so that they can access the identification data required for interaction. In S405, user 401 can then provide their credentials to user equipment 402. For example, user 401 can present their biometric sample (e.g., fingerprint reader, forward-facing camera, etc.) to the biometric reader of user equipment 402. In S406, user equipment 402 can receive user 401's credentials and authenticate them based on their validity. For example, user equipment 402 can generate a biometric sample template from the biometric sample presented by user 401 and compare the biometric sample template with a stored biometric reference template to determine a match (e.g., using facial recognition, voice recognition software, etc.). If the template matches within a predetermined threshold, the credentials can be considered valid, and user 401 is authenticated.

[0075] In S407, when authenticating user 401, user equipment 402 may generate and transmit a data response message including the requested interaction data to interaction device 421A. For example, user equipment 402 may generate a data response message including user 401's name, address, identification number, and voting selection, and may transmit the data response message to interaction device 421A. In one embodiment, the interaction device may include logic to initiate an action based on the received interaction data. For example, interaction device 421A may include logic for verifying user data and / or logic for incrementing a counter value (e.g., a vote count for a specific candidate). In other examples, interaction device 421A may include logic for granting access to an entry point, opening a door, providing resources such as food or consumer goods, providing services, etc.

[0076] In S408, the interactive device 421A can receive a data response message and generate a hash of the interactive data contained therein. In one embodiment, the interactive device 421A may include an API or software that can receive the interactive data contained in the data response message and input the interactive data into a hash algorithm such as SHA256(). For example, the interactive device 421A can hash the user's name, address, identification number, and voting choice by concatenating and inputting them into a hash algorithm to obtain "90172AKLSD3JG9023U59S135", with a hash algorithm such as SHA256 ("John Smith", "5703Bishops Glen Ct.Houston, TX 77084", "893-34-3243", "Candidate A"). In S409, the interactive device 421A can submit the hash of the interactive data to the processing server computer 440 for recording.

[0077] The processing server computer 440 can receive the hash of the interaction data and can determine the interaction identifier in S410. The processing server computer 440 can then link the determined interaction identifier to the hash of the interaction data. In one embodiment, the processing server computer 440 can also generate a timestamp based on the current time and can link the timestamp to the hash of the interaction data. For example, the processing server computer 440 can link the interaction identifier "vote: 32352" and the timestamp "2020-11-03T03:30:38Z" to the hash "90172AKLSD3JG9023U59S135" in a relational database.

[0078] In S411, the processing server computer 440 can store the hash in a secure database. After several other interactions are performed at the interaction device 421A and stored by the processing server computer 440, the processing server computer 440 can generate a hash tree in S412, including the hash of the interaction data from the first interaction and the hashes of the interaction data from other interactions. The processing server computer 440 can then determine the root hash of the hash tree in S413. In S414, the processing server computer 440 can provide the root hash to the blockchain 450 so that the interactions contained in the hash tree can be verified later. In S415, the root hash can be published to the blockchain 450, and the updated blockchain can be broadcast to nodes of the blockchain network, including the application server 410.

[0079] Figure 5 A verified swimlane diagram according to an embodiment of the present invention is shown. Figure 5Verification can be performed between user equipment 502, query device 521B, processing server computer 540, and public blockchain 550, which can respectively correspond to Figure 1 User equipment 102, query device 121B, first processing server computer 141 or nth processing server computer 142, and blockchain 150.

[0080] according to Figure 5 In S501, query device 521B can send a data request message requesting interactive data to be verified. For example, query device 521B, used to verify appropriate records of a vote, can request interactive data relating to a specific vote cast from user equipment 502. In S502, user equipment can receive the data request message and can generate and transmit a data response message including the interactive data or a hash of the interactive data to query device 521B. For example, the data response message can include the string "90172AKLSD3JG9023U59S135", which can be a hash of the user's name, address, identification number, and voting choice, SHA256 ("John Smith", "5703Bishops Glen Ct.Houston, TX 77084", "893-34-3243", "Candidate A"). Query device 521B can receive the data response message and can generate a verification request message including a hash of the interactive data. In S503, query device 521B can send the verification request message to processing server computer 540.

[0081] In S504, the processing server computer 540 can receive the verification request message and can determine or identify the hash contained therein. In one embodiment, the processing server computer 540 can query a database to discover the interaction identifier linked to the received hash. For example, the processing server computer 540 can receive the hash "90172AKLSD3JG9023U59S135" in the verification request message and can query a relational database to determine that the hash is linked to the interaction identifier "vote: 32352".

[0082] In S505, the processing server computer 540 can use the identified hash and other hashes of other interaction data from other interactions with other users to determine the hash tree. For example, the processing server computer 540 can query a relational database and determine that the interaction identifier "vote: 32352" is included in a hash tree that also includes "vote: 12425", "vote: 24242", and "vote: 30023". "In S506, the processing server computer 540 can determine the root hash by hashing the received hash of the queried interaction data together with other hashes in the determined hash tree. In one embodiment, the root hash of the hash tree can be determined by referring to a mapping table. For example, the processing server computer 540 can refer to a table and determine the root hash by inputting the hashes into the hash algorithm in the following order: 'Vote: 12425 + Vote: 24242 = k29350; Vote: 32352 + Vote: 30023 = 125jp3; k29350 + 125jp3 = Root Hash = 102JKJ1293.'"

[0083] In S507, the processing server computer 540 can query or scan the public blockchain 550 to compare the determined root hash with the corresponding root hash on the blockchain 550. In S508, the processing server computer 540 can determine the block on the blockchain that includes the determined root hash. In S509, the processing server computer 540 can compare the data in the determined data block with the expected data to determine the verification result. For example, the processing server computer 540 can determine that the Merkle root and timestamp contained in the block header match the expected values ​​and can determine a "verified" verification result. In S510, the processing server computer 540 can generate and send a verification response message including the verification result to the query device 521B. The query device 521B can receive the verification response message including the verification result to take appropriate action. For example, the query device 521B can receive the verification response message and can display the verification result on the display of the query device 521B. According to one embodiment, the verification response message may include a defined root hash, and the querying device may compare the root hash with blockchain 550 for verification.

[0084] Embodiments of the present invention offer several technical advantages over existing technologies because they provide a secure and efficient method for recording information or data. Specifically, according to embodiments of the invention, data is decentralized and can be publicly verified while being privately stored on a user's device. Embodiments of the invention also allow users to easily present records to third parties or querying entities in a manner that does not require copying files or requiring users to establish trust with a central authority. Furthermore, the data recording methods taught by the embodiments of the invention offer greater security compared to centralized methods because they are less susceptible to injection attacks or less likely to expose or exploit data in unwanted ways. Moreover, by storing multiple hashes of the interaction data locally before recording it to the blockchain and hashing them together to the root hash of the hash tree, interactions can be processed much faster than previous blockchain methods that publish to blocks during each individual interaction. This can be used in retail environments or any environment where several interactions are expected to occur within a relatively short period of time (e.g., thousands of transactions or interactions per second).

[0085] It should also be understood that any embodiment of the present invention may be implemented using hardware (e.g., application-specific integrated circuits or field-programmable gate arrays) and / or computer software in the form of control logic, wherein the general-purpose programmable processor is modular or integrated. As used herein, the processor comprises a single-core processor, a multi-core processor on the same integrated chip, or multiple processing units on a single circuit board or networked thereon. Based on this disclosure and the teachings provided herein, those skilled in the art will know and understand other ways and / or methods of implementing embodiments of the present invention using hardware and combinations of hardware and software.

[0086] Any software component or function described in this application may be implemented as software code to be executed by a processor using any suitable computer language such as Java, C, C++, C#, Objective-C, Swift, or a scripting language such as Perl or Python, employing techniques such as conventional or object-oriented methods. The software code may be stored as a series of instructions or commands on a computer-readable medium for storage and / or transmission. Suitable media include random access memory (RAM), read-only memory (ROM), magnetic media such as hard disk drives or floppy disks, or optical media such as optical discs (CDs) or digital versatile discs (DVDs), flash memory, and the like. The computer-readable medium may be any combination of such storage or transmission means.

[0087] Such programs can also be encoded and transmitted using carrier signals adapted for transmission via wired, optical, and / or wireless networks conforming to various protocols, including the Internet. Therefore, computer-readable media according to embodiments of the invention can be created using data signals encoded with such programs. Computer-readable media encoded with program code can be packaged with compatible devices or provided separately from other devices (e.g., downloaded via the Internet). Any such computer-readable medium can reside on or within a single computer product (e.g., a hard disk drive, CD, or an entire computer system) and can exist on or within different computer products within a system or network. The computer system may include a monitor, printer, or other suitable display for providing any of the results mentioned herein to a user.

[0088] The above description is illustrative and not restrictive. Many variations of the invention will become apparent to those skilled in the art upon reading this disclosure. Therefore, the scope of the invention should not be determined by reference to the above description, but rather by reference to the pending claims and their full scope or equivalents.

[0089] Without departing from the scope of the invention, one or more features of any embodiment may be combined with one or more features of any other embodiment.

[0090] Unless explicitly indicated otherwise, the use of “a / an” or “the” is intended to mean “a / one or more / a kind”.

[0091] All patents, patent applications, publications, and descriptions mentioned above are incorporated herein by reference in their entirety for all purposes. They are not recognized as prior art.

Claims

1. A method for verifying an interaction, the method comprising the following steps: The query device transmits a request to the computer to verify a first interaction between the user and the interactive entity, the request including first interaction data or a first hash of the first interaction data, wherein the computer is programmed to: The first hash is determined based on the request to verify the first interaction; Determine the first interaction identifier of the first hash; Using a mapping table, the interaction identifier of the first hash is used to determine other interaction identifiers of the hashes of other interaction data; Determine the hash associated with the other interaction identifiers; According to the instructions in the mapping table, an intermediate hash is formed by hashing at least the first hash and the hash of the other interaction data of other interactions performed by other users, and then at least the intermediate hash is hashed to form a second root hash. Compare the second hash with the first hash on the public blockchain; as well as In response to a comparison between the second hash and the first hash, a verification result is provided to the querying device, the verification result indicating that the first interaction between the user and the interaction entity has occurred; as well as The query device receives the verification result from the computer.

2. The method of claim 1, further comprising: The interactive device transmits first interaction data for the first interaction between the user and the interactive entity, or the first hash of the first interaction data for the first interaction between the user and the interactive entity, to the computer. The computer includes a mapping module, the mapping module including the mapping table, wherein the computer is further programmed to: (i) Determine the first interaction identifier associated with the first interaction data or the first hash of the first interaction data; (ii) Store the first hash of the first interaction data together with the first interaction identifier in the database; (iii) Determine the first root hash of the first hash tree, the first hash tree including the first hash of the first interaction data and the hash of the other interaction data of the other interactions of the other users, and intermediate hashes based on the first hash and the hashes of the other interaction data; (iv) Storing and linking the first interaction identifier and the first hash associated with the first interaction data in the mapping table, the mapping table further comprising a first column having hashes including the first hash and the hashes of the other interaction data, and a second column having interaction identifiers including the first interaction identifier and the other interaction identifiers, the hashes in the first column being linked to the interaction identifiers in the second column, and instructions for determining how to hash the hashes associated with the first interaction identifier and the other interaction identifiers together in the formation of the first hash tree; as well as (v) Provide the first root hash of the first hash tree to the public blockchain.

3. The method of claim 1, wherein the request to verify the first interaction between the user and the interaction entity includes the first interaction data.

4. The method of claim 1, wherein the request to verify the first interaction between the user and the interaction entity includes the first hash of the first interaction data.

5. The method of claim 1, wherein the first interaction identifier and the other interaction identifiers are transaction identifiers.

6. The method of claim 1, wherein the steps are performed sequentially.

7. The method of claim 1, wherein the query device is operated by a government agency or a merchant.

8. The method according to claim 1, wherein the computer is a processing server computer.

9. The method of claim 1, wherein determining the first hash comprises inputting the first hash and the hashes of the other interaction data performed by the other users into a hash algorithm in an order specified by the mapping table.

10. The method of claim 1, wherein the first interaction is a payment transaction.

11. The method according to claim 1, wherein the interactive entity is a merchant.

12. A system comprising: The query device includes: Network interface; Processor; and A non-transitory computer-readable medium, the non-transitory computer-readable medium including code for instructing a processor to implement a method, the method comprising: A request is transmitted to a computer to verify a first interaction between a user and an interactive entity, the request including first interaction data or a first hash of the first interaction data, wherein the computer is programmed to: The first hash is determined based on the request to verify the first interaction; Determine the first interaction identifier of the first hash; Using a mapping table, the interaction identifier of the first hash is used to determine other interaction identifiers of the hashes of other interaction data; Determine the hash associated with the other interaction identifiers; According to the instructions in the mapping table, an intermediate hash is formed by hashing at least the first hash and the hash of the other interaction data of other interactions performed by other users, and then at least the intermediate hash is hashed to form a second root hash. Compare the second hash with the first hash on the public blockchain; and In response to a comparison of the second hash and the first hash, a verification result is provided to the querying device, the verification result indicating that the first interaction between the user and the interacting entity has occurred; and Receive the verification result from the computer.

13. The system of claim 12, wherein the first interaction identifier is a transaction ID.

14. The system of claim 12, wherein the request to verify the first interaction between the user and the interaction entity includes the first interaction data.

15. The system of claim 12, wherein the request to verify the first interaction between the user and the interaction entity includes the first hash of the first interaction data.

16. The system of claim 12, further comprising the computer.

17. The system of claim 16, wherein the computer is further programmed to: The computer receives first interaction data, or a first hash of the first interaction data, for the first interaction between the user and the interactive entity from the interactive device, and transmits the data to the computer, which includes a mapping module comprising the mapping table. Determine the first interaction identifier associated with the first interaction data or the first hash of the first interaction data. The first hash of the first interaction data is stored together with the first interaction identifier in the database. Determine the first root hash of the first hash tree, the first hash tree including the first hash of the first interaction data and the hash of the other interaction data of the other interactions of the other users, and intermediate hashes based on the first hash and the hashes of the other interaction data; The mapping table stores and links the first interaction identifier and the first hash associated with the first interaction data, as well as other interaction identifiers and hashes of the other interaction data. The mapping table also includes a first column with hashes, which includes the first hash and the hashes of the other interaction data, and a second column with interaction identifiers, which includes the first interaction identifier and the other interaction identifiers. The hashes in the first column are linked to the interaction identifiers in the second column, and instructions are provided for determining how to hash the hashes associated with the first interaction identifier and the other interaction identifiers together in the formation of the first hash tree. as well as Provide the first root hash of the first hash tree to the public blockchain.

18. An interactive device for interacting with a user equipment, the interactive device comprising: processor; A network interface coupled to the processor; as well as A non-transitory computer-readable medium coupled to the processor, the non-transitory computer-readable medium including code for instructing the processor to implement a method, the method comprising: Receive interactive data from the user's user device; Generate a hash of the interaction data; Sending a request to the server computer to generate a record, the request including the interaction data or a hash of the interaction data; and The server computer receives a response confirming the interaction data or the hash of the interaction data, wherein the interaction data or the hash of the interaction data is stored in a database by the server computer before the root hash of the hash tree is provided to the public blockchain, and the hash tree includes the hash of the interaction data and hashes of other interaction data from other interactions performed by other users.

19. The interactive device according to claim 18, wherein the interactive device is a terminal.

20. The interactive device of claim 18, wherein the non-transitory computer-readable medium includes predetermined logic for authorizing access to resources based on the interactive data.

Citation Information

Patent Citations

  • Method and apparatus of data authentication

    CN105593872A

  • Method and system for computing code management platform

    WO2015026664A1