CN115130147A - Copyright declaration method and copyright declaration device based on block chain - Google Patents

Abstract

The embodiment of the specification provides a copyright notice method and a copyright notice device based on a block chain. In the copyright declaration method, copyright works to be declared are acquired; generating a copyright notice based on the right content of the right person notice for the copyright works, wherein the copyright notice comprises right person information, right content and copyright work information; acquiring signing information of a rightful person aiming at the copyright statement; and linking the copyrighted work, the copyright notice and the signing information.

Description

Copyright declaration method and copyright declaration device based on block chain

Technical Field

The embodiment of the present specification relates to the technical field of block chains, and in particular, to a copyright notice method and a copyright notice apparatus based on a block chain.

Background

Copyright is the legal property of the copy right for computer programs, literary works, musical works, photographs, games, movies, etc., which can be used to express the rights the creator enjoys for his literary, artistic works. Copyright rights typically belong to the originator, but copyright rights may also be assigned.

Copyright notice is an explanation of copyright that is placed in written form or otherwise, and may specify the rights to the copyright owner for the content of the rights to the claimed work. In the copyright industry, after an author completes the creation of a work, the author may make a copyright statement on the work to clarify the content of the author's rights to the work. At present, one way of claiming copyright is for the claimant to submit relevant material to the national copyright office on-line to apply for a copyright claim for a work.

Disclosure of Invention

In view of the above, embodiments of the present specification provide a block chain-based copyright notice method and a copyright notice apparatus. Through the technical scheme provided by the embodiment of the specification, the copyright notice is online carried out, and the related data of the copyright notice is uplink stored, so that the digital management and the trusted authentication of the copyright notice are realized.

According to an aspect of an embodiment of the present specification, there is provided a block chain-based copyright notice method, including: acquiring copyright works to be declared; generating a copyright notice based on the right content for the copyrighted work declared by the obligee, the copyright notice including the obligee information, the right content, and the copyrighted-work information; acquiring signing information of the rightful person for the copyright statement; and linking the copyrighted work, the copyright notice and the signing information.

According to another aspect of embodiments of the present specification, there is also provided a block chain-based copyright notice apparatus, including: the work acquisition unit is used for acquiring copyright works to be declared; a claim generating unit that generates a copyright claim including the righter information, the rights content, and the copyrighted-work information, based on the righter-declared rights content for the copyrighted work; a signing information acquisition unit for acquiring signing information of the righter for the copyright statement; and an uplink unit for linking the copyrighted work, the copyright notice and the signing information.

According to another aspect of embodiments herein, there is also provided an electronic device, including: at least one processor, a memory coupled to the at least one processor, and a computer program stored on the memory, the at least one processor executing the computer program to implement the blockchain based copyright notice method as described in any of the above.

According to another aspect of embodiments of the present specification, there is also provided a computer-readable storage medium storing a computer program which, when executed by a processor, implements the block chain-based copyright notice method as described above.

According to another aspect of embodiments of the present specification, there is also provided a computer program product comprising a computer program which, when executed by a processor, implements the block chain based copyright notice method as set forth in any of the above.

Drawings

A further understanding of the nature and advantages of the contents of the embodiments of the present specification may be realized by reference to the following drawings. In the drawings, similar components or features may have the same reference numerals.

FIG. 1 is a schematic diagram of an example environment provided by an example embodiment.

Fig. 2 is a schematic diagram showing an example of a system architecture for copyright notice according to the embodiment of the present specification.

Fig. 3 is a flowchart illustrating an example of a block chain-based copyright notice method according to an embodiment of the present specification.

Fig. 4 shows a flow chart of one example of copyrighted works, copyright notices and chaining of signing messages according to embodiments of the present description.

Fig. 5 is a schematic diagram illustrating an example of a consensus process of an embodiment of the present specification.

Fig. 6 is a diagram illustrating an example of formats of a pre-preparation message, a preparation message, and an acknowledgement message in a consensus process of an embodiment of the present specification.

Fig. 7 is a flowchart illustrating an example of querying rights content from a blockchain provided in accordance with an embodiment of the present specification.

FIG. 8 illustrates a flow diagram of one example of work validation provided in accordance with an embodiment of the present description.

Fig. 9 is a block diagram illustrating an example of a block chain-based copyright notice apparatus provided according to an embodiment of the present specification.

Fig. 10 shows a block diagram of an electronic device for implementing a block chain-based copyright notice method according to an embodiment of the present specification.

Detailed Description

The subject matter described herein will be discussed with reference to example embodiments. It should be understood that these embodiments are discussed only to enable those skilled in the art to better understand the subject matter described herein and are not intended to limit the scope, applicability, or examples set forth in the claims. Changes may be made in the function and arrangement of elements discussed without departing from the scope of the embodiments of the disclosure. Various examples may omit, substitute, or add various procedures or components as needed. In addition, features described with respect to some examples may also be combined in other examples.

As used herein, the term "include" and its variants mean open-ended terms in the sense of "including, but not limited to. The term "based on" means "based at least in part on". The terms "one embodiment" and "an embodiment" mean "at least one embodiment". The term "another embodiment" means "at least one other embodiment". The terms "first," "second," and the like may refer to different or the same objects. Other definitions, whether explicit or implicit, may be included below. The definition of a term is consistent throughout the specification unless the context clearly dictates otherwise.

Copyright is the legal property of the right to copy computer programs, literary works, musical works, photographs, games, movies, etc., which can be used to express the rights the creator enjoys with their literary, artistic works. The copyright is typically of the originator, but the copyright may be transferred.

Copyright notice is an explanation of copyright that is placed in written form or otherwise, and may specify the rights to the copyright owner for the content of the rights to the claimed work. In the copyright industry, after an author completes the creation of a work, copyright statements may be made on the work to clarify the content of the author's rights to the work. At present, one way of claiming copyright is for the claimant to submit relevant material to the national copyright office on-line to apply for a copyright claim for a work.

However, the offline copyright notice processing not only takes a long time, but also has high cost, and the obtained copyright notice file is a paper file, so that the file management is not convenient to be uniformly carried out.

