WO2020134620A1 - 一种受理区块链存证交易的方法及系统 - Google Patents

一种受理区块链存证交易的方法及系统 Download PDF

Info

Publication number
WO2020134620A1
WO2020134620A1 PCT/CN2019/116010 CN2019116010W WO2020134620A1 WO 2020134620 A1 WO2020134620 A1 WO 2020134620A1 CN 2019116010 W CN2019116010 W CN 2019116010W WO 2020134620 A1 WO2020134620 A1 WO 2020134620A1
Authority
WO
WIPO (PCT)
Prior art keywords
evidence
hash
network
forensic
hashes
Prior art date
Application number
PCT/CN2019/116010
Other languages
English (en)
French (fr)
Inventor
杨新颖
Original Assignee
阿里巴巴集团控股有限公司
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 阿里巴巴集团控股有限公司 filed Critical 阿里巴巴集团控股有限公司
Priority to SG11202100651XA priority Critical patent/SG11202100651XA/en
Priority to EP19906401.5A priority patent/EP3816924B1/en
Publication of WO2020134620A1 publication Critical patent/WO2020134620A1/zh
Priority to US17/160,674 priority patent/US11086965B2/en
Priority to US17/391,221 priority patent/US11275814B2/en

Links

Images

Classifications

    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/958—Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking
    • 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
    • G06Q30/00—Commerce
    • G06Q30/018—Certifying business or products
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/951—Indexing; Web crawling techniques
    • 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
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
    • G06Q20/3827—Use of message hashing
    • 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
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/389—Keeping log of transactions for guaranteeing non-repudiation of a transaction
    • 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
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/18—Legal services
    • 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/0618—Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation
    • 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/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
    • H04L9/3239—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
    • 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
    • G06Q2220/00—Business processing using cryptography
    • 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

