CN110046990B - Data processing method, device and server based on block chain - Google Patents
Data processing method, device and server based on block chain Download PDFInfo
- Publication number
- CN110046990B CN110046990B CN201811308455.4A CN201811308455A CN110046990B CN 110046990 B CN110046990 B CN 110046990B CN 201811308455 A CN201811308455 A CN 201811308455A CN 110046990 B CN110046990 B CN 110046990B
- Authority
- CN
- China
- Prior art keywords
- transaction information
- information
- submitting
- combined
- blockchain
- 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
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 12
- 238000000034 method Methods 0.000 claims abstract description 29
- 238000012545 processing Methods 0.000 claims description 9
- 230000008569 process Effects 0.000 claims description 5
- 238000004364 calculation method Methods 0.000 claims description 2
- 238000005315 distribution function Methods 0.000 description 13
- 238000005516 engineering process Methods 0.000 description 7
- 230000006872 improvement Effects 0.000 description 7
- 238000012795 verification Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 230000007246 mechanism Effects 0.000 description 3
- 238000003860 storage Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000007596 consolidation process Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 238000009826 distribution Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000001413 cellular effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 239000010979 ruby Substances 0.000 description 1
- 229910001750 ruby Inorganic materials 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Classifications
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- General Health & Medical Sciences (AREA)
- Bioethics (AREA)
- Health & Medical Sciences (AREA)
- Physics & Mathematics (AREA)
- Marketing (AREA)
- Databases & Information Systems (AREA)
- Technology Law (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Development Economics (AREA)
- Medical Informatics (AREA)
- General Business, Economics & Management (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The embodiment of the specification provides a data processing method, device and server based on a blockchain. The method comprises the following steps: calculating the submitting time according to the reference time and the submitting time interval; after the submitting time arrives, merging at least one piece of original transaction information received in the submitting time interval to obtain at least one piece of merged transaction information; submitting the at least one consolidated transaction information to the blockchain.
Description
Technical Field
Embodiments of the present disclosure relate to the field of computer technologies, and in particular, to a data processing method, device and server based on a blockchain.
Background
The blockchain technology is a distributed database technology, and the data cannot be tampered and counterfeited by utilizing cryptography and a consensus mechanism. With the development of computer and internet technologies, the blockchain technology is popular with the advantages of decentralization, transparency, non-tampering, trust and the like, and is widely applied to numerous scenes such as intelligent contracts, securities trading, electronic commerce, the internet of things, social communication, file storage, presence evidence, identity verification, stock crowd funding and the like.
Currently, when the blockchain technique is applied to the above scenario, since transaction information of each transaction needs to be sent to the blockchain for verification, implementation and uplink, the transaction number of the account runs the risk of being revealed to a third party.
For privacy protection, a technical solution capable of hiding the transaction number is needed in business.
Disclosure of Invention
An object of the embodiments of the present disclosure is to provide a blockchain-based data processing method, device and server to hide the transaction number of an account on a blockchain.
To achieve the above object, an embodiment of the present disclosure provides a data processing method based on a blockchain, including:
Calculating the submitting time according to the reference time and the submitting time interval;
After the submitting time arrives, merging at least one piece of original transaction information received in the submitting time interval to obtain at least one piece of merged transaction information;
submitting the at least one consolidated transaction information to the blockchain.
To achieve the above object, embodiments of the present invention provide a blockchain-based data processing apparatus, including
The calculation unit is used for calculating the submitting time according to the reference time and the submitting time interval;
The merging unit is used for merging at least one piece of original transaction information received in the submitting time interval after the submitting time arrives, so as to obtain at least one piece of merged transaction information;
And the submitting unit is used for submitting the at least one combined transaction information to the blockchain.
To achieve the above object, embodiments of the present disclosure provide a server, including:
a memory for storing computer instructions;
a processor for executing the computer instructions to perform the steps of: calculating the submitting time according to the reference time and the submitting time interval; after the submitting time arrives, merging at least one piece of original transaction information received in the submitting time interval to obtain at least one piece of merged transaction information; submitting the at least one consolidated transaction information to the blockchain.
As can be seen from the technical solutions provided in the embodiments of the present disclosure, the sink server may perform merging processing on the original transaction information received in the submitting time interval, so that the third party cannot obtain the number of original transaction information actually submitted to the blockchain, thereby hiding the transaction number of the sink account on the blockchain. In addition, by combining the original transaction information received during the commit time interval, the amount of transaction information processed by the blockchain can also be reduced, and thus the burden on the blockchain throughput can be reduced.
Drawings
In order to more clearly illustrate the embodiments of the present description or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described below, it being obvious that the drawings in the following description are only some of the embodiments described in the present description, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of a data processing method according to an embodiment of the present disclosure;
FIG. 2 is a schematic diagram of a data processing method according to an embodiment of the present disclosure;
FIG. 3 is a schematic functional diagram of a data processing apparatus according to an embodiment of the present disclosure;
Fig. 4 is a functional schematic diagram of a server according to an embodiment of the present disclosure.
Detailed Description
The technical solutions of the embodiments of the present specification will be clearly and completely described below with reference to the drawings in the embodiments of the present specification, and it is apparent that the described embodiments are only some embodiments of the present specification, not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are intended to be within the scope of the present disclosure.
Please refer to fig. 1 and 2. The embodiment of the specification provides a data processing method based on a block chain.
In this embodiment, the blockchain (blockchain) may be a distributed ledger that organizes a plurality of blockdata in a chained structure according to a time sequence, and guarantees security, traceability, and non-falsifiability by using a cryptographic algorithm. The blockchains may include public blockchains, federated blockchains (also known as federated blockchains), private blockchains, and the like. The blockchain may be implemented based on a blockchain network. The blockchain network may include a P2P network (peer-to-peer network) or the like. The blockchain network may include a plurality of blockchain nodes. And the unified blockchain ledgers are commonly maintained among the blockchain nodes.
In this embodiment, the data processing method uses the sender server as an execution subject. The sender server may join the blockchain network as a blockchain node. An account of the sink may be logged into the sink server. The exporter account may be an account of an exporter in the blockchain. The sink server is capable of communicating with clients. The client may be, for example, a smart phone, a tablet electronic device, a portable computer, a Personal Digital Assistant (PDA), or a smart wearable device, etc. The data processing method may include the following steps.
Step S10: and calculating the commit time according to the reference time and the commit time interval.
In this embodiment, the reference time may include at least one of: the time of last submitting combined transaction information to the blockchain, the time of last submitting false transaction information to the blockchain. Details regarding the combined transaction information and the dummy transaction information will be presented in the following process.
In this embodiment, the value of the commit time interval may be flexibly set according to the service requirement. Specifically, the value of the submitting time interval may be a fixed value; or the method can be divided into time periods according to the actual service demand, and each time period is set to be a fixed value; or may be a random value. For example, the value of the commit time interval at the peak of the transaction may be set to 0.1 seconds (shorter or longer may also be set depending on the business requirements); the value of the commit time interval at the low valley period of the transaction may be set to 1 minute (shorter or longer may also be set depending on the business requirements). Of course, the value of the commit time interval may also be set according to a distribution function, so that the value of the commit time interval satisfies the distribution function. The distribution functions may include, for example, an exponential distribution function and an allangerhans distribution (Erlang Distribution) function. Wherein the expression of the exponential distribution function can beThe expression of the Allang distribution function can beWhere x represents the value of the commit time interval; lambda represents the arrival rate; k represents the order of the allran distribution function. Wherein the arrival rate may represent the number of event occurrences per unit time. In some examples of scenarios, the arrival rate may specifically represent the number of transactions per unit time. In actual business, for example, the expected transaction (including real and spurious transactions) arrival rate D for the commit time interval may be set; the actual arrival rate E of the actual transaction may be counted. Then λ=d-E in the exponential distribution function and the allron distribution function. Of course, it should be understood by those skilled in the art that the above manner of setting the values of the commit time intervals according to the distribution function and the alwnian distribution function is merely an example, and that the values of the commit time intervals may be set according to the distribution function and the alwnian distribution function in fact in any other suitable manner.
In this embodiment, the sender server may add the reference time and the commit time interval to obtain the commit time. Specifically, the sender server may add the time when the transaction information was last submitted to the blockchain to the commit time interval to obtain the commit time. The time at which the transaction information was last submitted to the blockchain may be the time at which the consolidated transaction information was submitted, or may also be the time at which the spurious transaction information was submitted.
Step S12: and after the submitting moment arrives, merging at least one piece of original transaction information received in the submitting time interval to obtain at least one piece of merged transaction information.
In this embodiment, the original transaction information may be transaction information from the client. Specifically, during the commit time interval, the client may send transaction information to the exporter server, which may receive the transaction information as original transaction information. Wherein the original transaction information may include a sink account identification and its corresponding original transaction amount. The sender account identification may be used to identify a sender account, such as a name or address of the sender account. In one implementation of this embodiment, the original transaction information may further include real business information. The real service information may include, for example, an order number, user information, and the like. The original transaction information may directly include the real service information, or may further include ciphertext of the real service information. Further, in this embodiment, the original transaction information may further include signature information of the real business information.
In this embodiment, the consolidated transaction information may include at least one sink account identification and its corresponding consolidated transaction amount. In the consolidated transaction information, a consolidated transaction amount corresponding to the sender account identifier may be calculated according to an original transaction amount corresponding to the sender account identifier, for example, a sum of the original transaction amounts corresponding to the sender account identifier may be calculated. In one implementation of this embodiment, the original transaction information may include real business information. Accordingly, the consolidated transaction information may include real business information corresponding to at least one sender account identification. The real business information corresponding to the sink account identifier in the merged transaction information can be determined according to the real business information corresponding to the sink account identifier in the original transaction information. The consolidated transaction information may directly include the real service information, or may further include ciphertext of the real service information. Further, in this embodiment, the combined transaction information may further include signature information of the real service information.
In this embodiment, the amount of original transaction information received by the sender server during the commit time interval may be one or more. When the number of received original transaction information is one, the sender server may directly use the original transaction information as the combined transaction information. When the number of received original transaction information is a plurality, the sender server may combine the plurality of original transaction information into at least one combined transaction information. In particular, the sender server may combine the plurality of original transaction information into at least one combined transaction information in any manner. For example, the sender server may combine the plurality of original transaction information into one combined transaction information. As another example, the sender server may combine the original transaction information having the same sender account identifier in the plurality of original transaction information into one combined transaction information.
In one example scenario, the original transaction information received by the sender server during the commit time interval may include 5 of A1, A2, A3, B1, B2, etc. The 5 pieces of original transaction information may be as shown in table 1 below.
TABLE 1
| Name of original transaction information | Inward account identification | Transaction amount |
| A1 | A | 10 |
| A2 | A | 20 |
| A3 | A | 30 |
| B1 | B | 40 |
| B2 | B | 50 |
The sender server may combine the 5 original transaction information into one combined transaction information. The consolidated transaction information obtained by consolidation may be as shown in table 2 below.
TABLE 2
| Inward account identification | Transaction amount |
| A | 60 |
| B | 90 |
In another example scenario, the original transaction information received by the sender server during the commit time interval may include 5 of A4, A5, A6, B3, B4, etc. The 5 pieces of original transaction information may be as shown in table 3 below.
TABLE 3 Table 3
| Name of original transaction information | Inward account identification | Transaction amount | Service information | Signature information |
| A4 | A | 10 | A4_D | A4_QM |
| A5 | A | 20 | A5_D | A5_QM |
| A6 | A | 30 | A6_D | A6_QM |
| B3 | B | 40 | B3_D | B3_QM |
| B4 | B | 50 | B4_D | B4_QM |
The sender server may combine the 5 original transaction information into one combined transaction information. The consolidated transaction information obtained by the consolidation may be as shown in table 4 below.
TABLE 4 Table 4
Of course, the sender server may also merge the 5 original transaction messages into two merged transaction messages. The combined transaction information obtained by the combination may be shown in the following tables 5 and 6, respectively.
TABLE 5
TABLE 6
Step S14: submitting the at least one consolidated transaction information to the blockchain.
In this embodiment, the sink device may submit the at least one consolidated transaction information to the blockchain; so that the common blockchain node in the blockchain can update the balance of the sink account and the balance of the sink account according to the combined transaction amount in the combined transaction information. For example, deducting the consolidated transaction amount from the balance of the sink account; the combined transaction amount is credited to the balance of the sender account. The sink device may submit the at least one merged transaction information to the blockchain at the same time, or may also submit the at least one merged transaction information to the blockchain separately.
In one implementation of this embodiment, before submitting the at least one consolidated transaction information to the blockchain, for each of the at least one consolidated transaction information, the sink server may further generate verification information from the consolidated transaction information; the verification information may be added to the consolidated transaction information. For example, the verification information may include signature information that incorporates transaction information.
In one implementation of this embodiment, the sender server may further encrypt the consolidated transaction amount in the at least one consolidated transaction information prior to submitting the at least one consolidated transaction information to the blockchain. This allows for hiding and confidentiality of the consolidated transaction amount.
In one implementation of this embodiment, the sender server may be provided with a set of false traffic information. The set of dummy service information may include at least one dummy service information. The dummy service information may include, for example, a dummy order number, dummy user information, and so on. The dummy service information may be preset. In this manner, the sender server may further select, for each sender account identifier in each merged transaction information, at least one piece of dummy service information from the set of dummy service information as the corresponding dummy service information in the merged transaction information before submitting the at least one merged transaction information to the blockchain. The number of the selected false service information can be flexibly set according to service requirements, for example, 1,2 or 5 false service information can be selected. Thus, by adding false business information into the combined transaction information, the quantity of the real business information in the combined transaction information can be hidden, and the transaction number is prevented from being leaked through the quantity of the real business information in the combined transaction information.
Further, in this embodiment, the dummy service information in the set of dummy service information may correspond to signature information. Accordingly, each consolidated transaction information may also include signature information corresponding to the dummy transaction information.
Further, in this embodiment, the false service information in the set of false service information may correspond to an account identifier of the sender. In this way, for each sender account identifier in each merged transaction information, the sender server may select, from the set of false service information, the false service information corresponding to the sender account identifier as the false service information in the merged transaction information.
For example, the set of dummy traffic information may include dummy traffic information AXJ _ D, AXJ2_ D, AXJ3_ D, BXJ1 _1_ D, BXJ2 _2_d. Wherein the dummy service information AXJ1_ D, AXJ2_ D, AXJ3_d may correspond to the sink account identification a; the dummy service information bxj1_ D, BXJ2_d may correspond to the sink account identification B. The signature information of the dummy traffic information AXJ1_ D, AXJ2_ D, AXJ3_ D, BXJ1 _1_ D, BXJ2_d may be AXJ1_qm, axj2_qm, axj3_qm, bxj1_qm, bxj2_qm, respectively.
The combined transaction information obtained by the combination may be as shown in the above table 4. Then, after adding the dummy transaction information, the consolidated transaction information may be as shown in table 7 below.
TABLE 7
In one implementation of this embodiment, the client may not send transaction information to the sender server during the commit time interval. Such that the sink server does not receive the original transaction information during the commit time interval. The sink server may thus generate spurious transaction information. The fraudulent transaction information may include a sink account identification and its corresponding zero value transaction amount. The sender server may obtain the sender account identification as the sender account identification in the fraudulent transaction information in any manner. For example, the sender server may randomly choose an account identification in a blockchain as the sender account identification in the spurious transaction information.
The remitter server can encrypt the transaction amount with the value of zero in the false transaction information; the spurious transaction information may be submitted to the blockchain. Thus, after the common block chain link point in the block chain updates the balance of the account of the sink and the balance of the account of the sink according to the transaction amount with the value of zero, the balance of the account of the sink and the balance of the account of the sink can be kept unchanged.
In this embodiment, the remitter server may perform merging processing on the original transaction information received in the submitting time interval, so that the third party cannot obtain the number of the original transaction information actually submitted to the blockchain, thereby hiding the transaction number of the remitter account on the blockchain. In addition, by combining the original transaction information received during the commit time interval, the amount of transaction information processed by the blockchain can also be reduced, and thus the burden on the blockchain throughput can be reduced.
Please refer to fig. 1 and 2. One example of a scenario for the embodiments of the present description is presented below.
In this scenario example, the sink device may have a set of spurious traffic information stored locally in advance. The set of dummy service information may include at least one dummy service information. The false business information in the false business information set may correspond to the sender account identification and signature information. The false service information in the false service information set can be agreed in advance by the sink and the sink. Specifically, for example, the sink may generate dummy service information in advance and transmit it to the sink. The importer can sign the false service information to obtain the signature information of the false service information; the signature information of the dummy service information can be fed back to the sink.
In this scenario example, the exporter server may add the time of the last submission of the transaction information to the blockchain to the commit time interval to obtain the commit time. The time of last submitting transaction information to the blockchain can be the time of submitting false transaction information or the time of submitting real transaction information. After the submitting time arrives, the remitter server can combine at least one original transaction information received in the submitting time interval to obtain at least one combined transaction information.
In this scenario example, the exporter's server may process the at least one consolidated transaction information as follows.
And selecting false business information corresponding to the account identifier of the importer from the false business information set as false business information in the combined transaction information aiming at the account identifier of the importer in each combined transaction information.
And encrypting the combined transaction amount in the at least one piece of combined transaction information.
Carrying out signature processing on each piece of combined transaction information to obtain signature information; the signature information is added to the consolidated transaction information.
In this scenario example, after the above-described processing, the exporter server may submit the at least one consolidated transaction information to the blockchain.
The blockchain may determine a consensus blockchain node based on a consensus mechanism. For each consolidated transaction information, the common blockchain node may verify whether the transaction has been executed using the anti-double or anti-replay mechanism of the related art; if already performed, the transaction may be rejected; if not, verifying whether the signature information in the combined transaction information is correct; if not, the transaction may be declined; if so, the balance of the sink account and the balance of the sender account may be updated based on the consolidated transaction amount in the consolidated transaction information.
Please refer to fig. 3. The embodiment of the specification provides a data processing device based on a block chain. The apparatus may comprise the following units.
A calculating unit 20 for calculating a commit time according to the reference time and the commit time interval;
A merging unit 22, configured to, after the commit time arrives, merge at least one piece of original transaction information received in the commit time interval, so as to obtain at least one piece of merged transaction information;
a submitting unit 24 for submitting the at least one merged transaction information to the blockchain.
Please refer to fig. 4. The embodiment of the specification also provides a server. The server may include a memory and a processor.
In this embodiment, the memory may be implemented in any suitable manner. For example, the memory may be a read-only memory, a mechanical hard disk, a solid state hard disk, or a usb disk. The memory may be used to store computer instructions.
In this embodiment, the processor may be implemented in any suitable manner. For example, a processor 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, application SPECIFIC INTEGRATED Circuits (ASICs), programmable logic controllers, and embedded microcontrollers, among others. The processor may execute the computer instructions to implement the steps of: calculating the submitting time according to the reference time and the submitting time interval; after the submitting time arrives, merging at least one piece of original transaction information received in the submitting time interval to obtain at least one piece of merged transaction information; submitting the at least one consolidated transaction information to the blockchain.
It should be noted that, in the present specification, each embodiment is described in a progressive manner, and the same or similar parts of each embodiment are referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for the device embodiment and the server embodiment, since they are substantially similar to the method embodiment, the description is relatively simple, and reference is made to the partial description of the method embodiment for relevant points.
Those skilled in the art, after reading this specification, will recognize without undue burden that any and all of the embodiments set forth herein can be combined, and that such combinations are within the scope of the disclosure and protection of the present specification.
In the 90 s of the 20 th century, improvements to one technology could clearly be distinguished as improvements in hardware (e.g., improvements to circuit structures such as diodes, transistors, switches, etc.) or software (improvements to the process flow). However, with the development of technology, many improvements of the current method flows can be regarded as direct improvements of hardware circuit structures. Designers almost always obtain corresponding hardware circuit structures by programming improved method flows into hardware circuits. Therefore, an improvement of a method flow cannot be said to be realized by a hardware entity module. For example, a programmable logic device (Programmable Logic Device, PLD) (e.g., field programmable gate array (Field Programmable GATE ARRAY, FPGA)) is an integrated circuit whose logic functions are determined by user programming of the device. 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 2. Moreover, nowadays, instead of manually manufacturing integrated circuit chips, such programming is mostly implemented with "logic compiler (logic compiler)" software, which is similar to the software compiler used in program development and writing, and the original code before being compiled is also written in a specific programming language, which is called hardware description language (Hardware Description Language, HDL), but HDL is not just one, but a plurality of kinds, such as ABEL(Advanced Boolean Expression Language)、AHDL(Altera Hardware Description Language)、Confluence、CUPL(Cornell University Programming Language)、HDCal、JHDL(Java Hardware Description Language)、Lava、Lola、MyHDL、PALASM、RHDL(Ruby Hardware Description Language), and VHDL (Very-High-SPEED INTEGRATED Circuit Hardware Description Language) and Verilog2 are currently most commonly used. It will also be apparent to those skilled in the art that a hardware circuit implementing the logic method flow can be readily obtained by merely slightly programming the method flow into an integrated circuit using several of the hardware description languages described above.
The system, apparatus, module or unit set forth in the above embodiments may be implemented in particular by a computer chip or entity, or by a product having a certain function. One typical implementation is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a cellular telephone, a camera phone, a smart phone, 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.
From the above description of embodiments, it will be apparent to those skilled in the art that the present description may be implemented in software plus a necessary general purpose hardware platform. Based on this understanding, the technical solution of the present specification may be embodied in essence or a part contributing to the prior art in the form of a software product, which may be stored in a storage medium, such as a ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method described in the embodiments or some parts of the embodiments of the present specification.
The specification is operational with numerous general purpose or special purpose computer system environments or configurations. For example: personal computers, server computers, hand-held or portable devices, tablet devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
The 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.
Although the present specification has been described by way of example, it will be appreciated by those skilled in the art that there are many variations and modifications to the specification without departing from the spirit of the specification, and it is intended that the appended claims encompass such variations and modifications as do not depart from the spirit of the specification.
Claims (13)
1. A blockchain-based data processing method, comprising:
Calculating the submitting time according to the reference time and the submitting time interval;
After the commit time arrives, merging the at least one piece of original transaction information received in the commit time interval to obtain at least one piece of merged transaction information, wherein the merging process comprises the following steps: when the number of the received original transaction information is one, the received original transaction information is taken as combined transaction information, and when the number of the received original transaction information is a plurality of the received original transaction information, the received plurality of the original transaction information is combined into at least one combined transaction information;
submitting the at least one consolidated transaction information to the blockchain.
2. The method of claim 1, the reference time being a time of a last submission of consolidated transaction information to the blockchain or a time of a last submission of false transaction information to the blockchain, the false transaction information including a sender account identification and its corresponding transaction amount of zero value.
3. The method of claim 1, the original transaction information comprising a sender account identification and its corresponding original transaction amount; the combined transaction information comprises an identifier of an account of an importer and a corresponding combined transaction amount; and calculating the combined transaction amount corresponding to the sender account identifier according to the original transaction amount corresponding to the sender account identifier.
4. The method of claim 3, wherein the consolidated transaction amount corresponding to the sender account identification is a sum of the original transaction amounts corresponding to the sender account identification.
5. The method of claim 3, prior to submitting the at least one consolidated transaction information to the blockchain, the method further comprising:
and encrypting the combined transaction amount in the at least one piece of combined transaction information.
6. The method of claim 1, wherein the original transaction information includes an importer account identification and corresponding real business information; the combined transaction information comprises an account identifier of an importer and corresponding real service information; the real business information corresponding to the sink account identification in the combined transaction information is obtained by determining the real business information corresponding to the sink account identification in the original transaction information.
7. The method of claim 6, wherein the original transaction information further comprises signature information of real business information; the consolidated transaction information also includes signature information for the authentic transaction information.
8. The method of claim 1, provided with a set of false traffic information; the set of dummy service information includes at least one dummy service information; accordingly, prior to submitting the at least one consolidated transaction information to the blockchain, the method further includes:
And selecting at least one false business information from the false business information set as the false business information corresponding to the sender account identifier in the merged transaction information aiming at the sender account identifier in the merged transaction information.
9. The method of claim 8, wherein the set of dummy service information corresponds to an importer account identifier; accordingly, the step of selecting the dummy service information includes:
And selecting false business information corresponding to the account identifier of the importer from the false business information set aiming at the account identifier of the importer in the combined transaction information, and taking the false business information as the false business information in the combined transaction information.
10. The method of claim 8, wherein the consolidated transaction information further includes signature information for dummy transaction information.
11. The method of claim 1, the method further comprising:
Generating false transaction information under the condition that original transaction information is not received in the submitting time interval; the false transaction information comprises an identifier of an account of an importer and a corresponding transaction amount with a value of zero;
Encrypting the transaction amount with the value of zero;
Submitting the false transaction information to the blockchain.
12. A data processing apparatus based on a blockchain includes
The calculation unit is used for calculating the submitting time according to the reference time and the submitting time interval;
the merging unit is configured to, after the commit time arrives, merge at least one piece of original transaction information received in the commit time interval to obtain at least one piece of merged transaction information, where the merging unit includes: when the number of the received original transaction information is one, the received original transaction information is taken as combined transaction information, and when the number of the received original transaction information is a plurality of the received original transaction information, the received plurality of the original transaction information is combined into at least one combined transaction information;
And the submitting unit is used for submitting the at least one combined transaction information to the blockchain.
13. A server, comprising:
a memory for storing computer instructions;
a processor for executing the computer instructions to perform the steps of: calculating the submitting time according to the reference time and the submitting time interval; after the commit time arrives, merging the at least one piece of original transaction information received in the commit time interval to obtain at least one piece of merged transaction information, wherein the merging process comprises the following steps: when the number of the received original transaction information is one, the received original transaction information is taken as combined transaction information, and when the number of the received original transaction information is a plurality of the received original transaction information, the received plurality of the original transaction information is combined into at least one combined transaction information; submitting the at least one consolidated transaction information to a blockchain.
Priority Applications (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811308455.4A CN110046990B (en) | 2018-11-05 | 2018-11-05 | Data processing method, device and server based on block chain |
| PCT/CN2019/098110 WO2020093736A1 (en) | 2018-11-05 | 2019-07-29 | Blockchain-based data processing method and apparatus, and server |
| TW108128082A TWI718614B (en) | 2018-11-05 | 2019-08-07 | Data processing method, device and server based on blockchain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811308455.4A CN110046990B (en) | 2018-11-05 | 2018-11-05 | Data processing method, device and server based on block chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110046990A CN110046990A (en) | 2019-07-23 |
| CN110046990B true CN110046990B (en) | 2024-08-02 |
Family
ID=67273139
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811308455.4A Active CN110046990B (en) | 2018-11-05 | 2018-11-05 | Data processing method, device and server based on block chain |
Country Status (3)
| Country | Link |
|---|---|
| CN (1) | CN110046990B (en) |
| TW (1) | TWI718614B (en) |
| WO (1) | WO2020093736A1 (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110046990B (en) * | 2018-11-05 | 2024-08-02 | 创新先进技术有限公司 | Data processing method, device and server based on block chain |
| CN110909038B (en) * | 2019-10-24 | 2021-05-11 | 支付宝(杭州)信息技术有限公司 | Data processing method and device based on block chain and electronic equipment |
| CN110929293B (en) * | 2019-12-11 | 2022-11-15 | 佛山科学技术学院 | Beautifying data storage system based on block chain |
| US20210314139A1 (en) * | 2020-04-01 | 2021-10-07 | International Business Machines Corporation | Noisy transaction for protection of data |
| CN112435120B (en) * | 2020-11-05 | 2023-01-31 | 德州职业技术学院（德州市技师学院） | Block chain data supervision method and system |
| CN113641664A (en) * | 2021-07-13 | 2021-11-12 | 华中科技大学 | Lightweight data storage device and method suitable for schema block chain |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106549749A (en) * | 2016-12-06 | 2017-03-29 | 杭州趣链科技有限公司 | A kind of block chain method for secret protection encrypted based on additive homomorphism |
| CN107239940A (en) * | 2017-05-11 | 2017-10-10 | 北京博晨技术有限公司 | Network trading method and device based on block catenary system |
| CN108198018A (en) * | 2017-12-27 | 2018-06-22 | 邵美 | A kind of trade network system and its implementation for block chain address ranking |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10417217B2 (en) * | 2016-08-05 | 2019-09-17 | Chicago Mercantile Exchange Inc. | Systems and methods for blockchain rule synchronization |
| CN106330431A (en) * | 2016-08-29 | 2017-01-11 | 北京瑞卓喜投科技发展有限公司 | Data processing method, apparatus and system based on block chain technology |
| CN106899698B (en) * | 2017-04-11 | 2020-12-18 | 张铮文 | Cross-chain interoperation method between block chains |
| CN107678865A (en) * | 2017-09-20 | 2018-02-09 | 中国银行股份有限公司 | The verification method and system of block chain based on transaction packet |
| CN108062672B (en) * | 2017-12-07 | 2022-03-18 | 北京泛融科技有限公司 | Flow scheduling method based on block chain intelligent contract |
| CN108540484A (en) * | 2018-04-23 | 2018-09-14 | 北京云图科瑞科技有限公司 | A kind of method of commerce, apparatus and system based on block chain |
| CN110046990B (en) * | 2018-11-05 | 2024-08-02 | 创新先进技术有限公司 | Data processing method, device and server based on block chain |
-
2018
- 2018-11-05 CN CN201811308455.4A patent/CN110046990B/en active Active
-
2019
- 2019-07-29 WO PCT/CN2019/098110 patent/WO2020093736A1/en active Application Filing
- 2019-08-07 TW TW108128082A patent/TWI718614B/en active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106549749A (en) * | 2016-12-06 | 2017-03-29 | 杭州趣链科技有限公司 | A kind of block chain method for secret protection encrypted based on additive homomorphism |
| CN107239940A (en) * | 2017-05-11 | 2017-10-10 | 北京博晨技术有限公司 | Network trading method and device based on block catenary system |
| CN108198018A (en) * | 2017-12-27 | 2018-06-22 | 邵美 | A kind of trade network system and its implementation for block chain address ranking |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110046990A (en) | 2019-07-23 |
| TW202018644A (en) | 2020-05-16 |
| WO2020093736A1 (en) | 2020-05-14 |
| TWI718614B (en) | 2021-02-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110046990B (en) | Data processing method, device and server based on block chain | |
| CN111833186B (en) | Transaction method, device and node equipment based on blockchain | |
| CN111833057B (en) | Transaction method, device and node equipment based on blockchain | |
| CN110520882B (en) | Parallel execution of transactions in a blockchain network | |
| CN111080295B (en) | Electronic contract processing method and device based on blockchain | |
| CN111095326B (en) | Methods, systems, and apparatus for performing multiple transactions in a blockchain network | |
| US11057217B2 (en) | Performing parallel execution of transactions in a distributed ledger system | |
| CN110457912B (en) | Data processing method and device and electronic equipment | |
| US20200034834A1 (en) | Blockchain-based asset transfer method and apparatus, and electronic device | |
| CN111095325B (en) | Parallel execution of transactions in a distributed ledger system | |
| US11270004B2 (en) | Blockchain-based transaction privacy | |
| CN109308211B (en) | Method, apparatus and storage medium for processing transaction data in a blockchain | |
| CN111066047A (en) | Implementing a blockchain based workflow | |
| CN110263580B (en) | Data processing method and device based on block chain and block chain link points | |
| CN110998633A (en) | Method and apparatus for avoiding double-flower problem in block chain technology based on read-write set model | |
| CN112131593A (en) | Information-based feature encryption method, device, equipment and storage medium | |
| KR102522981B1 (en) | Blockchain-based Smishing Prevention method and apparatus thereof | |
| CN116112293B (en) | Block chain-based data trusted transaction method and device, equipment and medium | |
| CN113127535B (en) | Data processing method and device based on block chain and electronic equipment | |
| CN116628097A (en) | Data maintenance method and system | |
| CN115643002A (en) | Service processing method, device and storage medium | |
| CN111865580A (en) | token generation and verification method and device, computer equipment 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 | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 40010920 Country of ref document: HK |
|
| TA01 | Transfer of patent application right |
Effective date of registration: 20201012 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: 20201012 Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Applicant after: Advanced innovation technology Co.,Ltd. Address before: Greater Cayman, British Cayman Islands Applicant before: Alibaba Group Holding Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20240923 Address after: Guohao Times City # 20-01, 128 Meizhi Road, Singapore Patentee after: Ant Chain Technology Co.,Ltd. Country or region after: Singapore Address before: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman ky1-9008 Patentee before: Innovative advanced technology Co.,Ltd. Country or region before: Cayman Islands |
|
| TR01 | Transfer of patent right |