CN110245944B - Receipt storage method and node based on user type - Google Patents

Receipt storage method and node based on user type Download PDF

Info

Publication number
CN110245944B
CN110245944B CN201910419176.3A CN201910419176A CN110245944B CN 110245944 B CN110245944 B CN 110245944B CN 201910419176 A CN201910419176 A CN 201910419176A CN 110245944 B CN110245944 B CN 110245944B
Authority
CN
China
Prior art keywords
transaction
receipt
user type
receipt data
key
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201910419176.3A
Other languages
Chinese (zh)
Other versions
CN110245944A (en
Inventor
刘琦
闫莺
魏长征
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Advanced New Technologies Co Ltd
Advantageous New Technologies Co Ltd
Original Assignee
Advanced New Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Advanced New Technologies Co Ltd filed Critical Advanced New Technologies Co Ltd
Priority to CN201910419176.3A priority Critical patent/CN110245944B/en
Publication of CN110245944A publication Critical patent/CN110245944A/en
Priority to PCT/CN2020/089382 priority patent/WO2020233422A1/en
Priority to PCT/CN2020/091409 priority patent/WO2020233630A1/en
Application granted granted Critical
Publication of CN110245944B publication Critical patent/CN110245944B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/38Payment protocols; Details thereof
    • G06Q20/382Payment protocols; Details thereof insuring higher security of transaction
    • G06Q20/3825Use of electronic signatures
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/38Payment protocols; Details thereof
    • G06Q20/382Payment protocols; Details thereof insuring higher security of transaction
    • G06Q20/3827Use of message hashing
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/38Payment protocols; Details thereof
    • G06Q20/382Payment protocols; Details thereof insuring higher security of transaction
    • G06Q20/3829Payment protocols; Details thereof insuring higher security of transaction involving key management
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/04Billing or invoicing

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Accounting & Taxation (AREA)
  • General Physics & Mathematics (AREA)
  • Finance (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • Economics (AREA)
  • Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
  • Storage Device Security (AREA)

Abstract

One or more embodiments of the present specification provide a user type-based receipt storage method and node, which may include: the first block link node receives the encrypted transaction; the first block chain node decrypts the transaction in a trusted execution environment and executes the obtained transaction content to obtain receipt data; the first block link point stores the receipt data, at least one receipt field of the receipt data is stored in a plain text form when a transaction initiator belongs to a preset user type, and the receipt data is stored in a cipher text form when the transaction initiator does not belong to the preset user type.

Description

Receipt storage method and node based on user type
Technical Field
One or more embodiments of the present specification relate to the field of blockchain technology, and in particular, to a receipt storage method and node based on user type.
Background
The blockchain technique is built on top of a transport network, such as a point-to-point network. Network nodes in a transport network utilize a chained data structure to validate and store data and employ a distributed node consensus algorithm to generate and update data.
The two biggest challenges in the current enterprise-level blockchain platform technology are privacy and performance, which are often difficult to solve simultaneously. Most solutions trade privacy for loss of performance or do not consider privacy much to pursue performance. Common encryption technologies for solving privacy problems, such as Homomorphic encryption (Homomorphic encryption) and Zero-knowledge proof (Zero-knowledge proof), have high complexity and poor universality, and may cause serious performance loss.
Trusted Execution Environment (TEE) is another way to address privacy concerns. The TEE can play a role of a black box in hardware, a code and data operating system layer executed in the TEE cannot be peeped, and the TEE can be operated only through an interface defined in advance in the code. In the aspect of efficiency, due to the black box property of the TEE, plaintext data is operated in the TEE instead of complex cryptography operation in homomorphic encryption, and the efficiency of the calculation process is not lost, so that the safety and privacy of a block chain can be improved to a great extent on the premise of small performance loss by combining with the TEE. The industry is concerned with TEE solutions, and almost all mainstream chip and Software consortiums have their own TEE solutions, including Software-oriented TPM (Trusted Platform Module) and hardware-oriented Intel SGX (Software Guard Extensions), ARM Trustzone (Trusted zone), and AMD PSP (Platform Security Processor).
Disclosure of Invention
In view of the above, one or more embodiments of the present specification provide a receipt storage method and node based on user type.
To achieve the above object, one or more embodiments of the present disclosure provide the following technical solutions:
according to a first aspect of one or more embodiments of the present specification, there is provided a receipt storing method based on a user type, including:
the first block link node receives the encrypted transaction;
the first block chain node decrypts the transaction in a trusted execution environment and executes the obtained transaction content to obtain receipt data;
the first block link point stores the receipt data, at least one receipt field of the receipt data is stored in a plain text form when a transaction initiator belongs to a preset user type, and the receipt data is stored in a cipher text form when the transaction initiator does not belong to the preset user type.
In accordance with a second aspect of one or more embodiments of the present specification, there is provided a receipt storage node based on user type, comprising:
a receiving unit that receives the encrypted transaction;
a decryption unit to decrypt the transaction in a trusted execution environment;
the execution unit executes the obtained transaction content in the trusted execution environment to obtain receipt data;
and the storage unit is used for storing the receipt data, when the transaction initiator belongs to a preset user type, at least one receipt field of the receipt data is stored in a plaintext form, and when the transaction initiator does not belong to the preset user type, the receipt data is stored in a ciphertext form.
According to a third aspect of one or more embodiments of the present specification, there is provided an electronic apparatus including:
a processor;
a memory for storing processor-executable instructions;
wherein the processor implements the method of the first aspect by executing the executable instructions.
According to a fourth aspect of one or more embodiments of the present description, a computer-readable storage medium is presented, having stored thereon computer instructions which, when executed by a processor, implement the steps of the method according to the first aspect.
Drawings
Fig. 1 is a schematic diagram of implementing privacy protection at block link points according to an exemplary embodiment.
FIG. 2 is a flow chart of a method for user type based receipt storage according to an exemplary embodiment.
FIG. 3 is a schematic diagram of creating an intelligent contract, provided by an exemplary embodiment.
FIG. 4 is a schematic diagram of invoking an intelligent contract, provided by an exemplary embodiment.
Fig. 5 is a schematic diagram of the functional logic for implementing a blockchain network via system contracts and chain code in accordance with an exemplary embodiment.
FIG. 6 is a block diagram of a user type based receipt store provided by an exemplary embodiment.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with one or more embodiments of the present specification. Rather, they are merely examples of apparatus and methods consistent with certain aspects of one or more embodiments of the specification, as detailed in the claims which follow.
It should be noted that: in other embodiments, the steps of the corresponding methods are not necessarily performed in the order shown and described herein. In some other embodiments, the method may include more or fewer steps than those described herein. Moreover, a single step described in this specification may be broken down into multiple steps for description in other embodiments; multiple steps described in this specification may be combined into a single step in other embodiments.
Blockchains are generally divided into three types: public chain (Public Blockchain), Private chain (Private Blockchain) and alliance chain (Consortium Blockchain). In addition, there are various types of combinations, such as private chain + federation chain, federation chain + public chain, and other different combinations. The most decentralized of these is the public chain. The public chain is represented by bitcoin and ether house, and the participators joining the public chain can read the data record on the chain, participate in transaction, compete for accounting right of new blocks, and the like. Furthermore, each participant (i.e., node) is free to join and leave the network and perform related operations. Private chains are the opposite, with the network's write rights controlled by an organization or organization and the data read rights specified by the organization. Briefly, a private chain can be a weakly centralized system with strictly limited and few participating nodes. This type of blockchain is more suitable for use within a particular establishment. A federation chain is a block chain between a public chain and a private chain, and "partial decentralization" can be achieved. Each node in a federation chain typically has a physical organization or organization corresponding to it; participants jointly maintain blockchain operation by authorizing to join the network and forming a benefit-related alliance.
Whether public, private, or alliance, a node in the blockchain network, upon executing a received transaction, generates corresponding receipt (receipt) data for recording receipt information associated with the transaction. Taking the ether house as an example, the receipt data obtained by the node executing the transaction may include the following:
a Result field indicating the execution Result of the transaction;
a Gas used field representing a Gas value consumed by the transaction;
a Logs field for representing a Log generated by the transaction, wherein the Log may further comprise a From field for representing an account address of an initiator of the call, a To field for representing an account address of an object (such as a smart contract) To be called, a Topic field for representing a subject of the Log, a Log data field for representing Log data, and the like;
an Output field, representing the Output of the transaction.
When the node executes each transaction contained in a certain block, the corresponding receipt data can be generated after each transaction is executed, and the node can organize the receipt data corresponding to each transaction contained in the block according to a predefined tree structure and processing logic to form a receipt tree. By organizing the generated receipt tree, the corresponding query or verification efficiency can be greatly improved when the receipt data is queried or verified. For example, in the ether house, the receipt tree is organized by using an mpt (media Patricia tree) structure, where a leaf of the receipt tree is a hash value of receipt data corresponding to each transaction included in the block, and a receipt tree root (receiptRoot) is a root hash sequentially generated upward according to the hash value of the receipt data at the leaf. Of course, other types of tree structures may be used in other blockchain networks.
Generally, receipt data generated after a transaction is executed is stored in a clear text form, so that anyone can see the contents of the receipt fields contained in the receipt data, and the setting and the capability of privacy protection are not provided. In some solutions where blockchains are combined with TEE (Trusted Execution Environment), receipt data needs to be stored in ciphertext form for privacy protection purposes.
For example, as shown in fig. 1, the first chunk node includes the conventional environment on the left (left in the figure) and the TEE, and the transaction submitted by the client (or other source) first enters the "transaction/query interface" in the conventional environment and then passes the transaction to the TEE for processing. The TEE is isolated from the normal environment. For example, when a transaction is encrypted, the transaction needs to be passed to the TEE for decryption into clear transaction content, so that the clear transaction content can be efficiently processed in the TEE and clear receipt data generated in the TEE while ensuring data security.
The TEE is a trusted execution environment that is based on a secure extension of the CPU hardware and is completely isolated from the outside. TEE was originally proposed by Global Platform to address the secure isolation of resources on mobile devices, providing a trusted and secure execution environment for applications parallel to the operating system. The Trust Zone technology of ARM realizes the real commercial TEE technology at the earliest. Along with the rapid development of the internet, the security requirement is higher and higher, and more requirements are provided for the TEE by mobile equipment, cloud equipment and a data center. The concept of TEE has also been developed and expanded at a high rate. The concept now referred to as TEE has been a more generalized TEE than the concept originally proposed. For example, server chip manufacturers Intel, AMD, etc. have introduced hardware-assisted TEE in turn and enriched the concept and characteristics of TEE, which have gained wide acceptance in the industry. The mention of TEE now is more generally directed to such hardware assisted TEE techniques. Unlike the mobile terminal, the cloud access requires remote access, and the end user is not visible to the hardware platform, so the first step of using the TEE is to confirm the authenticity and credibility of the TEE. Therefore, the current TEE technology introduces a remote attestation mechanism which is endorsed by a hardware manufacturer (mainly a CPU manufacturer) and ensures that a user can verify the TEE state through a digital signature technology. Meanwhile, the security requirement which cannot be met by only safe resource isolation is also met, and further data privacy protection is also provided. Commercial TEE including Intel SGX, AMD SEV also provide memory encryption techniques, limiting trusted hardware within the CPU, with the data of the bus and memory being ciphertext to prevent snooping by malicious users. For example, TEE technology such as intel's software protection extensions (SGX) isolates code execution, remote attestation, secure configuration, secure storage of data, and trusted paths for executing code. Applications running in the TEE are secured and are almost impossible to access by third parties.
Taking the Intel SGX technology as an example, SGX provides an enclosure (also called enclave), that is, an encrypted trusted execution area in memory, and a CPU protects data from being stolen. Taking the example that the first block link point adopts a CPU supporting SGX, a part of an area EPC (enclosure Page Cache, Enclave Page Cache, or Enclave Page Cache) may be allocated in the memory by using a newly added processor instruction, and data therein is encrypted by an Encryption engine mee (memory Encryption engine) in the CPU. The encrypted content in the EPC is decrypted into plaintext only after entering the CPU. Therefore, in the SGX, a user may not trust an operating System, a VMM (Virtual Machine Monitor), or even a BIOS (Basic Input Output System), and only need to trust the CPU to ensure that private data is not leaked. In practical application, the private data can be encrypted and then transmitted to the enclosure in a ciphertext form, and the corresponding secret key is transmitted to the enclosure through remote certification. Then, the operation is performed by using the data under the encryption protection of the CPU, and the result is returned in a ciphertext form. In this mode, not only can the powerful calculation be utilized, but also data leakage is not worried about.
In the related art, the entire contents of receipt data generated within a TEE are stored on a blockchain as data requiring privacy protection. The block chain is a data set organized by specific logics stored in a database of nodes. The database, as described later, may be a storage medium, such as a persistent storage medium, in physical carrier. In fact, the privacy protection requirements for receipt data are not the same for different users. For example, a part of users may pay relatively more attention to privacy protection, and then the receipt data generated by the transaction initiated by the user may be stored in a ciphertext form as much as possible; another portion of users may be relatively more interested in data availability, such as a desire to support retrieval operations on receipt data, to drive related processing operations, such as DAPP (Decentralized Application) clients, and the like.
The following describes the implementation process of an embodiment of the receipt storing method based on the user type according to the present application with reference to fig. 2:
in step 202, the first block link receives an encrypted transaction.
In one embodiment, a user may generate a transaction directly on a first blockchain node; alternatively, the user may generate a transaction on the client and send the transaction to the first blockchain node through the client; alternatively, the client may send the transaction to the second blockchain node and send the transaction to the first blockchain node by the second blockchain node.
The transactions in this specification may be used to implement relatively simple processing logic, such as transfer logic similar to that of the related art. At this point, the transaction may be unrelated to the smart contract.
The transactions in this specification may also be used to implement relatively complex processing logic, which may be implemented here by means of the smart contracts described above. An intelligent contract on a blockchain is a contract that can be executed on a blockchain system triggered by a transaction. An intelligent contract may be defined in the form of code.
Taking the ethernet as an example, the support user creates and invokes some complex logic in the ethernet network, which is the biggest challenge of ethernet to distinguish from bitcoin blockchain technology. The core of the ethernet plant as a programmable blockchain is the ethernet plant virtual machine (EVM), each ethernet plant node can run the EVM. The EVM is a well-behaved virtual machine, which means that a variety of complex logic can be implemented through it. The user issuing and invoking smart contracts in the etherhouse is running on the EVM. In fact, what the virtual machine directly runs is virtual machine code (virtual machine bytecode, hereinafter referred to as "bytecode"). The intelligent contracts deployed on the blockchain may be in the form of bytecodes.
For example, as shown in fig. 3, after Bob sends a transaction containing information to create an intelligent contract to the ethernet network, the EVM of node 1 may execute the transaction and generate a corresponding contract instance. The "0 x6f8ae93 …" in fig. 3 represents the address of the contract, the data field of the transaction holds the byte code, and the to field of the transaction is empty. After agreement is reached between the nodes through the consensus mechanism, this contract is successfully created and can be invoked in subsequent procedures. After the contract is created, a contract account corresponding to the intelligent contract appears on the blockchain and has a specific address, and the contract code is stored in the contract account. The behavior of the intelligent contract is controlled by the contract code. In other words, an intelligent contract causes a virtual account to be generated on a blockchain that contains a contract code and an account store (Storage).
As shown in fig. 4, still taking an ethernet house as an example, after Bob sends a transaction for invoking an intelligent contract to the ethernet house network, the EVM of a certain node may execute the transaction and generate a corresponding contract instance. The from field of the transaction in fig. 2 is the address of the account of the transaction initiator (i.e., Bob), the "0 x6f8ae93 …" in the to field represents the address of the smart contract called, and the value field is the value of tai-currency in the etherhouse, and the data field of the transaction holds the method and parameters for calling the smart contract. The intelligent contract is independently executed at each node in the blockchain network in a specified mode, and all execution records and data are stored on the blockchain, so that after the transaction is completed, transaction certificates which cannot be tampered and cannot be lost are stored on the blockchain.
It can be seen that when a transaction is used to create a smart contract, the transaction content may include the code of the smart contract that needs to be created; when a transaction is used to invoke a smart contract, the transaction content may include the account address of the invoked smart contract, the methods and parameters that need to be passed in, and so on.
Step 204, the first blockchain node decrypts the transaction in the trusted execution environment and executes the obtained transaction content, so as to obtain the receipt data.
In one embodiment, by encrypting the transaction content, the encrypted transaction can be in a privacy protection state, and the transaction content is prevented from being exposed. For example, the transaction content may include information such as an account address of the transaction initiator and an account address of the transaction target, and the encryption process may ensure that none of the transaction content can be directly read.
In an embodiment, the transaction may be encrypted by a symmetric encryption algorithm or may be encrypted by an asymmetric encryption algorithm. The encryption algorithm used for symmetric encryption is, for example, DES algorithm, 3DES algorithm, TDEA algorithm, Blowfish algorithm, RC5 algorithm, IDEA algorithm, etc. Examples of asymmetric encryption algorithms are RSA, Elgamal, knapsack Algorithm, Rabin, D-H, ECC (elliptic curve encryption Algorithm), etc.
In one embodiment, the transaction may be encrypted by combining a symmetric encryption algorithm with an asymmetric encryption algorithm. Taking the example that the client submits the transaction to the first blockchain node, the client may encrypt the transaction content using a symmetric encryption algorithm, that is, encrypt the transaction content using a key of the symmetric encryption algorithm, and encrypt the key used in the symmetric encryption algorithm using an asymmetric encryption algorithm, for example, encrypt the key used in the symmetric encryption algorithm using a public key of the asymmetric encryption algorithm. Therefore, after the first block chain node receives the encrypted transaction, the first block chain node can firstly decrypt by using the private key of the asymmetric encryption algorithm to obtain the key of the symmetric encryption algorithm, and then decrypt by using the key of the symmetric encryption algorithm to obtain the transaction content.
When the transaction is used to invoke a smart contract, it may be an invocation of multiple nested structures. For example, a transaction directly calls intelligent contract 1, while the code of intelligent contract 1 calls intelligent contract 2, and the code in intelligent contract 2 points to the contract address of intelligent contract 3, so that the transaction actually indirectly calls the code of intelligent contract 3. The specific implementation process is similar to the above process, and is not described herein again.
As previously described, the transaction received by the first blockchain node may be, for example, a transaction that creates and/or invokes a smart contract. For example, in an ethernet, after receiving a transaction sent by a client to create and/or invoke an intelligent contract, a first block node may check whether the transaction is valid, whether the format is correct, whether a signature of the transaction is valid, and the like.
Typically, the nodes in the Etherhouse are also accounting contested nodes, and thus the first blockchain node can perform the transaction locally as accounting contested node. If one of the nodes competing for accounting rights wins the current round of accounting rights, the node becomes the accounting node. If the first block link point wins the accounting right in the current round, the first block link point becomes an accounting node; of course, if the first block link point does not win in the process of competing for accounting rights in the current round, it is not an accounting node, and other nodes may become accounting nodes.
An intelligent contract is similar to a class in object-oriented programming, with the result of execution generating a contract instance corresponding to the intelligent contract, similar to generating an object corresponding to a class. Executing code in the transaction to create the intelligent contract creates a contract account and deploys the contract in the account space. In the etherhouse, the address of the intelligent contract account is generated by an encryption algorithm by taking the address of the sender (e.g., "0 xf5e …" in fig. 3-4) and a transaction random number (nonce) as input, such as the contract address "0 x6f8ae93 …" in fig. 3-4, i.e., by the address of the sender "0 xf5e …" and the nonce in the transaction.
In general, in a blockchain network supporting intelligent contracts using consensus algorithms such as Proof of Work (POW) and Proof of equity (POS), Proof of commission (DPOS), nodes competing for accounting rights may execute a transaction including creation of an intelligent contract after receiving the transaction. One of the nodes competing for the accounting right wins the accounting right in the current round of the accounting right competition, and becomes the accounting node. The accounting node may package the transaction containing the smart contract with other transactions and generate a new block, and send the generated new block to other nodes for consensus.
For a block chain network supporting an intelligent contract by using a Practical Byzantine Fault Tolerance (PBFT) mechanism and the like, nodes with the accounting right are already agreed before accounting in the current round. Therefore, after the first block link node receives the transaction, if the first block link node is not the accounting node of the current round, the transaction can be sent to the accounting node. For the accounting node of the current round (which may be the first blockchain node), the transaction may be performed during or before the process of packaging the transaction and generating the new tile, or during or before the process of packaging the transaction with other transactions and generating the new tile. After the accounting node packages the transaction (or packages other transactions together) and generates a new block, the generated new block or a block header is sent to other nodes for consensus.
As described above, in the blockchain network supporting the intelligent contract using the POW mechanism or the blockchain network supporting the intelligent contract using the POS, DPOS, or PBFT mechanisms, the accounting node in the current round may package the transaction and generate a new block, and send the block header after the generated new block to other nodes for consensus. If the other nodes verify that no problem exists after receiving the block, the new block can be added to the tail of the original block chain, so that the accounting process is completed, and consensus is achieved; and if the transaction is used for calling the intelligent contract, the calling and executing of the intelligent contract are finished. Other nodes may also perform transactions in the block while verifying the new block or block header sent by the accounting node.
As described above, by executing the decrypted transaction content in the TEE, the execution process may be assured of being completed within the trusted environment to ensure that private information is not revealed. When the transaction with the privacy processing requirement is used for creating the intelligent contract, the transaction comprises the code of the intelligent contract, and the first block link point can decrypt the transaction in the TEE to obtain the code of the intelligent contract contained in the transaction and further execute the code in the TEE. When the transaction requiring privacy processing is used for invoking the intelligent contract, the first block link point may execute the code in the TEE (if the invoked intelligent contract handles the encryption state, the intelligent contract needs to be decrypted in the TEE to obtain the corresponding code). Specifically, the first block link point may allocate a part of the area EPC in the memory by using a processor instruction newly added in the CPU, and encrypt the plaintext code by using an encryption engine MEE in the CPU and store the plaintext code in the EPC. The encrypted content in the EPC enters the CPU and is decrypted into plaintext. And in the CPU, the operation is carried out on the code of the plaintext, and the execution process is completed. For example, in SGX technology, the EVM may be loaded into the enclosure by executing the plaintext code of the smart contract. In the remote certification process, the key management server can calculate a hash value of the local EVM code, compare the hash value with the hash value of the EVM code loaded in the first block chain link point, and correctly use a comparison result as a necessary condition for passing the remote certification, thereby completing measurement of the code loaded on the SGX enclosure of the first block chain node. Measured, the correct EVM can execute the code of the intelligent contract described above in the SGX.
And step 206, storing the receipt data by the first block chain link point, wherein when the transaction initiator belongs to a preset user type, at least one receipt field of the receipt data is stored in a plaintext form, and when the transaction initiator does not belong to the preset user type, the receipt data is stored in a ciphertext form.
In one embodiment, the user has a corresponding external account on the blockchain and initiates a transaction or performs other operations based on the external account. Then, the preset user type to which the transaction initiator belongs, that is, the preset user type to which the external account belongs. Therefore, the first block link point may determine an external account corresponding to the transaction initiator, and query a user type corresponding to the external account recorded on the block link to serve as the user type to which the transaction initiator belongs.
In one embodiment, the external account may include a Type field (e.g., a Type field) recorded on the blockchain, the value of the Type field corresponding to the user Type. For example, when the value of the type field is 00, the user type is a normal user, when the value of the type field is 01, the user type is a premium user, and when the value of the type field is 11, the user type is a management user. Therefore, the first block link point may determine the corresponding user type based on the value by reading the type field of the external account.
In one embodiment, when creating the external account, the user type may be configured to be associated with the external account, so that the association relationship between the user type and the external account is recorded in the blockchain, for example, the association relationship is established by the user type and the account address of the external account, so that the data structure of the external account does not need to be changed, i.e., the external account does not need to include the type field. Therefore, the first block link point may determine the preset user type corresponding to the external account based on the external account corresponding to the transaction initiator by reading the association relationship recorded on the block chain.
In an embodiment, the user type of the external account may be modified under certain conditions. For example, the management user may have a modification right, so that the first tile link point may change the user type corresponding to the external account according to a change request initiated by the management user. The management user may correspond to an external account with management authority preset in the foundational block, so that the management user may perform type change on other ordinary users, advanced users, and the like, for example, change the ordinary user into the advanced user, change the advanced user into the ordinary user, and the like.
In an embodiment, on the premise of protecting the privacy of the user, by identifying the user type, the differentiated storage operation can be implemented for the generated receipt data according to the differentiated requirements of different users on the privacy protection degree, and the flexibility is higher. For example, where the need for privacy protection is relatively lower for the average user and the need for triggering operations based on receipt data is relatively higher, then for receipt data generated by an average user initiated transaction, relatively more receipt content may be stored in clear text form in order to perform retrieval and trigger relatively more types of associated operations with respect to the clear text stored receipt content. For another example, where the need for privacy protection is relatively higher for the premium user and the need for trigger operations based on receipt data is relatively lower, then for receipt data generated by a transaction initiated by the premium user, relatively less of the receipt content may be stored in plain text form and relatively more of the receipt content may be stored in cipher text form to ensure that the receipt content in cipher text form is securely preserved while supporting some types of correlation operations.
In an embodiment, the mapping relationship between the user type and the receipt field may be predefined, for example, a general user may store the Logs field and the Output field in a plaintext form, and the rest of the receipt fields are stored in a ciphertext form, while an advanced user may store the Topic field and the Output field in the Logs field in a plaintext form, and the rest of the receipt fields are stored in a ciphertext form. Then, the first block link point may determine, according to a mapping relationship between a predefined user type and receipt fields, a receipt field corresponding to the user type to which the transaction initiator belongs, so that when the receipt data is stored, the determined receipt field is stored in a plaintext form, and the remaining receipt fields are stored in a ciphertext form.
By running program code (hereinafter simply referred to as chain code) of a blockchain on a computing device (physical or virtual machine), the computing device can be configured as a blockchain link point in a blockchain network, such as the first blockchain node described above, or the like. In other words, the first block link point implements the corresponding functional logic by running the above-mentioned chain code. Thus, the receipt data store logic described above in relation to user type can be written into the chain code when creating the blockchain network, so that each blockchain link point can implement the receipt data store logic; taking the first blockchain node as an example, the receipt data store logic is as described above: the receipt data storage logic can specifically define a receipt field which needs plaintext storage and/or needs ciphertext storage and corresponds to each user type, so that the first block link point can determine the storage mode of receipt data generated by a transaction to be plaintext storage or ciphertext storage according to the user type corresponding to the transaction initiator.
However, upgrading and updating of the chain code are relatively difficult, so that the chain code is adopted to realize storage of the receipt data, and the problems of low flexibility and insufficient expandability exist. In order to implement the functional extension of the chain code, as shown in fig. 5, the chain code may be combined with a system contract: the chain code is used for realizing basic functions of the block chain network, and the function extension in the running process can be realized in a system contract mode. Similar to the above-mentioned smart contract, the system contract includes code in the form of byte code, for example, and the first block link node may be functionally complementary to the chain code by running the code of the system contract (for example, reading the code in the system contract according to the uniquely corresponding address "0 x53a98 …").
Unlike the above-described intelligent contracts issued by users to blockchains, system contracts cannot be freely issued by users. The system contract read by the first blockchain node may include a preset system contract configured in a founder block of the blockchain network; and an administrator (i.e., the above-mentioned administrative user) in the blockchain network may have an update authority for the system contract, so as to perform an update for a preset system contract such as the above-mentioned system contract, the system contract read by the above-mentioned first blockchain node may further include a corresponding updated system contract. Certainly, the updated system contract can be obtained by the administrator by performing one-time update on the preset system contract; or, the updated system contract may be obtained by performing multiple iterative updates on the preset system contract by the administrator, for example, the preset system contract is updated to obtain the system contract 1, the system contract 1 is updated to obtain the system contract 2, and the system contract 2 is updated to obtain the system contract 3, where the system contract 1, the system contract 2, and the system contract 3 may all be regarded as the updated system contract, but the first block link point generally is subject to the latest version of the system contract, for example, the first block link node is subject to the code in the system contract 3, but not the code in the system contract 1 or the system contract 2.
In addition to the preset system contracts contained in the foundational blocks, the administrator may also publish system contracts within subsequent blocks and make updates to the published system contracts. In summary, a certain degree of restriction should be imposed on the issuance and updating of system contracts by means such as rights management to ensure that the functional logic of the blockchain network is functioning properly and to avoid unnecessary loss to any user.
Thus, a first block link point may read a code of a system contract in which receipt data storage logic associated with a preset user type is defined; the first block link point may then execute code of the system contract to store at least one receipt field of the receipt data in plain text when the transaction initiator is of the preset user type and to store the receipt data in cipher text when the transaction initiator is not of the preset user type.
In one embodiment, the first block link point encrypts the receipt content with a key. The encryption can adopt symmetric encryption or asymmetric encryption. If the first blockchain node encrypts the receipt content in a symmetric encryption manner, i.e., using the symmetric key of the symmetric encryption algorithm, the client (or other object holding the key) can decrypt the encrypted receipt content using the symmetric key of the symmetric encryption algorithm.
In one embodiment, when the first blockchain node encrypts the receipt content with the symmetric key of the symmetric encryption algorithm, the symmetric key may be pre-provided to the first blockchain node by the client. Then, only the client (which should actually be the user corresponding to the logged-in account on the client) and the first block link point grasp the symmetric key, so that only the client can decrypt the corresponding encrypted receipt content, and an unrelated user or even a lawbreaker is prevented from decrypting the encrypted receipt content.
For example, when the client initiates a transaction to the first block link node, the client may encrypt the transaction content with an initial key of a symmetric encryption algorithm to obtain the transaction; accordingly, the first tile chain node may be used to directly or indirectly encrypt the receipt content by obtaining the initial key. For example, the initial key may be pre-negotiated by the client and the first blockchain node, or sent by the key management server to the client and the first blockchain node, or sent by the client to the first blockchain node. When the initial key is sent to the first block chain node by the client, the client can encrypt the initial key by the public key of the asymmetric encryption algorithm and then send the encrypted initial key to the first block chain node, and the first block chain node decrypts the encrypted initial key by the private key of the asymmetric encryption algorithm to obtain the initial key, that is, the digital envelope encryption described above, which is not described herein again.
In one embodiment, the first tile link point may encrypt the receipt content using the initial key described above. The initial keys used for different transactions may be the same, so that all transactions submitted by the same user are encrypted using the initial keys, or the initial keys used for different transactions may be different, for example, the client may randomly generate an initial key for each transaction, so as to improve security.
In one embodiment, the first tile chain node may generate a derivative key based on the initial key and the impact factor, and encrypt the receipt content with the derivative key. Compared with the method that the initial key is directly adopted for encryption, the derived key can increase the randomness, so that the difficulty of being broken is improved, and the safety protection of data is optimized. The impact factor may be related to the transaction; for example, the impact factor may include designated bits of the transaction hash value, such as the first chunk nexus may concatenate the initial key with the first 16 bits (or the first 32 bits, the last 16 bits, the last 32 bits, or other bits) of the transaction hash value and hash the concatenated string to generate the derivative key.
In an embodiment, the first block link point may further adopt an asymmetric encryption manner, that is, the receipt content is encrypted by using a public key of an asymmetric encryption algorithm, and accordingly, the client may decrypt the encrypted receipt content by using a private key of the asymmetric encryption algorithm. The key of the asymmetric encryption algorithm may be, for example, a pair of a public key and a private key generated by the client, and the public key is sent to the first blockchain node in advance, so that the first blockchain node may encrypt the receipt content with the public key.
The first block link point implements a function by running code for implementing the function. Thus, for functions that need to be implemented in the TEE, the relevant code needs to be executed as well. For code executed in the TEE, relevant specifications and requirements of the TEE need to be met; accordingly, for codes used for realizing a certain function in the related art, code writing needs to be performed again in combination with the specification and requirements of the TEE, so that not only is a relatively large development amount, but also a bug (bug) is easily generated in the rewriting process, and reliability and stability of function realization are affected.
Thus, a first block link point may store receipt data generated in the TEE (including receipt content in plain text requiring plain text storage, and receipt content in cipher text requiring cipher text storage) to an external storage space outside the TEE by executing a store function code outside the TEE, so that the storage function code can be the code used for realizing the storage function in the related art, does not need to be re-written with the specification and requirement of the TEE, the receipt data can be safely and reliably stored, the development amount of related codes can be reduced on the basis of not influencing the safety and reliability, furthermore, the TCB (Trusted Computing Base) can be reduced by reducing the related codes of the TEE, so that the additional security risk caused by the combination of the TEE technology and the block chain technology is in a controllable range.
In one embodiment, the first block chain node may execute a write cache function code within the TEE to store the receipt data described above in a write cache within the TEE, such as may correspond to a "cache" as shown in fig. 1. Further, the first block chain node outputs the data in the write cache from the trusted execution environment to be stored in the external storage space. The writing cache function code can be stored in the TEE in a plaintext form, and the cache function code in the plaintext form can be directly executed in the TEE; alternatively, the write cache function code may be stored outside the TEE in a ciphertext form, such as in the external storage space (for example, "pack + store" shown in fig. 1, where "pack" indicates that the first blockchain node packs the transaction into blocks outside the trusted execution environment), and the write cache function code in the ciphertext form may be read into the TEE, decrypted in the TEE into a plaintext code, and executed.
Write caching refers to a "buffering" mechanism provided to avoid causing a "shock" to an external storage space when data is written to the external storage space. For example, the above write cache may be implemented by using a buffer; of course, the write cache may also be implemented by using a cache, which is not limited in this specification. In fact, because the TEE is an isolated security environment and the external storage space is located outside the TEE, the external storage space can be written into the data in the cache in batches by adopting a cache writing mechanism, so that the interaction times between the TEE and the external storage space are reduced, and the data storage efficiency is improved. Meanwhile, the TEE may need to call generated data in the process of continuously executing each transaction, and if the data needing to be called is just located in the write cache, the data can be directly read from the write cache, so that on one hand, interaction with an external storage space can be reduced, on the other hand, a decryption process of the data read from the external storage space is omitted, and therefore the data processing efficiency in the TEE is improved.
Of course, the write cache may also be established outside the TEE, for example, the first tile chain node may execute the write cache function code outside the TEE, so as to store the receipt data in the write cache outside the TEE, and further store the data in the write cache to the external storage space.
An embodiment of a receipt storage node based on user type according to the present specification is described below in conjunction with FIG. 6, and includes:
a receiving unit 61 that receives the encrypted transaction;
a decryption unit 62 to decrypt the transaction in the trusted execution environment;
an execution unit 63, configured to execute the obtained transaction content in the trusted execution environment, so as to obtain receipt data;
a storage unit 64 storing the receipt data, at least one receipt field of which is stored in a plain text form when the transaction originator belongs to a preset user type, and the receipt data is stored in a cipher text form when the transaction originator does not belong to the preset user type.
Optionally, the first block link point determines the user type to which the transaction initiator belongs by:
the first block chain node determines an external account corresponding to the transaction initiator;
and the first block chain link point inquires the user type corresponding to the external account recorded on the block chain to serve as the user type to which the transaction initiator belongs.
Optionally, the external account includes a type field recorded on the blockchain, and a value of the type field corresponds to the user type.
Optionally, when the external account is created, the user type is configured to be associated to the external account, so that an association relationship between the user type and the external account is recorded in a blockchain.
Optionally, the method further includes:
the changing unit 65 changes the user type corresponding to the external account according to the change request initiated by the management user.
Optionally, the storage unit 64 is specifically configured to:
according to a mapping relation between a predefined user type and a receipt field, determining the receipt field corresponding to the user type to which the transaction initiator belongs;
in storing the receipt data, the determined receipt fields are stored in plaintext form and the remaining receipt fields are stored in ciphertext form.
Optionally, the storage unit 64 is specifically configured to:
code for reading a system contract, the code for the system contract defining receipt data storage logic associated with the preset user type;
code for executing the system contract to store at least one receipt field of the receipt data in plaintext form when the transaction initiator is of the preset user type and to store the receipt data in ciphertext form when the transaction initiator is not of the preset user type.
Optionally, the system contract includes: the preset system contract recorded in the creation block or the updated system contract corresponding to the preset system contract.
Optionally, the storage unit 64 is specifically configured to:
executing storage function code outside the trusted execution environment to store the receipt data to an external storage space outside the trusted execution environment.
Optionally, the transaction is used to create and/or invoke a smart contract.
Optionally, the key for encrypting the receipt data by the first block link point includes: a key of a symmetric encryption algorithm or a key of an asymmetric encryption algorithm.
Optionally, the key of the symmetric encryption algorithm includes an initial key provided by the client; or, the key of the symmetric encryption algorithm comprises the initial key and a derivative key generated by the influence factor.
Optionally, the transaction is encrypted by the initial key, and the initial key is encrypted by a public key of an asymmetric encryption algorithm; the decryption unit 62 is specifically configured to:
and decrypting by using a private key of the asymmetric encryption algorithm to obtain the initial key, and decrypting the transaction by using the initial key to obtain the transaction content.
Optionally, the initial key is generated by the client; or, the initial key is sent to the client by a key management server.
Optionally, the impact factor is associated with the transaction.
Optionally, the influence factor includes: a specified bit of the hash value for the transaction.
In the 90 s of the 20 th century, improvements in a technology could clearly distinguish between improvements in hardware (e.g., improvements in circuit structures such as diodes, transistors, switches, etc.) and improvements in software (improvements in process flow). However, as technology advances, many of today's process flow improvements have been seen as direct improvements in hardware circuit architecture. Designers almost always obtain the corresponding hardware circuit structure by programming an improved method flow into the hardware circuit. Thus, it cannot be said that an improvement in the process flow cannot be realized by hardware physical modules. For example, a Programmable Logic Device (PLD), such as a Field Programmable Gate Array (FPGA), is an integrated circuit whose Logic functions are determined by programming the Device by a user. A digital system is "integrated" on a PLD by the designer's own programming without requiring the chip manufacturer to design and fabricate application-specific integrated circuit chips. Furthermore, nowadays, instead of manually making an Integrated Circuit chip, such Programming is often implemented by "logic compiler" software, which is similar to a software compiler used in program development and writing, but the original code before compiling is also written by a specific Programming Language, which is called Hardware Description Language (HDL), and HDL is not only one but many, such as abel (advanced Boolean Expression Language), ahdl (alternate Hardware Description Language), traffic, pl (core universal Programming Language), HDCal (jhdware Description Language), lang, Lola, HDL, laspam, hardward Description Language (vhr Description Language), vhal (Hardware Description Language), and vhigh-Language, which are currently used in most common. It will also be apparent to those skilled in the art that hardware circuitry that implements the logical method flows can be readily obtained by merely slightly programming the method flows into an integrated circuit using the hardware description languages described above.
The controller may be implemented in any suitable manner, for example, the controller may take the form of, for example, a microprocessor or processor and a computer-readable medium storing computer-readable program code (e.g., software or firmware) executable by the (micro) processor, logic gates, switches, an Application Specific Integrated Circuit (ASIC), a programmable logic controller, and an embedded microcontroller, examples of which include, but are not limited to, the following microcontrollers: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20, and Silicone Labs C8051F320, the memory controller may also be implemented as part of the control logic for the memory. Those skilled in the art will also appreciate that, in addition to implementing the controller as pure computer readable program code, the same functionality can be implemented by logically programming method steps such that the controller is in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers, embedded microcontrollers and the like. Such a controller may thus be considered a hardware component, and the means included therein for performing the various functions may also be considered as a structure within the hardware component. Or even means for performing the functions may be regarded as being both a software module for performing the method and a structure within a hardware component.
The systems, devices, modules or units illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. One typical implementation device is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a cellular telephone, a camera phone, a smartphone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.
For convenience of description, the above devices are described as being divided into various units by function, and are described separately. Of course, the functions of the various elements may be implemented in the same one or more software and/or hardware implementations of the present description.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
This description may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The specification may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks. In a typical configuration, a computer includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic disk storage, quantum memory, graphene-based storage media or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The foregoing description has been directed to specific embodiments of this disclosure. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may also be possible or may be advantageous.
The terminology used in the description of the one or more embodiments is for the purpose of describing the particular embodiments only and is not intended to be limiting of the description of the one or more embodiments. As used in one or more embodiments of the present specification and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.
It should be understood that although the terms first, second, third, etc. may be used in one or more embodiments of the present description to describe various information, such information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, first information may also be referred to as second information, and similarly, second information may also be referred to as first information, without departing from the scope of one or more embodiments herein. The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination", depending on the context.
The above description is only for the purpose of illustrating the preferred embodiments of the one or more embodiments of the present disclosure, and is not intended to limit the scope of the one or more embodiments of the present disclosure, and any modifications, equivalent substitutions, improvements, etc. made within the spirit and principle of the one or more embodiments of the present disclosure should be included in the scope of the one or more embodiments of the present disclosure.

Claims (19)

1. A method for user-type based receipt storage, comprising:
the first block link node receives the encrypted transaction;
the first block chain node decrypts the transaction in a trusted execution environment and executes the obtained transaction content to obtain receipt data;
the first block link point stores the receipt data, at least one receipt field of the receipt data is stored in a plain text form when a transaction initiator belongs to a preset user type, and the receipt data is stored in a cipher text form when the transaction initiator does not belong to the preset user type.
2. The method of claim 1, the first block link point determining the type of user to which the transaction initiator belongs by:
the first block chain node determines an external account corresponding to the transaction initiator;
and the first block chain link point inquires the user type corresponding to the external account recorded on the block chain to serve as the user type to which the transaction initiator belongs.
3. The method of claim 2, the external account comprising a type field recorded on a blockchain, a value of the type field corresponding to the user type.
4. The method of claim 2, wherein the user type is configured to be associated to the external account when creating the external account, such that an association between the user type and the external account is recorded in a blockchain.
5. The method of claim 4, further comprising:
and the first block chain node changes the user type corresponding to the external account according to a change request initiated by a management user.
6. The method of claim 1, the at least one receipt field of the receipt data being stored in clear text form, comprising:
the first block chain node determines a receipt field corresponding to the user type to which the transaction initiator belongs according to a mapping relation between a predefined user type and the receipt field;
and when storing the receipt data, the first blockchain node stores the determined receipt fields in a plaintext form and stores the rest receipt fields in a ciphertext form.
7. The method of claim 1, a first block link point storing the receipt data, comprising:
code for reading a system contract at a first block link point, the code for the system contract defining receipt data storage logic associated with the predetermined user type;
code for executing the system contract at a first block link point to store at least one receipt field of the receipt data in plaintext form when the transaction initiator is of the preset user type and to store the receipt data in ciphertext form when the transaction initiator is not of the preset user type.
8. The method of claim 7, the system contract comprising: the preset system contract recorded in the creation block or the updated system contract corresponding to the preset system contract.
9. The method of claim 1, a first block link point storing the receipt data, comprising:
the first blockchain node executes storage function code outside the trusted execution environment to store the receipt data to an external storage space outside the trusted execution environment.
10. The method of claim 1, the transaction being used to create and/or invoke a smart contract.
11. The method of claim 1, the key for the first block chain node to encrypt the receipt data comprising: a key of a symmetric encryption algorithm or a key of an asymmetric encryption algorithm.
12. The method of claim 11, the key of the symmetric encryption algorithm comprising a client-provided initial key that initiates the transaction; or, the key of the symmetric encryption algorithm comprises the initial key and a derivative key generated by the influence factor.
13. The method of claim 12, the transaction being encrypted by the initial key, and the initial key being encrypted by a public key of an asymmetric encryption algorithm; the first blockchain node decrypts the transaction in the trusted execution environment, including:
and the first blockchain node decrypts by using a private key of the asymmetric encryption algorithm to obtain the initial key, and decrypts the transaction by using the initial key to obtain the transaction content.
14. The method of claim 12, the initial key is generated by a client; or, the initial key is sent to the client by a key management server.
15. The method of claim 12, the impact factor being related to the transaction.
16. The method of claim 15, the impact factor comprising: a specified bit of the hash value for the transaction.
17. A user type based receipt storage node comprising:
a receiving unit that receives the encrypted transaction;
a decryption unit to decrypt the transaction in a trusted execution environment;
the execution unit executes the obtained transaction content in the trusted execution environment to obtain receipt data;
and the storage unit is used for storing the receipt data, when the transaction initiator belongs to a preset user type, at least one receipt field of the receipt data is stored in a plaintext form, and when the transaction initiator does not belong to the preset user type, the receipt data is stored in a ciphertext form.
18. An electronic device, comprising:
a processor;
a memory for storing processor-executable instructions;
wherein the processor implements the method of any one of claims 1-16 by executing the executable instructions.
19. A computer-readable storage medium having stored thereon computer instructions, which, when executed by a processor, carry out the steps of the method according to any one of claims 1 to 16.
CN201910419176.3A 2019-05-20 2019-05-20 Receipt storage method and node based on user type Active CN110245944B (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
CN201910419176.3A CN110245944B (en) 2019-05-20 2019-05-20 Receipt storage method and node based on user type
PCT/CN2020/089382 WO2020233422A1 (en) 2019-05-20 2020-05-09 Receipt storage method and node based on user type
PCT/CN2020/091409 WO2020233630A1 (en) 2019-05-20 2020-05-20 User type-based receipt storing method and node

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910419176.3A CN110245944B (en) 2019-05-20 2019-05-20 Receipt storage method and node based on user type

Publications (2)

Publication Number Publication Date
CN110245944A CN110245944A (en) 2019-09-17
CN110245944B true CN110245944B (en) 2021-04-27

Family

ID=67884492

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910419176.3A Active CN110245944B (en) 2019-05-20 2019-05-20 Receipt storage method and node based on user type

Country Status (2)

Country Link
CN (1) CN110245944B (en)
WO (1) WO2020233630A1 (en)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110245944B (en) * 2019-05-20 2021-04-27 创新先进技术有限公司 Receipt storage method and node based on user type
WO2020233422A1 (en) * 2019-05-20 2020-11-26 创新先进技术有限公司 Receipt storage method and node based on user type
CN110263089B (en) * 2019-05-20 2021-05-04 创新先进技术有限公司 Receipt storage method and node combining conditional restrictions of transaction and event types
CN111080290B (en) * 2019-11-19 2023-05-26 杭州趣链科技有限公司 Block chain transaction execution and data storage method based on account classification
CN112801785B (en) * 2021-01-13 2023-10-20 中央财经大学 Fair data transaction method and device based on blockchain intelligent contract
CN112948350B (en) * 2021-02-02 2023-08-01 中央财经大学 Distributed ledger model cold data archiving and migration storage method based on MPT verification
CN114049213A (en) * 2021-11-15 2022-02-15 深圳前海鸿泰源兴科技发展有限公司 Informatization financial data analysis system and analysis method
CN115801796A (en) * 2022-10-12 2023-03-14 支付宝(杭州)信息技术有限公司 Vehicle battery data management method, device and equipment based on block chain

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102143482A (en) * 2011-04-13 2011-08-03 中国工商银行股份有限公司 Method and system for authenticating mobile banking client information, and mobile terminal
CN105790938A (en) * 2016-05-23 2016-07-20 ***股份有限公司 System and method for generating safety unit key based on reliable execution environment
CN107342858A (en) * 2017-07-05 2017-11-10 武汉凤链科技有限公司 A kind of intelligent contract guard method and system based on trusted context
CN108389130A (en) * 2018-03-02 2018-08-10 合肥学院 A kind of more trade mode alliances chain
CN109033855A (en) * 2018-07-18 2018-12-18 腾讯科技(深圳)有限公司 A kind of data transmission method based on block chain, device and storage medium
CN109299217A (en) * 2018-11-02 2019-02-01 符安文 A kind of secure storage and search method based on block chain

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106559211B (en) * 2016-11-22 2019-12-13 中国电子科技集团公司第三十研究所 Privacy protection intelligent contract method in block chain
CN107169757A (en) * 2017-04-19 2017-09-15 新开普电子股份有限公司 NFC POS P2P payment platforms and its method
WO2019055290A1 (en) * 2017-09-12 2019-03-21 Northwestern University Blockchain distribution network
US20190095879A1 (en) * 2017-09-26 2019-03-28 Cornell University Blockchain payment channels with trusted execution environments
WO2019074479A1 (en) * 2017-10-09 2019-04-18 Hewlett-Packard Development Company, L.P. Encrypted transaction receipts
CN108573438A (en) * 2018-05-09 2018-09-25 深圳汇创联合自动化控制有限公司 A kind of autonomous transaction system of custom power based on block chain
CN108765159B (en) * 2018-06-04 2022-07-15 杭州溪塔科技有限公司 Block chain-based uplink and state processing method and device and interconnection system
CN109063109A (en) * 2018-07-27 2018-12-21 电子科技大学 A kind of data query system based on ether mill
CN109584067A (en) * 2018-11-01 2019-04-05 有链(广州)信息技术有限公司 The method for secure storing of business transaction data based on block chain public affairs chain
CN109493020B (en) * 2018-11-08 2022-02-11 众安信息技术服务有限公司 Block chain based secure transaction method and device
CN109684287A (en) * 2018-12-29 2019-04-26 厦门链平方科技有限公司 Gateway information sharing query method and system based on block chain
CN110245944B (en) * 2019-05-20 2021-04-27 创新先进技术有限公司 Receipt storage method and node based on user type

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102143482A (en) * 2011-04-13 2011-08-03 中国工商银行股份有限公司 Method and system for authenticating mobile banking client information, and mobile terminal
CN105790938A (en) * 2016-05-23 2016-07-20 ***股份有限公司 System and method for generating safety unit key based on reliable execution environment
CN107342858A (en) * 2017-07-05 2017-11-10 武汉凤链科技有限公司 A kind of intelligent contract guard method and system based on trusted context
CN108389130A (en) * 2018-03-02 2018-08-10 合肥学院 A kind of more trade mode alliances chain
CN109033855A (en) * 2018-07-18 2018-12-18 腾讯科技(深圳)有限公司 A kind of data transmission method based on block chain, device and storage medium
CN109299217A (en) * 2018-11-02 2019-02-01 符安文 A kind of secure storage and search method based on block chain

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
基于混沌保密的即时通信技术研究;张琳琳;《中国优秀硕士学位论文全文数据库 信息科技辑》;20120615;全文 *

Also Published As

Publication number Publication date
WO2020233630A1 (en) 2020-11-26
CN110245944A (en) 2019-09-17

Similar Documents

Publication Publication Date Title
CN110264195B (en) Receipt storage method and node combining code marking with transaction and user type
CN110263544B (en) Receipt storage method and node combining transaction type and judgment condition
CN110245944B (en) Receipt storage method and node based on user type
CN110223172B (en) Conditional receipt storage method and node combining code labeling and type dimension
CN110245490B (en) Conditional receipt storage method and node combining code labeling and type dimension
CN110266644B (en) Receipt storage method and node combining code marking and transaction types
CN110245945B (en) Receipt storage method and node combining code marking and user type
CN110245942B (en) Receipt storage method and node combining user type and judgment condition
CN110278193B (en) Receipt storage method and node combining code marking with transaction and event types
CN110245947B (en) Receipt storage method and node combining conditional restrictions of transaction and user types
CN110263087B (en) Receipt storage method and node based on multi-dimensional information and with conditional restriction
CN110264196B (en) Conditional receipt storage method and node combining code labeling and user type
CN110263086B (en) Receipt storage method and node combining user type and event function type
CN110264198B (en) Conditional receipt storage method and node combining code labeling and transaction type
CN110245504B (en) Receipt storage method and node combined with condition limitation of multi-type dimensionality
CN110245946B (en) Receipt storage method and node combining code labeling and multi-type dimensionality
CN110263091B (en) Receipt storage method and node combining code marking with user and event type
CN110264193B (en) Receipt storage method and node combining user type and transaction type
CN110245503B (en) Receipt storage method and node combining code marking and judging conditions
CN110264192B (en) Receipt storage method and node based on transaction type
CN110264197B (en) Receipt storage method and node combining event function type and judgment condition
CN110263088B (en) Conditional receipt storage method and node combining code labeling and event type
CN110276684B (en) Receipt storage method and node combining transaction type and event function type
CN110245489B (en) Receipt storage method, node and system based on plaintext log
CN110247895B (en) Receipt storage method, node, device and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
TA01 Transfer of patent application right

Effective date of registration: 20200925

Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands

Applicant after: Innovative advanced technology Co.,Ltd.

Address before: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands

Applicant before: Advanced innovation technology Co.,Ltd.

Effective date of registration: 20200925

Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands

Applicant after: Advanced innovation technology Co.,Ltd.

Address before: A four-storey 847 mailbox in Grand Cayman Capital Building, British Cayman Islands

Applicant before: Alibaba Group Holding Ltd.

TA01 Transfer of patent application right
GR01 Patent grant
GR01 Patent grant