In view of the above, embodiments of the present specification provide a block chain-based copyright notice method and a copyright notice apparatus, in the copyright notice method, obtaining a copyright work to be declared; generating a copyright notice based on the right content of the right person notice for the copyright works, wherein the copyright notice comprises right person information, right content and copyright work information; acquiring signing information of a rightful person aiming at the copyright statement; and linking the copyrighted work, the copyright notice and the signing information. Through the technical scheme provided by the embodiment of the specification, the copyright notice is online carried out, and related data of the copyright notice is linked and stored, so that digital management and credible authentication of the copyright notice are realized.

A block chain-based copyright notice method and a copyright notice apparatus provided in an embodiment of the present specification are described in detail below with reference to the accompanying drawings.

The block chain is a distributed shared account book and a database, and has the characteristics of decentralization, no tampering, trace retention, backtracking, openness and transparency and the like. The data on the block chain is stored in the form of data blocks, and the data blocks are connected in time sequence to form a chain data structure. Each block in the chain of blocks is linked to the previous block by an included cryptographic hash, and each block further includes a timestamp, a cryptographic hash, and one or more transactions. The individual transactions in the block form a Merkle tree by hashing. In a Merkle tree, the lowest leaf node contains the underlying data, each intermediate node is a hash of its child node, the root node is a hash of its child node, representing the root of the Merkle tree, and the root node of the Merkle tree stores hash values representing all the data in the Merkle tree. When verifying whether a hash value is a transaction stored in the Merkle tree, quick verification can be performed by determining whether the hash value is consistent with the structure of the Merkle tree.

A blockchain network is a decentralized point-to-point network consisting of multiple computing nodes for managing, updating, and maintaining one or more blockchain structures. The types of blockchain networks may include public blockchain networks, private blockchain networks, and alliance blockchain networks, depending on the degree of openness of the nodes in the blockchain network.

The public blockchain network is a public network of participating entities, thousands of entities can exist in the public blockchain network for cooperative processing, each entity operates at least one node in the public blockchain network, and accordingly, the consensus process in the public blockchain network is also completed by each node. In the consensus process, a node participating in the consensus signs a block to indicate that the node acknowledges the consensus for the block, and then the block that completed the consensus is added to the block chain of the block chain network. In addition, the public blockchain network supports public transactions, and the public transactions are shared among all nodes in the public blockchain network and are stored in the global blockchain after being identified by all the nodes. A global blockchain refers to a blockchain that is replicated across all nodes. Consensus in a blockchain network is supported by a consensus mechanism, which is an algorithm for blockchain transactions to achieve distributed consensus, which may include: proof of work (POW), proof of rights (POS), and proof of authority (POA).

The private block chain network only aims at a specific entity, and the read-write permission of each node in the private block chain network is strictly controlled. In addition, the threshold for joining the private blockchain network is high, and it needs to be allowed to join the private blockchain network to become one of the nodes, based on which, the private blockchain network is also commonly referred to as an allowed network, which limits who is allowed to participate in the network and the participation level in the network, for example, some nodes may participate in the uplink process of all transactions, and some nodes may only participate in the uplink process of a designated part of transactions. Various types of access control mechanisms may be used in private blockchain networks, such as voting of adding new entities by existing participants, regulatory agency control permissions, and the like.

The participating entities in the federated blockchain network are also private from each other and can be considered private networks of the participating entities. A federated blockchain network may be composed of several entities, each of which operates at least one node in the federated blockchain network. The consensus process in the federated coalition blockchain network is performed by authorized nodes, which may be all or part of the nodes in the federated coalition blockchain network, each of which signs a block to be uplinked to indicate a consensus acknowledgement for that block, which is then added to the blockchain.

FIG. 1 is a schematic diagram of an example environment provided by an example embodiment. As shown in fig. 1, the example environment 100 allows entities to participate in a blockchain network 102. The blockchain network 102 may be, for example, a public, private, or alliance chain blockchain network. The example environment 100 may include computing devices 104, 106, 108, 110, 112 and a network 114. In an embodiment, the Network 114 may include a Local Area Network (LAN), Wide Area Network (WAN), the internet, or a combination thereof, and is connected to websites, user devices (e.g., computing devices), and backend systems. In an embodiment, the computing devices 104, 106, 108, 110, 112 may access the network 114 through wired and/or wireless communication.

In some cases, the computing devices 106, 108 may be nodes of a cloud computing system (not shown), or each computing device 106, 108 may be a separate cloud computing system, including multiple computers interconnected by a network and operating as a distributed processing system.

In an embodiment, the computing devices 104-108 may run any suitable computing system that enables them to act as nodes in the blockchain network 102. For example, the computing devices 104-108 may include, but are not limited to, servers, desktop computers, laptops, tablet computing devices, and smartphones. In an embodiment, the computing devices 104-108 can be affiliated with a related entity and used to implement a corresponding service, which can be used to manage transactions between an entity or entities, for example.

In one embodiment, the computing devices 104-108 respectively store a blockchain ledger corresponding to the blockchain network 102. The computing device 104 may be (or include) a web server for providing browser functionality that may provide visualization information related to the blockchain network 102 based on the network 114. In some cases, the computing device 104 may not participate in the blockchain verification, but rather monitor the blockchain network 102 to determine when other nodes (e.g., which may include the computing device 106 and 108) agree, and generate a corresponding blockchain visualization user interface accordingly.

In an embodiment, computing devices 110 and 112 may be client devices connected to the blockchain network 102. For example, computing device 110 may be a terminal device at a medical facility platform and computing device 112 may be a terminal device at an advertising administration platform. Computing devices 110 and 112 may include, but are not limited to, servers, desktop computers, laptops, tablet computing devices, and smartphones.

In an embodiment, computing device 104 may receive a request initiated by a client device (e.g., computing device 110 or computing device 112) for a blockchain visualization user interface. In some cases, the nodes of the blockchain network 102 may also act as client devices, such that a user of the computing device 108 may send the request to the computing device 104 using a browser running on the computing device 108.

