CN116614317B - Trade data processing method and system based on blockchain - Google Patents

Trade data processing method and system based on blockchain Download PDF

Info

Publication number
CN116614317B
CN116614317B CN202310889949.0A CN202310889949A CN116614317B CN 116614317 B CN116614317 B CN 116614317B CN 202310889949 A CN202310889949 A CN 202310889949A CN 116614317 B CN116614317 B CN 116614317B
Authority
CN
China
Prior art keywords
node
data
sequence
target
uplink
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
CN202310889949.0A
Other languages
Chinese (zh)
Other versions
CN116614317A (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.)
China National Institute of Standardization
Original Assignee
China National Institute of Standardization
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 China National Institute of Standardization filed Critical China National Institute of Standardization
Priority to CN202310889949.0A priority Critical patent/CN116614317B/en
Publication of CN116614317A publication Critical patent/CN116614317A/en
Application granted granted Critical
Publication of CN116614317B publication Critical patent/CN116614317B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
    • H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/602—Providing cryptographic facilities or services
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • G06F21/6245—Protecting personal data, e.g. for financial or medical purposes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
    • H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
    • H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Health & Medical Sciences (AREA)
  • Bioethics (AREA)
  • General Health & Medical Sciences (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Hardware Design (AREA)
  • Business, Economics & Management (AREA)
  • Finance (AREA)
  • Software Systems (AREA)
  • Accounting & Taxation (AREA)
  • Databases & Information Systems (AREA)
  • Medical Informatics (AREA)
  • Computing Systems (AREA)
  • Power Engineering (AREA)
  • Development Economics (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Strategic Management (AREA)
  • Technology Law (AREA)
  • General Business, Economics & Management (AREA)
  • Storage Device Security (AREA)

Abstract

The application discloses a method and a system for processing trade data based on a block chain, wherein a third sequence is obtained by means of random sequencing, first occupying data and encryption before the data to be uplinked provided by a source data node forms a block capable of being uplinked, and the data to be uplinked is in an unobservable state on the third sequence. Then, based on the interaction between the system and the source data node, only the source data node providing the data to be uplink knows which position on the third sequence the data to be uplink provided by the source data node is located, and other nodes do not know which position in the third sequence the data to be uplink is located. And if the data on the block is required to be queried, the source data node provides the system with which position of the data to be uplink in the third sequence in the block so as to realize the authentication of the ground source data node.

Description

Trade data processing method and system based on blockchain
Technical Field
The application relates to the technical field of data processing systems or methods, in particular to a block chain-based trade data processing method and system.
Background
The use of blockchain technology is becoming more and more widespread. The blockchain technology has the advantages of high security, difficult tampering of data on the chain and the like. With the popularization of blockchain technology, more and more transaction data providers (which may be source data nodes) wish to store data generated by themselves in a uplink manner so as to ensure the security of the data. Thereafter, the data on the chain may be reviewed as necessary to obtain historical transaction data. If the identity of the party referring to the historical transaction data is not limited, the transaction data may be revealed to the party referring to the party, and there is a risk of privacy disclosure. How to avoid such risks becomes a problem to be solved.
Disclosure of Invention
The embodiment of the application provides a method and a system for processing trade data based on a blockchain, which are used for at least partially solving the technical problems.
The embodiment of the application adopts the following technical scheme:
in a first aspect, embodiments of the present application provide a blockchain-based trade data processing method performed by a blockchain-based trade data processing system, the system being separately connected to a source data node and a computing node; the source data node is used for providing data to be uplink to the system, and the calculation node is used for calculating a first random number when the block is uplink; the method comprises the following steps:
Determining the source data node uploading the data to be uplink to the system as a target node aiming at the next block generation period;
determining a first target difficulty under the condition that the target node is not unique and the current block generation period is finished;
based on the first target difficulty, sending a calculation instruction to the calculation node, so that the calculation node calculates a first random number corresponding to the first target difficulty in a block head of a block to which the data to be uplink belongs;
arranging the data to be uplink according to a random order to obtain a first sequence;
randomly generating a plurality of first occupation data, and inserting the first occupation data into random positions of the first sequence to obtain a second sequence, wherein the second sequence comprises a preset appointed number of data;
encrypting the second sequence by adopting a preset first encryption model to obtain a third sequence which can be used for forming a block;
any one of the target nodes is used as a first node, and the position of the data to be uplink uploaded by the first node in the third sequence is determined to be used as a target position corresponding to the first node;
Constructing a pending sequence corresponding to the first node, so that the unique identifier of the first node is recorded in the target position of the pending sequence, and a preset value is recorded in the position of the pending sequence except for the target position; or, the unique identifier of the first node and the target position corresponding to the first node are recorded in a certain position of the undetermined sequence, and a preset value is recorded in a position of the undetermined sequence except the certain position; so that the second target difficulty corresponding to the verification sequence obtained based on the undetermined sequence is smaller than the first target difficulty; the verification sequence is obtained by carrying out hash processing on the undetermined sequence;
sending the second target difficulty to the first node, so that the first node calculates a second random number corresponding to the second target difficulty, wherein the second random number characterizes the position of the data to be uplink uploaded by the first node in the third sequence;
and if the second random number returned by the first node is received before the next block generation period is finished, generating a block based on the first random number and linking the block.
In an alternative embodiment of the present specification, the method further comprises:
if the second random number returned by the first node is not received before the next block generation period is finished, reducing the appointed number;
and re-determining the target nodes, and enabling the number of the re-determined target nodes to be not larger than the number of the target nodes determined last time.
In an alternative embodiment of the present specification, the method further comprises:
and determining that the next block generation period is empty under the condition that the target node is unique and the current block generation period is ended.
In an alternative embodiment of the present specification, the method further comprises:
and if the second random number returned by the first node is received before the generation period of the next block is finished, the target position corresponding to the first node, the unique identifier of the data to be uplink uploaded by the first node and the unique identifier of the block to which the data to be uplink belong are added into a preset verification table after being encrypted.
In an alternative embodiment of the present specification, the method further comprises:
If a query request of the source data node for querying transaction data recorded in a history block formed on a history on a blockchain is received, analyzing the target position corresponding to the source data node, the unique identifier of the data to be uplink corresponding to the transaction data and the unique identifier of the history block from the query request as available data;
if the result of encrypting the available data is matched with the content in the verification table, decrypting the data corresponding to the target position in the third sequence of the history block;
and returning the decrypted result to the source data node which sends the query request.
In an alternative embodiment of the present disclosure, the hash function used in calculating the first random number or the second random number is SHA-256.
In an alternative embodiment of the present specification, the duration of the next tile generation period is 10 minutes.
In a second aspect, embodiments of the present application also provide a blockchain-based trade data processing system, the system being separately connected to a source data node and a compute node; the source data node is used for providing data to be uplink to the system, and the calculation node is used for calculating a first random number when the block is uplink; the system comprises:
A target node determination module configured to: determining the source data node uploading the data to be uplink to the system as a target node aiming at the next block generation period;
the first target difficulty determining module is configured to: determining a first target difficulty under the condition that the target node is not unique and the current block generation period is finished;
an instruction sending module configured to: based on the first target difficulty, sending a calculation instruction to the calculation node, so that the calculation node calculates a first random number corresponding to the first target difficulty in a block head of a block to which the data to be uplink belongs;
a first sequence determination module configured to: arranging the data to be uplink according to a random order to obtain a first sequence;
a second sequence determination module configured to: randomly generating a plurality of first occupation data, and inserting the first occupation data into random positions of the first sequence to obtain a second sequence, wherein the second sequence comprises a preset appointed number of data;
a third sequence determination module configured to: encrypting the second sequence by adopting a preset first encryption model to obtain a third sequence which can be used for forming a block;
A target location determination module configured to: any one of the target nodes is used as a first node, and the position of the data to be uplink uploaded by the first node in the third sequence is determined to be used as a target position corresponding to the first node;
a pending sequence determination module configured to: constructing a pending sequence corresponding to the first node, so that the unique identifier of the first node is recorded in the target position of the pending sequence, and a preset value is recorded in the position of the pending sequence except for the target position; or, the unique identifier of the first node and the target position corresponding to the first node are recorded in a certain position of the undetermined sequence, and a preset value is recorded in a position of the undetermined sequence except the certain position; so that the second target difficulty corresponding to the verification sequence obtained based on the undetermined sequence is smaller than the first target difficulty; the verification sequence is obtained by carrying out hash processing on the undetermined sequence;
the second target difficulty sending module is configured to: sending the second target difficulty to the first node, so that the first node calculates a second random number corresponding to the second target difficulty, wherein the second random number characterizes the position of the data to be uplink uploaded by the first node in the third sequence;
The uplink operation module is configured to: and if the second random number returned by the first node is received before the next block generation period is finished, generating a block based on the first random number and linking the block.
In a third aspect, an embodiment of the present application further provides an electronic device, including:
a processor; and
a memory arranged to store computer executable instructions which, when executed, cause the processor to perform the method steps of the first aspect.
In a fourth aspect, embodiments of the present application also provide a computer-readable storage medium storing one or more programs, which when executed by an electronic device comprising a plurality of application programs, cause the electronic device to perform the method steps of the first aspect.
The above at least one technical scheme adopted by the embodiment of the application can achieve the following beneficial effects:
the present specification provides a blockchain-based trade data processing method, and a blockchain-based trade data processing system in which the method may be implemented. Before the data to be uplink provided by the source data node forms a block capable of being uplink, a third sequence is obtained through random sequencing, first occupied data and encryption, and the data to be uplink is in an unknown state on the third sequence. Then, based on the interaction between the system and the source data node, only the source data node providing the data to be uplink knows which position on the third sequence the data to be uplink provided by the source data node is located, and other nodes do not know which position in the third sequence the data to be uplink is located. And if the data on the block is required to be queried, the source data node provides the system with which position of the data to be uplink in the third sequence in the block so as to realize the authentication of the ground source data node. And if the verification is passed, allowing the source data node to acquire the content of the data to be uplink. Therefore, the method of the specification can be combined with the formation process of the block to realize verification of the identity of the node inquiring the data to be uplink, and is beneficial to preventing the risk of privacy leakage.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this specification, illustrate embodiments of the application and together with the description serve to explain the application and do not constitute a limitation on the application. In the drawings:
FIG. 1 is a process diagram of a blockchain-based trade data processing method provided in an embodiment of the present disclosure;
fig. 2 is a schematic structural diagram of an electronic device according to an embodiment of the present disclosure.
Detailed Description
The application will be described in further detail below with reference to the drawings by means of specific embodiments. Wherein like elements in different embodiments are numbered alike in association. In the following embodiments, numerous specific details are set forth in order to provide a better understanding of the present application. However, one skilled in the art will readily recognize that some of the features may be omitted, or replaced by other elements, materials, or methods in different situations. In some instances, related operations of the present application have not been shown or described in the specification in order to avoid obscuring the core portions of the present application, and may be unnecessary to persons skilled in the art from a detailed description of the related operations, which may be presented in the description and general knowledge of one skilled in the art.
Furthermore, the described features, operations, or characteristics of the description may be combined in any suitable manner in various embodiments. Also, various steps or acts in the method descriptions may be interchanged or modified in a manner apparent to those of ordinary skill in the art. Thus, the various orders in the description and drawings are for clarity of description of only certain embodiments, and are not meant to be required orders unless otherwise indicated.
The numbering of the components itself, e.g. "first", "second", etc., is used herein merely to distinguish between the described objects and does not have any sequential or technical meaning. The term "coupled" as used herein includes both direct and indirect coupling (coupling), unless otherwise indicated.
The following describes in detail the technical solutions provided by the embodiments of the present application with reference to the accompanying drawings.
The methods in this specification are performed by a blockchain-based trade data processing system (hereinafter simply "system"). The system is provided with a memory module that can be used to store the blockchain and authentication tables and other related content as will be mentioned below. The steps of the method in this specification are performed by one or more modules of the system.
The system is connected separately to the source data node(s) and the compute node(s). In this specification, the node for providing data to be uplink to the system is a source data node. The node used to calculate the first random number at the time of block uplink is the calculation node. In some cases, a node may be both a source data node and a compute node. The first random number is a nonce on the block head of the block of the blockchain (the second random number and the first random number, which will be referred to below, are functionally different, but are similar in nature, and are similarly calculated, and are not described in detail).
The system is also coupled to a storage node(s) for storing the blockchain. In some cases, a source data node and/or computing node may be a storage node.
In this specification, not every node storing a blockchain is able to learn the transaction data in the block (the transaction data is referred to as "to-be-uplinked data" before it is not uplinked). Specifically, the transaction data in the block exists in the form of encrypted ciphertext (the encryption means in the related art can be applied to the present specification when the conditions allow, and only the system can decrypt the ciphertext to obtain plaintext (i.e., transaction data). Thus, privacy protection for transaction data is achieved.
As shown in fig. 1, the blockchain-based trade data processing method in the present specification includes the steps of:
s100: and determining the source data node for uploading the data to be uplinked to the system as a target node for the next block generation period.
The system acquires the data to be uplink from the source data node in real time, and due to uncertainty of transaction behavior, transaction data generated at different moments may be different, and there may be a possibility that no transaction data is generated in a certain period of time.
The block generation period may be determined according to actual requirements, and in an alternative embodiment of the present disclosure, the duration of one block generation period is ten minutes. In other embodiments, the duration of the tile generation period may be other.
The method in the present specification is directed to the next block generation period after one block generation period, but the timing at which at least part of the steps for the next block generation period are performed may be in the current, or the current previous block generation period.
For example, the source data node 1, the source data node 2, and the source data node 3 respectively transmit transaction data to the system, wherein the transaction data transmitted by the source data node 2 is allocated in the current block generation period for generating a block corresponding to the current block generation period; and the transaction data transmitted by the source data node 1 and the source data node 3 are distributed in the next block generation period for generating blocks corresponding to the next block generation period. Then source data node 1 and source data node 3 are target nodes. Since the source data node 4 does not send transaction data to the system, the source data node 4 is not the target node either.
S102: and determining a first target difficulty under the condition that the target node is not unique and the current block generation period is ended.
If the target node is not unique, the data to be uplink prepared for the next block generation period is indicated to be provided with an uplink chain piece. The method in the specification aims at realizing privacy protection on data on a block, and provides a query function of transaction data for legal source data nodes on one hand, and can identify illegal nodes to a certain extent on the other hand. Combining the follow-up steps to identify the identity of the source data in the query process, if a source data node is a legal node, the source data node can clearly know the specific position of the transaction data to be queried on the blockchain and the blocks.
If a source data node is an illegal node, it cannot pass verification, and further if the illegal node is able to know the specific positions of transaction data generated by other source data nodes (knowing IDs and/or specified IDs of the other source data nodes (the concept of the specified IDs will be described later), wherein the IDs are unique identifiers) on a blockchain and a block, on one hand, the illegal node is relatively strong in aggressiveness, and on the other hand, the other data source may be attacked by the illegal node, so that a potential safety hazard exists.
That is, the target node is not uniquely advantageous for implementing verification of the security of the source data node. If the target node is unique, even if the ID of the block in which the target node stores transaction data is leaked, the position of the third sequence of the transaction data on the block is not necessarily leaked, and if the illegal node queries exactly the transaction data historically formed by the target node at this time, then the attack behavior of the target node can be confirmed (at this time, it can be determined that the risk level is centered, and a second alarm is issued). If the inquiry is the interference transaction formed by the first occupation data, the inquiry shows that even if the attack behavior exists, the leakage degree is not large, and the risk is still in a controllable range (at the moment, the risk degree can be judged to be lower, and a third alarm is sent). If transaction data historically formed by other target nodes except the target node is queried, the system is attacked, the risk is uncontrollable, and the system needs to be isolated for self-checking (at the moment, the highest risk degree can be judged, and a first alarm is sent).
In the related art, technical means for determining the difficulty of calculating a random number (nonce), where conditions allow, may be applied to the present specification for determining the first target difficulty.
In an alternative embodiment of the present disclosure, in a case where the target node is unique and the current block generation period has ended, the next block generation period is determined to be empty, and a new target node is waited for to join.
S104: and sending a calculation instruction to the calculation node based on the first target difficulty.
And the computing node is used for computing a first random number corresponding to the first target difficulty in the block head of the block to which the uplink data belong.
The structures of the blocks in this specification are the same as or similar to those in the related art. The block header of a block may include a block ID, the ID of the previous block, and the like, in addition to the first random number. The third sequence, which is recorded with transaction data, may then be stored in the bank.
In this specification, the method of calculating the first random number by the calculation node may be the same as or similar to the technical means in the related art.
S106: and arranging the data to be uplink according to a random order to obtain a first sequence.
The random algorithm used in forming the first sequence in the present specification may be the same as or similar to the technical means in the related art. For example, if the data to be uplinked is a, b, c, d and e. After processing by a random algorithm, the resulting first sequence may be c, a, e, b, d. Where a, b, c are provided by source data node 1 and d and e are provided by source data node 3.
At this time, randomness is introduced into the first sequence, and the order of transaction data in the first sequence in terms of reception time, generation time, transaction amount, and the like is disturbed.
S108: and randomly generating a plurality of first occupation data, and inserting the first occupation data into random positions of the first sequence to obtain a second sequence.
Such that the second sequence contains a preset specified number of data.
Because of uncertainty of transaction behavior, the number of corresponding transaction data in different block generation periods is also different. In each block obtained by the method in the specification, the number of data (i.e. the designated number) contained in the block is greater than the total number of data to be uplink sent by the source data node for the next blockchain generation period to different extent.
The first placeholder data does not have actual transaction information, and contains virtual content, and can be composed of placeholders or unordered characters. In an alternative embodiment of the present disclosure, the different first placeholder data has different proportions, so that the volumes of the different first placeholder data are different.
Continuing with the above example, if the specified number is equal to 8, the number of data to be uplink included in the first sequence is 5, and then 3 first placeholder data are generated. The second sequence obtained may be c, [ ], a, e, [ ], b, [ ], d. Wherein "[ ]" represents the first placeholder data. It should be noted that, here, only by way of example, in practical application, the number of first placeholder data may be much larger than the number of data to be uplink, and there may be a case where two first placeholder data are adjacent in the second sequence.
In an alternative embodiment of the present description, the specified number is an empirical value.
S110: and encrypting the second sequence by adopting a preset first encryption model to obtain a third sequence which can be used for forming the block.
In the related art, all technical means that can be used to implement data encryption can be used as the first encryption model in the present specification.
In an alternative embodiment of the present disclosure, the second sequence may be the only whole, and a common encryption result is obtained. For example, if the second sequence includes 8 bits, 7 pieces of second occupation data (which may be composed of placeholders or unordered characters) having a volume similar to the encryption result but different from each other are randomly generated, and the encryption result is inserted into the sequence composed of the second occupation data, to obtain a third sequence. For example, the encryption result is a. The second occupancy data is [ and the resulting third sequence may be [, ], a, [, ], and [, ]. Thus, the number of data bits of the obtained third sequence is the same as that of the second sequence, and the encryption result is confused in the third sequence, so that the content of the encryption result is not confused and only the position of the second occupying data in the block is confused because the second occupying data has no meaning. Continuing with the second sequence in the previous embodiment, the position of this transaction data "c" in the third sequence is 4-1. Where 4 denotes the position of the encryption result in the third sequence and 1 denotes the position of c in the second sequence. As a result of the effects of randomness, confusion, etc., the position of c and the content of c cannot be known to other parties than the system, if the third sequence is known.
In another alternative embodiment of the present description, each bit in the second sequence may be encrypted separately. As in the above embodiment, the second sequence has 8 bits, so that 8 encryption results can be obtained, where the position of the encryption result in the third sequence is the same as the position of its corresponding plaintext in the second sequence. This embodiment does not determine the second placeholder data, and is more efficient (this example will be continued to be referred to below).
S112: and taking any one of the target nodes as a first node, and determining the position of the data to be uplink uploaded by the first node in the third sequence as a target position corresponding to the first node.
In the foregoing embodiment, if the source data node 1 and the source data node 3 are target nodes, they are respectively used as the first nodes, and the corresponding target positions are determined. If the data to be uplink provided by a source data node in the next block generation period is not unique, determining the target position of each data to be uplink.
Taking the source data node 1 as an example, the provided target position corresponding to a is the block ID-3, the target position corresponding to b is the block ID-6, and the target position corresponding to c is the block ID-1. (ID is a unique identifier)
S114: a pending sequence corresponding to the first node is constructed.
The pending sequence in this specification satisfies one of the following: the unique identifier of the first node is recorded in the target position of the undetermined sequence, and a preset value is recorded in the position of the undetermined sequence except the target position; and recording the unique identifier of the first node and the target position corresponding to the first node in a certain position of the undetermined sequence, and recording a preset value in a position of the undetermined sequence except the certain position.
The length of the undetermined sequence and the value of the preset value (for example, the values of all the preset values are the same and are all 0), and the condition that the second target difficulty corresponding to the verification sequence obtained based on the undetermined sequence is smaller than the first target difficulty is required to be satisfied. In the related art, the technical means that can be used to determine the difficulty of the hash calculation may be applied to the present specification to determine the second target difficulty in the case where the foregoing conditions can be achieved. In order to realize the adjustment of the second target difficulty, the length of the undetermined sequence and the value of the preset value can be determined in an iterative mode until the condition can be met. In an alternative embodiment of the present disclosure, the hash function used in calculating the first random number and/or the second random number is SHA-256.
Considering that the source data node may not be a computing node, the computing power may be poor, if the source data node cannot complete the computation for the second target difficulty in one block generation period, the generation efficiency of the block chain will be affected, and thus, the condition is set.
In a further alternative embodiment of the present description, the unique identifier of the first node is an identifier assigned by the system, which assigns its unique identifier to the source data node when the source data node accesses the system, and sends the unique identifier to the source data node via a secure link, so that only the source data node and the system are aware of the unique identifier of the source data node.
For example, for a. The undetermined sequence is 8 bits in total, and the undetermined sequence is '0, unique identification of source data node 1, 0 and 0'; for another example, the pending sequence is hashed by 5 bits (in other examples, other bits are also possible), "0, unique identification of source data node 1+block ID-3, 0", and the resulting verification sequence.
S116: and sending the second target difficulty to the first node.
And calculating a second random number corresponding to the second target difficulty by the first node, wherein the second random number represents the position of the data to be uplink uploaded by the first node in the third sequence.
The first node continuously calculates the hash value through the continuous random number until the hash value meeting the second target difficulty is calculated. For example, the first node may be made aware of its unique identity by sending the second target difficulty in this step. Since the second target difficulty is not addressed to other nodes, the other nodes will not know the unique identity of the first node. The first node does not know the unique identification of the first node before, so that the risk that the unique identification of the first node is leaked can be effectively reduced.
In an alternative embodiment of the present description, the connection between the system and the first node is secure, and the second target difficulty is normally not known to the third party.
S118: and if the second random number returned by the first node is received before the next block generation period is finished, generating a block based on the first random number and linking the block.
And receiving the second random number returned by the first node, indicating that the first node has known the position of the data to be uplink provided by the first node in the third sequence and has known the unique identification of the first node, and storing the position of the data to be uplink provided by the first node in the third sequence and the unique identification of the first node in the first node by the unit with a storage function. Optionally, the first node locally stores a transaction data management table, in which a correspondence is recorded between a unique identifier of the transaction data, a unique identifier allocated by the system to the first node when the transaction data is uplink, a unique identifier of a block to which the transaction data belongs, and a position of the transaction data in a third sequence on the block to which the transaction data belongs. The first node itself is provided with some anti-risk measures to avoid transaction data management table leakage.
In an optional embodiment of the present disclosure, if the second random number returned by the first node is not received before the end of the next block generation period, which indicates that the calculation corresponding to the second random number may have exceeded the calculation power of the first node, or the first node has an anomaly (such as being attacked, interrupted in communication, etc.) after providing the data to be uplink to the system, the specified number is reduced (in a specific manner, the pending sequence with fewer bits may be described in step S114), so as to reduce the second difficulty, and determine that the next block generation period is round-robin. And then, the target nodes are redetermined, the number of the redetermined target nodes is not larger than the number of the target nodes determined last time, so that the occurrence of new target nodes along with the continuation of time is avoided, and the increase of the second difficulty is avoided.
Since there may be a phenomenon that the first node is abnormal, in order to avoid the spread of risks, each time the designated number is reduced, unique identifiers are newly allocated to all the target nodes.
The present specification provides a blockchain-based trade data processing method, and a blockchain-based trade data processing system in which the method may be implemented. Before the data to be uplink provided by the source data node forms a block capable of being uplink, a third sequence is obtained through random sequencing, first occupied data and encryption, and the data to be uplink is in an unknown state on the third sequence. Then, based on the interaction between the system and the source data node, only the source data node providing the data to be uplink knows which position on the third sequence the data to be uplink provided by the source data node is located, and other nodes do not know which position in the third sequence the data to be uplink is located. And if the data on the block is required to be queried, the source data node provides the system with which position of the data to be uplink in the third sequence in the block so as to realize the authentication of the ground source data node. And if the verification is passed, allowing the source data node to acquire the content of the data to be uplink. Therefore, the method of the specification can be combined with the formation process of the block to realize verification of the identity of the node inquiring the data to be uplink, and is beneficial to preventing the risk of privacy leakage.
In an alternative embodiment of the present description, the memory module of the system has a validation table stored therein. And if the second random number returned by the first node is received before the next block generation period is finished, adding the target position corresponding to the first node, the unique identifier of the data to be uplinked uploaded by the first node and the unique identifier of the block to which the data to be uplinked belongs to into a preset verification table after encryption (encryption technical means in the related art are applicable to the specification under the condition of permission).
In the subsequent query process, if a query request of the source data node for querying transaction data recorded in a history block formed on the history on the blockchain is received, the target position (the target position is recorded by the source data node and may be wrong if the source data node is attacked or the source data node is disguised by an illegal node) is resolved from the query request, the unique identifier of the data to be uplink to which the transaction data belongs (similarly, the unique identifier may be wrong), and the unique identifier of the history block (similarly, the unique identifier may be wrong) are taken as available data (optionally, the unique identifier allocated by the history system for the source data node and corresponding to the transaction data may also be available data, so that the accuracy of identification is higher). If the result of encrypting the available data matches (optionally, is the same as, i.e., matches) the contents of the validation table, in this embodiment, no decryption of the validation table is required, and the validation table is always in an encrypted state, which is advantageous in reducing the risk of leakage of the contents of the validation table), then the data in the third sequence corresponding to the target location is decrypted. And then, returning the decrypted result to the source data node which sends the query request. Thus, highly defensive inquiry of transaction data is realized.
Further, the present specification also provides a blockchain-based trade data processing system, the system being separately connected to a source data node and a compute node; the source data node is used for providing data to be uplink to the system, and the calculation node is used for calculating a first random number when the block is uplink; the system comprises:
a target node determination module configured to: determining the source data node uploading the data to be uplink to the system as a target node aiming at the next block generation period;
the first target difficulty determining module is configured to: determining a first target difficulty under the condition that the target node is not unique and the current block generation period is finished;
an instruction sending module configured to: based on the first target difficulty, sending a calculation instruction to the calculation node, so that the calculation node calculates a first random number corresponding to the first target difficulty in a block head of a block to which the data to be uplink belongs;
a first sequence determination module configured to: arranging the data to be uplink according to a random order to obtain a first sequence;
a second sequence determination module configured to: randomly generating a plurality of first occupation data, and inserting the first occupation data into random positions of the first sequence to obtain a second sequence, wherein the second sequence comprises a preset appointed number of data;
A third sequence determination module configured to: encrypting the second sequence by adopting a preset first encryption model to obtain a third sequence which can be used for forming a block;
a target location determination module configured to: any one of the target nodes is used as a first node, and the position of the data to be uplink uploaded by the first node in the third sequence is determined to be used as a target position corresponding to the first node;
a pending sequence determination module configured to: constructing a pending sequence corresponding to the first node, so that the unique identifier of the first node is recorded in the target position of the pending sequence, and a preset value is recorded in the position of the pending sequence except for the target position; or, the unique identifier of the first node and the target position corresponding to the first node are recorded in a certain position of the undetermined sequence, and a preset value is recorded in a position of the undetermined sequence except the certain position; so that the second target difficulty corresponding to the verification sequence obtained based on the undetermined sequence is smaller than the first target difficulty; the verification sequence is obtained by carrying out hash processing on the undetermined sequence;
The second target difficulty sending module is configured to: sending the second target difficulty to the first node, so that the first node calculates a second random number corresponding to the second target difficulty, wherein the second random number characterizes the position of the data to be uplink uploaded by the first node in the third sequence;
the uplink operation module is configured to: and if the second random number returned by the first node is received before the next block generation period is finished, generating a block based on the first random number and linking the block.
The system can execute the method in any of the foregoing embodiments and achieve the same or similar technical effects, and will not be described herein.
Fig. 2 is a schematic structural view of an electronic device according to an embodiment of the present application. Referring to fig. 2, at the hardware level, the electronic device includes a processor, and optionally an internal bus, a network interface, and a memory. The Memory may include a Memory, such as a Random-Access Memory (RAM), and may further include a non-volatile Memory (non-volatile Memory), such as at least 1 disk Memory. Of course, the electronic device may also include hardware required for other services.
The processor, network interface, and memory may be interconnected by an internal bus, which may be an ISA (Industry Standard Architecture ) bus, a PCI (Peripheral Component Interconnect, peripheral component interconnect standard) bus, or EISA (Extended Industry Standard Architecture ) bus, among others. The buses may be classified as address buses, data buses, control buses, etc. For ease of illustration, only one bi-directional arrow is shown in FIG. 2, but not only one bus or type of bus.
And the memory is used for storing programs. In particular, the program may include program code including computer-operating instructions. The memory may include memory and non-volatile storage and provide instructions and data to the processor.
The processor reads the corresponding computer program from the nonvolatile memory into the memory and then runs to form a blockchain-based trade data processing system on a logic level. And the processor is used for executing the program stored in the memory and particularly used for executing any of the block chain-based trade data processing methods.
The above-described blockchain-based trade data processing method disclosed in the embodiment of fig. 1 of the present application may be applied to a processor or implemented by a processor. The processor may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware in a processor or by instructions in the form of software. The processor may be a general-purpose processor, including a central processing unit (Central Processing Unit, CPU), a network processor (Network Processor, NP), etc.; but also digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), field programmable gate arrays (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components. The disclosed methods, steps, and logic blocks in the embodiments of the present application may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of the method disclosed in connection with the embodiments of the present application may be embodied directly in the execution of a hardware decoding processor, or in the execution of a combination of hardware and software modules in a decoding processor. The software modules may be located in a random access memory, flash memory, read only memory, programmable read only memory, or electrically erasable programmable memory, registers, etc. as well known in the art. The storage medium is located in a memory, and the processor reads the information in the memory and, in combination with its hardware, performs the steps of the above method.
The electronic device may also execute a blockchain-based trade data processing method in fig. 1, and implement the functions of the embodiment shown in fig. 1, which is not described herein.
The embodiments of the present application also provide a computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by an electronic device comprising a plurality of application programs, perform any of the aforementioned blockchain-based trade data processing methods.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application 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 application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations 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 a system for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
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 one typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include volatile memory in a computer-readable medium, random Access Memory (RAM) and/or nonvolatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of computer-readable media.
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 storage media for a computer 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 tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device. Computer-readable media, as defined herein, does not include transitory computer-readable media (transmission media), such as modulated data signals and carrier waves.
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 one … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises the element.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application 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 foregoing is merely exemplary of the present application and is not intended to limit the present application. Various modifications and variations of the present application will be apparent to those skilled in the art. Any modification, equivalent replacement, improvement, etc. which come within the spirit and principles of the application are to be included in the scope of the claims of the present application.

Claims (10)

1. A blockchain-based trade data processing method, wherein the method is performed by a blockchain-based trade data processing system, the system being separately connected to a source data node and a compute node; the source data node is used for providing data to be uplink to the system, and the calculation node is used for calculating a first random number when the block is uplink; the method comprises the following steps:
Determining the source data node uploading the data to be uplink to the system as a target node aiming at the next block generation period;
determining a first target difficulty under the condition that the target node is not unique and the current block generation period is finished;
based on the first target difficulty, sending a calculation instruction to the calculation node, so that the calculation node calculates a first random number corresponding to the first target difficulty in a block head of a block to which the data to be uplink belongs;
arranging the data to be uplink according to a random order to obtain a first sequence;
randomly generating a plurality of first occupation data, and inserting the first occupation data into random positions of the first sequence to obtain a second sequence, wherein the second sequence comprises a preset appointed number of data;
encrypting the second sequence by adopting a preset first encryption model to obtain a third sequence which can be used for forming a block;
any one of the target nodes is used as a first node, and the position of the data to be uplink uploaded by the first node in the third sequence is determined to be used as a target position corresponding to the first node;
Constructing a pending sequence corresponding to the first node, so that the unique identifier of the first node is recorded in the target position of the pending sequence, and a preset value is recorded in the position of the pending sequence except for the target position; or, the unique identifier of the first node and the target position corresponding to the first node are recorded in a certain position of the undetermined sequence, and a preset value is recorded in a position of the undetermined sequence except the certain position; so that the second target difficulty corresponding to the verification sequence obtained based on the undetermined sequence is smaller than the first target difficulty; the verification sequence is obtained by carrying out hash processing on the undetermined sequence;
sending the second target difficulty to the first node, so that the first node calculates a second random number corresponding to the second target difficulty, wherein the second random number characterizes the position of the data to be uplink uploaded by the first node in the third sequence;
and if the second random number returned by the first node is received before the next block generation period is finished, generating a block based on the first random number and linking the block.
2. The method of claim 1, wherein the method further comprises:
if the second random number returned by the first node is not received before the next block generation period is finished, reducing the appointed number;
and re-determining the target nodes, and enabling the number of the re-determined target nodes to be not larger than the number of the target nodes determined last time.
3. The method of claim 1, wherein the method further comprises:
and determining that the next block generation period is empty under the condition that the target node is unique and the current block generation period is ended.
4. The method of claim 1, wherein the method further comprises:
and if the second random number returned by the first node is received before the generation period of the next block is finished, the target position corresponding to the first node, the unique identifier of the data to be uplink uploaded by the first node and the unique identifier of the block to which the data to be uplink belong are added into a preset verification table after being encrypted.
5. The method of claim 4, wherein the method further comprises:
If a query request of the source data node for querying transaction data recorded in a history block formed on a history on a blockchain is received, analyzing the target position corresponding to the source data node, the unique identifier of the data to be uplink corresponding to the transaction data and the unique identifier of the history block from the query request as available data;
if the result of encrypting the available data is matched with the content in the verification table, decrypting the data corresponding to the target position in the third sequence of the history block;
and returning the decrypted result to the source data node which sends the query request.
6. The method of claim 1, wherein the hash function employed in computing the first random number or the second random number is SHA-256.
7. The method of claim 1, wherein the duration of the next tile generation period is 10 minutes.
8. A blockchain-based trade data processing system, wherein the system is separately connected to a source data node and a compute node; the source data node is used for providing data to be uplink to the system, and the calculation node is used for calculating a first random number when the block is uplink; the system comprises:
A target node determination module configured to: determining the source data node uploading the data to be uplink to the system as a target node aiming at the next block generation period;
the first target difficulty determining module is configured to: determining a first target difficulty under the condition that the target node is not unique and the current block generation period is finished;
an instruction sending module configured to: based on the first target difficulty, sending a calculation instruction to the calculation node, so that the calculation node calculates a first random number corresponding to the first target difficulty in a block head of a block to which the data to be uplink belongs;
a first sequence determination module configured to: arranging the data to be uplink according to a random order to obtain a first sequence;
a second sequence determination module configured to: randomly generating a plurality of first occupation data, and inserting the first occupation data into random positions of the first sequence to obtain a second sequence, wherein the second sequence comprises a preset appointed number of data;
a third sequence determination module configured to: encrypting the second sequence by adopting a preset first encryption model to obtain a third sequence which can be used for forming a block;
A target location determination module configured to: any one of the target nodes is used as a first node, and the position of the data to be uplink uploaded by the first node in the third sequence is determined to be used as a target position corresponding to the first node;
a pending sequence determination module configured to: constructing a pending sequence corresponding to the first node, so that the unique identifier of the first node is recorded in the target position of the pending sequence, and a preset value is recorded in the position of the pending sequence except for the target position; or, the unique identifier of the first node and the target position corresponding to the first node are recorded in a certain position of the undetermined sequence, and a preset value is recorded in a position of the undetermined sequence except the certain position; so that the second target difficulty corresponding to the verification sequence obtained based on the undetermined sequence is smaller than the first target difficulty; the verification sequence is obtained by carrying out hash processing on the undetermined sequence;
the second target difficulty sending module is configured to: sending the second target difficulty to the first node, so that the first node calculates a second random number corresponding to the second target difficulty, wherein the second random number characterizes the position of the data to be uplink uploaded by the first node in the third sequence;
The uplink operation module is configured to: and if the second random number returned by the first node is received before the next block generation period is finished, generating a block based on the first random number and linking the block.
9. An electronic device, comprising:
a processor; and
a memory arranged to store computer executable instructions which, when executed, cause the processor to perform the method of any of claims 1 to 7.
10. A computer readable storage medium storing one or more programs, which when executed by an electronic device comprising a plurality of application programs, cause the electronic device to perform the method of any of claims 1-7.
CN202310889949.0A 2023-07-20 2023-07-20 Trade data processing method and system based on blockchain Active CN116614317B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310889949.0A CN116614317B (en) 2023-07-20 2023-07-20 Trade data processing method and system based on blockchain

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310889949.0A CN116614317B (en) 2023-07-20 2023-07-20 Trade data processing method and system based on blockchain

Publications (2)

Publication Number Publication Date
CN116614317A CN116614317A (en) 2023-08-18
CN116614317B true CN116614317B (en) 2023-09-12

Family

ID=87685736

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310889949.0A Active CN116614317B (en) 2023-07-20 2023-07-20 Trade data processing method and system based on blockchain

Country Status (1)

Country Link
CN (1) CN116614317B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10657293B1 (en) * 2019-03-26 2020-05-19 Alibaba Group Holding Limited Field-programmable gate array based trusted execution environment for use in a blockchain network
CN115134069A (en) * 2021-03-29 2022-09-30 华为技术有限公司 Block chain editing method and block chain link point
CN115222410A (en) * 2022-07-12 2022-10-21 深圳壹账通智能科技有限公司 Block chain based transaction uplink method and device, electronic equipment and storage medium
CN115277094A (en) * 2022-06-24 2022-11-01 北京天融信网络安全技术有限公司 Block chain-based communication method, terminal, system and storage medium

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10657293B1 (en) * 2019-03-26 2020-05-19 Alibaba Group Holding Limited Field-programmable gate array based trusted execution environment for use in a blockchain network
CN115134069A (en) * 2021-03-29 2022-09-30 华为技术有限公司 Block chain editing method and block chain link point
CN115277094A (en) * 2022-06-24 2022-11-01 北京天融信网络安全技术有限公司 Block chain-based communication method, terminal, system and storage medium
CN115222410A (en) * 2022-07-12 2022-10-21 深圳壹账通智能科技有限公司 Block chain based transaction uplink method and device, electronic equipment and storage medium

Also Published As

Publication number Publication date
CN116614317A (en) 2023-08-18

Similar Documents

Publication Publication Date Title
CN111475849B (en) Private data query method and device based on blockchain account
CN110166411B (en) Data transmission method, device and network node
CN111523110B (en) Authority query configuration method and device based on chain codes
FI125736B (en) Software controlled radio, and procedure to renew a software, and software controlled radio system
CN109918925A (en) Date storage method, back end and storage medium
CN111475850B (en) Intelligent contract-based privacy data query method and device
CA2921740C (en) Enabling access to data
US20100037069A1 (en) Integrated Cryptographic Security Module for a Network Node
CN111461883A (en) Transaction processing method and device based on block chain and electronic equipment
CN110224808B (en) Bank data sharing method and device based on block chain, computer equipment and storage medium
KR20130086387A (en) Method for securely communicating information about the location of a compromised computing device
US9165148B2 (en) Generating secure device secret key
CN110147666B (en) Lightweight NFC identity authentication method in scene of Internet of things and Internet of things communication platform
CN114285551B (en) Quantum key distribution method, quantum key distribution device, readable storage medium and electronic equipment
US11128455B2 (en) Data encryption method and system using device authentication key
US10491570B2 (en) Method for transmitting data, method for receiving data, corresponding devices and programs
JP6188633B2 (en) Computer system, computer, semiconductor device, information processing method, and computer program
CN116614317B (en) Trade data processing method and system based on blockchain
Gandino et al. A security protocol for RFID traceability
CN112418850A (en) Transaction method and device based on block chain and electronic equipment
CN113382021B (en) Financial data processing method
CN114567483B (en) Data transmission method and device and electronic equipment
CN114978714B (en) RISC-V based lightweight data bus encryption safe transmission method
CN113312650B (en) Transaction log privacy protection method and device
US11785448B2 (en) Method and device for implementing secure communication, 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
GR01 Patent grant
GR01 Patent grant