Definitions

  • the embodiments of the present specification relate to the field of information technology, and in particular, to a method and system for accepting blockchain deposit transaction.
  • a node in the blockchain network is generally responsible for grabbing the network evidence. Then, the node will calculate the evidence hash of the grabbed network evidence and based on The evidence hash constructs the certificate deposit transaction, and then the node accepts the certificate deposit transaction constructed by itself on the one hand, and broadcasts the constructed certificate deposit transaction to other nodes for acceptance on the other hand.
  • the node accepts the certificate storage transaction, which means that the node will cache the certificate storage transaction locally, so that when each node needs to reach consensus, it is cached in each node Only the node's local deposit transaction can be packaged into the block and then written into the blockchain.
  • the embodiments of this specification provide a method and system for accepting blockchain deposit transactions, and the technical solutions are as follows:
  • Each node of the blockchain network includes a plurality of forensic nodes responsible for grabbing network evidence.
  • the method includes:
  • the forensic node grabs the network evidence from the target evidence source and calculates the evidence hash of the grabbed network evidence
  • an apparatus for accepting blockchain certificate deposit transactions Each node of the blockchain network includes a plurality of the apparatuses responsible for capturing network evidence.
  • the apparatus includes:
  • the grab calculation module grabs the network evidence from the target evidence source and calculates the evidence hash of the grabbed network evidence
  • the sending and receiving module sends the calculated hash of evidence to other forensic nodes, and receives the hash of evidence sent by other forensic nodes;
  • the grouping module divides the same evidence hash among all the obtained evidence hashes into the same group, and divides the different evidence hash among the obtained all evidence hashes into different groups;
  • the statistical processing module counts the number of evidence hashes in each group, and determines the evidence hash in the group with the largest number as a trusted evidence hash;
  • the acceptance module based on the determined credible evidence hash, constructs a certificate deposit transaction and accepts it.
  • a blockchain system including a blockchain network; wherein, each node of the blockchain network includes multiple forensic nodes responsible for capturing network evidence;
  • Each forensic node grabs the network evidence from the target evidence source and calculates the evidence hash of the grabbed network evidence; sends the calculated evidence hash to other forensic nodes and receives the evidence hash sent by other forensic nodes;
  • the same evidence hash among all obtained evidence hashes is divided into the same group, and different evidence hashes among all obtained evidence hashes are divided into different groups; the number of evidence hashes in each group is counted, and the The evidence hash in the group with the largest number is determined to be a trusted evidence hash; based on the determined trusted evidence hash, a certificate deposit transaction is constructed and accepted.
  • multiple nodes in the blockchain network are responsible for capturing network evidence. After the multiple forensics nodes have captured the network evidence, they will Send each other evidence hashes of the network evidence they grab. Then, each forensic node will determine the largest number of evidence hashes among all the evidence hashes obtained by itself (including self-calculated evidence hashes and self-received evidence hashes) as credible evidence hashes, based on The evidence hash of the letter constructs the deposit transaction and accepts it.
  • multiple forensics nodes in the blockchain network independently perform forensics on the network evidence, and regard the version of the network evidence that is captured the most as the trusted version. Subsequently, the credible version of the network evidence was deposited. This is equivalent to the fact that multiple forensic nodes in the blockchain network jointly determine the depository transactions that the blockchain network needs to accept, rather than a node in the blockchain network determining the depository certificates that the blockchain network needs to accept. Transaction, which enhances the authenticity of the evidence on the network.
  • Figure 1 is a schematic diagram of the existing mode of accepting blockchain deposit transactions
  • FIGS. 2a to d are schematic diagrams of the process of accepting the blockchain deposit transaction provided by the embodiments of this specification;
  • FIG. 3 is a schematic flowchart of a method for accepting a blockchain certificate deposit transaction provided by an embodiment of this specification
  • FIG. 4 is a schematic structural diagram of an apparatus for accepting blockchain certificate deposit transactions provided by embodiments of the present specification
  • FIG. 5 is a schematic structural diagram of a computer device configured to configure an apparatus of an embodiment of this specification.
  • Figure 1 is a schematic diagram of the existing mode of accepting blockchain deposit transactions.
  • node A can access webpage X and grab a webpage screenshot of webpage X. Then, based on the captured webpage screenshot, node A constructs a storage containing the hash value of the webpage screenshot Card transaction. Then, node A accepts the deposit transaction on the one hand (that is, caches the deposit transaction), and on the other hand broadcasts the deposit transaction to nodes B to D, and nodes B to D also cache the deposit transaction separately. In the subsequent consensus stage, the cache transaction will be packaged into blocks and written into the blockchain by nodes A to D.
  • FIGS. 2a to d are schematic diagrams of the process of accepting blockchain deposit transactions provided by embodiments of the present specification.
  • FIG. 3 is a schematic flowchart of a method for accepting a blockchain deposit transaction provided by an embodiment of the present specification, including the following steps:
  • the blockchain network may specifically be an alliance chain network.
  • Each node of the blockchain network includes multiple forensic nodes responsible for capturing network evidence.
  • each node in the blockchain network may or may not be all forensic nodes.
  • the number of forensic nodes is generally more than 3.
  • the target evidence source refers to the source of the network evidence to be stored.
  • the target data source may be a webpage address (referred to as the target webpage address in this article).
  • the screenshot of the webpage at the target webpage address is to be fetched from the forensics node Network evidence.
  • evidence hash the hash value of the grabbed network evidence
  • S302 Send the calculated hash of evidence to other forensic nodes, and receive the hash of evidence sent by other forensic nodes.
  • each forensic node will grab a piece of network evidence, and the network evidence grabbed by each forensic node may be the same or different.
  • Each forensic node needs to send the evidence hash of the network evidence it grabs to each other forensic node.
  • N the number of evidence hashes obtained by each forensic node is N .
  • all evidence hashes obtained by each forensic node include the evidence hashes calculated by itself and the evidence hashes received by itself.
  • S304 Divide the same evidence hash among all the obtained evidence hashes into the same group, and divide the different evidence hash among the obtained all evidence hashes into different groups.
  • S306 Count the number of evidence hashes in each group, and determine the evidence hash in the group with the largest number as a trusted evidence hash.
  • steps S304 and S306 are to group the same evidence hashes into one group, and count the number of evidence hashes in each group, so as to determine the dominant number of evidence hashes as the trusted evidence hashes.
  • the group with the largest number refers to the group with the largest number of evidence hashes.
  • S308 Construct a certificate deposit transaction based on the determined hash of trusted evidence and accept it.
  • each forensic node After determining the hash of the trusted evidence, each forensic node can construct the deposit transaction based on the hash of the trusted evidence and accept the deposit transaction constructed by itself.
  • the forensic nodes generally do not need to broadcast each other to construct evidence deposit transactions.
  • each node in the blockchain network also includes at least one non-forensic node, then any forensic node can build itself The deposit transaction is sent to the non-forensic node for acceptance. In this way, the trusted transaction accepted by each node in the blockchain network contains a hash of trusted evidence.
  • multiple forensics nodes in the blockchain network independently perform forensics on the network evidence, and regard the version of the network evidence that is captured the most as the trusted version. Subsequently, the credible version of the network evidence is deposited.
  • This is equivalent to the fact that multiple forensic nodes in the blockchain network jointly determine the depository transactions that the blockchain network needs to accept, rather than a node in the blockchain network determining the depository certificates that the blockchain network needs to accept. Transaction, which enhances the authenticity of the evidence on the network.
  • the criteria for determining the hash of the credible evidence may be more strictly restricted.
  • step S306 if the number of evidence hashes included in the group with the largest number is greater than the first specified number, the evidence hash corresponding to the group with the largest number will be determined as the trusted evidence hash.
  • the first specified number may be (2N+1)/3, that is, if there are N forensic nodes, even if there are (N-1)/3 faulty nodes and/or malicious nodes, as long as there are If the network evidence captured by more than (2N+1)/3 forensic nodes is consistent, it can be considered that the network evidence captured by more than (2N+1)/3 forensic nodes is credible.
  • the first specified number may be (N+1)/2, that is, if there are N forensic nodes, even if there are (N-1)/2 failed nodes, as long as there are more than (N+ 1)
  • the network evidence captured by the two forensic nodes is consistent, and it can be considered that the network evidence captured by (N+1)/2 forensic nodes is credible.
  • each forensic node is not fully synchronized when capturing webpage screenshots separately ( That is, the time points of capturing webpage screenshots are not completely consistent), which may lead to the inconsistency of the time displayed on the webpage screenshots grabbed by the forensic nodes, resulting in inconsistent calculated hash of evidence.
  • the inconsistent hashing of evidence caused by the above reasons is tolerable.
  • the hash of evidence in the group with the largest number and the hash of evidence with the second largest number are regarded as credible.
  • the network corresponding to the evidence hash in the largest number of groups must be further analyzed The similarity between the evidence and the network evidence corresponding to the evidence hash in the next largest group. If the similarity is greater than the specified similarity, it means that the two are sufficiently similar and can be considered as the same network evidence. Therefore, the evidence hash corresponding to the largest number of groups and/or the evidence hash corresponding to the second largest number of groups can be determined as the trusted evidence hash.
  • the forensics is restarted and each forensics node
  • the network evidence can be recaptured from the target evidence source, that is, the method shown in FIG. 3 can be restarted. It should be noted that you can set a number of forensics (such as 5 times). When each forensic node in the blockchain network executes the method shown in Figure 3 for the specified number of times, if the forensics still fails, it will not continue to try.
  • each forensic node may construct the credible evidence based on the credible evidence hash for each determined credible evidence hash Corresponding to the deposit transaction and accept.
  • each forensic node can also build and accept deposit transactions based on the determined two trusted evidence hashes.
  • FIG. 4 is a schematic structural diagram of an apparatus for accepting blockchain certificate deposit transactions provided by an embodiment of the present specification.
  • Each node of the blockchain network includes a plurality of the devices responsible for capturing network evidence.
  • the devices include:
  • the grab calculation module 401 grabs the network evidence from the target evidence source, and calculates the evidence hash of the grabbed network evidence;
  • the sending and receiving module 402 sends the calculated hash of evidence to other forensic nodes, and receives the hash of evidence sent by other forensic nodes;
  • the grouping module 403 divides the same evidence hash among all obtained evidence hashes into the same group, and divides the different evidence hash among all obtained evidence hashes into different groups;
  • the statistical processing module 404 counts the number of evidence hashes in each group, and determines the evidence hash in the group with the largest number as a trusted evidence hash;
  • the acceptance module 405 constructs a certificate deposit transaction based on the determined hash of trusted evidence and accepts it.
  • the target evidence source includes a target webpage address, and the network evidence includes a webpage screenshot.
  • the statistical processing module 404 determines that the evidence hash corresponding to the largest number of groups is the credible evidence hash if the number of evidence hashes contained in the largest number of groups is greater than the first specified number.
  • the first specified number is (2N+1)/3 or (N+1)/2; N is the number of forensic nodes.
  • the statistical processing module 404 if the number of evidence hashes contained in the largest number of groups is not greater than the first specified number and greater than the second specified number, then the hash of the evidence corresponding to the largest number of groups and the next largest number The evidence hash corresponding to the group is determined to be a trusted evidence hash; the second specified number is smaller than the first specified number.
  • the acceptance module 405 if the number of evidence hashes contained in the group with the largest number is not greater than the second specified number, then grab network evidence from the target evidence source again.
  • Each node of the blockchain network also includes at least one non-forensic node
  • the sending and receiving module 402 sends the constructed certificate deposit transaction to a non-forensic node for acceptance.
  • a blockchain system includes a blockchain network; wherein each node of the blockchain network includes multiple forensic nodes responsible for grabbing network evidence;
  • Each forensic node grabs the network evidence from the target evidence source and calculates the evidence hash of the grabbed network evidence; sends the calculated evidence hash to other forensic nodes and receives the evidence hash sent by other forensic nodes;
  • the same evidence hash among all obtained evidence hashes is divided into the same group, and different evidence hashes among all obtained evidence hashes are divided into different groups; the number of evidence hashes in each group is counted, and the The evidence hash in the group with the largest number is determined to be a trusted evidence hash; based on the determined trusted evidence hash, a certificate deposit transaction is constructed and accepted.
  • Embodiments of this specification also provide a computer device, which includes at least a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor implements the program to implement the method shown in FIG. 3 Features.
  • the device may include: a processor 1410, a memory 1420, an input/output interface 1430, a communication interface 1440, and a bus 1450.
  • the processor 1410, the memory 1420, the input/output interface 1430 and the communication interface 1440 realize the communication connection among the devices through the bus 1450.
  • the processor 1410 may be implemented by a general-purpose CPU (Central Processing Unit, central processing unit), a microprocessor, an application-specific integrated circuit (Application Specific Integrated Circuit, ASIC), or one or more integrated circuits, etc. Programs to implement the technical solutions provided by the embodiments of this specification.
  • the memory 1420 may be implemented in the form of ROM (Read Only Memory, Read Only Memory), RAM (Random Access Memory, Random Access Memory), static storage devices, and dynamic storage devices.
  • the memory 1420 may store an operating system and other application programs. When the technical solutions provided by the embodiments of the present specification are implemented by software or firmware, related program codes are stored in the memory 1420 and called and executed by the processor 1410.
  • the input/output interface 1430 is used to connect input/output modules to realize information input and output.
  • the input/output/module can be configured as a component in the device (not shown in the figure), or can be externally connected to the device to provide corresponding functions.
  • the input device may include a keyboard, mouse, touch screen, microphone, various sensors, etc.
  • the output device may include a display, a speaker, a vibrator, an indicator light, and the like.
  • the communication interface 1440 is used to connect a communication module (not shown in the figure) to implement communication interaction between the device and other devices.
  • the communication module can implement communication through a wired method (such as USB, network cable, etc.), and can also implement communication through a wireless method (such as mobile network, WIFI, Bluetooth, etc.).
  • the bus 1450 includes a path to transfer information between various components of the device (eg, processor 1410, memory 1420, input/output interface 1430, and communication interface 1440).
  • the device may also include the necessary Other components.
  • the above-mentioned device may also include only the components necessary to implement the solutions of the embodiments of the present specification, rather than including all the components shown in the figures.
  • Embodiments of the present specification also provide a computer-readable storage medium on which a computer program is stored, which when executed by a processor implements the functions of the method shown in FIG. 3.
  • Computer readable media including permanent and non-permanent, removable and non-removable media, can store information by any method or technology.
  • the information may be computer readable instructions, data structures, modules of programs, or other data.
  • Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, read-only compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, Magnetic tape cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media can be used to store information that can be accessed by computing devices.
  • computer-readable media does not include temporary computer-readable media (transitory media), such as modulated data signals and carrier waves.
  • the system, method, module or unit explained in the above embodiments may be specifically implemented by a computer chip or entity, or implemented by a product having a certain function.
  • a typical implementation device is a computer, and the specific form of the computer may be a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email sending and receiving device, and a game control Desk, tablet computer, wearable device, or any combination of these devices.

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Accounting & Taxation (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Security & Cryptography (AREA)
  • General Business, Economics & Management (AREA)
  • Strategic Management (AREA)
  • Finance (AREA)
  • Signal Processing (AREA)
  • Databases & Information Systems (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Tourism & Hospitality (AREA)
  • Technology Law (AREA)
  • Development Economics (AREA)
  • Power Engineering (AREA)
  • Health & Medical Sciences (AREA)
  • Entrepreneurship & Innovation (AREA)
  • General Health & Medical Sciences (AREA)
  • Human Resources & Organizations (AREA)
  • Primary Health Care (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

一种受理区块链存证交易的方法及系统。由区块链网络中的多个取证节点负责网络证据的抓取，在这多个取证节点在抓取了网络证据之后，会彼此互相发送自身抓取的网络证据的证据哈希。然后，每个取证节点会将自身获得的全部证据哈希中数量最大的证据哈希确定为可信的证据哈希，基于可信的证据哈希构建存证交易并受理。

Description

一种受理区块链存证交易的方法及系统 技术领域
本说明书实施例涉及信息技术领域，尤其涉及一种受理区块链存证交易的方法及系统。
背景技术
随着区块链技术的发展，基于区块链实现网络证据存证的业务模式较为常见。
具体地，针对待存证的网络证据(如网页)，一般由区块链网络中的某个节点负责抓取网络证据，接着，该节点会计算抓取的网络证据的证据哈希，并基于证据哈希构建存证交易，然后，该节点一方面受理自身构建的存证交易，另一方面将构建的存证交易广播给其他节点进行受理。
需要说明的是，针对区块链网络中的每个节点，该节点受理存证交易，意味着该节点会将存证交易缓存于本地，如此，待到各节点需要进行共识时，缓存于各节点本地的存证交易才可能被打包进区块，进而写入区块链。
然而，在现有技术中，仅由联盟链网络中的单个节点负责抓取网络证据并构建存证交易，其他节点在受理该节点广播的存证交易时，通常无法验证该节点抓取的网络证据是否真实。
发明内容
为了解决区块链网络中负责对网络证据进行取证的节点不可信的问题，本说明书实施例提供一种受理区块链存证交易的方法及系统，技术方案如下：
根据本说明书实施例的第1方面，提供一种受理区块链存证交易的方法，区块链网络的各节点中包括多个负责抓取网络证据的取证节点，所述方法包括：
针对每个取证节点，
该取证节点从目标证据源抓取网络证据，并计算抓取的网络证据的证据哈希；
将计算的证据哈希发送给其他取证节点，以及接收其他取证节点发送的证据哈希；
将获得的全部证据哈希中相同的证据哈希划分进同一组，并且，将获得的全部证据 哈希中不同的证据哈希划分进不同组；
统计每个组中证据哈希的数量，并将数量最大的组中的证据哈希确定为可信证据哈希；
基于确定的可信证据哈希构建存证交易并受理。
根据本说明书实施例的第2方面，提供一种受理区块链存证交易的装置，区块链网络的各节点中包括多个负责抓取网络证据的所述装置，所述装置包括：
抓取计算模块，从目标证据源抓取网络证据，并计算抓取的网络证据的证据哈希；
发送接收模块，将计算的证据哈希发送给其他取证节点，以及接收其他取证节点发送的证据哈希；
分组模块，将获得的全部证据哈希中相同的证据哈希划分进同一组，并且，将获得的全部证据哈希中不同的证据哈希划分进不同组；
统计处理模块，统计每个组中证据哈希的数量，并将数量最大的组中的证据哈希确定为可信证据哈希；
受理模块，基于确定的可信证据哈希构建存证交易并受理。
根据本说明书实施例的第3方面，提供一种区块链系统，包括区块链网络；其中，所述区块链网络的各节点中包括多个负责抓取网络证据的取证节点；
每个取证节点，从目标证据源抓取网络证据，并计算抓取的网络证据的证据哈希；将计算的证据哈希发送给其他取证节点，以及接收其他取证节点发送的证据哈希；将获得的全部证据哈希中相同的证据哈希划分进同一组，并且，将获得的全部证据哈希中不同的证据哈希划分进不同组；统计每个组中证据哈希的数量，并将数量最大的组中的证据哈希确定为可信证据哈希；基于确定的可信证据哈希构建存证交易并受理。
本说明书实施例所提供的技术方案，由区块链网络中的多个节点(本文称之为取证节点)负责网络证据的抓取，在这多个取证节点在抓取了网络证据之后，会彼此互相发送自身抓取的网络证据的证据哈希。然后，每个取证节点会将自身获得的全部证据哈希(包括自身计算的证据哈希和自身接收到的证据哈希)中数量最大的证据哈希确定为可信的证据哈希，基于可信的证据哈希构建存证交易并受理。
通过本说明书实施例，由区块链网络中的多个取证节点独立进行网络证据的取证，并将被抓取次数最多的网络证据的版本视为可信版本。随后，对可信版本的网络证据进 行存证。这相当于，由区块链网络中的多个取证节点共同决定区块链网络需要受理的存证交易，而不是由区块链网络中的某个节点决定区块链网络需要受理的存证交易，这提升了存证的网络证据的真实性。
应当理解的是，以上的一般描述和后文的细节描述仅是示例性和解释性的，并不能限制本说明书实施例。
此外，本说明书实施例中的任一实施例并不需要达到上述的全部效果。
附图说明
为了更清楚地说明本说明书实施例或现有技术中的技术方案，下面将对实施例或现有技术描述中所需要使用的附图作简单地介绍，显而易见地，下面描述中的附图仅仅是本说明书实施例中记载的一些实施例，对于本领域普通技术人员来讲，还可以根据这些附图获得其他的附图。
图1是现有的受理区块链存证交易的模式示意图；
图2a～d是本说明书实施例提供的受理区块链存证交易过程的示意图；
图3是本说明书实施例提供的一种受理区块链存证交易的方法的流程示意图；
图4是本说明书实施例提供的一种受理区块链存证交易的装置的结构示意图；
图5是用于配置本说明书实施例装置的一种计算机设备的结构示意图。
具体实施方式
图1是现有的受理区块链存证交易的模式示意图。如图1所示，对于待存证的网页，可以由节点A访问网页X，抓取网页X的网页截图，接着，节点A基于抓取的网页截图，构建包含网页截图的哈希值的存证交易。然后，节点A一方面受理该存证交易(即缓存该存证交易)，另一方面将该存证交易广播给节点B～D，节点B～D也会分别缓存该存证交易。在后续的共识阶段，该缓存交易会被打包进区块，并由节点A～D分别写入区块链。
但是，实践中存在这样的可能，即节点A访问错网页(未访问网页X，而是访问了网页Y)，或者，节点A故意作恶，导致节点A抓取的网页截图实际上并不是网页X的网页截图。这种情况会导致节点B～D接收到的存证交易中包含的哈希值实际上并不 是网页X的网页截图的哈希值，进而导致区块链网络实际上并没有对网页X进行存证。
而在本说明实施例中，为了避免上述情况出现，由区块链网络中的多个节点分别独立抓取网页截图，然后得到多数节点支持的网页截图版本可被视为可信版本。区块链网络受理的存证交易是基于可信版本的网页截图的哈希值构建的。图2a～d是本说明书实施例提供的受理区块链存证交易过程的示意图。
为了使本领域技术人员更好地理解本说明书实施例中的技术方案，下面将结合本说明书实施例中的附图，对本说明书实施例中的技术方案进行详细地描述，显然，所描述的实施例仅仅是本说明书的一部分实施例，而不是全部的实施例。基于本说明书中的实施例，本领域普通技术人员所获得的所有其他实施例，都应当属于保护的范围。
以下结合附图，详细说明本说明书各实施例提供的技术方案。
图3是本说明书实施例提供的一种受理区块链存证交易的方法的流程示意图，包括如下步骤：
S300：针对每个取证节点，该取证节点从目标证据源抓取网络证据，并计算抓取的网络证据的证据哈希。
在本说明书实施例中，区块链网络具体可以是联盟链网络。所述区块链网络的各节点中包括多个负责抓取网络证据的取证节点。
需要说明的是，区块链网络中的各节点可以都是取证节点，也可以不都是取证节点。取证节点的数量一般是3个以上。
在本说明书实施例中，目标证据源是指待存证的网络证据的出处。例如，目标数据源可以是一个网页地址(本文称之为目标网页地址)，当需要对目标网页地址上的网页进行存证时，目标网页地址上的网页的网页截图就是从取证节点需要抓取的网络证据。
取证节点在从目标证据源抓取到网络证据之后，需要计算抓取的网络证据的哈希值(本文称之为证据哈希)。
S302：将计算的证据哈希发送给其他取证节点，以及接收其他取证节点发送的证据哈希。
在本说明书实施例中，每个取证节点都会抓取到一份网络证据，各取证节点抓取的网络证据可能相同，可能不同。每个取证节点都需要将自身抓取到的网络证据的证据哈希发送给其他每个取证节点，如此，假设有N个取证节点，那么，每个取证节点获得的 证据哈希的数量为N。
也就是说，在本说明书实施例中，每个取证节点获得的全部证据哈希包括自身计算的证据哈希以及自身接收到的证据哈希。
S304：将获得的全部证据哈希中相同的证据哈希划分进同一组，并且，将获得的全部证据哈希中不同的证据哈希划分进不同组。
S306：统计每个组中证据哈希的数量，并将数量最大的组中的证据哈希确定为可信证据哈希。
在本说明书实施例中，由于各取证节点中可能出现故障节点或恶意节点，因此，各取证节点从目标证据源抓取的网络证据并不一定是相同的，因此各取证节点分别基于自身抓取的网络证据计算得到的证据哈希也不一定是相同的。步骤S304和S306的目的在于，将相同的证据哈希归为一组，并统计每个组中证据哈希的数量，以便将数量占优的证据哈希确定为可信证据哈希。
其中，数量最大的组，是指包含的证据哈希的数量最大的组。
S308：基于确定的可信证据哈希构建存证交易并受理。
各取证节点在确定可信证据哈希之后，就可以分别基于可信证据哈希构建存证交易，并受理自身构建的存证交易。
也就是说，在本说明书实施例中，取证节点间一般不需要相互广播构建的存证交易。
需要说明的是，如果区块链网络中各节点并不都是取证节点，也就是说，区块链网络的各节点中还包括至少一个非取证节点，那么，任一取证节点可以将自身构建的存证交易发送给非取证节点进行受理。这样，区块链网络中每个节点受理的存证交易中都包含可信证据哈希。
通过图3所示的方法，由区块链网络中的多个取证节点独立进行网络证据的取证，并将被抓取次数最多的网络证据的版本视为可信版本。随后，对可信版本的网络证据进行存证。这相当于，由区块链网络中的多个取证节点共同决定区块链网络需要受理的存证交易，而不是由区块链网络中的某个节点决定区块链网络需要受理的存证交易，这提升了存证的网络证据的真实性。
此外，在本说明书实施例中，可以对确定可信证据哈希的标准进行更为严格的限制。
具体地，在步骤S306中，若数量最大的组所包含的证据哈希的数量大于第一指定 数量，才会将数量最大的组所对应的证据哈希确定为可信证据哈希。
进一步地，可以借鉴常见的共识算法(如PBFT、RAFT等)，使得哪怕各取证节点中存在一定数量的故障节点和/或恶意节点，也能够确定出可信证据哈希。
例如，所述第一指定数量可以是(2N+1)/3，也就是说，倘若有N个取证节点，那么哪怕存在(N-1)/3个故障节点和/或恶意节点，只要有大于(2N+1)/3个取证节点所抓取的网络证据是一致的，就可以认为这大于(2N+1)/3个取证节点所抓取的网络证据是可信的。
又如，所述第一指定数量可以是(N+1)/2，也就是说，倘若有N个取证节点，那么哪怕存在(N-1)/2个故障节点，只要有大于(N+1)/2个取证节点所抓取的网络证据是一致的，就可以认为这大于(N+1)/2个取证节点所抓取的网络证据是可信的。
此外，在实际应用中，例如进行网页抓取时，假设网页上显示有动态变化的指标(如当前时间)，因此，各取证节点在分别对网页截图进行抓取时，并不是完全同步的(即抓取网页截图的时间点并不是完全一致的)，这就导致各取证节点抓取的网页截图上显示的时间有可能不一致，导致计算得到的证据哈希也不一致。
但是，上述原因导致的证据哈希不一致是可以容忍的，一般而言，不能仅仅因为两个网页截图上显示的时间存在些许差别，就将这两个网页截图认定为不同的两个网页的网页截图。因此，在本说明书实施例中，如果数量最大的组所包含的证据哈希的数量不大于第一指定数量，那么，可以适当放低要求，进一步判断最大的组所包含的证据哈希的数量是否大于第二指定数量(小于第一指定数量)，如果判断结果为是，则将数量最大的组所对应的证据哈希与数量次大的组所对应的证据哈希皆确定为可信证据哈希。
也就是说，将数量最大的组中的证据哈希与数量次大(第二大)的证据哈希都视为可信。实践中，可以进一步地，如果数量最大的组所包含的证据哈希的数量不大于第一指定数量且大于第二指定数量，那么还要进一步分析数量最大的组中的证据哈希对应的网络证据与数量次大的组中的证据哈希对应的网络证据之间的相似度，如果相似度大于指定相似度，就说明二者足够相似，可以认为是同一网络证据。因此，可以将数量最大的组所对应的证据哈希和/或数量次大的组所对应的证据哈希皆确定为可信证据哈希。
在本说明书实施例中，若数量最大的组所包含的证据哈希的数量不大于第二指定数量，则说明本次取证的真实性并未达到要求，因此，重新开始取证，每个取证节点可以重新从目标证据源抓取网络证据，即重新开始执行图3所示的方法。需要说明的是，可 以设置一个取证次数(如5次)，当区块链网络中的各取证节点执行图3所示方法的次数达到指定次数时，若仍然取证失败，则不再继续尝试。
在本说明书实施例中，如果确定的可信证据哈希为两个，那么，每个取证节点可以针对确定的每个可信证据哈希，基于该可信证据哈希构建该可信证据哈希对应的存证交易并受理。此外，每个取证节点也可以基于确定的两个可信证据哈希构建存证交易并受理。
图4是本说明书实施例提供的一种受理区块链存证交易的装置的结构示意图。区块链网络的各节点中包括多个负责抓取网络证据的所述装置，所述装置包括：
抓取计算模块401，从目标证据源抓取网络证据，并计算抓取的网络证据的证据哈希；
发送接收模块402，将计算的证据哈希发送给其他取证节点，以及接收其他取证节点发送的证据哈希；
分组模块403，将获得的全部证据哈希中相同的证据哈希划分进同一组，并且，将获得的全部证据哈希中不同的证据哈希划分进不同组；
统计处理模块404，统计每个组中证据哈希的数量，并将数量最大的组中的证据哈希确定为可信证据哈希；
受理模块405，基于确定的可信证据哈希构建存证交易并受理。
所述目标证据源包括目标网页地址，网络证据包括网页截图。
所述统计处理模块404，若数量最大的组所包含的证据哈希的数量大于第一指定数量，则将数量最大的组所对应的证据哈希确定为可信证据哈希。
所述第一指定数量为(2N+1)/3或(N+1)/2；N为各取证节点的数量。
所述统计处理模块404，若数量最大的组所包含的证据哈希的数量不大于第一指定数量且大于第二指定数量，则将数量最大的组所对应的证据哈希与数量次大的组所对应的证据哈希皆确定为可信证据哈希；所述第二指定数量小于所述第一指定数量。
所述受理模块405，针对确定的每个可信证据哈希，基于该可信证据哈希构建该可信证据哈希对应的存证交易并受理；或，基于确定的两个可信证据哈希构建存证交易并受理。
所述受理模块405，若数量最大的组所包含的证据哈希的数量不大于第二指定数量， 则重新从目标证据源抓取网络证据。
区块链网络的各节点中还包括至少一个非取证节点；
所述发送接收模块402，将构建的存证交易发送给非取证节点进行受理。
一种区块链系统，包括区块链网络；其中，所述区块链网络的各节点中包括多个负责抓取网络证据的取证节点；
每个取证节点，从目标证据源抓取网络证据，并计算抓取的网络证据的证据哈希；将计算的证据哈希发送给其他取证节点，以及接收其他取证节点发送的证据哈希；将获得的全部证据哈希中相同的证据哈希划分进同一组，并且，将获得的全部证据哈希中不同的证据哈希划分进不同组；统计每个组中证据哈希的数量，并将数量最大的组中的证据哈希确定为可信证据哈希；基于确定的可信证据哈希构建存证交易并受理。
本说明书实施例还提供一种计算机设备，其至少包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，其中，处理器执行所述程序时实现图3所示方法的功能。
图5示出了本说明书实施例所提供的一种更为具体的计算设备硬件结构示意图，该设备可以包括：处理器1410、存储器1420、输入/输出接口1430、通信接口1440和总线1450。其中处理器1410、存储器1420、输入/输出接口1430和通信接口1440通过总线1450实现彼此之间在设备内部的通信连接。
处理器1410可以采用通用的CPU(Central Processing Unit，中央处理器)、微处理器、应用专用集成电路(Application Specific Integrated Circuit，ASIC)、或者一个或多个集成电路等方式实现，用于执行相关程序，以实现本说明书实施例所提供的技术方案。
存储器1420可以采用ROM(Read Only Memory，只读存储器)、RAM(Random Access Memory，随机存取存储器)、静态存储设备，动态存储设备等形式实现。存储器1420可以存储操作系统和其他应用程序，在通过软件或者固件来实现本说明书实施例所提供的技术方案时，相关的程序代码保存在存储器1420中，并由处理器1410来调用执行。
输入/输出接口1430用于连接输入/输出模块，以实现信息输入及输出。输入输出/模块可以作为组件配置在设备中(图中未示出)，也可以外接于设备以提供相应功能。其中输入设备可以包括键盘、鼠标、触摸屏、麦克风、各类传感器等，输出设备可以包括显示器、扬声器、振动器、指示灯等。
通信接口1440用于连接通信模块(图中未示出)，以实现本设备与其他设备的通信交互。其中通信模块可以通过有线方式(例如USB、网线等)实现通信，也可以通过无线方式(例如移动网络、WIFI、蓝牙等)实现通信。
总线1450包括一通路，在设备的各个组件(例如处理器1410、存储器1420、输入/输出接口1430和通信接口1440)之间传输信息。
需要说明的是，尽管上述设备仅示出了处理器1410、存储器1420、输入/输出接口1430、通信接口1440以及总线1450，但是在具体实施过程中，该设备还可以包括实现正常运行所必需的其他组件。此外，本领域的技术人员可以理解的是，上述设备中也可以仅包含实现本说明书实施例方案所必需的组件，而不必包含图中所示的全部组件。
本说明书实施例还提供一种计算机可读存储介质，其上存储有计算机程序，该程序被处理器执行时实现图3所示方法的功能。
计算机可读介质包括永久性和非永久性、可移动和非可移动媒体可以由任何方法或技术来实现信息存储。信息可以是计算机可读指令、数据结构、程序的模块或其他数据。计算机的存储介质的例子包括，但不限于相变内存(PRAM)、静态随机存取存储器(SRAM)、动态随机存取存储器(DRAM)、其他类型的随机存取存储器(RAM)、只读存储器(ROM)、电可擦除可编程只读存储器(EEPROM)、快闪记忆体或其他内存技术、只读光盘只读存储器(CD-ROM)、数字多功能光盘(DVD)或其他光学存储、磁盒式磁带，磁带磁磁盘存储或其他磁性存储设备或任何其他非传输介质，可用于存储可以被计算设备访问的信息。按照本文中的界定，计算机可读介质不包括暂存电脑可读媒体(transitory media)，如调制的数据信号和载波。
通过以上的实施方式的描述可知，本领域的技术人员可以清楚地了解到本说明书实施例可借助软件加必需的通用硬件平台的方式来实现。基于这样的理解，本说明书实施例的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品可以存储在存储介质中，如ROM/RAM、磁碟、光盘等，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本说明书实施例各个实施例或者实施例的某些部分所述的方法。
上述实施例阐明的系统、方法、模块或单元，具体可以由计算机芯片或实体实现，或者由具有某种功能的产品来实现。一种典型的实现设备为计算机，计算机的具体形式可以是个人计算机、膝上型计算机、蜂窝电话、相机电话、智能电话、个人数字助理、 媒体播放器、导航设备、电子邮件收发设备、游戏控制台、平板计算机、可穿戴设备或者这些设备中的任意几种设备的组合。
本说明书中的各个实施例均采用递进的方式描述，各个实施例之间相同相似的部分互相参见即可，每个实施例重点说明的都是与其他实施例的不同之处。尤其，对于方法和设备实施例而言，由于其基本相似于方法实施例，所以描述得比较简单，相关之处参见方法实施例的部分说明即可。以上所描述的方法实施例仅仅是示意性的，其中所述作为分离部件说明的模块可以是或者也可以不是物理上分开的，在实施本说明书实施例方案时可以把各模块的功能在同一个或多个软件和/或硬件中实现。也可以根据实际的需要选择其中的部分或者全部模块来实现本实施例方案的目的。本领域普通技术人员在不付出创造性劳动的情况下，即可以理解并实施。
以上所述仅是本说明书实施例的具体实施方式，应当指出，对于本技术领域的普通技术人员来说，在不脱离本说明书实施例原理的前提下，还可以做出若干改进和润饰，这些改进和润饰也应视为本说明书实施例的保护范围。

Claims (18)

  1. 一种受理区块链存证交易的方法，区块链网络的各节点中包括多个负责抓取网络证据的取证节点，所述方法包括：
    针对每个取证节点，
    该取证节点从目标证据源抓取网络证据，并计算抓取的网络证据的证据哈希；
    将计算的证据哈希发送给其他取证节点，以及接收其他取证节点发送的证据哈希；
    将获得的全部证据哈希中相同的证据哈希划分进同一组，并且，将获得的全部证据哈希中不同的证据哈希划分进不同组；
    统计每个组中证据哈希的数量，并将数量最大的组中的证据哈希确定为可信证据哈希；
    基于确定的可信证据哈希构建存证交易并受理。
  2. 如权利要求1所述的方法，所述目标证据源包括目标网页地址，网络证据包括网页截图。
  3. 如权利要求1所述的方法，将数量最大的组中的证据哈希确定为可信证据哈希，具体包括：
    若数量最大的组所包含的证据哈希的数量大于第一指定数量，则将数量最大的组所对应的证据哈希确定为可信证据哈希。
  4. 如权利要求3所述的方法，所述第一指定数量为(2N+1)/3或(N+1)/2；N为各取证节点的数量。
  5. 如权利要求3所述的方法，所述方法还包括：
    若数量最大的组所包含的证据哈希的数量不大于第一指定数量且大于第二指定数量，则将数量最大的组所对应的证据哈希与数量次大的组所对应的证据哈希皆确定为可信证据哈希；所述第二指定数量小于所述第一指定数量。
  6. 如权利要求5所述的方法，基于确定的可信证据哈希构建存证交易并受理，具体包括：
    针对确定的每个可信证据哈希，基于该可信证据哈希构建该可信证据哈希对应的存证交易并受理；
    或，基于确定的两个可信证据哈希构建存证交易并受理。
  7. 如权利要求5所述的方法，所述方法还包括：
    若数量最大的组所包含的证据哈希的数量不大于第二指定数量，则重新从目标证据源抓取网络证据。
  8. 如权利要求1所述的方法，区块链网络的各节点中还包括至少一个非取证节点；
    所述方法还包括：
    将构建的存证交易发送给非取证节点进行受理。
  9. 一种受理区块链存证交易的装置，区块链网络的各节点中包括多个负责抓取网络证据的所述装置，所述装置包括：
    抓取计算模块，从目标证据源抓取网络证据，并计算抓取的网络证据的证据哈希；
    发送接收模块，将计算的证据哈希发送给其他取证节点，以及接收其他取证节点发送的证据哈希；
    分组模块，将获得的全部证据哈希中相同的证据哈希划分进同一组，并且，将获得的全部证据哈希中不同的证据哈希划分进不同组；
    统计处理模块，统计每个组中证据哈希的数量，并将数量最大的组中的证据哈希确定为可信证据哈希；
    受理模块，基于确定的可信证据哈希构建存证交易并受理。
  10. 如权利要求9所述的装置，所述目标证据源包括目标网页地址，网络证据包括网页截图。
  11. 如权利要求9所述的装置，所述统计处理模块，若数量最大的组所包含的证据哈希的数量大于第一指定数量，则将数量最大的组所对应的证据哈希确定为可信证据哈希。
  12. 如权利要求11所述的装置，所述第一指定数量为(2N+1)/3或(N+1)/2；N为各取证节点的数量。
  13. 如权利要求11所述的装置，所述统计处理模块，若数量最大的组所包含的证据哈希的数量不大于第一指定数量且大于第二指定数量，则将数量最大的组所对应的证据哈希与数量次大的组所对应的证据哈希皆确定为可信证据哈希；所述第二指定数量小于所述第一指定数量。
  14. 如权利要求13所述的装置，所述受理模块，针对确定的每个可信证据哈希，基于该可信证据哈希构建该可信证据哈希对应的存证交易并受理；或，基于确定的两个可信证据哈希构建存证交易并受理。
  15. 如权利要求13所述的装置，所述受理模块，若数量最大的组所包含的证据哈希的数量不大于第二指定数量，则重新从目标证据源抓取网络证据。
  16. 如权利要求9所述的装置，区块链网络的各节点中还包括至少一个非取证节点；
    所述发送接收模块，将构建的存证交易发送给非取证节点进行受理。
  17. 一种区块链系统，包括区块链网络；其中，所述区块链网络的各节点中包括多个负责抓取网络证据的取证节点；
    每个取证节点，从目标证据源抓取网络证据，并计算抓取的网络证据的证据哈希；将计算的证据哈希发送给其他取证节点，以及接收其他取证节点发送的证据哈希；将获得的全部证据哈希中相同的证据哈希划分进同一组，并且，将获得的全部证据哈希中不同的证据哈希划分进不同组；统计每个组中证据哈希的数量，并将数量最大的组中的证据哈希确定为可信证据哈希；基于确定的可信证据哈希构建存证交易并受理。
  18. 一种计算机设备，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，其中，所述处理器执行所述程序时实现如权利要求1～8任一项所述的方法。
PCT/CN2019/116010 2018-12-28 2019-11-06 一种受理区块链存证交易的方法及系统 WO2020134620A1 (zh)

Priority Applications (4)

Application Number Priority Date Filing Date Title
SG11202100651XA SG11202100651XA (en) 2018-12-28 2019-11-06 Method and system for recording ledger data on a blockchain
EP19906401.5A EP3816924B1 (en) 2018-12-28 2019-11-06 Method for accepting blockchain evidence storage transaction and system
US17/160,674 US11086965B2 (en) 2018-12-28 2021-01-28 Recording ledger data on a blockchain
US17/391,221 US11275814B2 (en) 2018-12-28 2021-08-02 Recording ledger data on a blockchain

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811621459.8 2018-12-28
CN201811621459.8A CN110046994B (zh) 2018-12-28 2018-12-28 一种受理区块链存证交易的方法及系统

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US17/160,674 Continuation US11086965B2 (en) 2018-12-28 2021-01-28 Recording ledger data on a blockchain

Publications (1)

Publication Number Publication Date
WO2020134620A1 true WO2020134620A1 (zh) 2020-07-02

Family

ID=67274070

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/116010 WO2020134620A1 (zh) 2018-12-28 2019-11-06 一种受理区块链存证交易的方法及系统

Country Status (6)

Country Link
US (2) US11086965B2 (zh)
EP (1) EP3816924B1 (zh)
CN (2) CN110046994B (zh)
SG (1) SG11202100651XA (zh)
TW (1) TW202027003A (zh)
WO (1) WO2020134620A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113378236A (zh) * 2021-06-02 2021-09-10 浙江数秦科技有限公司 一种证据数据在线保全公证平台及保全方法

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110892377A (zh) * 2018-12-27 2020-03-17 思杰系统有限公司 用于开发Web产品的系统和方法
CN110046994B (zh) 2018-12-28 2020-05-12 阿里巴巴集团控股有限公司 一种受理区块链存证交易的方法及系统
CN111079101B (zh) * 2019-12-20 2020-10-23 支付宝(杭州)信息技术有限公司 基于区块链的侵权取证方法及装置、电子设备、存储介质
CN111143883B (zh) * 2019-12-31 2021-08-03 支付宝(杭州)信息技术有限公司 基于区块链的数字内容取证方法、装置及设备

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180101701A1 (en) * 2016-10-07 2018-04-12 Acronis International Gmbh System and method for file authenticity certification using blockchain network
CN108512653A (zh) * 2018-04-18 2018-09-07 成都零光量子科技有限公司 一种基于区块链的电子证据采集和服务方法
CN108920966A (zh) * 2018-06-25 2018-11-30 北京奇虎科技有限公司 一种区块链存证、取证方法及装置
CN108959416A (zh) * 2018-06-08 2018-12-07 浙江数秦科技有限公司 一种基于区块链的网页数据自动取证与存证方法
CN110046994A (zh) * 2018-12-28 2019-07-23 阿里巴巴集团控股有限公司 一种受理区块链存证交易的方法及系统

Family Cites Families (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7805518B1 (en) * 2003-11-14 2010-09-28 The Board Of Trustees Of The Leland Stanford Junior University Method and system for reputation management in peer-to-peer networks
US20090182653A1 (en) * 2008-01-07 2009-07-16 Daylight Forensic & Advisory Llc System and method for case management
US8374914B2 (en) * 2008-08-06 2013-02-12 Obschestvo S Ogranichennoi Otvetstvennostiu “Kuznetch” Advertising using image comparison
US9025767B2 (en) * 2010-03-24 2015-05-05 Nokia Corporation Method and apparatus for querying content protected by identity-based encryption
US10454689B1 (en) * 2015-08-27 2019-10-22 Amazon Technologies, Inc. Digital certificate management
WO2017069874A1 (en) * 2015-10-21 2017-04-27 Manifold Technology, Inc. Event synchronization systems and methods
US9881184B2 (en) * 2015-10-30 2018-01-30 Intel Corporation Authenticity-assured data gathering apparatus and method
US10114980B2 (en) * 2016-07-21 2018-10-30 Acronis International Gmbh System and method for verifying data integrity using a blockchain network
US10715331B2 (en) * 2016-12-28 2020-07-14 MasterCard International Incorported Method and system for providing validated, auditable, and immutable inputs to a smart contract
WO2018119930A1 (zh) * 2016-12-29 2018-07-05 深圳前海达闼云端智能科技有限公司 交易验证处理方法、装置及节点设备
TWI683273B (zh) 2017-01-26 2020-01-21 富邦金融控股股份有限公司 使用智能合約進行保險理賠之系統及其方法
KR20180089682A (ko) * 2017-02-01 2018-08-09 삼성전자주식회사 블록체인 기반의 데이터의 무결성을 검증하는 전자 장치 및 방법
US9870508B1 (en) * 2017-06-01 2018-01-16 Unveiled Labs, Inc. Securely authenticating a recording file from initial collection through post-production and distribution
CN107436836A (zh) * 2017-06-22 2017-12-05 深圳市金立通信设备有限公司 一种日志文件的处理方法及相关设备
US11144865B2 (en) * 2017-07-12 2021-10-12 Accenture Global Solutions Limited Delivery platform for real-time locations
US20200396059A1 (en) * 2017-12-19 2020-12-17 Algorand Inc. Fast and partition-resilient blockchains
CN109345061B (zh) * 2018-08-21 2020-12-29 创新先进技术有限公司 一种基于区块链存证的识别证据真实性的方法及装置
CN108900364B (zh) * 2018-08-22 2021-11-26 泰康保险集团股份有限公司 区块链网络的管理方法、装置、介质及电子设备
US10997251B2 (en) * 2018-10-15 2021-05-04 Bao Tran Smart device
US20200134760A1 (en) * 2018-10-31 2020-04-30 Motorola Solutions, Inc Method for Weighted Voting in a Public Safety Distributed Ledger

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180101701A1 (en) * 2016-10-07 2018-04-12 Acronis International Gmbh System and method for file authenticity certification using blockchain network
CN108512653A (zh) * 2018-04-18 2018-09-07 成都零光量子科技有限公司 一种基于区块链的电子证据采集和服务方法
CN108959416A (zh) * 2018-06-08 2018-12-07 浙江数秦科技有限公司 一种基于区块链的网页数据自动取证与存证方法
CN108920966A (zh) * 2018-06-25 2018-11-30 北京奇虎科技有限公司 一种区块链存证、取证方法及装置
CN110046994A (zh) * 2018-12-28 2019-07-23 阿里巴巴集团控股有限公司 一种受理区块链存证交易的方法及系统

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113378236A (zh) * 2021-06-02 2021-09-10 浙江数秦科技有限公司 一种证据数据在线保全公证平台及保全方法
CN113378236B (zh) * 2021-06-02 2022-09-16 浙江数秦科技有限公司 一种证据数据在线保全公证平台及保全方法

Also Published As

Publication number Publication date
US11086965B2 (en) 2021-08-10
CN110046994B (zh) 2020-05-12
SG11202100651XA (en) 2021-02-25
EP3816924A1 (en) 2021-05-05
US20210149974A1 (en) 2021-05-20
CN110046994A (zh) 2019-07-23
CN111899097B (zh) 2023-10-27
US11275814B2 (en) 2022-03-15
EP3816924B1 (en) 2023-01-04
EP3816924A4 (en) 2021-07-28
US20210357466A1 (en) 2021-11-18
TW202027003A (zh) 2020-07-16
CN111899097A (zh) 2020-11-06

Similar Documents

Publication Publication Date Title
WO2020134620A1 (zh) 一种受理区块链存证交易的方法及系统
TWI730309B (zh) 資料處理方法及裝置
TWI743458B (zh) 一種並行化執行區塊鏈交易的方法、裝置及系統
US11042876B2 (en) Transaction method and system based on centralized settlement and blockchain deposit certificates
US20210049608A1 (en) Transaction method and system based on centralized clearing and blockchain record keeping
TWI727467B (zh) 聯盟鏈的可信度驗證方法、系統、裝置及設備
WO2020199711A1 (zh) 数据存储方法、系统、装置及设备
JP2019523952A (ja) ストリーミングデータ分散処理方法及び装置
EP3817333B1 (en) Method and system for processing requests in a consortium blockchain
CN113032412B (zh) 数据同步方法、装置、电子设备和计算机可读介质
CN113535721A (zh) 一种数据写入方法及装置
WO2020108052A1 (zh) 一种基于多个区块链网络的数据读取方法及系统
US20230007873A1 (en) Management Method and Apparatus for System Configuration Independent of Smart Contract for Blockchain
WO2018177286A1 (zh) 一种静态资源请求处理方法及装置
CN111464319B (zh) 一种基于中心化块链式账本的交易存储、签名校验方法
CN109254847B (zh) 一种租户映射信息获取方法及装置
CN106027619A (zh) 一种用于处理基于jsonp的请求的方法与设备
US20240265009A1 (en) Transaction processing method and apparatus
KR102416337B1 (ko) 블록체인을 관리하기 위한 장치, 방법, 시스템 및 컴퓨터 판독가능 저장 매체
US11362969B2 (en) Efficient packet re-transmission for express data paths
US20220239767A1 (en) Efficient packet re-transmission for express data paths
US20240089128A1 (en) Blockchain monitoring platform
US20240236141A9 (en) System and method for threat detection through data storage analysis
CN110264211B (zh) 风控方法、系统、装置及设备
CN117290203A (zh) 代码检测方法及相关设备

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19906401

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2019906401

Country of ref document: EP

Effective date: 20210129

NENP Non-entry into the national phase

Ref country code: DE