In response to the request, computing device 104 may generate a blockchain visualization user interface (e.g., a web page) based on the stored blockchain ledger and send the generated blockchain visualization user interface to the requesting client device. If blockchain network 102 is a private type or a federated type of blockchain network, the request for the blockchain visual user interface may include user authorization information, which may be verified by computing device 104 before generating and sending the blockchain visual user interface to the requesting client device and returned to the corresponding blockchain visual user interface after verification is passed.

The blockchain visualization user interface may be displayed on the client device (e.g., as may be displayed in user interface 116 shown in fig. 1). When the blockchain ledger is updated, the display of the user interface 116 may be updated accordingly. Further, user interaction with user interface 116 may result in requests to other user interfaces, such as displaying a block list, block details, transaction list, transaction details, account list, account details, contract list, contract details, or search results page resulting from a user conducting a search of a block chain network, and so forth.

Fig. 2 is a schematic diagram illustrating an example of a system architecture 200 for copyright noticing according to an embodiment of the present specification.

As shown in fig. 2, the system architecture 200 for transaction data processing may include a blockchain client and a blockchain network end, wherein the blockchain client is communicatively connected to the blockchain nodes in the blockchain network. The blockchain client may include the obligee client 210, other user clients, and the like. The blockchain network end may include a copyright platform 220, a work request node 240, a work verification node 260, other blockchain nodes, and the like.

The obligee client 210 is communicatively connected with the rights platform 220, and the rights platform 220 can provide corresponding rights services for the obligee client 210.

In one example, the machines that make up the copyright platform 220 may act as or be part of a blockchain node in the blockchain network 214, such that the copyright platform 220 can package copyright related data into blocks that are recorded on the blockchain 216, and the data recorded on the blockchain 216 cannot be tampered with, thereby ensuring the authenticity of such data.

In addition, the work request node 240 may be a blockchain node in the blockchain network 214 or a component thereof, and the work request node 240 may query and obtain data related to the copyrighted work, such as the copyrighted work, the right content corresponding to the copyrighted work, and the like, from the blockchain 216.

In addition, the work verification node 260 may also be a blockchain node in the blockchain network 214 or a component thereof, and the work verification node 260 may query a hash value corresponding to the copyrighted work from the blockchain 216 and verify the work to be verified based on the queried hash value. An organization acting as a work verification node 260 may verify a work obtained from a third party to determine whether the work has been tampered with.

In one example, the copyright platform 220, the work request node 240, and the work validation node 260 may belong to the same blockchain node or a portion thereof in the blockchain network 214. The block link point may implement the functions of the copyright platform 220, the work request node 240, and the work verification node 260.

In another example of an embodiment of the present specification, the copyright platform 220 in the system architecture 200 belongs to a blockchain client, and the copyright platform 220 is communicatively connected to at least one blockchain node in the blockchain network 214.

In this example, the copyright platform 220 may send the copyright associated to-be-linked-chain data to the blockchain node, and the blockchain node packs the copyright associated to-be-linked-chain data into blocks to be recorded on the blockchain 216.

Fig. 3 shows a flowchart of an example 300 of a block chain based copyright notice method according to an embodiment of the present specification.

The copyright notice method shown in fig. 3 may be performed by a copyright platform. The copyright platform may include multiple machines, and the copyright platform may provide copyright services, such as copyright registration, copyright notices, copyright management, and the like. When the copyright platform provides the copyright service, the provided copyright service can be executed by one machine in the copyright platform, and can also be executed by a plurality of machines in the copyright platform in an interactive mode.

As shown in FIG. 3, at 310, a copyrighted work to be claimed is obtained.

In the embodiments of the present specification, copyrighted works are copyrighted works such as computer programs, literary works, musical works, photographs, games, movies, and the like. In one way of acquiring copyrighted works, a user may upload copyrighted works to a copyright platform so that the copyright platform may acquire the copyrighted works. The user who uploads copyrighted work may include an obligee of copyrighted work, an assignee who is entrusted by the obligee as an offeror, and the like.

In one example, the implementer of the copyright notice may be authenticated prior to obtaining the copyrighted work to be claimed. The enforcer of a copyright notice may be the person that initiated the copyright notice, the enforcer may be the claimant of the copyright work being asserted, or the claimant may be the delegate delegated by the claimant as a principal.

The authentication mode of the executor may include an account and password login mode, a face recognition mode, an ID authentication mode, and the like. In the account password login mode, an executor can correspond to an account and a corresponding password, successfully log in a copyright platform through the account and the password, and express that identity authentication is passed; otherwise, the authentication is not passed. In the ID verification method, the ID may include an ID number, a name of an executor, and the like. In the face recognition mode, the copyright platform can store face features for verification, and when the face image of the executor acquired by the copyright platform is consistent with the stored face features, the identity verification is passed.

When the actor is a delegate, the authentication may include authentication of the actor and authentication of a principal, the principal being a written certificate for the authority as a principal to delegate the delegate to the delegate for relevant transactions, and the principal may be used to determine the validity of a delegation relationship between the principal and the delegate.

In this example, before the copyright notice operation is executed, the identity of the executor who initiates the copyright notice is verified to ensure the correctness of the signed information in the subsequent copyright notice process, so that the execution process of the copyright notice is ensured to be credible and legal, and the copyright notice is prevented from being executed wrongly.

At 320, a copyright notice is generated based on the rights to the copyrighted work content as stated by the claimant.

In the embodiment of the present specification, the right content for the copyrighted work may include a publication right, a signature right, a modification right, a duplication right, a distribution right, a lease right, an exhibition right, a performance right, a showing right, a broadcast right, an adaptation right, and the like, and the right content stated by the rightful person may include all rights or a part of rights of the copyrighted work. For example, when the claimant is the originator of a copyrighted work, the originator, as a claimant, may claim all rights to the copyrighted work. When the claimant is an assignee for which the copyright is transferred, the claimant, as the assignee, may enjoy partial rights to the copyrighted work.

After determining the rights content claimed by the righter for the copyrighted work, a copyright claim may be generated based on the righter and the claimed rights content. The copyright notice may include information on the right holder, the content of the right to be declared, and information on the copyright work. The copyrighted work information may include a copyrighted work name, a work image, etc., the declared rights content is rights to copyrighted works owned by the rightist, and the rightist information may include the name of the rightist, an identification card number, etc. The copyright notice may be used to confirm the rights the rightist has to the copyrighted work,

in one way of generating a copyright notice, format terms are provided for each rights correspondence in the copyright, and the format terms corresponding to each claimed right that need to be exposed in the copyright notice are determined from the rights contents claimed by the claimant. And then correspondingly filling the format clauses, the information of the right persons and the information of the copyright works of the determined rights into a format contract, wherein the format contract is correspondingly provided with fixed filling positions for different types of information, and each piece of information to be filled can be correspondingly filled into the corresponding position of the format contract according to the type of the information. The format contract filled with the respective information generates the copyright notice.

In one example, the operation of generating the copyright notice may be performed by an intelligent contract that may be used to perform the operation of generating the copyright notice. After the rights holder declares the rights content, the intelligent contract may be invoked to perform the operation of generating the copyright notice to obtain the copyright notice.

In this example, the copyright notice is generated by automatic execution of the smart contract, avoiding human intervention. In addition, the intelligent contracts are identified, and codes corresponding to the intelligent contracts can be audited, so that the copyright statement execution process is guaranteed to be credible and not to be falsified.

At 330, the signing information of the rightist for the copyright notice is obtained.

After the copyright notice is generated, the generated copyright notice can be presented to the obligee so that the obligee can check the copyright notice. After verification, the rightful person signs the copyright notice to confirm that the content of the copyright notice is correct.

The signing information may include signatures and/or signatures, etc. The signature may be an electronic signature generated by the authorized person performing signature on the terminal device, the signature may be generated by the authorized person on the terminal device in a checking manner, and the terminal device may be a device used by the authorized person, such as a mobile phone. In the signature mode, the option can include options such as agreement, disagreement and the like, the obligee only needs to perform the check operation on the corresponding item, and the copyright platform can generate the corresponding signature in response to the 'agreement' item checked by the obligee.

In one mode of generating the signature, the copyright platform can pre-store the signature of each obligee, the signature and the obligee are correspondingly stored, and the corresponding signature can be obtained according to the information of the obligee when the signature needs to be generated. The location where the signature is stored may be a blockchain, or may be in a memory of tee (trusted Execution environment) to ensure the security of the signature storage.

At 340, the copyrighted work, copyright notice, and signing information are linked.

FIG. 4 shows a flow diagram of one example 400 of copyrighted works, copyright notices and chaining of signing messages in accordance with an embodiment of the present description.

As shown in fig. 4, the copyrighted work may be packaged into a first tile that includes a first hash value that may be generated from the copyrighted work at 341.

In this example, the first block may include one or more blocks, and when the first block includes a plurality of blocks, the copyrighted work may be divided into transaction data as transaction data, each of the transaction data being packed into one block. When the data amount of the copyrighted work is not greater than the capacity of the tile, the copyrighted work may be packaged into one tile as the first tile. When the data volume of the copyright works is larger than the capacity of the block, the copyright works can be divided according to the capacity of the block, and the data volume of each transaction datum after division is not larger than the capacity of the block. Then, packaging each transaction data into a block, wherein all the obtained blocks are the first blocks.

At 343, the copyright notice and the signing information may be packaged into a second chunk that includes a second hash value generated from the copyright notice and the signing information.

In this example, the second block may include one or more blocks, and when the second block includes a plurality of blocks, the transaction data of the copyright notice and the signing information as a whole is divided into transaction data pieces, each of which is packed into one block. When the data amount of the whole data of the copyright notice and the signing information is not more than the capacity of the block, the copyright notice and the signing information may be packaged into one block as a second block. When the data volume of the whole data of the copyright notice and the signing information is larger than the capacity of the block, the data volume of each transaction data after being divided can be divided according to the capacity of the block, and the data volume of each transaction data after being divided is not larger than the capacity of the block. Then, packaging each transaction data into a block, and obtaining all blocks as a second block.

It should be noted that the execution order of 341 and 343 may not be limited in this embodiment.

Before being packaged into blocks (e.g., a first block and a second block), hash calculation needs to be performed on uplink data (e.g., copyrighted works, copyright notices and signature information) to obtain corresponding hash values. For example, hash calculation is performed on the copyrighted work to obtain a first hash value, and hash calculation is performed on the copyright notice and the signing information to obtain a second hash value.

Hash calculation is the process of converting the data to be linked (i.e., copyrighted works, copyright notices, and signing information) into a fixed-length hash value. After performing hash calculation on the data to be uplink, even if the data to be uplink is slightly changed, a completely different first hash value is obtained. The first hash value is typically generated by hashing the data to be uplinked using a hash function. Examples of hash functions include, but are not limited to, Secure Hash Algorithm (SHA) -256, which outputs a first hash value of 256 bits.

The plurality of data included in the data to be uplinked may be hashed and stored in the block. For example, two data are hashed to obtain two hash values, and then the two obtained hash values are hashed again to obtain another hash value. This process is repeated until a single hash value is obtained for all the data to be stored in the block. This hash value is called a Merkle root hash and is stored at the head of the chunk. Any change to the transaction data will cause its hash value to change, eventually causing the Merkle root hash value to change.

At 345, the first chunk and the second chunk may be recorded on the blockchain.

In the embodiment of the present specification, the uplink operations of the first block and the second block may be performed separately, and the uplink operations of the first block and the second block do not affect each other. That is, for the first block, the first block may be broadcasted to a consensus node in the blockchain network for consensus processing, and after the consensus node achieves consensus, the first block may be recorded on the blockchain. For the second block, the second block may be broadcasted to a consensus node in the blockchain network for consensus processing, and after the consensus node achieves consensus, the second block may be recorded on the blockchain.

Fig. 5 is a schematic diagram illustrating an example of a consensus process of an embodiment of the present specification. In this specification, copyrighted works as well as copyright notice and signing information may be considered as transaction data in a blockchain. In the example of fig. 5, the block chain node where the copyright platform is located serves as the master node (i.e., accounting node, hereinafter referred to as master node R0) of the block chain network.

The master node R0 broadcasts the packaged tiles to all consensus nodes in the blockchain network for consensus processing, for example, the master node R0 broadcasts the packaged tiles to the backup nodes R1, R2, and R3 for consensus processing. Note that the consensus process is shown as including 4 network nodes R0, R1, R2, and R3 for illustrative purposes only, and the consensus process may include any suitable number of network nodes.

In the embodiment of the present specification, the consensus process may be implemented using PoW (workload certification algorithm), PoS (entitlement certification algorithm), PBFT (practical byzantine fault-tolerant algorithm), and the like. The following description will be made by taking the PBFT consensus process as an example.

As shown in fig. 5, the procedure of the PBFT consensus process includes: a Pre-preparation phase (Pre-preparation) 510, a preparation phase (preparation) 520, and a validation phase (Commit) 530.

Specifically, at 510, the master node R0 packages the data segments to be recorded into the blockchain into a message m, then generates a Pre-prepare message Pre-prepare, and sends (e.g., broadcasts) the Pre-prepare message Pre-prepare to the backup nodes R1, R2, and R3 within a given time interval. The Pre-prepare message Pre-prepare indicates that master node R0 is initiating the consensus process.

In an embodiment of the present specification, as shown in fig. 6, the format of the Pre-preparation message Pre-preparation may be: < PRE-PREPARE, epoch, seq, D (m), signature-p >, m, j >. Here, "PRE-PREPARE" represents a protocol identification of the PRE-preparation message, "epoch" represents an era in which R0 is the master node, "seq" represents a proposal number of a proposal of a required consensus (i.e., adding the block to the blockchain 216), "d (m)" represents a digest of a request message set, "signature-p" represents a signature of R0, "m" represents a specific content of the request message (i.e., a specific content of each piece of authentication information in the block), and "j" represents a node identification of R0. Here, d (m) is obtained by performing hash calculation on each authentication information set in the block.

In the preparation stage 520, for each backup node (R1, R2, or R3), after receiving the Pre-preparation message Pre-preparation and detecting that the Pre-preparation message Pre-preparation is legal, the Pre-preparation message Pre-preparation may be stored in a local log and a preparation message Prepare for responding to the Pre-preparation message Pre-preparation may be generated and then broadcast to other nodes. The Prepare message Prepare indicates that the backup node has received the Pre-Prepare message Pre-Prepare from the primary node and is sending a reply in response to the Pre-Prepare message Pre-Prepare.

Accordingly, each backup node will also receive the prepare message Pre-prepare sent by the other backup nodes. Taking backup node R1 as an example, after receiving the Prepare message Pre-Prepare sent by master node R0, backup node R1 broadcasts the generated Prepare message Pre-Prepare to master node R0, backup nodes R2, and R3. Accordingly, backup node R1 also receives Prepare message Prepare sent by primary node R0, backup nodes R2 and R3.

In this description, the Prepare message Prepare broadcast by the backup node may be used to indicate the consensus commitment made by the backup node during the Prepare phase 520.

In this specification, as shown in fig. 6, the format of the preparation message Prepare may be: < PREPARE, epoch, seq, D (m), i, signature-i >. Here, "PREPARE" denotes a protocol identification of the preparation message PREPARE, "i" denotes a node identification of the node that transmitted the preparation message PREPARE, and "signature-i" denotes a signature of the node that transmitted the preparation message PREPARE. The meaning of "epoch", "seq", and "d (m)" in the preparation message Prepare is the same as that of "epoch", "seq", and "d (m)" in the aforementioned prepard message Pre-Prepare.

In the acknowledgement phase 530, when the network node receives a sufficient number of preparation messages Prepare from other network nodes, the network node determines that consensus has been reached. For example, if the primary node R0 or backup nodes R1, R2, or R3 receive qurum (e.g., 2f +1, where f represents the number of failed network nodes) Prepare messages Prepare, it is determined that consensus is achieved between the network nodes. The master node R0 or the backup node R1, R2 or R3 then broadcasts a confirmation message Commit to the other nodes.

In this specification, as shown in fig. 6, the format of the acknowledgment message Commit may be: < COMMIT, epoch, seq, D (m), p, signature-p >. Here, "COMMIT" indicates a protocol identifier of the acknowledgment message COMMIT, "p" indicates a node identifier of a node that transmits the acknowledgment message COMMIT, and "signature-p" indicates a signature of a node that transmits the acknowledgment message COMMIT. The meaning of "epoch", "seq" and "d (m)" in the acknowledgment message Commit is the same as that of "epoch", "seq" and "d (m)" in the aforementioned Pre-preparation message Pre-preparation.

In this description, a node sends a confirmation message Commit and stores the confirmation message Commit in a local log to represent consensus commitments made by the node during the confirmation phase 530.

After reaching consensus for the initiated proposal as above, the master node records the block into the blockchain, thereby completing the recording of the first block or the second block into the blockchain.

In addition, before the data to be uplink is packaged into blocks, encryption processing can be performed on the data to be uplink, so that information leakage caused by the fact that the data to be uplink is known by other common identification nodes is avoided. Accordingly, in this case, the encrypted data is used to calculate a hash value of the data. When data is stored in a block, the encrypted data is also stored in the block. In addition, it should be noted that the encrypting of the data may include encrypting all data included in the data, or encrypting part of data included in the data.

Examples of encryption methods for data include, but are not limited to, symmetric encryption, asymmetric encryption, homomorphic encryption, and the like. Symmetric encryption may use a single key for both the encryption process of encrypting data (generating ciphertext from plaintext) and decrypting data (generating plaintext from ciphertext). In symmetric encryption, multiple nodes may have the same key, so each node may encrypt/decrypt data.

Asymmetric encryption may use a key pair to encrypt data. Specifically, the copyright platform may encrypt data using a public key of a public/private key pair at the data application side, then digitally sign the encrypted data using a private key of the public/private key pair at the copyright platform, send the digitally signed encrypted data to a consensus node in the block chain, decrypt and verify the encrypted data using the public key of the public/private key pair at the copyright platform by the consensus node, and record the decrypted data on the block chain after the consensus node achieves consensus. In this case, after the encrypted transaction data is acquired from the blockchain, the data application side may decrypt the encrypted transaction data by using its own private key, thereby obtaining the plaintext data of the transaction data.

As described herein, the blockchain network 214 is provided in the form of a peer-to-peer network that includes a plurality of blockchain nodes that are each used to persist a blockchain 216 (also referred to as a blockchain ledger 216) formed by blockchain data. Only one blockchain 216 is shown in fig. 2, but there may be multiple blockchains 216 or copies thereof in the blockchain network, e.g., one blockchain 216 or copy thereof may be maintained for each blockchain link point.

Furthermore, it is noted that the embodiment described in fig. 3 may be implemented in a block chain recording manner based on a consensus protocol. In other embodiments of the present specification, the block chain record may be implemented without the need of consensus processing, for example, a trusted account book without the need of consensus processing.

In one example of an embodiment of the present specification, the copyrighted work, the copyright notice, and the signing information may be packaged into a block, and the block may include a hash value generated from the copyrighted work, the copyright notice, and the signing information. The packed blocks are then recorded on a block chain.

In one example of the embodiment of the present specification, when the claimant is not an originator of a copyrighted work of a copyright notice, it may be determined that the claimant has obtained a corresponding right by way of right transfer. The right transfer may be achieved by a transfer contract, which may record transfer work information, right transferor information, right transferee information, transfer right content, and transfer and transferee sign information, etc. The transfer contract can be used to determine the source and legitimacy of rights enjoyed by the rightist, thereby avoiding the counterfeiting of the rights and ensuring the authenticity of the copyright notice content.

In this example, the copyrighted work, the copyright notice, the signing information, and the transfer contract for the copyrighted work may be linked. In one example, the blocks may be packed separately and each block may be linked separately. For example, a copyrighted work may be packaged into a first block, and a copyright notice, signing information, and a transfer contract for the copyrighted work may be packaged into a second block, the hash value in the second block being generated from the copyright notice, signing information, and transfer contract for the copyrighted work.

In one example of an embodiment of the present specification, after the rightist signs the copyright notice, the contents of the copyright notice may be determined to be error-free. Thus, an intelligent contract can be invoked to record correspondences between the righter, the copyrighted work and the declared rights, and the recorded correspondences are also linked to the blockchain for storage.

The storage manner of the correspondence may be a manner of key-value pairs (key-value), the key may be used to represent the rights person and/or the copyrighted work, and the value may be used to represent the rights content. In one example, the recorded correspondence may be stored in an account store of the smart contract, the account store being saved as one attribute of the account on the blockchain, the correspondence being stored in the account store in a key-value pair manner. Each smart contract corresponds to an account storage, and the smart contracts can perform operations on the account storage, such as write operations, read operations, and the like.

In one example, an intelligent contract may be invoked to store a copyright notice, the stored copyright notice being linked up to the blockchain. The copyright notice includes information of the right person, the right content, the copyrighted work and the like, so that the corresponding relation among the right person, the copyrighted work and the copyrighted content can be determined based on the copyright notice.

In the above example, the intelligent contract may perform the operation of recording the correspondence or storing the copyright notice by means of calling, and by automatic execution of the intelligent contract, the correspondence may be recorded without human involvement. In addition, the intelligent contract records the corresponding relationship among the authorized person, the copyright works and the rights, and accordingly, the corresponding relationship needs to be executed through the intelligent contract when the corresponding relationship is inquired from the block chain.

In one example, the smart contract may have functionality for verifying query rights, which may be used to verify query rights for rights content, and a list of query rights may be specified. The inquiry authority can be realized by setting a white list, when a requester requests to inquire the right content, the intelligent contract determines whether the requester has the inquiry authority or not by inquiring the white list, the requester is allowed to inquire the right content only when the requester has the inquiry authority, and the requester is forbidden to inquire the right content otherwise.

Through the above example, by calling the intelligent contract to record the corresponding relation among the authorized person, the copyright works and the rights content, the corresponding relation passing through the uplink can be prevented from being tampered, so that the authenticity of the corresponding relation is ensured. In addition, the intelligent contract can ensure that the right content stored on the block chain can not be completely disclosed by setting the query authority, and only can be viewed by a specified part of users.

Fig. 7 illustrates a flow diagram of an example 700 of querying rights content from a blockchain provided in accordance with an embodiment of the present description.

As shown in fig. 7, at 710, an intelligent contract may be invoked to verify the work requestor's query right in response to a work requestor's right query request. The work requestor may include, among other things, an individual or an organization. The rights inquiry request may include the information of the rightist as well as the information of the copyrighted work.

Upon passing verification, the operations of 720 may be performed. When the verification is not passed, it indicates that the work requester does not have the right content to view the copyrighted work.

At 720, upon verification, the block chain is queried for rights content corresponding to the information of the rightful person and the name of the copyrighted work. When inquiring on the block chain, the information of the right of interest and the name of the copyright works can be used as index information to inquire.

At 730, the queried rights content is fed back to the work requestor.

In one example, when the blockchain is a public chain, the rights content recorded on the blockchain can be viewed by all nodes, and the rights content on the chain can be limited by the intelligent contract, so that only part of the nodes can be viewed. When the blockchain is a private chain or a federation chain, the rights content recorded on the blockchain is only viewable by nodes in the same private chain network or federation chain network. The number of nodes viewing the rights content may be further limited by intelligent contracts so that only some of the nodes in the private or federated link network have permission to view the rights content on the link.

FIG. 8 illustrates a flow diagram of one example 800 of validation of a work provided in accordance with an embodiment of the present description.

As shown in fig. 8, at 810, in response to a verification request of a work to be verified by a work verification policy, hash calculation is performed on the work to be verified to obtain a third hash value corresponding to the work to be verified. The authentication request may include information of the work to be authenticated, such as a name, a work type, a storage address, and the like.

