CN114221956A - Content examination method of distributed network - Google Patents
Content examination method of distributed network Download PDFInfo
- Publication number
- CN114221956A CN114221956A CN202111314885.9A CN202111314885A CN114221956A CN 114221956 A CN114221956 A CN 114221956A CN 202111314885 A CN202111314885 A CN 202111314885A CN 114221956 A CN114221956 A CN 114221956A
- Authority
- CN
- China
- Prior art keywords
- file
- node
- nodes
- distributed network
- content
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 38
- 238000012795 verification Methods 0.000 claims abstract description 6
- 238000012552 review Methods 0.000 claims description 29
- 238000012544 monitoring process Methods 0.000 claims description 9
- 238000007689 inspection Methods 0.000 claims description 8
- 238000012550 audit Methods 0.000 claims description 7
- 238000012545 processing Methods 0.000 claims description 4
- 238000004364 calculation method Methods 0.000 claims description 2
- 230000000694 effects Effects 0.000 abstract description 3
- 238000013386 optimize process Methods 0.000 abstract description 2
- 238000012360 testing method Methods 0.000 abstract description 2
- 230000006870 function Effects 0.000 description 5
- 230000006399 behavior Effects 0.000 description 3
- 238000004422 calculation algorithm Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 230000010076 replication Effects 0.000 description 2
- 230000003044 adaptive effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000000903 blocking effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 239000012634 fragment Substances 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 230000001953 sensory effect Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/13—File access structures, e.g. distributed indices
- G06F16/134—Distributed indices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/13—File access structures, e.g. distributed indices
- G06F16/137—Hash-based
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/18—File system types
- G06F16/182—Distributed file systems
- G06F16/1834—Distributed file systems implemented based on peer-to-peer networks, e.g. gnutella
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/06—Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F2221/2107—File encryption
Abstract
The invention relates to a content examination method of a distributed network. The verification test results of the content examination method of the distributed network show that based on comparison of products of the same type, the content examination method of the distributed network has the advantages of more advanced architecture, more logic execution and more optimized process, reduces negative effects of bad content on the society, lightens the workload of manual examination, improves examination efficiency and accelerates the speed of content sharing.
Description
Technical Field
The invention belongs to the technical field of computers, relates to an information processing technology, and discloses a content examination method of a distributed network.
Background
With the rapid development of the internet and sharing concepts, the internet system also gradually goes up to the shared road; however, in the prior art, there is no strict examination mechanism for users of each individual computer, so that shared contents are not good and uniform, and bad contents can bring negative effects to the society; the workload of manual examination is large, and the content is repeated; further resulting in inefficient review and slow content sharing.
Disclosure of Invention
In the embodiments of these methods, the specific steps of automatically auditing the files to be audited when the nodes upload the files are as follows:
A) any node packages the file to be audited and generates a file fingerprint corresponding to the file to be audited; uploading the file fingerprint to a distributed point-to-point network where the node is located;
B) when the file fingerprint is monitored and acquired by any review node, automatically reviewing the file fingerprint immediately to obtain a review result;
C) and performing corresponding processing based on the auditing result: if the audit result is that the file is not a prohibited file, the file is coded to obtain 1 original and a plurality of copies, the original of the file is stored in a distributed network path of the node, and the copies are stored in other nodes of the distributed network; and if the verification result is that the file is an illegal file, storing the file fingerprint into an illegal file fingerprint library.
The invention has the beneficial effect of providing a content examination method of the distributed network. The verification test results of the content examination method of the distributed network show that based on comparison of products of the same type, the content examination method of the distributed network has more advanced architecture, more logic execution and more optimized process, reduces negative effects of bad content on the society, lightens the workload of manual examination, improves examination efficiency and accelerates content sharing.
Drawings
FIG. 1 is a logic diagram for automatically reviewing content under review;
fig. 2 is a distributed point-to-point network topology.
Detailed Description
The technical features of the different embodiments of the invention may be combined in any way in conformity with the gist of the invention, and therefore any specific embodiment should not be understood as limiting the scope of protection of the invention.
In some embodiments of the content auditing method for the distributed network, the specific steps of automatically auditing the files to be audited when the nodes upload the files are as follows:
A) any node packages the file to be audited and generates a file fingerprint corresponding to the file to be audited; uploading the file fingerprint to a distributed point-to-point network where the node is located;
B) when the file fingerprint is monitored and acquired by any review node, automatically reviewing the file fingerprint immediately to obtain a review result;
C) and performing corresponding processing based on the auditing result: if the audit result is that the file is not a prohibited file, the file is coded to obtain 1 original and a plurality of copies, the original of the file is stored in a distributed point-to-point network path of the node, and the copies are stored in other nodes of the distributed point-to-point network; if the verification result is that the file is an illegal file, storing the file fingerprint into an illegal file fingerprint library;
the file fingerprint is a unique file hash value which is generated by a hash algorithm based on the file content and corresponds to the file content.
The term "distributed Peer-to-Peer network" refers to a P2P network, i.e., a Peer-to-Peer computer network, which is a distributed application architecture that distributes tasks and workloads among peers (peers), and is a networking or networking form of the Peer-to-Peer computing model at the application layer.
In some embodiments of a content review method for a distributed network, a file fingerprint is matched to a prohibited file fingerprint in a prohibited file fingerprint repository; if the matching is successful, the auditing result is that the file to be audited is a prohibited file; if the matching is not successful, the auditing result is that the file to be audited is not a prohibited file; the prohibited file fingerprint library is formed by fingerprint library files stored in all nodes of a distributed point-to-point network.
In some embodiments of a content review method for a distributed network, a number of review nodes form a content review layer; any one of the examination nodes generates a plurality of pairs of private keys and distributes the private keys to other examination nodes; a monitoring engine program is configured in the distributed network; the monitoring engine program can be deployed on any node; and starting a monitoring engine program to monitor the uploaded fingerprints of the unapproved files after the nodes are upgraded into the audit nodes based on the function upgrading rules.
In some embodiments of a content review method for a distributed network, a master and several copies are cut into several block files; and stores the block file in the form of a sequence of blocks.
In some embodiments of the content review method for a distributed network, the review node generates a unique check code for each of the different block files; and adding the check code to a check code library; the check code library is stored in a plurality of examination nodes in a distributed manner; and a plurality of check codes in the check code library cannot be modified.
In some embodiments of the content inspection method for the distributed network, when any node downloads a file, all block file check codes corresponding to the file are obtained from an inspection layer; if the block file is damaged or the content of the file is tampered by a malicious node, the block file cannot be opened through a corresponding check code;
when the corresponding check code cannot open the block file, the node user can select other nodes to download the block file which is not damaged or tampered.
In some embodiments of the content inspection method for the distributed network, the function upgrading rule is that any node can be upgraded into an inspection node by contributing storage space, uploading or downloading energy-positive files and having no malicious behavior;
malicious acts include: uploading or downloading prohibited files with bad social influence and tampering the approved files;
malicious behavior of individual nodes can be traced in a number of ways, such as: the combination of functions of copy certification and space-time algorithm certification based on a distributed point-to-point network can trace the behaviors of uploading, storing or maliciously tampering files of forbidden files; wherein the replication proof can be realized by a zero-knowledge proof;
the term "proof of replication" proves that the data has been correctly processed and provides the root of the Merkle tree formed by the processed data;
the term "Merkle tree," also known as a merkel tree or hash tree, is a binary tree consisting of a root node, a set of intermediate nodes, and a set of leaf nodes. The lowest leaf node contains stored data or hash values thereof, each intermediate node is the hash value of the contents of two child nodes, and the root node is also composed of the hash values of the contents of two child nodes;
further, the merkel tree can be generalized to the case of a multi-way tree;
the characteristics of the Mercker tree are that any change of the bottom data is transmitted to the father node of the Mercker tree until the root of the Mercker tree;
the term "spatio-temporal algorithm proves that one leaf data is randomly chosen at intervals, and a participant needs to be stored to provide path evidence from the leaf data to a Merkle tree root within a certain time;
the term "zero knowledge proof" means that the prover is able to convince the verifier that some argument is correct without providing the verifier with any useful information; zero knowledge proof is essentially a protocol involving two or more parties; zero knowledge proof of knowledge uses zk-SNARK encryption technology.
In some embodiments of the content review method for the distributed network, the files that any node contributes to the storage space and uploads or downloads positive energy are recorded by any other node in a block chain manner; the method comprises the following steps of taking the contribution storage space of other nodes recorded by the node which completes calculation at the fastest speed, and uploading or downloading files with positive energy as rights and interests evidence; and upgrading the private key into a review node based on the rights and interests evidence node.
In some embodiments of the content review method for a distributed network, the review node preferentially monitors other nodes that are logically closer to the review node.
In some embodiments of a content vetting method for a distributed network, a library of illicit file fingerprints is stored in a memory space contributed by each node in a decentralized distributed peer-to-peer network; forms of illicit documents include: text, audio and video; the characters comprise keywords and key sentences; converting the audio into a character form through voice recognition, and extracting key words and key sentences in the text form; video is converted into a uniform, but not limited to unique format, such as: a TS slice format in an HLS protocol is adopted, and segmented storage is performed; slicing the keywords, the key sentences and the segmented video and then calculating to obtain forbidden data hash values;
the format of the video slice is not unique, and a TS slice format can be adopted;
the term "HLS protocol" refers to the (HTTP Live Streaming) adaptive bitrate Streaming protocol; the HLS protocol includes: the index file, the TS media fragment file and the Key encryption string file of m3u (8);
the term "TS" is a stream file format for binary transmission.
In some embodiments of the content review method for a distributed network, the content of the file cannot be cut to a size exceeding 256 k; the file content is in the form of text content, audio and video; the characters comprise keywords and key sentences; converting the audio into a character form through voice recognition, and extracting key words and key sentences in the text form; video is converted into a uniform, but not limited to unique format, such as: a TS slice format in an HLS protocol is adopted, and segmented storage is performed; and slicing the keywords, the key sentences and the segmented video and then calculating to obtain the forbidden data hash value.
In some embodiments of the content review method for a distributed network, the file is typically divided into a number of block files of equal size, the block files being of variable size, typically 64 MB;
the file blocking and check code generation modes are not unique, and can be completed by the introduced HDFS technology.
The term "HDFS" is a highly fault tolerant system; the system can provide high-throughput data access and is very suitable for application on large-scale data sets;
the internal mechanism of the HDFS is to divide a file into one or more blocks, and the blocks are stored in a data node; typically one node and one machine;
HDFS is designed to reliably store a large number of files between a large number of machines, it stores files in the form of a sequence of blocks; blocks of a file are copied for fault tolerance, and the size and the number of copies of the blocks are configured in units of files.
In some embodiments of the content review method for a distributed network, each node that newly joins the distributed peer-to-peer network is randomly assigned a node ID value; distributed peer-to-peer networks may employ a variety of node numbering schemes, such as: numbering each node by adopting a Kademlia binary state tree structure, wherein each node is a leaf node, the prefix of a tree root from the tree root is empty, and the numbering of a left sub-tree and the numbering of a right sub-tree are respectively 1 and 0; each node starts from the root node and arrives along the shortest unique prefix path; the serial number of the number string formed by connecting the shortest unique prefix path in series is used as the node ID of the node;
the binary state tree can be provided with a key, value pair, and a distributed hash table is commonly maintained in a distributed point-to-point network; the DHT entry contains a < key, value > pair; key is the hash value of the file; value is the node ID; key and value have the same value field, both 160 bits; < key, value > on 160-bit Hash, judging whether the distance between a first node x and a second node y is far or near by a binary arithmetic, and d (x, y) ═ x ≦ y; if the two binary bit results are the same, the XOR value of the two binary bit results is 0; if the two binary bit results are not the same, the XOR value of the two binary bit results is 1; searching along the direction of reducing the distance of the exclusive or value, starting to query from any network node, and reaching the result at most by only Log N step; based on a distributed hash table and binary operation XOR, a plurality of routing nodes and common nodes with close logical distances can be searched;
the term "Kademlia" is a P2P overlay network transmission protocol designed by Petar Maymounkov and David Mazieres to construct a distributed P2P network, and is a P2P information system based on XOR operation; it establishes the network structure and standardizes the communication and information exchange mode between nodes.
The invention is further illustrated by the following more specific examples:
referring to fig. 1, a logic diagram of automatically auditing files to be audited in a content auditing method for a distributed network according to the embodiment; the method comprises the following specific steps of automatically auditing the files to be audited when the nodes upload the files:
A) any node packages the file to be audited and generates a file fingerprint corresponding to the file to be audited; uploading the file fingerprint to a distributed point-to-point network where the node is located;
B) when the file fingerprint is monitored and acquired by any review node, automatically reviewing the file fingerprint immediately to obtain a review result;
C) and performing corresponding processing based on the auditing result: if the audit result is that the file is not a prohibited file, the file is coded to obtain 1 original and a plurality of copies, the original of the file is stored in a distributed point-to-point network path of the node, and the copies are stored in other nodes of the distributed point-to-point network; and if the verification result is that the file is an illegal file, storing the file fingerprint into an illegal file fingerprint library.
Referring to fig. 2, a distributed peer-to-peer network topology of a content censoring method for a distributed network according to the present embodiment; wherein, a plurality of examination nodes form a content examination layer; any one of the examination nodes generates a plurality of pairs of private keys and distributes the private keys to other examination nodes; a monitoring engine program is configured in the distributed network; the monitoring engine program can be deployed on any node; and starting a monitoring engine program to monitor the uploaded file fingerprints after the nodes are upgraded into the examination nodes based on the function upgrading rules.
The processes and logic flows described in this specification can be performed by one or more programmable computers executing one or more computer programs to perform functions by operating on input data and generating output.
To send interactions with a user, embodiments of the subject matter described in this specification can be implemented on a computer having: a display device, for example, a CRT (cathode ray tube) or LCD (liquid crystal display) monitor, for displaying information to a user; and a keyboard and a pointing device, such as a mouse or trackball, by which a user can communicate input to the computer. Other kinds of devices may also be used to send interactions with the user; for example, feedback provided to the user can be any form of sensory feedback, e.g., visual feedback, auditory feedback, or tactile feedback; and input from the user may be received in any form, including acoustic, speech, or tactile input. In addition, the computer may interact with the user by sending documents to a device used by the user and receiving documents from the device; for example, by sending a web page to a web browser on the user's client device in response to a request received from the web browser.
While this specification contains many specific implementation details, these should not be construed as limitations on the scope of any inventions or of what may be claimed, but rather as descriptions of features that may embody particular implementations of particular inventions. Certain features that are described in this specification in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in combination and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.
Claims (10)
1. A content auditing method of a distributed network is characterized in that when a node uploads a file, the specific steps of automatically auditing the file to be audited are as follows:
A) any node packages the file to be audited and generates a file fingerprint corresponding to the file to be audited; uploading the file fingerprint to a distributed network in which the nodes are located;
B) when the file fingerprint is monitored and acquired by any review node, automatically reviewing the file fingerprint immediately to obtain a review result;
C) and performing corresponding processing based on the auditing result: if the audit result shows that the file is not a prohibited file, the file is coded to obtain 1 original and a plurality of copies, the original of the file is stored in a distributed network path of the node, and the copies are stored in other nodes of the distributed network; and if the verification result is that the file is a prohibited file, storing the file fingerprint into a prohibited file fingerprint library.
2. The method for content inspection in a distributed network according to claim 1, wherein in step B), the file fingerprint is matched with a prohibited file fingerprint in the prohibited file fingerprint database; if the matching is successful, the auditing result is that the file to be audited is a prohibited file; if the matching is not successful, the auditing result indicates that the file to be audited is not a prohibited file; the prohibited file fingerprint library is composed of fingerprint library files stored in all nodes of the distributed network.
3. The method of claim 1, wherein a plurality of the review nodes form a content review layer; any one of the examination nodes generates a plurality of pairs of private keys and distributes the private keys to other examination nodes; a monitoring engine program is configured in the distributed network; the monitoring engine program can be deployed on any one node; and starting the monitoring engine program to monitor the uploaded unapproved file fingerprints after the nodes are upgraded to the audit nodes based on the function upgrading rules.
4. The method for content inspection in a distributed network according to claim 1, wherein in step C), the original and the copies are cut into blocks; and storing the block files in a distributed mode.
5. The method of claim 4, wherein the review node generates a unique check code for each of the different block files; adding the check code to a check code library; the check code library is stored in a plurality of examination nodes in a distributed manner; and a plurality of check codes in the check code library cannot be modified.
6. The content inspection method of the distributed network according to claim 5, wherein when any of the nodes downloads a file, all block file check codes corresponding to the file are first obtained from the inspection layer; if the block file is damaged or the content of the file is tampered by a malicious node, the block file cannot be opened through the corresponding check code.
7. The method of claim 1, wherein the function upgrade rule is that any of the nodes can upgrade to an audit node by contributing storage space, uploading or downloading energy-positive files, and no malicious behavior.
8. The method according to claim 7, wherein any one of the nodes contributing storage space, uploading or downloading energy-positive files is recorded by any other one of the nodes in a blockchain manner; using the other nodes recorded by the node which completes calculation fastest to contribute storage space and upload or download files with positive energy as rights and interests evidence; the node may obtain the private key to upgrade to the review node based on the equity evidence.
9. The method of claim 8, wherein said censoring node preferentially monitors other said nodes that are logically closer to said censoring node.
10. The method of claim 9, wherein each node that newly joins the distributed network is randomly assigned a node ID; node IDs in the distributed network are numbered for each node by adopting a Kademlia binary state tree structure, and each node is reached along a path of the shortest unique prefix of the node from the tree root of the binary state tree; and the serial number of the shortest unique prefix path is used as the node ID of the node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111314885.9A CN114221956A (en) | 2021-11-08 | 2021-11-08 | Content examination method of distributed network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111314885.9A CN114221956A (en) | 2021-11-08 | 2021-11-08 | Content examination method of distributed network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114221956A true CN114221956A (en) | 2022-03-22 |
Family
ID=80696651
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111314885.9A Pending CN114221956A (en) | 2021-11-08 | 2021-11-08 | Content examination method of distributed network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114221956A (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110109888A (en) * | 2019-04-04 | 2019-08-09 | 深圳市元征科技股份有限公司 | A kind of document handling method and device |
| US20190347290A1 (en) * | 2018-05-10 | 2019-11-14 | Alibaba Group Holding Limited | Blockchain-based music originality analysis method and apparatus |
| CN111125023A (en) * | 2019-11-15 | 2020-05-08 | 北京十分科技有限公司 | File auditing, auditing control and publishing method and corresponding device |
| CN111522987A (en) * | 2020-04-24 | 2020-08-11 | 腾讯科技（深圳）有限公司 | Image auditing method and device and computer readable storage medium |
| CN111539014A (en) * | 2020-03-27 | 2020-08-14 | 肾泰网健康科技(南京)有限公司 | Block chain-based ethical file archiving method |
| CN111949630A (en) * | 2020-08-10 | 2020-11-17 | 大连理工大学 | Distributed block chain storage method based on file review mechanism |
| CN112291356A (en) * | 2020-11-02 | 2021-01-29 | 大连理工大学 | Self-verification variable name distributed storage method based on CNFS protocol |
| CN113495920A (en) * | 2020-04-02 | 2021-10-12 | 国家广播电视总局广播电视科学研究院 | Content auditing system, method and device based on block chain and storage medium |
-
2021
- 2021-11-08 CN CN202111314885.9A patent/CN114221956A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190347290A1 (en) * | 2018-05-10 | 2019-11-14 | Alibaba Group Holding Limited | Blockchain-based music originality analysis method and apparatus |
| CN110109888A (en) * | 2019-04-04 | 2019-08-09 | 深圳市元征科技股份有限公司 | A kind of document handling method and device |
| CN111125023A (en) * | 2019-11-15 | 2020-05-08 | 北京十分科技有限公司 | File auditing, auditing control and publishing method and corresponding device |
| CN111539014A (en) * | 2020-03-27 | 2020-08-14 | 肾泰网健康科技(南京)有限公司 | Block chain-based ethical file archiving method |
| CN113495920A (en) * | 2020-04-02 | 2021-10-12 | 国家广播电视总局广播电视科学研究院 | Content auditing system, method and device based on block chain and storage medium |
| CN111522987A (en) * | 2020-04-24 | 2020-08-11 | 腾讯科技（深圳）有限公司 | Image auditing method and device and computer readable storage medium |
| CN111949630A (en) * | 2020-08-10 | 2020-11-17 | 大连理工大学 | Distributed block chain storage method based on file review mechanism |
| CN112291356A (en) * | 2020-11-02 | 2021-01-29 | 大连理工大学 | Self-verification variable name distributed storage method based on CNFS protocol |
Non-Patent Citations (1)
| Title |
|---|
| 张家亮;曾兵;沈宜;张明亮;陈正宇;: "超高清视频内容安全审核技术研究", 通信技术, no. 08 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6865851B2 (en) | Blockchain World State Markle Patricia Tri Tree Subtree Construction | |
| CN114514732B (en) | Method, computing system, and readable medium for consensus protocol for blockchain DAG structures | |
| JP7235764B2 (en) | Industrial data validation using a secure distributed ledger | |
| AU2016204072B2 (en) | Event anomaly analysis and prediction | |
| Baldimtsi et al. | Sorting and searching behind the curtain | |
| CN110647503A (en) | Distributed storage method and device | |
| Tang et al. | Enabling ciphertext deduplication for secure cloud storage and access control | |
| CN115211093A (en) | Efficient threshold storage of data objects | |
| CN113779355A (en) | Network rumor source tracing evidence obtaining method and system based on block chain | |
| CN113157735A (en) | Method and device for inquiring block chain storage data | |
| Dhasade et al. | TEE-based decentralized recommender systems: The raw data sharing redemption | |
| Megías et al. | DNA-inspired anonymous fingerprinting for efficient peer-to-peer content distribution | |
| Xu et al. | Achieving online and scalable information integrity by harnessing social spam correlations | |
| CN115865461B (en) | Method and system for distributing data in high-performance computing cluster | |
| Zheng et al. | An efficient multikeyword fuzzy ciphertext retrieval scheme based on distributed transmission for Internet of Things | |
| Santos et al. | Performance analysis of data fragmentation techniques on a cloud server | |
| CN114221956A (en) | Content examination method of distributed network | |
| CN114221767A (en) | File monitoring method for distributed network | |
| Kozik et al. | Cyber security of the application layer of mission critical industrial systems | |
| US20240160769A1 (en) | Method and system for confidential repository searching and retrieval | |
| Li et al. | Verifiable range query processing for cloud computing | |
| Marjai et al. | The Use of Template Miners and Encryption in Log Message Compression. Computers 2021, 10, 83 | |
| Baligodugula et al. | A Comparative Study of Secure and Efficient Data Duplication Mechanisms for Cloud-Based IoT Applications | |
| EP3163474A1 (en) | A similarity module, a local computer, a server of a data hosting service and associated methods | |
| Rong et al. | Verifiable and privacy-preserving association rule mining in hybrid cloud environment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |