Data content ownership confirmation method and device

Abstract

This application provides a method and apparatus for confirming data content ownership, including: providing algorithm proof information and content proof information; receiving target protected data content, target protection algorithm, algorithm proof information, content proof information, and comparison data content; and, if it is determined that the target protected data content and target protection algorithm have been registered, extracting first identity information from the target protected data content and second identity information from the comparison data content based on the target protection algorithm, and determining the ownership confirmation result between the target protected data content and the comparison data content. In this application, once the protection algorithm and data content are registered, they possess standardization and uniqueness. During the ownership confirmation stage, by verifying the existence of the registration process, the identity information of the target protected data content and the comparison data content can be extracted and quickly compared using a standardized protection algorithm to obtain a fair and reliable ownership confirmation result.

Description

Technical Field

[0001] This application relates to the field of computer technology, and in particular to a method and apparatus for confirming data content rights. Background Technology

[0002] In the digital information age, various multimedia files circulate widely on the Internet, and copyright infringement occurs frequently. When the rights holder of multimedia content discovers that their files have been infringed, they can apply to the relevant authorities for confirmation of rights, and the relevant authorities will effectively identify the infringement of the files.

[0003] Among related technologies, digital watermarking is one of the most effective technical solutions for determining ownership or serving as proof of infringement. Digital watermarking technology embeds a digital watermark directly into multimedia files based on watermarking algorithms, without affecting the original file's usability and without being easily detected. Through this information hidden within the file, it is possible to confirm the rights holder, purchaser, or determine whether the file has been tampered with. Therefore, relevant institutions can use this digital watermark, a kind of file identifier, to determine whether infringement has occurred, thereby achieving the purpose of establishing rights.

[0004] However, in the current scheme, the watermarking algorithm is not unique. This non-uniqueness leads to subjectivity and arbitrariness in the rights confirmation process. For example, for the same document, a standardized watermarking algorithm can extract one watermark result, while a non-standard watermarking algorithm can extract a different watermark result. This leads to the risk that relevant stakeholders may take advantage of the non-uniqueness of the watermarking algorithm to counterfeit watermarks, reducing the reliability and fairness of the rights confirmation process. Summary of the Invention

[0005] This application provides a data content ownership confirmation method to solve the problem of subjectivity and arbitrariness in the ownership confirmation process caused by the non-uniqueness of watermarking algorithms in related technologies.

[0006] Accordingly, embodiments of this application also provide a data content ownership confirmation device, an electronic device, and a storage medium to ensure the implementation and application of the above methods.

[0007] To address the aforementioned issues, this application discloses a data content ownership confirmation method, applied to a target server, the method comprising:

[0008] After the protection algorithm is registered with the target server, it provides algorithm proof information for the protection algorithm, and after the protected data content is registered with the target server, it provides content proof information for the protected data content; the protected data content contains identity information added by the protection algorithm;

[0009] Receive the target protected data content, target protection algorithm, algorithm proof information of the target protected data content, content proof information of the target protection algorithm, and comparison data content sent by the first client;

[0010] If, based on the content proof information of the target protected data content and the algorithm proof information of the target protection algorithm, it is determined that the target protected data content and the target protection algorithm have been registered on the target server, then, based on the target protection algorithm, first identity information is extracted from the target protected data content, and second identity information is extracted from the comparison data content.

[0011] Based on the first identity information and the second identity information, the ownership determination result between the target protected data content and the comparison data content is determined.

[0012] Optionally, determining that the target protection algorithm has been registered on the target server based on the target protection algorithm and its algorithm proof information includes:

[0013] The algorithm proof information of the target protection algorithm is analyzed to obtain the ninth hash value;

[0014] Based on the target protection algorithm and its algorithm proof information, determine the tenth hash value of the target protection algorithm;

[0015] If the ninth hash value and the tenth hash value are the same, it is determined that the target protection algorithm has been registered on the target server.

[0016] Optional, also includes:

[0017] Determine the content similarity between the target protected data content and the comparison data content;

[0018] If the similarity meets the first preset condition, the steps of extracting first identity information from the target protected data content and extracting second identity information from the comparison data content are performed respectively, based on the target protection algorithm, if the content proof information of the target protected data content and the algorithm proof information of the target protection algorithm are determined, and the target protection algorithm is registered on the target server.

[0019] Optionally, the protection algorithm includes a watermarking algorithm, and the protected data content includes at least one of the following: image files, video files, audio files, and document files; the target server includes at least one of the following: a third-party notary server and a blockchain server.

[0020] This application discloses a data content ownership confirmation method, applied to a target server, the method comprising:

[0021] The protected data content, the protection algorithm, and the comparison data content are obtained; wherein, the protected data content contains protection information added by the protection algorithm;

[0022] Obtain the algorithm proof information of the protection algorithm and the content proof information of the protected data content; the algorithm proof information is determined by the target server for the protection algorithm, and the content proof information is determined by the target server for the protected data content;

[0023] If the target protected data content is determined based on the content proof information and the algorithm proof information, and the target protection algorithm has been registered on the target server, then an ownership confirmation operation is performed between the protected data content and the comparison data content based on the protection algorithm.

[0024] Optionally, the step of performing the ownership confirmation operation between the protected data content and the comparison data content based on the protection algorithm includes:

[0025] Based on the protection algorithm, first identity information is extracted from the protected data content, and second identity information is extracted from the comparison data content;

[0026] Based on the first identity information and the second identity information, the ownership confirmation result between the protected data content and the comparison data content is determined.

[0027] This application discloses a data content ownership confirmation device, applied to a target server, the device comprising:

[0028] A module is provided to provide algorithm proof information for the protection algorithm after it is registered on the target server, and to provide content proof information for the protected data content after it is registered on the target server; the protected data content contains identity information added by the protection algorithm.

[0029] The receiving module is used to receive the target protected data content, the target protection algorithm, the algorithm proof information of the target protected data content, the content proof information of the target protection algorithm, and the comparison data content sent by the first client.

[0030] The analysis module is used to extract first identity information from the target protected data content and second identity information from the comparison data content based on the target protection algorithm, respectively, when it is determined that the target protected data content and the target protection algorithm have been registered on the target server, based on the content proof information of the target protected data content and the algorithm proof information of the target protection algorithm.

[0031] The first rights confirmation module is used to determine the rights confirmation result between the target protected data content and the comparison data content based on the first identity information and the second identity information.

[0032] This application discloses a data content ownership confirmation device, the device comprising:

[0033] The first acquisition module is used to acquire the protected data content, the protection algorithm, and the comparison data content; wherein, the protected data content contains protection information added by the protection algorithm;

[0034] The second acquisition module is used to acquire the algorithm proof information of the protection algorithm and the content proof information of the protected data content; the algorithm proof information is determined by the target server for the protection algorithm, and the content proof information is determined by the target server for the protected data content;

[0035] The second rights confirmation module is used to perform rights confirmation operations between the protected data content and the comparison data content based on the protection algorithm, provided that the target protected data content is determined according to the content proof information and the algorithm proof information, and the target protection algorithm has been registered on the target server.

[0036] This application also discloses an electronic device, including: a processor; and a memory storing executable code thereon, which, when executed, causes the processor to perform one or more methods as described in this application.

[0037] This application also discloses one or more machine-readable media storing executable code thereon, which, when executed, causes a processor to perform one or more methods as described in this application.

[0038] Compared with the prior art, the embodiments of this application have the following advantages:

[0039] This application provides a scheme for registering the protected data content and the protection algorithm used by the protected data content on the target server. The registration process can be based on hash encoding technology to generate corresponding algorithm proof information and content proof information, thereby realizing the notarization of the protection algorithm and the protected data content. While ensuring the openness of the notarization, the proof information of the hash structure cannot be tampered with and can avoid the leakage of customer algorithms and data content. This makes the protection algorithm and data content standardized and unique once registered. In the rights confirmation stage, by verifying the existence of the registration process, the identity information of the target protected data content and the comparison data content can be extracted and quickly compared using the standardized protection algorithm to obtain a fair and reliable rights confirmation result, reducing the probability of watermark counterfeiting. Attached Figure Description

[0040] Figure 1 This is a system architecture diagram of a data content ownership confirmation method according to an embodiment of this application;

[0041] Figure 2 This is a system architecture diagram of another data content ownership confirmation method according to an embodiment of this application;

[0042] Figure 3 This is a flowchart illustrating the steps of a data content ownership confirmation method according to an embodiment of this application;

[0043] Figure 4 This is a flowchart illustrating the steps of another data content ownership confirmation method embodiment of this application;

[0044] Figure 5 This is a flowchart illustrating the steps of another data content ownership confirmation method embodiment of this application;

[0045] Figure 6 This is a structural block diagram of a data content ownership confirmation device according to an embodiment of this application;

[0046] Figure 7 This is a structural block diagram of another data content ownership confirmation device according to an embodiment of this application;

[0047] Figure 8 This is a schematic diagram of the structure of a device provided in an embodiment of this application. Detailed Implementation

[0048] To make the above-mentioned objectives, features and advantages of this application more apparent and understandable, the application will be further described in detail below with reference to the accompanying drawings and specific embodiments.

[0049] To enable those skilled in the art to better understand this application, the concepts involved in this application are explained below:

[0050] Protection algorithms are algorithms that embed identity information directly into data content without affecting the original data content's usability or making it difficult for human perception systems to detect or notice the presence of identification information in the data content. Protection algorithms can enable data content to contain identity information that reflects its identity, and the identity information can also store some important information, such as transaction information stored in scenarios involving data content transactions.

[0051] Digital watermarking: Unlike visual watermark patterns, digital watermarks are digital signals that can be embedded in or extracted from data content using algorithms. They can be used to carry information. In one implementation, the protection algorithm may include a digital watermarking algorithm, which can add digital watermark-like identity information to data content (multimedia, documents, software, etc.). This digital watermark cannot be detected or noticed by the human perceptual system. In other implementations, the identity information can take other forms, such as steganography.

[0052] Target Server: In this embodiment, the target server may include at least one of a third-party notary service and a blockchain server. The third-party notary service can provide registration for protection algorithms and data content. After registration, it can provide proof information for both the protection algorithm and the data content for evidence preservation. Additionally, the third-party notary service can provide data content ownership confirmation services, i.e., based on the protected data content, proof information, and comparison data content submitted by the client, it determines whether the comparison data content constitutes an infringement of the protected data content. The blockchain server can provide the services supported by the aforementioned third-party notary service. Furthermore, the blockchain server can also provide blockchain transaction services, i.e., enabling the trading of data content under a blockchain architecture.

[0053] Confirmation of rights: This involves determining whether the comparison data submitted by the client infringes on the protected data submitted by the client. Specifically, this can be achieved by extracting the identity information of both the comparison data and the protected data using compliant protection algorithms. If the similarity between the two identity information exceeds a threshold, the comparison data is determined to infringe on the protected data; if the similarity between the two identity information does not exceed the threshold, the comparison data is determined not to infringe on the protected data.

[0054] Hash chain: Defined as a repeated application of a given data asset using a cryptographic hash function, it is a chain-like structure composed of multiple interconnected hash parameters. Hash chains can be applied in the field of data security to improve data security.

[0055] Blockchain: Essentially a public, transparent, and tamper-proof data storage structure. It treats each piece of data (transaction data) that needs to be verified as an independent data structure and stores it in the form of blocks. Each data block contains: timestamp, block number of the previous block, hash value of the previous block, data content of the current block, etc., thus forming a secure chain structure.

[0056] Reference Figure 1 The diagram illustrates a system architecture of a data content ownership confirmation method provided in this application, including a client and a target server.

[0057] The target server can be a third-party notary service, and the client user can be the operator of the data content (multimedia, documents, software, etc.). When there is data content that needs to be protected, the client can use a protection algorithm to add identity information to the protected data content. In one implementation, the client can use a digital watermarking algorithm to add a digital watermark to the protected data content. Afterwards, the user can register the code file of the protection algorithm on the target server through the client, as well as register the protected data content with added identity information on the target server, to ensure the standardization and impartiality of the protection algorithm, as well as the uniqueness of the protection algorithm and the protected data content after registration.

[0058] Specifically, for algorithm registration, the client can use a first hash encoding method to hash the code of the protection algorithm used in the protected data content. The resulting hash value (a hash code) is used as the algorithm hash signature of the protection algorithm, which is then used in subsequent registration steps to establish a hash chain structure, ensuring the security of the registration information. The first hash encoding method can be a user-selectable encoding method, and this embodiment does not limit its use.

[0059] For file registration, the client can use a second hash encoding method to hash the protected data content containing identity information. The resulting hash value (a hash code) is used as the content hash signature of the protected data content, which is then used in subsequent registration steps to establish a hash chain structure, ensuring the security of the registration information. The second hash encoding method can be a user-selectable encoding method, and it can be the same as or different from the first hash encoding method; this embodiment does not limit this.

[0060] In this embodiment of the application, the client can submit the algorithm hash signature to the target server to register the protection algorithm, and submit the content hash signature to the target server to register the protected data content. Since the client only uploads the hash signature after hash encoding to the target server, the protection algorithm, the first hash encoding method and the second hash encoding method used by the client will not be known to the target server, thereby reducing the risk of leakage of the client's algorithm and encoded data.

[0061] In another implementation, when the target server acts as a third-party notary service with strong data security and credibility, the client can also send the protection algorithm and the protected data content to the target server. The target server then processes the protection algorithm and the protected data content using its own hash encoding method to obtain the algorithm hash signature and the content hash signature.

[0062] Furthermore, when registering the protection algorithm and the protected data content, the target server can generate algorithm proof information corresponding to the protection algorithm based on the algorithm hash signature sent by the client, and generate content proof information corresponding to the protected data content based on the content hash signature sent by the client. The algorithm proof information and content proof information are then sent to the client. These two pieces of information serve as evidence in the registration process, jointly stored by the client and the target server to prove the existence of the registration process and improve its fairness. Additionally, the evidence storage information essentially stores a hash digest of the source information. A hash is a fixed-length bit string. Another characteristic of hashes is that the original information cannot be deduced from the hash digest without knowing the hash encoding method, thus ensuring the security of the evidence storage information. If the source information changes, the hash will be completely different from the original. Since hashes are essentially not traversable, in reality, a one-to-one correspondence between the hash and the source information can be considered. In this embodiment, the evidence storage information can be a hash code obtained by processing the hash signature using a third hash encoding method adopted by the target server.

[0063] In this embodiment of the application, in addition to being obtained by hashing the hash signature of the registered object, the evidence information can also be obtained by hashing the hash signature of the registered object and the time when the registration was triggered, thereby proving the registration time and helping to determine the effective time of the copyright of the registered object.

[0064] Furthermore, the evidence can be obtained by hashing the hash signature of the registered object, the time when registration was triggered, and the hash signatures of several previously registered objects on the target server, along with the registration time generated during the registration process. This involves collecting the hash codes corresponding to multiple registration nodes on the registration timeline (each registration node represents the registration process of one registered object) and establishing associations between these hash codes, forming a hash chain structure. Because the registration process nodes are interdependent in this hash chain structure, and each node records the registration information of other related nodes, the registration information has multiple backups, making it difficult to tamper with the registration information of a single node and improving data security. Additionally, the hash chain also contains the registration time of the current registered object and the registration time of the previous registered object. These two registration times reflect the absence of other registered objects during the time period between these two registration times, meaning that external parties cannot insert the registration information of other registered objects during this period, ensuring the fairness and credibility of the registration process.

[0065] Reference Figure 1 Regarding the subsequent rights confirmation process, if a client user collects comparative data that may infringe upon their registered protected data content in their daily life, the client can upload their registered protected data content, registered protection algorithm, algorithm proof information, content proof information, and comparative data content to the target server. The target server verifies the algorithm proof information and content proof information to confirm that the protected data content and protection algorithm have indeed been registered on the target server. It also compares the content similarity between the protected data content and the comparative data content. If a high degree of similarity is found, the target protection algorithm can be used to extract the individual identity information (digital watermark information) of both the protected data content and the comparative data content. By comparing the similarity between the two identity information, a rights confirmation result is obtained. If the similarity between the two identity information exceeds a threshold, the comparative data content is determined to constitute infringement; if the similarity does not exceed the threshold, the comparative data content is determined not to constitute infringement.

[0066] For example, in a scenario involving the trading of a copyrighted image, suppose the copyright holder owns the copyright to image X and trades image X to buyer B for use based on agreed-upon conditions. These conditions include: image X is for buyer B's use only. Upon the transaction, the copyright holder can use their own digital watermarking algorithm to add a digital watermark to image X. The digital watermark contains information indicating that it is for buyer B's use only. The watermarked image X is then traded to buyer B. Simultaneously, the digital watermarking algorithm and the watermarked image X can be registered with a third-party notary service to obtain corresponding algorithm and image notarization.

[0067] However, after the transaction, the copyright holder subsequently saw an image X' similar to image X on the website of a certain merchant platform C. After collecting image X', the copyright holder uploaded their digitally watermarked image X, image X', digital watermarking algorithm, algorithm evidence, and image evidence to a third-party notary service. The third-party notary service verified the algorithm evidence and image evidence, confirming that image X and the digital watermarking algorithm were indeed registered on the service. It also compared the content similarity between image X and image X', finding them highly similar. The digital watermarking algorithm was then used to extract the digital watermarks from both images. By comparing the similarity between the two watermarks, it was found that the similarity exceeded a threshold, confirming that merchant platform C was illegally using the copyright holder's image X. Therefore, the third-party notary service concluded that image X' infringes on image X. Based on this conclusion, the copyright holder can then seek redress from merchant platform C and the buyer B.

[0068] The data content ownership confirmation method provided in this application embodiment can also be applied to blockchain transaction scenarios, where the target server acts as the blockchain server, referring to... Figure 2 This document illustrates a blockchain-based system architecture diagram for a data content ownership confirmation method provided in this application, including a blockchain server Y and multiple client-side servers. The blockchain server Y can provide transaction information records for the data content, and it can also provide... Figure 1The target server can provide algorithm and data content registration functions, and various platform servers connected to the blockchain can conduct data content transactions. Assuming that platform server 1 is the provider of the protected data content, when platform server 1 conducts a transaction of protected data content with client 2, platform server 1 can use the protection algorithm to add identity information (digital watermark) to the protected data content. The identity information includes the identity hash identifier of platform server 1. This information can be stored as transaction information in the blockchain in the blocks corresponding to all platform servers. Afterwards, platform server 1 can register the protection algorithm and the protected data content on blockchain server Y. The algorithm proof information and content proof information generated by the registration can be used as proof information 1 and stored in block 1 of the blockchain corresponding to platform server 1. When client 2 transacts with protected data content provided by platform server 1, it can invoke the protection algorithm of platform server 1 to update the identity information in the protected data content. Specifically, it adds client 2's identity hash to the existing identity information, which already includes platform server 1's identity hash, thus forming a chain structure. The updated identity information is then stored in the blockchain's transaction information within the blocks corresponding to all platform servers. Client 3 follows the same logic. If clients 2 and 3 are data content providers transacting with each other, they can also register their respective protection algorithms and protected data content on blockchain server Y. After registration, proof information will be stored in the blockchain's blocks corresponding to clients 2 and 3 respectively.

[0069] Suppose that client 3 illegally leaks the protected data content provided by platform server 1 to other clients. Then, platform server 1 can use the data content collected from other clients as comparison data content, and upload it to blockchain server Y along with its own protected data content, protection algorithm, algorithm evidence, and image evidence for rights confirmation. The rights confirmation process is described above and will not be repeated here.

[0070] In this embodiment of the application, the proof information from block to storage is obtained not only by hashing the hash signature of the registered object, but also by hashing the time of registration triggering, the hash signatures of several registered objects registered before or after the previous registration, and the registration time generated during the registration process, thereby forming a hash chain; the transaction information is obtained not only by hashing the identity hash identifier at the time of the transaction, but also by hashing the time of the transaction, the identity hash identifiers of several transactions registered before or after the previous transaction, and the time of the transaction, thereby forming a hash chain, thereby improving data security.

[0071] This application provides a scheme for registering the protected data content and the protection algorithm used by the protected data content on the target server. The registration process can be based on hash encoding technology to generate corresponding algorithm proof information and content proof information, thereby realizing the notarization of the protection algorithm and the protected data content. While ensuring the openness of the notarization, the proof information of the hash structure cannot be tampered with and can avoid the leakage of customer algorithms and data content. This makes the protection algorithm and data content standardized and unique once registered. In the rights confirmation stage, by verifying the existence of the registration process, the identity information of the target protected data content and the comparison data content can be extracted and quickly compared using the standardized protection algorithm to obtain a fair and reliable rights confirmation result, reducing the probability of watermark counterfeiting.

[0072] Reference Figure 3 It illustrates a flowchart of the steps of a data content ownership confirmation method provided in an embodiment of this application, including:

[0073] Step 101: After the protection algorithm registers with the target server, it provides algorithm proof information for the protection algorithm, and after the protected data content registers with the target server, it provides content proof information for the protected data content; the protected data content contains identity information added by the protection algorithm.

[0074] In this embodiment, the user of the first client can be the operator of data content (multimedia, documents, software, etc.). When there is data content that needs to be protected, the user can use a protection algorithm to add identity information to the protected data content. In one implementation, the client can use a digital watermarking algorithm to add a digital watermark to the protected data content. Afterwards, the user can register the code file of the protection algorithm on the target server through the first client, and register the protected data content with added identity information on the target server, and obtain algorithm proof information and content proof information provided by the target server to ensure the standardization and fairness of the protection algorithm, as well as the uniqueness of the protection algorithm and the protected data content after registration.

[0075] Step 102: Receive the target protected data content, the target protection algorithm, the algorithm proof information of the target protected data content, the content proof information of the target protection algorithm, and the comparison data content sent by the first client.

[0076] Regarding the subsequent rights confirmation process, if a user of the first client collects comparative data that is suspected of infringing on their registered protected data content in their daily life, the client can upload their registered protected data content, the registered protected algorithm, algorithm proof information, content proof information, and comparative data content to the target server for the target server to verify the existence of the registration process.

[0077] Step 103: If, based on the content proof information of the target protected data content and the algorithm proof information of the target protection algorithm, it is determined that the target protected data content and the target protection algorithm have been registered on the target server, then, based on the target protection algorithm, first identity information is extracted from the target protected data content, and second identity information is extracted from the comparison data content.

[0078] In this embodiment, after verifying the algorithm proof information and content proof information, the target server confirms that the target protected data content and the target protection algorithm have indeed been registered on the target server. It can then compare the content similarity between the target protected data content and the comparison data content. If a high similarity is found, the target protection algorithm can extract the identity information (digital watermark information) of both the target protected data content and the comparison data content. By comparing the similarity between the two identity information, the ownership confirmation result is obtained. Alternatively, to simplify the ownership confirmation process, the step of comparing the content similarity between the target protected data content and the comparison data content can be omitted, and the identity information can be extracted directly.

[0079] Step 104: Based on the first identity information and the second identity information, determine the ownership confirmation result between the target protected data content and the comparison data content.

[0080] In this application embodiment, if the similarity between the identity information of the target protected data content and the comparison data content exceeds a threshold, the comparison data content is determined to constitute infringement; if the similarity between the identity information of the two does not exceed the threshold, the comparison data content is determined not to constitute infringement.

[0081] For example, if a copyright holder sees an image X' that is similar to image X on a merchant platform C's website, the copyright holder collects image X' and uploads their digitally watermarked image X, image X', digital watermarking algorithm, algorithm evidence, and image evidence to a third-party notary service. The third-party notary service verifies the algorithm and image evidence to confirm that image X and the digital watermarking algorithm have indeed been registered on the service. It also compares the content similarity between image X and image X'. If the similarity is found to be high, the digital watermarking algorithm can be used to extract the digital watermarks from both images. By comparing the similarity between the two watermarks, if the similarity exceeds a threshold, it can be determined that merchant platform C is illegally using the copyright holder's image X. The third-party notary service can then conclude that image X' infringes on image X. Based on this conclusion, the copyright holder can then pursue legal action against merchant platform C.

[0082] In summary, this application provides a scheme for registering the protected data content and the protection algorithm used by the protected data content on the target server. The registration process can be based on hash encoding technology to generate corresponding algorithm proof information and content proof information, thereby realizing the notarization of the protection algorithm and the protected data content. While ensuring the openness of the notarization, the proof information of the hash structure cannot be tampered with and can avoid the leakage of the client's algorithm and data content. This makes the protection algorithm and data content standardized and unique once registered. In the rights confirmation stage, by verifying the existence of the registration process, the identity information of the target protected data content and the comparison data content can be extracted and quickly compared using the standardized protection algorithm to obtain a fair and reliable rights confirmation result, reducing the probability of watermark counterfeiting.

[0083] Reference Figure 4 The diagram illustrates a flowchart of another embodiment of the data content ownership confirmation method of this application. It includes:

[0084] Step 201: Receive an algorithm registration request sent by the second client; the algorithm registration request includes a first hash value for the protection algorithm.

[0085] Optionally, the protection algorithm includes a watermarking algorithm, and the protected data content includes at least one of the following: image files, video files, audio files, and document files (such as Word, Excel spreadsheets, PDF files, etc.); the target server includes at least one of the following: a third-party notary service and a blockchain service.

[0086] In this embodiment, the digital watermarking algorithm can add identity information in the form of a digital watermark to data content (multimedia, documents, software, etc.). This digital watermark cannot be detected or noticed by the human perceptual system. Furthermore, the watermarking algorithm can also detect or extract the digital watermark from the data content to which it has been added.

[0087] Furthermore, the protected data content includes, but is not limited to, image files, video files, audio files, and document files. Third-party notary services can provide registration for protection algorithms and data content, and after registration, can provide proof information for each algorithm and data content for evidence preservation. In addition, third-party notary services can also provide data content ownership confirmation services, that is, based on the protected data content, proof information, and comparison data content submitted by the client, to determine whether the comparison data content constitutes an infringement of the protected data content. Blockchain servers can provide the services supported by the aforementioned third-party notary services. Furthermore, blockchain servers can also provide blockchain transaction services, that is, to realize the trading of data content under the blockchain architecture.

[0088] In this step, the first client and the second client can be the same client or different clients. When the first client and the second client are different clients, the user of the first client can send the algorithm, data content, and evidence to the second client, such as via email, instant messaging tools, or USB flash drive copying.

[0089] In response to an algorithm registration request, which includes a first hash value of the protection algorithm, in one implementation, the client can use a first hash encoding method to perform hash encoding on the code of the protection algorithm used in the protected data content, and use the resulting hash value (a hash encoding segment) as the first hash value of the protection algorithm. The first hash encoding method can be an encoding method selected by the client user, and this application embodiment does not limit it.

[0090] Specifically, the first hash value can be obtained from Formula 1.

[0091] Formula 1: SigAn = Han(CodeAn), where Han can be the first hash encoding method, CodeAn can be the code of the protection algorithm, and SigAn can be the first hash value.

[0092] In another implementation, when the target server has strong data security and credibility, the first or second client can also send the protection algorithm to the target server, which will then process the protection algorithm using its own hash encoding method to obtain the first hash value.

[0093] Step 202: In response to the algorithm registration request, generate algorithm proof information for the protection algorithm based on the first hash value.

[0094] In this embodiment, when registering a protection algorithm, the target server can generate algorithm proof information corresponding to the protection algorithm based on the first hash value sent by the first or second client, and send the algorithm proof information to the client. This algorithm proof information can serve as evidence in the algorithm registration process, jointly stored by the client and the target server to prove the existence of the algorithm registration process and improve its fairness. Furthermore, the evidence storage information essentially stores a hash digest of the source information. A hash is a fixed-length bit string. Another characteristic of hashes is that without knowing the hash encoding method, it is impossible to deduce the original information from the hash digest, thus ensuring the security of the evidence storage information. If the source information changes, the hash will be completely different from the original. Since hashes are essentially not traversable, in reality, a one-to-one correspondence between the hash and the source information can be considered. In this embodiment, the evidence storage information can be a hash code obtained after processing the hash signature using the third hash encoding method adopted by the target server.

[0095] Optionally, in one implementation, step 202 may specifically include:

[0096] Sub-step 2021: Determine a third hash value for the algorithm registration request based on the first hash value of the protection algorithm, the first response time of the algorithm registration request, and the second hash value of at least one algorithm registration request that has been responded to before the first response time.

[0097] Sub-step 2022: Generate algorithm proof information for the algorithm registration request based on the third hash value, the first response time, and the second hash value of at least one algorithm registration request before the first response time.

[0098] In this embodiment of the application, the third hash value can be obtained by formula 2.

[0099] Formula 2: EAn=Han'(SigAn, TAn, EA n-1 In this context, Han' can be the third hash encoding method used by the target server, TAn can be the first response time of the algorithm registration request, EAn can be the third hash value (i.e., the registration event corresponding to the current algorithm registration request), and EA... n-1 A second hash value (i.e., the registration event corresponding to the previous algorithm registration request) can be used for at least one algorithm registration request that has been responded to before the first response time. In the blockchain architecture, the registration event EAn is recorded in the node block corresponding to the first client in the blockchain.

[0100] The algorithm proof information can be obtained from Formula 3.

[0101] Formula 3: RAn=(EAn, TAn, EA n-1 Ran can provide proof information for the algorithm.

[0102] In this embodiment, the algorithm evidence information can also be obtained by hashing the first hash value of the protection algorithm, the first response time when the algorithm registration is triggered, and the first hash values ​​and registration times of several protection algorithms registered by the target server previously or earlier. This is achieved by collecting the hash codes corresponding to multiple algorithm registration nodes on the registration timeline (each algorithm registration node represents the registration process of one protection algorithm), and establishing associations between these hash codes to form a hash chain structure. Because the registration process nodes are interdependent in the hash chain structure, and each algorithm registration node records the registration information of other related algorithm registration nodes, the registration information has multiple backups, making it difficult to tamper with the registration information of a particular algorithm registration node, thus improving the security of the algorithm data. Furthermore, the hash chain also contains the registration time of the current protection algorithm and the registration time of the previous protection algorithm. These two registration times reflect that no other protection algorithms exist during the time period between these two registration times, meaning that external parties cannot insert the registration information of other protection algorithms during the time period between these two registration times, ensuring the fairness and credibility of the algorithm registration process.

[0103] Step 203: Receive a content registration request sent by the second client; the content registration request includes: the protected data content, a fourth hash value for the protected data content, and algorithm proof information.

[0104] In response to a content registration request that includes a fourth hash value of protected data content, in one implementation, the client can use a second hash encoding method to perform hash encoding on the protected data content, and use the resulting hash value (a hash encoding segment) as the fourth hash value of the protected data content. The second hash encoding method can be an encoding method selected by the client user. The second hash encoding method can be the same as or different from the first hash encoding method. This application embodiment does not limit this.

[0105] Specifically, the fourth hash value can be obtained from formula 4.

[0106] Formula 4: SigFm = HFm(EAn, Fm), where SigFm can be the fourth hash value, HFm can be the second hash encoding method, Fm can be the protected data content, and EAN can be the third hash value in sub-step 2022 above, that is, the registration event corresponding to the protection algorithm used by the protected data content during registration, which can be obtained from the algorithm proof information in the parsed content registration request. Since the target server uses its own third hash encoding method to generate the algorithm proof information, the third hash value in sub-step 2022 above can also be obtained from the algorithm proof information when the target server knows the third hash encoding method.

[0107] In another implementation, when the target server has strong data security and credibility, the first or second client can also send the protection algorithm to the target server, which will then process the protection algorithm using its own hash encoding method to obtain the first hash value.

[0108] Step 204: In response to the content registration request, generate content proof information for the protected data content based on the fourth hash value and the protected data content.

[0109] In this embodiment, when registering protected data content, the target server can generate content proof information corresponding to the protected data content based on the fourth hash value sent by the first or second client and the protected data content, and send the content proof information to the client. The content proof information can be used as evidence information in the content registration process and is jointly kept by the client and the target server to prove the existence of the content registration process and improve the fairness of the content registration process. In this embodiment, the content evidence information can be a hash code obtained by processing the hash signature through the third hash encoding method adopted by the target server.

[0110] Optionally, in one implementation, step 204 may specifically include:

[0111] Sub-step 2041: Determine a sixth hash value for the content registration request based on the fourth hash value of the protected data content, the feature information of the protected data content, the second response time of the content registration request, and the fifth hash value of at least one content registration request that has been responded to before the second response time.

[0112] Sub-step 2042: Generate content proof information for the content registration request based on the sixth hash value, the second response time, and the fifth hash value of at least one content registration request that has been responded to before the second response time.

[0113] In this embodiment of the application, the sixth hash value can be obtained by formula 5.

[0114] Formula 5: EFm=HFm'(SigFm, f(Fm), TFm, EF m-1 ), where HFm' can be the third hash encoding method used by the target server, TFm can be the second response time of the content registration request, EFm can be the fourth hash value (i.e., the registration event corresponding to the current content registration request), and EF m-1 It can be the fifth hash value of at least one content registration request that has been responded to before the first response time (i.e., the registration event corresponding to the previous content registration request), and f(Fm) can be the feature information of the protected data content. In the blockchain architecture, the registration event EFm is recorded in the node block corresponding to the first client in the blockchain.

[0115] The content proof information can be obtained from Formula 6.

[0116] Formula 6: RFm = (EFm, TFm, EF m-1 RFm can be content proof information.

[0117] In this embodiment of the application, the content evidence information can also be obtained by hashing the fourth hash value of the protected data content, the second response time when the content registration is triggered, and the fourth hash value and registration time of several protected data contents registered by the target server before or after the previous registration. The effect can be referred to the relevant description of the above sub-step 2022, which will not be repeated here.

[0118] Step 205: Receive the target protected data content, target protection algorithm, algorithm proof information of the target protected data content, content proof information of the target protection algorithm, and comparison data content sent by the first client;

[0119] This step can be referred to as step 102 above, and will not be repeated here.

[0120] Step 206: Based on the target protected data content, the content proof information of the target protected data content, and the algorithm proof information of the target protection algorithm, determine that the target protected data content has been registered on the target server.

[0121] In this embodiment of the application, when confirming rights, it is necessary to first determine whether the target protected data content and the target protection algorithm have been registered on the target server. When determining whether the target protected data content has been registered, since the target server uses its own third hash encoding method to generate the algorithm proof information of the target protection algorithm used by the target protected data content, as well as the content proof information of the target protected data content, the target server also knows the third hash encoding method. It is also possible to determine whether the target protected data content has been registered by reverse parsing the target protected data content, the content proof information of the target protected data content, and the algorithm proof information of the target protection algorithm, and by comparing whether the hash result obtained by parsing is the same as the hash result when registering the target protected data content. For example, if the hash result obtained by parsing is the same as the hash result when registering the target protected data content, then it is determined that the target protected data content has been registered.

[0122] Optionally, in one implementation, step 206 may specifically include:

[0123] Sub-step 2061: Parse the content proof information of the target protected data content to obtain the seventh hash value.

[0124] Sub-step 2062: Determine the eighth hash value of the target protected data content based on the target protected data content, the content proof information of the target protected data content, and the algorithm proof information of the target protection algorithm.

[0125] Sub-step 2063: If the seventh hash value and the eighth hash value are the same, determine that the target protected data content has been registered on the target server.

[0126] In this embodiment of the application, based on the above formulas 5 and 6, the seventh hash value (equivalent to the fourth hash value Efm in formula 5, i.e. the registration event corresponding to the registration of the target protected data content) can be obtained by reverse parsing from the content proof information RFm and the third hash encoding method HFm adopted by the target server.

[0127] Furthermore, based on Formula 3 above, the algorithmic proof information Ran can be reverse-parsed to obtain the third hash value EAn (i.e., the registration event when the target protection algorithm used by the target protected data content is registered). Finally, according to Formula 4 above, based on the target protected data content Fm, the third hash value EAn, and the third hash encoding method HFm used by the target server, the eighth hash value of the target protected data content (equivalent to the fourth hash value SigFm' of the target protected data content, i.e., the content hash signature) can be reverse-parsed to obtain the eighth hash value of the target protected data content.

[0128] When the eighth hash value SigFm' = the seventh hash value Efm, it proves the existence of the registration process of the target protected data content, and at the same time proves the binding relationship between the target protected data content and the target protection algorithm adopted.

[0129] Step 207: Based on the target protection algorithm and its algorithm proof information, determine that the target protection algorithm has been registered on the target server.

[0130] In this embodiment of the application, when determining whether a target protection algorithm has been registered, since the target server uses its own third hash encoding method to generate the algorithm proof information of the target protection algorithm, if the target server knows the third hash encoding method, it can also determine whether the target protection algorithm has been registered by reverse parsing the target protection algorithm and the algorithm proof information of the target protection algorithm and comparing whether the hash result obtained by parsing is the same as the hash result when registering the target protection algorithm. For example, if the hash result obtained by parsing is the same as the hash result when registering the target protection algorithm, it is determined that the target protection algorithm has been registered, thereby proving the effectiveness of the target protection algorithm.

[0131] Optionally, in one implementation, step 207 may specifically include:

[0132] Sub-step 2071: Parse the algorithm proof information of the target protection algorithm to obtain the ninth hash value.

[0133] Sub-step 2072: Determine the tenth hash value of the target protection algorithm based on the target protection algorithm and the algorithm proof information of the target protection algorithm.

[0134] Sub-step 2073: If the ninth hash value and the tenth hash value are the same, determine that the target protection algorithm has been registered on the target server.

[0135] In this embodiment of the application, based on the above formulas 3 and 2, the ninth hash value (equivalent to the third hash value EAn in formula 2, i.e. the registration event corresponding to the registration of the target protection algorithm) can be obtained by reverse parsing from the algorithm proof information RAn and the third hash encoding method HAn adopted by the target server.

[0136] Furthermore, based on Formula 1 above, the tenth hash value of the target protection algorithm (equivalent to the first hash value SigAn' of the protected data content, i.e., the content hash signature) can be obtained by reverse parsing using the target protection algorithm CodeAn' and the third hash encoding method HAn adopted by the target server.

[0137] When the tenth hash value SigAn' equals the ninth hash value EAn, the existence of the target protection algorithm's registration process is proven, thus demonstrating the effectiveness of the target protection algorithm.

[0138] Step 208: Based on the target protection algorithm, extract the first identity information from the target protected data content and extract the second identity information from the comparison data content.

[0139] This step can be referred to as step 103 above, and will not be repeated here.

[0140] Step 209: Based on the first identity information and the second identity information, determine the ownership confirmation result between the target protected data content and the comparison data content.

[0141] This step can be referred to as step 104 above, and will not be repeated here.

[0142] Optionally, the method may further include:

[0143] Step 210: Determine the content similarity between the target protected data content and the comparison data content.

[0144] Step 211: If the similarity meets the first preset condition, proceed to step 206.

[0145] In this application embodiment, the first preset condition may include the content similarity between the target protected data content and the comparison data content being greater than or equal to a preset similarity threshold (such as 90%). That is, if the target protected data content and the comparison data content are very similar, it is determined that infringement may exist, and subsequent comparison of identity information (digital watermark) is used to determine whether infringement has occurred. If the target protected data content and the comparison data content are significantly different, the probability of infringement is relatively small.

[0146] Specifically, if the content similarity between the target protected data content and the comparison data content meets the first preset condition, subsequent steps can be performed to determine whether the registration process of the target protected data content and the target protection algorithm exists. It should be noted that after proving the existence of the registration process of the target protected data content, but before proving the existence of the registration process of the target protection algorithm, steps 210-211 can be executed, and if the similarity meets the first preset condition, the operation to prove the existence of the registration process of the target protection algorithm can be performed. This application embodiment does not limit the specific execution sequence of steps 210-211.

[0147] In summary, this application provides a scheme for registering the protected data content and the protection algorithm used by the protected data content on the target server. The registration process can be based on hash encoding technology to generate corresponding algorithm proof information and content proof information, thereby realizing the notarization of the protection algorithm and the protected data content. While ensuring the openness of the notarization, the proof information of the hash structure cannot be tampered with and can avoid the leakage of the client's algorithm and data content. This makes the protection algorithm and data content standardized and unique once registered. In the rights confirmation stage, by verifying the existence of the registration process, the identity information of the target protected data content and the comparison data content can be extracted and quickly compared using the standardized protection algorithm to obtain a fair and reliable rights confirmation result, reducing the probability of watermark counterfeiting.

[0148] Reference Figure 5 It illustrates a flowchart of another data content ownership confirmation method provided in this application embodiment, including:

[0149] Step 301: Obtain the protected data content, the protection algorithm, and the comparison data content; wherein, the protected data content contains protection information added by the protection algorithm.

[0150] Step 302: Obtain the algorithm proof information of the protection algorithm and the content proof information of the protected data content; the algorithm proof information is determined by the target server for the protection algorithm, and the content proof information is determined by the target server for the protected data content.

[0151] Step 303: If the target protected data content and the target protection algorithm have been registered on the target server based on the content proof information and the algorithm proof information, then the rights confirmation operation between the protected data content and the comparison data content is performed based on the protection algorithm.

[0152] Optionally, step 303 may specifically include:

[0153] Sub-step 3031: Based on the protection algorithm, extract the first identity information from the protected data content and extract the second identity information from the comparison data content.

[0154] Sub-step 3032: Determine the ownership confirmation result between the protected data content and the comparison data content based on the first identity information and the second identity information.

[0155] For a detailed description of steps 301 to 303, please refer to the above. Figure 3 and Figure 4 The relevant descriptions of the corresponding embodiments will not be repeated here.

[0156] In summary, this application provides a scheme for registering the protected data content and the protection algorithm used by the protected data content on the target server. The registration process can be based on hash encoding technology to generate corresponding algorithm proof information and content proof information, thereby realizing the notarization of the protection algorithm and the protected data content. While ensuring the openness of the notarization, the proof information of the hash structure cannot be tampered with and can avoid the leakage of the client's algorithm and data content. This makes the protection algorithm and data content standardized and unique once registered. In the rights confirmation stage, by verifying the existence of the registration process, the identity information of the target protected data content and the comparison data content can be extracted and quickly compared using the standardized protection algorithm to obtain a fair and reliable rights confirmation result, reducing the probability of watermark counterfeiting.

[0157] Reference Figure 6 This diagram illustrates a structural block diagram of a data content rights confirmation device according to an embodiment of this application. Applied to a target server, the data content rights confirmation device 400 may specifically include the following modules:

[0158] Module 401 is provided to provide algorithm proof information for the protection algorithm after the protection algorithm is registered on the target server, and to provide content proof information for the protected data content after the protected data content is registered on the target server; the protected data content contains identity information added by the protection algorithm;

[0159] The receiving module 402 is used to receive the target protected data content, the target protection algorithm, the algorithm proof information of the target protected data content, the content proof information of the target protection algorithm, and the comparison data content sent by the first client.

[0160] Analysis module 403 is used to extract first identity information from the target protected data content and second identity information from the comparison data content based on the target protection algorithm, respectively, when it is determined that the target protected data content and the target protection algorithm have been registered on the target server, based on the content proof information of the target protected data content and the algorithm proof information of the target protection algorithm.

[0161] The first rights confirmation module 404 is used to determine the rights confirmation result between the target protected data content and the comparison data content based on the first identity information and the second identity information.

[0162] Optionally, the providing module 401 includes:

[0163] The first receiving submodule is used to receive an algorithm registration request sent by the second client; the algorithm registration request includes a first hash value for the protection algorithm;

[0164] The first generation submodule is used to generate algorithm proof information for the protection algorithm based on the first hash value in response to the algorithm registration request.

[0165] Optionally, the first generation submodule includes:

[0166] The first generation unit is configured to determine a third hash value for the algorithm registration request based on the first hash value of the protection algorithm, the first response time of the algorithm registration request, and the second hash value of at least one algorithm registration request that has been responded to before the first response time.

[0167] The second generation unit is used to generate algorithm proof information for the algorithm registration request based on the third hash value, the first response time, and the second hash value of at least one algorithm registration request before the first response time.

[0168] Optionally, the providing module 401 includes:

[0169] The second receiving submodule is used to receive a content registration request sent by the second client; the content registration request includes: the protected data content, a fourth hash value for the protected data content, and algorithm proof information;

[0170] The second generation submodule is used to respond to the content registration request and generate content proof information for the protected data content based on the fourth hash value and the protected data content.

[0171] Optionally, the second generation submodule includes:

[0172] The third generation unit is configured to determine a sixth hash value for the content registration request based on the fourth hash value of the protected data content, the feature information of the protected data content, the second response time of the content registration request, and the fifth hash value of at least one content registration request that has been responded to before the second response time.

[0173] The fourth generation unit is used to generate content proof information for the content registration request based on the sixth hash value, the second response time, and the fifth hash value of at least one content registration request that has been responded to before the second response time.

[0174] Optionally, the analysis module 403 includes:

[0175] The first determining submodule is used to determine, based on the target protected data content, the content proof information of the target protected data content, and the algorithm proof information of the target protection algorithm, that the target protected data content has been registered on the target server.

[0176] The second determining submodule is used to determine, based on the target protection algorithm and the algorithm proof information of the target protection algorithm, that the target protection algorithm has been registered on the target server.

[0177] Optionally, the first determined submodule includes:

[0178] The first parsing unit is used to parse the content proof information of the protected data content of the target to obtain the seventh hash value;

[0179] The second parsing unit is used to determine the eighth hash value of the target protected data content based on the target protected data content, the content proof information of the target protected data content, and the algorithm proof information of the target protection algorithm.

[0180] The third parsing unit is used to determine, if the seventh hash value and the eighth hash value are the same, that the target protected data content has been registered on the target server.

[0181] Optionally, the second determining submodule includes:

[0182] The fourth parsing unit is used to parse the algorithm proof information of the target protection algorithm to obtain the ninth hash value;

[0183] The fifth parsing unit is used to determine the tenth hash value of the target protection algorithm based on the target protection algorithm and the algorithm proof information of the target protection algorithm;

[0184] The sixth parsing unit is used to determine, if the ninth hash value and the tenth hash value are the same, that the target protection algorithm has been registered on the target server.

[0185] Optionally, the device further includes:

[0186] A similarity determination module is used to determine the content similarity between the target protected data content and the comparison data content;

[0187] The jump module is used to perform the following steps when the similarity meets the first preset condition: if the content proof information of the target protected data content and the algorithm proof information of the target protection algorithm are used to determine that the target protected data content and the target protection algorithm have been registered on the target server, respectively, extracting first identity information from the target protected data content and extracting second identity information from the comparison data content based on the target protection algorithm.

[0188] Optionally, the protection algorithm includes a watermarking algorithm, and the protected data content includes at least one of the following: image files, video files, audio files, and document files; the target server includes at least one of the following: a third-party notary server and a blockchain server.

[0189] In summary, this application provides a scheme for registering the protected data content and the protection algorithm used by the protected data content on the target server. The registration process can be based on hash encoding technology to generate corresponding algorithm proof information and content proof information, thereby realizing the notarization of the protection algorithm and the protected data content. While ensuring the openness of the notarization, the proof information of the hash structure cannot be tampered with and can avoid the leakage of the client's algorithm and data content. This makes the protection algorithm and data content standardized and unique once registered. In the rights confirmation stage, by verifying the existence of the registration process, the identity information of the target protected data content and the comparison data content can be extracted and quickly compared using the standardized protection algorithm to obtain a fair and reliable rights confirmation result, reducing the probability of watermark counterfeiting.

[0190] Reference Figure 7 The diagram illustrates a structural block diagram of a data content rights confirmation device according to an embodiment of this application. The data content rights confirmation device 500 may specifically include the following modules:

[0191] The first acquisition module 501 is used to acquire the protected data content, the protection algorithm, and the comparison data content; wherein, the protected data content contains protection information added by the protection algorithm;

[0192] The second acquisition module 502 is used to acquire the algorithm proof information of the protection algorithm and the content proof information of the protected data content; the algorithm proof information is determined by the target server for the protection algorithm, and the content proof information is determined by the target server for the protected data content;

[0193] The second rights confirmation module 503 is used to perform rights confirmation operations between the protected data content and the comparison data content based on the protection algorithm, when the target protected data content is determined according to the content proof information and the algorithm proof information, and the target protection algorithm has been registered on the target server.

[0194] Optionally, the second rights confirmation module 503 includes:

[0195] An extraction submodule is used to extract first identity information from the protected data content and second identity information from the comparison data content based on the protection algorithm, respectively.

[0196] The determination submodule is used to determine the ownership confirmation result between the protected data content and the comparison data content based on the first identity information and the second identity information.

[0197] In summary, this application provides a scheme for registering the protected data content and the protection algorithm used by the protected data content on the target server. The registration process can be based on hash encoding technology to generate corresponding algorithm proof information and content proof information, thereby realizing the notarization of the protection algorithm and the protected data content. While ensuring the openness of the notarization, the proof information of the hash structure cannot be tampered with and can avoid the leakage of the client's algorithm and data content. This makes the protection algorithm and data content standardized and unique once registered. In the rights confirmation stage, by verifying the existence of the registration process, the identity information of the target protected data content and the comparison data content can be extracted and quickly compared using the standardized protection algorithm to obtain a fair and reliable rights confirmation result, reducing the probability of watermark counterfeiting.

[0198] This application also provides a non-volatile readable storage medium storing one or more modules (programs). When these modules are applied to a device, they enable the device to execute the instructions for the method steps in this application.

[0199] This application provides one or more machine-readable media storing instructions that, when executed by one or more processors, cause an electronic device to perform one or more of the methods described in the above embodiments. In this application, the electronic device includes various types of devices such as terminal devices and server (cluster) devices.

[0200] The embodiments of this disclosure can be implemented as an apparatus configured as desired using any suitable hardware, firmware, software, or any combination thereof, including terminal devices, server (cluster) and other electronic devices. Figure 8An exemplary apparatus 700 is schematically shown that can be used to implement the various embodiments described in the embodiments of this application.

[0201] In one embodiment, Figure 8 An exemplary device 700 is shown, which includes one or more processors 702, a control module (chipset) 704 coupled to at least one of the processors 702, a memory 706 coupled to the control module 704, a non-volatile memory (NVM) / storage device 708 coupled to the control module 704, one or more input / output devices 710 coupled to the control module 704, and a network interface 712 coupled to the control module 704.

[0202] Processor 702 may include one or more single-core or multi-core processors, and processor 702 may include any combination of general-purpose processors or special-purpose processors (e.g., graphics processors, application processors, baseband processors, etc.). In some embodiments, device 700 can serve as a terminal device, server (cluster), or other device as described in the embodiments of this application.

[0203] In some embodiments, the apparatus 700 may include one or more computer-readable media (e.g., memory 706 or NVM / storage device 708) having instructions 714 and one or more processors 702 that are combined with the one or more computer-readable media and configured to execute the instructions 714 to implement the module and thus perform the actions described in this disclosure.

[0204] In one embodiment, the control module 704 may include any suitable interface controller to provide any suitable interface to at least one of the processors 702 and / or any suitable device or component communicating with the control module 704.

[0205] The control module 704 may include a memory controller module to provide an interface to the memory 706. The memory controller module may be a hardware module, a software module, and / or a firmware module.

[0206] Memory 706 may be used, for example, to load and store data and / or instructions 714 for device 700. In one embodiment, memory 706 may include any suitable volatile memory, such as suitable DRAM. In some embodiments, memory 706 may include double data rate type 4 synchronous dynamic random access memory (DDR4 SDRAM).

[0207] In one embodiment, the control module 704 may include one or more input / output controllers to provide an interface to the NVM / storage device 708 and (one or more) input / output devices 710.

[0208] For example, NVM / storage device 708 may be used to store data and / or instructions 714. NVM / storage device 708 may include any suitable non-volatile memory (e.g., flash memory) and / or may include any suitable (one or more) non-volatile storage devices (e.g., one or more hard disk drives (HDDs), one or more optical disc drives (CDs), and / or one or more digital universal optical disc (DVD) drives).

[0209] NVM / storage device 708 may include storage resources that are physically part of a device on which device 700 is mounted, or that can be accessed by the device without needing to be part of the device. For example, NVM / storage device 708 may be accessed via a network via one or more input / output devices 710.

[0210] One or more input / output devices 710 may provide an interface for device 700 to communicate with any other suitable device. Input / output devices 710 may include communication components, audio components, sensor components, etc. A network interface 712 may provide an interface for device 700 to communicate via one or more networks. Device 700 may wirelessly communicate with one or more components of a wireless network according to any of one or more wireless network standards and / or protocols, such as accessing wireless networks based on communication standards, such as WiFi, 2G, 3G, 4G, 5G, etc., or combinations thereof.

[0211] In one embodiment, at least one of the processors 702 may be logically packaged with one or more controllers (e.g., memory controller modules) of the control module 704. In one embodiment, at least one of the processors 702 may be logically packaged with one or more controllers of the control module 704 to form a system-in-package (SiP). In one embodiment, at least one of the processors 702 may be integrated with the logic of one or more controllers of the control module 704 on the same die. In one embodiment, at least one of the processors 702 may be integrated with the logic of one or more controllers of the control module 704 on the same die to form a system-on-a-chip (SoC).

[0212] In various embodiments, device 700 may be, but is not limited to, a server, a desktop computing device, or a mobile computing device (e.g., a laptop, a handheld computing device, a tablet, a netbook, etc.). In various embodiments, device 700 may have more or fewer components and / or different architectures. For example, in some embodiments, device 700 includes one or more cameras, a keyboard, a liquid crystal display (LCD) screen (including a touchscreen display), a non-volatile memory port, multiple antennas, a graphics chip, an application-specific integrated circuit (ASIC), and a speaker.

[0213] The detection device can use a main control chip as a processor or control module, and sensor data, position information, etc. can be stored in a memory or NVM / storage device. The sensor group can be used as an input / output device, and the communication interface can include a network interface.

[0214] As the device embodiment is basically similar to the method embodiment, the description is relatively simple, and relevant parts can be found in the description of the method embodiment.

[0215] The various embodiments in this specification are described in a progressive manner, with each embodiment focusing on the differences from other embodiments. The same or similar parts between the various embodiments can be referred to each other.

[0216] This application describes embodiments with reference to flowchart illustrations and / or block diagrams of methods, terminal devices (systems), and computer program products according to embodiments of this application. It should be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing terminal device to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing terminal device, generate instructions for implementing the flowchart illustrations. Figure 1 a process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0217] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing terminal device to operate in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 a process or multiple processes and / or boxes Figure 1 The function specified in one or more boxes.

[0218] These computer program instructions can also be loaded onto a computer or other programmable data processing terminal equipment, causing a series of operational steps to be performed on the computer or other programmable terminal equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable terminal equipment for implementing the process. Figure 1 a process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0219] Although preferred embodiments of the present application have been described, those skilled in the art, upon learning the basic inventive concept, can make other changes and modifications to these embodiments. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments as well as all changes and modifications falling within the scope of the embodiments of the present application.

[0220] Finally, it should be noted that in this document, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or terminal device that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or terminal device. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or terminal device that includes said element.

[0221] The above provides a detailed description of a data content ownership confirmation method, apparatus, electronic device, and storage medium provided in this application. Specific examples have been used to illustrate the principles and implementation methods of this application. The descriptions of the above embodiments are only for the purpose of helping to understand the method and core ideas of this application. At the same time, for those skilled in the art, there will be changes in the specific implementation methods and application scope based on the ideas of this application. Therefore, the content of this specification should not be construed as a limitation of this application.

Claims

1. A method for confirming data content ownership, characterized in that, Applied to the target server, the method includes: After the protection algorithm registers with the target server, it receives an algorithm registration request sent by the second client; the algorithm registration request includes a first hash value for the protection algorithm; in response to the algorithm registration request, it generates algorithm proof information for the protection algorithm based on the first hash value, and provides content proof information for the protected data content after the protected data content is registered with the target server; the protected data content contains identity information added by the protection algorithm; Receive the target protected data content, target protection algorithm, algorithm proof information of the target protected data content, content proof information of the target protection algorithm, and comparison data content sent by the first client; If, based on the content proof information of the target protected data content and the algorithm proof information of the target protection algorithm, it is determined that the target protected data content and the target protection algorithm have been registered on the target server, then, based on the target protection algorithm, first identity information is extracted from the target protected data content, and second identity information is extracted from the comparison data content. Based on the first identity information and the second identity information, the ownership determination result between the target protected data content and the comparison data content is determined.

2. The method according to claim 1, characterized in that, The step of generating algorithm proof information for the protection algorithm based on the first hash value includes: A third hash value for the algorithm registration request is determined based on the first hash value of the protection algorithm, the first response time of the algorithm registration request, and the second hash value of at least one algorithm registration request that has been responded to before the first response time. Based on the third hash value, the first response time, and the second hash value of at least one algorithm registration request prior to the first response time, algorithm proof information for the algorithm registration request is generated.

3. The method according to claim 2, characterized in that, The provision of content verification information for the protected data content includes: Receive a content registration request sent by a second client; the content registration request includes: the protected data content, a fourth hash value for the protected data content, and algorithm proof information; In response to the content registration request, content proof information for the protected data content is generated based on the fourth hash value and the protected data content.

4. The method according to claim 3, characterized in that, The step of generating content proof information for the protected data content based on the fourth hash value includes: A sixth hash value for the content registration request is determined based on the fourth hash value of the protected data content, the feature information of the protected data content, the second response time of the content registration request, and the fifth hash value of at least one content registration request that has been responded to before the second response time. Based on the sixth hash value, the second response time, and the fifth hash value of at least one content registration request that was responded to before the second response time, content proof information for the content registration request is generated.

5. The method according to claim 1, characterized in that, The step of determining that the target protected data content has been registered on the target server based on the content proof information of the target protected data content and the algorithm proof information of the target protection algorithm includes: Based on the target protected data content, the content proof information of the target protected data content, and the algorithm proof information of the target protection algorithm, it is determined that the target protected data content has been registered on the target server; Based on the target protection algorithm and its algorithm proof information, it is determined that the target protection algorithm has been registered on the target server.

6. The method according to claim 5, characterized in that, The step of determining that the target protected data content has been registered on the target server based on the target protected data content, the content proof information of the target protected data content, and the algorithm proof information of the target protection algorithm includes: The content proof information of the protected target data is parsed to obtain the seventh hash value; The eighth hash value of the target protected data content is determined based on the target protected data content, the content proof information of the target protected data content, and the algorithm proof information of the target protection algorithm. If the seventh hash value and the eighth hash value are the same, it is determined that the target protected data content has been registered on the target server.

7. A method for confirming data content ownership, characterized in that, The method includes: The protected data content, the protection algorithm, and the comparison data content are obtained; wherein, the protected data content contains protection information added by the protection algorithm; The process involves obtaining algorithm proof information for the protection algorithm and content proof information for the protected data content. The algorithm proof information is determined by the target server for the protection algorithm, including: the target server receiving an algorithm registration request sent by a second client, the algorithm registration request including a first hash value for the protection algorithm; in response to the algorithm registration request, generating algorithm proof information for the protection algorithm based on the first hash value; and the content proof information being determined by the target server for the protected data content. If, based on the content proof information and the algorithm proof information, it is determined that the protected data content and the protection algorithm have been registered on the target server, then, based on the protection algorithm, an ownership confirmation operation is performed between the protected data content and the comparison data content.

8. A data content ownership confirmation device, characterized in that, Applied to the target server, the device includes: A module is provided for receiving an algorithm registration request sent by a second client after the protection algorithm is registered on the target server; the algorithm registration request includes a first hash value for the protection algorithm; in response to the algorithm registration request, generating algorithm proof information for the protection algorithm based on the first hash value, and providing content proof information for the protected data content after the protected data content is registered on the target server; the protected data content contains identity information added by the protection algorithm; The receiving module is used to receive the target protected data content, the target protection algorithm, the algorithm proof information of the target protected data content, the content proof information of the target protection algorithm, and the comparison data content sent by the first client. The analysis module is used to extract first identity information from the target protected data content and second identity information from the comparison data content based on the target protection algorithm, respectively, when it is determined that the target protected data content and the target protection algorithm have been registered on the target server, based on the content proof information of the target protected data content and the algorithm proof information of the target protection algorithm. The first rights confirmation module is used to determine the rights confirmation result between the target protected data content and the comparison data content based on the first identity information and the second identity information.

9. A data content ownership confirmation device, characterized in that, The device comprises: The first acquisition module is used to acquire the protected data content, the protection algorithm, and the comparison data content; wherein, the protected data content contains protection information added by the protection algorithm; The second acquisition module is used to acquire algorithm proof information of the protection algorithm and content proof information of the protected data content; the algorithm proof information is determined by the target server for the protection algorithm, including: the target server receiving an algorithm registration request sent by a second client, the algorithm registration request including a first hash value for the protection algorithm; in response to the algorithm registration request, generating algorithm proof information for the protection algorithm based on the first hash value; the content proof information is determined by the target server for the protected data content; The second rights confirmation module is used to perform rights confirmation operations between the protected data content and the comparison data content based on the protection algorithm, provided that the protected data content and the protection algorithm have been registered on the target server according to the content proof information and the algorithm proof information.

10. An electronic device, characterized in that, include: processor; and A memory having executable code stored thereon, which, when executed, causes the processor to perform the method as described in one or more of claims 1-7.

11. One or more machine-readable media having executable code stored thereon, which, when executed, causes a processor to perform the method as described in one or more of claims 1-7.

Images