The work to be verified may be a work obtained from a third party, where the third party may be a trusted third party or an untrusted third party.

At 820, a first hash value corresponding to a copyrighted work used to verify the work to be verified is queried on the blockchain.

At 830, the first hash value is compared to the third hash value.

At 840, a verification result is fed back to the work verifier based on the comparison of the first hash value and the third hash value. And when the first hash value is consistent with the third hash value, the verification result shows that the work to be verified is consistent with the copyright work and the work to be verified is not tampered. And when the first hash value is inconsistent with the third hash value, the verification result shows that the work to be verified is consistent with the copyright work, and the work to be verified is tampered.

In the work verification scheme shown in fig. 8, the work to be verified is stored in the third-party transaction data storage party, when the transaction dispute is resolved, the transaction service data may be obtained from the third-party transaction data storage party, and the hash value recorded on the blockchain is used to verify whether the work to be verified provided by the third party is tampered, so as to effectively verify the authenticity of the work.

Fig. 9 is a block diagram illustrating an example of a block chain-based copyright notice apparatus 900 provided according to an embodiment of the present specification.

The copyright notice apparatus 900 includes a work acquisition unit 910, a notice generation unit 920, a signing information acquisition unit 930, and an uplink unit 940.

A work obtaining unit 910 configured to obtain a copyrighted work to be declared.

A claim generating unit 920 configured to generate a copyright claim including the right information, the rights content, and the copyrighted-work information based on the right content for the copyrighted work declared by the right person.

A signing information obtaining unit 930 configured to obtain signing information of the righter for the copyright notice.

An uplink unit 940 configured to uplink copyrighted works, copyright notices, and signing information.

In one example, the uplink unit 940 may be further configured to: packaging the copyrighted work into a first chunk, the first chunk including a first hash value generated by the copyrighted work; packaging the copyright notice and the signing information into a second block, wherein the second block comprises a second hash value generated by the copyright notice and the signing information; and recording the first block and the second block on the block chain.

In one example, the uplink unit 940 may be further configured to: respectively broadcasting the first block and the second block to a consensus node in a block chain network for consensus processing; and recording the first block and the second block on the block chain respectively after the consensus node achieves the consensus.

In one example, the copyright notice apparatus 900 may further include an intelligent contract invoking unit, and the intelligent contract invoking unit may be configured to: and calling an intelligent contract to record the corresponding relation among the authorized person, the copyright works and the right content.

In one example, the intelligent contract invoking unit may be configured to: an intelligent contract is invoked to store the copyright notice.

In one example, the copyright notice apparatus 900 may further include a rights content inquiry unit and a rights content feedback unit. The intelligent contract invoking unit may be further configured to: and in response to a right inquiry request of the work requester, invoking an intelligent contract to verify the inquiry right of the work requester, wherein the right inquiry request comprises right information and copyright work information. The rights content querying unit may be configured to: and when the verification is passed, inquiring the right content corresponding to the information of the right holder and the information of the copyright works on the block chain. The rights content feedback unit may be configured to: and feeding back the inquired right content to the work requester.

In one example, the copyright notice apparatus 900 may further include a hash calculation unit, a hash value query unit, a hash value comparison unit, and a verification result feedback unit.

The hash calculation unit may be configured to: and responding to a verification request of the work to be verified by the work verification policy, and performing hash calculation on the work to be verified to obtain a third hash value corresponding to the work to be verified.

The hash value querying unit may be configured to: and inquiring a first hash value corresponding to the copyright work for verifying the work to be verified on the block chain.

The hash value comparison unit may be configured to: the first hash value is compared with the third hash value.

The verification result feedback unit may be configured to: and feeding back a verification result to the work verifying party based on the comparison result of the first hash value and the third hash value.

Embodiments of a block chain based copyright notice method and a copyright notice apparatus according to an embodiment of the present specification are described above with reference to fig. 1 to 9.

The block chain-based copyright notice apparatus in the embodiments of the present specification may be implemented by hardware, or may be implemented by software, or a combination of hardware and software. The software implementation is taken as an example, and is formed by reading corresponding computer program instructions in the storage into the memory for operation through the processor of the device where the software implementation is located as a logical means. In the embodiments of the present specification, the block chain-based copyright notice apparatus may be implemented by, for example, an electronic device.

Fig. 10 shows a block diagram of an electronic device 1000 for implementing a block chain-based copyright notice method according to an embodiment of the present specification.

As shown in fig. 10, the electronic device 1000 may include at least one processor 1010, a memory (e.g., non-volatile memory) 1020, a memory 1030, and a communication interface 1040, and the at least one processor 1010, the memory 1020, the memory 1030, and the communication interface 1040 are connected together via a bus 1050. The at least one processor 1010 executes at least one computer-readable instruction (i.e., an element described above as being implemented in software) stored or encoded in memory.

In one embodiment, computer-executable instructions are stored in the memory that, when executed, cause the at least one processor 1010 to: acquiring copyright works to be declared; generating a copyright notice based on the right content of the right person notice for the copyright works, wherein the copyright notice comprises right person information, right content and copyright work information; acquiring signing information of a rightful person aiming at the copyright statement; and linking the copyrighted work, the copyright notice and the signing information.

It should be appreciated that the computer-executable instructions stored in the memory, when executed, cause the at least one processor 1010 to perform the various operations and functions described above in connection with fig. 1-9 in the various embodiments of the present description.

According to one embodiment, a program product, such as a machine-readable medium, is provided. A machine-readable medium may have instructions (i.e., elements described above as being implemented in software) that, when executed by a machine, cause the machine to perform various operations and functions described above in connection with fig. 1-9 in the various embodiments of the present specification.

Specifically, a system or apparatus may be provided which is provided with a readable storage medium on which software program code implementing the functions of any of the above embodiments is stored, and causes a computer or processor of the system or apparatus to read out and execute instructions stored in the readable storage medium.

In this case, the program code itself read from the readable medium can realize the functions of any of the above-described embodiments, and thus the machine-readable code and the readable storage medium storing the machine-readable code form part of the present invention.

Computer program code required for the operation of various portions of the present specification may be written in any one or more programming languages, including an object oriented programming language such as Java, Scala, Smalltalk, Eiffel, JADE, Emerald, C + +, C #, VB, NET, Python, and the like, a conventional programming language such as C, Visual Basic 2003, Perl, COBOL2002, PHP, and ABAP, a dynamic programming language such as Python, Ruby, and Groovy, or other programming languages. The program code may execute on the user's computer, or on the user's computer as a stand-alone software package, or in part on the user's computer and in part on a remote computer, or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any network format, such as a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet), or in a cloud computing environment, or as a service, such as a software as a service (SaaS).

Examples of the readable storage medium include floppy disks, hard disks, magneto-optical disks, optical disks (e.g., CD-ROMs, CD-R, CD-RWs, DVD-ROMs, DVD-RAMs, DVD-RWs), magnetic tapes, nonvolatile memory cards, and ROMs. Alternatively, the program code may be downloaded from a server computer or from the cloud via a communications network.

The foregoing description of specific embodiments has been presented for purposes of illustration and description. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may also be possible or may be advantageous.

Not all steps and elements in the above flows and system structure diagrams are necessary, and some steps or elements may be omitted according to actual needs. The execution order of the steps is not fixed, and can be determined as required. The apparatus structures described in the above embodiments may be physical structures or logical structures, that is, some units may be implemented by the same physical entity, or some units may be implemented by a plurality of physical entities, or some units may be implemented by some components in a plurality of independent devices.

The term "exemplary" used throughout this specification means "serving as an example, instance, or illustration," and does not mean "preferred" or "advantageous" over other embodiments. The detailed description includes specific details for the purpose of providing an understanding of the described technology. However, the techniques may be practiced without these specific details. In some instances, well-known structures and devices are shown in block diagram form in order to avoid obscuring the concepts of the described embodiments.

Alternative embodiments of the present disclosure are described in detail above with reference to the drawings, however, the embodiments of the present disclosure are not limited to the specific details of the embodiments, and within the technical idea of the embodiments of the present disclosure, many simple modifications may be made to the technical solution of the embodiments of the present disclosure, and these simple modifications all belong to the protection scope of the embodiments of the present disclosure.

The previous description of the disclosure is provided to enable any person skilled in the art to make or use the disclosure. Various modifications to the disclosure will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other variations without departing from the scope of the disclosure. Thus, the description is not intended to be limited to the examples and designs described herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims (14)

1. A copyright notice method based on a block chain comprises the following steps:

acquiring copyright works to be declared;

generating a copyright notice based on the rights content for the copyrighted work declared by the righter, the copyright notice including the righter information, the rights content, and the copyrighted-work information;

acquiring signing information of the righter for the copyright statement; and

and linking the copyrighted works, the copyright notices and the signing information.

2. A method of a copyright notice as recited in claim 1, wherein the uplinking of the copyrighted work, the copyright notice, and the signing information comprises:

packaging the copyrighted work into a first chunk, the first chunk including a first hash value generated by the copyrighted work;

packaging the copyright notice and the signing information into a second block, the second block comprising a second hash value generated from the copyright notice and the signing information; and

recording the first block and the second block on a block chain.

3. A copyright notice method as defined in claim 2, wherein recording the first and second blocks on a blockchain comprises:

broadcasting the first block and the second block to a consensus node in a block chain network respectively for consensus processing; and

after the consensus node achieves consensus, the first block and the second block are recorded on a block chain respectively.

4. A copyright notice method as defined in claim 1, further comprising:

invoking an intelligent contract to record the corresponding relationship of the righter, the copyrighted work and the rights content.

5. A copyright notice method as defined in claim 4, wherein invoking an intelligent contract to record the correspondence of the righter, the copyrighted work, and the rights content comprises:

an intelligent contract is invoked to store the copyright notice.

6. A copyright notice method as defined in claim 4, wherein the intelligent contract is used to verify the query right of the rights content.

7. A copyright notice method as defined in claim 6, further comprising:

invoking the intelligent contract to verify the query authority of the work requester in response to a right query request of the work requester, wherein the right query request comprises the information of the right holder and the information of the copyright works;

when the verification is passed, inquiring the right content corresponding to the information of the right holder and the information of the copyright works on a block chain; and

and feeding back the inquired right content to the work requester.

8. A copyright notice method as defined in claim 2, further comprising:

responding to a verification request of a work to be verified by a work verification policy, and performing hash calculation on the work to be verified to obtain a third hash value corresponding to the work to be verified;

inquiring a first hash value corresponding to the copyright work for verifying the work to be verified on a block chain;

comparing the first hash value to the third hash value; and

and feeding back a verification result to the work verifying party based on the comparison result of the first hash value and the third hash value.

9. A copyright notice method as defined in claim 1, further comprising, before acquiring the copyrighted work to be declared:

and authenticating the executor of the copyright notice.

10. A copyright notice method as defined in claim 1 wherein the righter is not the originator of the copyrighted work and linking the copyrighted work, the copyright notice, and the signing message comprises:

and linking the copyrighted work, the copyright statement, the signing information and the transfer contract of the copyrighted work.

11. A block chain-based copyright notice apparatus, comprising:

the work acquisition unit is used for acquiring copyright works to be declared;

a claim generating unit that generates a copyright notice including the rightful person information, the rights content, and the copyrighted work information, based on the rights content of the rightful person notice for the copyrighted work;

a signing information acquisition unit for acquiring signing information of the righter for the copyright statement; and

and the uplink unit is used for uplink transmitting the copyrighted works, the copyright statements and the signing information.

12. An electronic device, comprising: at least one processor, a memory coupled with the at least one processor, and a computer program stored on the memory, the at least one processor executing the computer program to implement the copyright notice method of any of claims 1-10.

13. A computer-readable storage medium storing a computer program which, when executed by a processor, implements a copyright notice method as claimed in any one of claims 1 to 10.

14. A computer program product comprising a computer program which, when executed by a processor, implements a method of copyright noticing according to any of claims 1-10.

Images