CN112052660A - Resource auditing method and device based on decentralization, computer equipment and medium - Google Patents
Resource auditing method and device based on decentralization, computer equipment and medium Download PDFInfo
- Publication number
- CN112052660A CN112052660A CN202010930244.5A CN202010930244A CN112052660A CN 112052660 A CN112052660 A CN 112052660A CN 202010930244 A CN202010930244 A CN 202010930244A CN 112052660 A CN112052660 A CN 112052660A
- Authority
- CN
- China
- Prior art keywords
- text
- resource
- abstract
- auditing
- registered
- 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 49
- 238000012795 verification Methods 0.000 claims abstract description 18
- 230000004044 response Effects 0.000 claims abstract description 12
- 230000001360 synchronised effect Effects 0.000 claims abstract description 11
- 238000012550 audit Methods 0.000 claims description 24
- 238000012545 processing Methods 0.000 claims description 12
- 230000007246 mechanism Effects 0.000 claims description 10
- 238000005516 engineering process Methods 0.000 abstract description 3
- 238000012790 confirmation Methods 0.000 description 8
- 230000008569 process Effects 0.000 description 6
- 230000006870 function Effects 0.000 description 5
- 238000004891 communication Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 230000006835 compression Effects 0.000 description 2
- 238000007906 compression Methods 0.000 description 2
- 230000003111 delayed effect Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 230000002411 adverse Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000001010 compromised effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 230000001788 irregular Effects 0.000 description 1
- 238000004898 kneading Methods 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012797 qualification Methods 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/10—Text processing
- G06F40/194—Calculation of difference between files
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/33—Querying
- G06F16/3331—Query processing
- G06F16/334—Query execution
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/34—Browsing; Visualisation therefor
- G06F16/345—Summarisation for human users
-
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
-
- 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
- H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Data Mining & Analysis (AREA)
- Strategic Management (AREA)
- General Health & Medical Sciences (AREA)
- Databases & Information Systems (AREA)
- Entrepreneurship & Innovation (AREA)
- Computational Linguistics (AREA)
- Health & Medical Sciences (AREA)
- Operations Research (AREA)
- Economics (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Artificial Intelligence (AREA)
- Audiology, Speech & Language Pathology (AREA)
- Quality & Reliability (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Bioethics (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Software Systems (AREA)
- Storage Device Security (AREA)
Abstract
The embodiment of the application belongs to a block chain technology, is applied to the field of intelligent government affairs, and relates to a resource auditing method based on decentralization, which comprises the steps of generating a first abstract text according to a first registered resource and a first cipher text uploaded by a user object; whether a second abstract text exists is inquired according to the first abstract text; if so, determining whether the first abstract text is the same as the second abstract text; and if the verification results are the same, the first registration resource is verified according to a preset verification text, the first registration resource passing the verification is synchronized to each verification node, and response information of successful verification is sent to the user object. The first registration resource of the privacy information/result data of the user can be stored in the blockchain. By the method and the device, the technical problem that information resources are easily stolen and registered by a bad registrant due to the fact that resources are registered on a block chain in the prior art is solved.
Description
Technical Field
The present application relates to the field of blockchain, and in particular, to a resource auditing method and apparatus, a computer device, and a storage medium based on decentralized.
Background
Centralized registration systems are now ubiquitous in the current internet world, e.g., microblog usernames, Taobao stores, WeChat public numbers, etc. The centralized registration system serves as a registration manager, and one of the most important roles is to prevent duplicate registration. The various names, accounts registered as a network resource may sometimes be of great value, if a registrant intends to register a name, all that is done is to check at the registration server for duplicates, i.e. whether it has already been registered by other users, and if so, the registration server will reject subsequent registrations. For example, if two different registrars a, B are affected by a concept at almost the same time, think of a name "nightly", such as a wechat public number, then a and B would submit a registration "nightly" to the wechat registrar as early as possible, as to who a and B can successfully register, depending entirely on who's request was first received by the wechat registrar, and even worse, information on the registration of A, B was leaked to be eavesdropped by C, or the registration request of A, B was intercepted on the network C, then C considers profitability, would prevent A, B registration by some network technology means, and preempt would submit a registration before the submission of A, B was received, and if so, the benefit of A, B could be compromised.
In particular, this situation is more serious in distributed decentralized systems, such as blockchain systems, and there is no absolute central authority to handle chronological changes, and most of the data exchanges of currently available blockchain systems are publicly auditable, which has the hidden danger that a honest registrar may submit a name registration, but the whole decentralized system needs a waiting time T for confirmation, which provides a time attack window to the malicious registrar, because the data is publicly auditable and the malicious registrar finds that the name that has not been confirmed is profitable, and also submits a registration application, and submits it to as many decentralized nodes as possible by some technical means, such as a method of increasing the commission of the blockchain system, the registration request is submitted to a decentralization node with high calculation capacity as much as possible so as to improve the probability that the registration request is preferentially confirmed. If registration of a malicious registrar is preferentially confirmed, registration requests of honest registrars are denied, resulting in adverse events for malicious registrations.
Disclosure of Invention
Based on this, in order to solve the above technical problems, the present application provides a resource auditing method and apparatus, a computer device and a storage medium based on decentralized, so as to solve the technical problem in the prior art that resources are registered preemptively due to the fact that information resources are disclosed on a block chain and resources are stolen.
A resource auditing method based on decentralization is applied to a decentralization system, wherein the decentralization system comprises a plurality of auditing nodes used for resource auditing, and the method comprises the following steps:
generating a first abstract text according to a first registration resource and a first cipher text uploaded by a user object;
whether a second abstract text exists is inquired according to the first abstract text, wherein the second abstract text is abstract information uploaded by the user object before a preset time length;
if so, determining whether the first abstract text is the same as the second abstract text;
and if the verification results are the same, the first registration resource is verified according to a preset verification text, the first registration resource passing the verification is synchronized to each verification node, and response information of successful verification is sent to the user object.
A resource auditing device based on decentralization is applied to a decentralization system, wherein the decentralization system comprises a plurality of auditing nodes for resource auditing, and the device comprises:
the generating module is used for generating a first abstract text according to the first registration resource and the first cipher text uploaded by the user object;
the query module is used for querying whether a second abstract text exists according to the first abstract text, wherein the second abstract text is abstract information uploaded by the user object before a preset time length;
the comparison module is used for confirming whether the first abstract text is the same as the second abstract text if the first abstract text exists;
and the auditing module is used for auditing the first registered resource according to a preset auditing text if the first registered resource is the same as the preset auditing text, synchronizing the first registered resource which passes the auditing to each auditing node, and sending response information of successful auditing to the user object.
A computer device comprising a memory and a processor, and computer readable instructions stored in the memory and executable on the processor, the processor implementing the steps of the decentralized-based resource auditing method when executing the computer readable instructions.
A computer readable storage medium storing computer readable instructions which, when executed by a processor, implement the steps of the decentralized-based resource auditing method described above.
According to the resource auditing method, device, computer equipment and storage medium based on decentralization, a second abstract text bound with a user object is uploaded in advance before the preset duration of uploading a first registered resource, the first abstract text generated according to the first registered resource is compared with the second abstract text, whether the user object has the qualification for registering the first registered resource is determined, if yes, the first registered resource is audited according to the preset audit text, and the technical problem that information resources are easy to be stolen and registered by a bad registrant due to the fact that registered resources on a block chain are open in the prior art is solved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments of the present invention will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without inventive labor.
FIG. 1 is a schematic diagram of an application environment of a decentralized resource auditing method;
FIG. 2 is a schematic flow chart of a resource auditing method based on decentralization;
FIG. 3 is a schematic diagram of a decentralized resource based auditing apparatus;
FIG. 4 is a diagram of a computer device in one embodiment.
Detailed Description
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs; the terminology used in the description of the application herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application; the terms "including" and "having," and any variations thereof, in the description and claims of this application and the description of the above figures are intended to cover non-exclusive inclusions. The terms "first," "second," and the like in the description and claims of this application or in the above-described drawings are used for distinguishing between different objects and not for describing a particular order.
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein can be combined with other embodiments.
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The resource auditing method based on decentralization provided by the embodiment of the invention can be applied to the application environment shown in figure 1. The application environment may include a terminal 102, a network for providing a communication link medium between the terminal 102 and the server 104, and a server 104, wherein the network may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
A user may use the terminal 102 to interact with the server 104 over a network to receive or send messages, etc. The terminal 102 may have installed thereon various communication client applications, such as a web browser application, a shopping application, a search application, an instant messaging tool, a mailbox client, social platform software, and the like.
The terminal 102 may be various electronic devices having a display screen and supporting web browsing, including but not limited to a smart phone, a tablet computer, an e-book reader, an MP3 player (Moving Picture Experts Group Audio Layer III, mpeg compression standard Audio Layer 3), an MP4 player (Moving Picture Experts Group Audio Layer IV, mpeg compression standard Audio Layer 4), a laptop portable computer, a desktop computer, and the like.
The server 104 may be a server that provides various services, such as a background server that provides support for pages displayed on the terminal 102.
It should be noted that the resource auditing method based on decentralization provided in the embodiment of the present application is generally executed by a server/terminal, and accordingly, the resource auditing apparatus based on decentralization is generally disposed in the server/terminal device.
The application is operational with numerous general purpose or special purpose computing system environments or configurations. For example: personal computers, server computers, hand-held or portable devices, tablet-type devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like. The application may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The application may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
This application can be applied to in the wisdom government affairs field to promote the construction in wisdom city. For example, in the decentralized intelligent government affair system, the auditing node corresponds to a government affair platform, and different government affair platforms form the decentralized system, when a user needs to register a product name or a company name in a certain auditing node, the user can upload the encrypted information of the product name in advance, and then upload the resource to be registered for resource auditing after presetting time.
It should be understood that the number of terminals, networks and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Wherein, the terminal 102 communicates with the server 104 through the network. The server 104 receives the first registered resource uploaded by the terminal 102, then generates a first abstract text according to the first registered resource, searches whether a second abstract text which is the same as the first abstract text and is uploaded exists on the decentralized system, if so, audits the first registered resource according to a preset audit text, synchronizes the audited first registered resource to each audit node on the decentralized system, and then sends response information of successful audit to the user object to complete audit of the resource. The terminal 102 and the server 104 are connected through a network, the network may be a wired network or a wireless network, the terminal 102 may be, but is not limited to, various personal computers, notebook computers, smart phones, tablet computers, and portable wearable devices, and the server 104 may be implemented by an independent server or a server cluster formed by a plurality of servers.
In some embodiments, as shown in fig. 2, a resource auditing method based on decentralization is provided, which is described by taking the method as an example applied to the server side in fig. 1, and includes the following steps:
One feature of the decentralized system is that the data is public, and when a user wants to register an account with the decentralized system, information about the account is disclosed and known to others during auditing of the account. Therefore, in order to solve the problem that information is preempted, in some embodiments, after a certain auditing node receives a first registered resource and a first cipher text uploaded by a user, a first abstract text is generated accordingly, and then the decentralized system synchronizes the first abstract text to other auditing nodes in the system.
For example, the first registration resource may be an information resource which has uniqueness such as a wechat public number, a microblog account number, a domain name, a literature web name, a company name, and the like and can be acquired only by registration and verification. When the first registration resource is a domain name, then the first registration resource is: when a user object registers a certain domain name, the first registration resource is a text of the domain name that is desired to be registered, such as: realm name ═ chengbuy; if the first registered resource is a website to be registered, a nickname or a unique number on an application, the first registered resource may be: name _ owner ═ chengbuye; when the name of a book is used, the following can be used: book _ name is a city overnight.
The first cipher text is a cipher text string used to encrypt the first enrollment resource and may be 123123123123. The first cipher text can be set by the user at will, or can be a string of irregular numbers and character combinations randomly generated according to a random function, the numbers created by the space cannot be easily guessed by others, and a common method can use a random number generation method, which is similar to a password generation method in a common computer system.
In some embodiments, the first registration resource explains the technical solution of the present application by a wechat public number, and after receiving the wechat public number of the user object, the wechat public number is: after applying for "name _ owner" in town, the first ciphertext uploaded together according to the user object is: 123123123123 and the first registered resource in town at night generates a first abstract text:
hx SHA256("123123123123name _ owne overnight)
＝c98bf160bbd179febeb8ed65e020a01bede95c634566192f39da35e441341b10
Specifically, the manner of generating the first summary text is as follows:
splicing the first registered resource and the first cipher text to obtain a first encrypted text; and performing message digest processing on the first encrypted text to obtain a first digest text.
The first registration resource and the first cipher text are directly spliced to obtain a first encrypted text, and then the first encrypted text is subjected to message digest processing to obtain a first digest text, for example: 123123123123name _ own is a city overnight. And then processing the first encrypted text through a hash algorithm to obtain a first abstract text.
Optionally, the exclusive or operation may be performed on each character of the first registered resource and the first cipher text to obtain a first encrypted text, and then the message digest processing may be performed on the first encrypted text through a hash algorithm to obtain a first digest text. For example, firstly, each character of the first registration resource m is stored in an array variable; and then carrying out exclusive OR operation on all the characters and a first cipher text s set by a user to obtain a first encrypted text. If the first encrypted text dx obtained in this way wants to be decrypted, the cracker needs not only the first ciphertext s but also a combination of the first ciphertext s and the first registered resource m. And the two encryption modes are simple and convenient to operate, are particularly suitable for the conditions of large data throughput and large server data processing capacity, save the calculated amount of the cup and improve the efficiency.
The message digest is an algorithm of pseudo-random input with fixed length obtained by kneading input with arbitrary length, wherein one hash algorithm can convert the input with arbitrary length (also called pre-map) into output with fixed length through a hash algorithm, and the output is a hash value. The message digest algorithm is characterized in that the first encrypted text dx can be known to obtain hx certainly, but the first encrypted text dx is difficult to obtain if the first digest text hx is known, so that the safety of data synchronized to a block chain is guaranteed.
And 204, inquiring whether a second abstract text exists according to the first abstract text, wherein the second abstract text is abstract information uploaded by the user object before the preset time length.
Before the user object wants to register the first registered resource, a first encrypted text is locally generated according to the first registered resource and the generated first cipher text, then message summarization processing is carried out on the first encrypted text through a hash algorithm to obtain a second summarized text, and then the second summarized text is uploaded to a certain auditing node. The block chain synchronizes the second abstract text received by the auditing node, generates a corresponding relation between the user object and the second abstract text, and takes the minimum time as preset time if the minimum time possibly required from uploading of the second abstract text to completion of synchronization is T. When the first registered resource that the user object audits and registers is received after the time of N × T, the first registered resource may be confirmed according to the above manner, where N is a positive integer. The second abstract text is abstract information uploaded to the auditing nodes by the user object before the preset time length, and the user object synchronizes the information to be registered to each auditing node in the decentralized system in advance in an encrypted form. The auditing nodes can package, upload and disclose the second abstract text h, so that all the auditing nodes in the decentralized system can know the second abstract text and can inquire the second abstract text when needed. And the auditing node also binds the corresponding relation between the second abstract text and the user object and specifies that the second abstract text is uploaded by the user object.
It is important to note that even if the decentralized system discloses the second digest text, because the second digest text is encrypted information, the user object seeing the first digest text cannot obtain from it what the user object wants to register for the resource without knowing the first registered resource, the first encrypted text, thereby avoiding the risk of information leakage and then being preempted.
In some embodiments, the preset time duration is a time duration from when the consensus node pair receives the information to when the information is synchronized to each audit node after one consensus node is selected from each audit node through a PoW mechanism. And taking the time of the consensus node as standard time, and generating a time sequence number for each request event according to the time of the consensus node every time a new request exists, wherein the time sequence number is used for identifying the time point of the request event on the decentralized system. Among them, PoW is Proof-of-Work, which literally understands the Proof of doing Work. A mechanism for obtaining consensus in a decentralized system such as a blockchain.
Optionally, the preset duration may be obtained in the following manner: receiving a second digest text before querying whether the second digest text exists according to the first digest text; synchronizing the second abstract text to each auditing node on the decentralized system; and acquiring the time length from uploading of the second abstract text to synchronous completion as preset time length. The preset time obtained by the method is compared with the actual shortest processing time of the attaching block chain to the second abstract text, so that the accuracy of inquiring the second abstract text according to the first abstract text can be improved, and the auditing efficiency can be improved.
And step 206, if yes, determining whether the first abstract text is the same as the second abstract text.
If the second abstract text uploaded by the user object exists, it needs to be compared whether the first abstract text is the same as the second abstract text, where the same meaning here means that the first abstract text hx is completely the same as the second abstract text h. If the first registration resource does not exist, the first registration resource which the user object needs to register does not meet the registration condition of the decentralized system, and response information of auditing failure is directly returned to the user object. And if the verification result does not exist, directly returning response information of the verification failure to the user object.
And 208, if the first registered resource is the same as the second registered resource, auditing the first registered resource according to the preset auditing text, synchronizing the first registered resource which passes the auditing to each auditing node, and sending response information of successful auditing to the user object.
If the first registered resource is the same as the second registered resource, determining whether the first registered resource conforms to a preset audit text; if the first registered resource is in accordance with the first registered resource, the first registered resource is determined to be approved; otherwise, determining that the first registration resource is failed to be audited. The preset audit text can be whether the registered resource is legal, such as whether legal regulations are violated, whether abusive, whether insulting, whether the country is suspected to be split, and the like. And if the first registered resource is in accordance with the preset audit text, confirming the first registered resource, synchronously disclosing the first registered resource on the decentralized system, and sending response information of successful confirmation to the user object.
And determining whether the first registered resource meets the auditing standard or not by obtaining a first abstract text according to the first registered resource and determining whether a second abstract text which is the same as the first abstract text and is uploaded by the user object before the preset time exists on the block chain or not according to the first abstract text. By the method, the risk that a malicious registrant sees the registration resources uploaded by the user object and then preempts the resources on other powerful nodes due to the fact that the registration information of the user object is published on the decentralized system before being audited and passed can be avoided. In the application, because the decentralized system S already records the corresponding relationship between the user object a and the second abstract text h, and restricts that "the user object submitting the first ciphertext S and the first registered resource m must register the second abstract text h corresponding to the first registered resource before, that is, the user object, or the registrant, is only a", and the malicious registrant cannot submit the remark because of the lack of the premise.
If the malicious registrant C now submits the registration of the second digest text h (although the malicious registrant C already knows the first registration resource m and the first cipher text S at this time, the malicious registrant C may also submit the first digest text hx), the malicious registrant C also may need a preset time T to allow the binding relationship between the corresponding first digest text h and the malicious registrant C to be confirmed by the decentralized system S. During this time T, the user object a has already completed information registration or confirmation for the first registered resource m (because this step, the user object a only needs to spend another confirmation period T), and even if the registration succeeds for the first abstract text h, the malicious registrant C does not register the first registered resource m by using the second abstract text h. In this way, the malicious registration problem can be effectively prevented.
According to the resource auditing method based on decentralization, the resource confirming step in the decentralization system is divided into two nodes, one node is to upload the second abstract information first, then process the first registered resource after receiving the registration information after a preset time length, and judge whether the first registered resource needing to be confirmed later accords with the resource auditing condition or not according to the uploaded second abstract text. Through the design, even if the information can be seen by the malicious registrant in the registration stage, due to the setting, the registration information can be completely prevented from being preempted by the malicious registrant, and the technical problem of resource preemptive registration caused by delayed confirmation and information disclosure in a decentralized system in the prior art is solved.
In some embodiments, before receiving the first registered resource and the first cipher text sent by the user object, the method further includes:
selecting a consensus node from all the audit nodes through a PoW mechanism; and taking the time from the time when the consensus node pair receives the information to the time when the information is synchronously completed to each auditing node as the preset time.
And taking the time for the contended consensus node to process the information as a shortest period, and taking the shortest period as a preset time length. If the user object uploads the second abstract text bound with the user object before the preset time for uploading the first registered resource is audited, the fact that the first registered resource which the user object wants to register is not preempted is indicated, and whether the first registered resource meets the resource auditing condition or not only needs to be checked. For example, whether someone else has registered with the same first registered resource, and if not, the first registered resource is synchronized to other auditing nodes for disclosure. If not, the response message which is registered is returned.
Preferably, rather than always having an authoritative node in the centralized system to arbitrate, all problems with a decentralized system require all nodes to compete and communicate with each other over a certain mechanism over a period of time to agree on a consensus arbitration (i.e., with a delay). The most common consensus problem is the chronological one. The authoritative node in the centralized system can simply use its own clock to arbitrate the order of arrival of the requests. However, in the decentralized system, the time of each system cannot be completely consistent, the decentralized system needs a "consensus time", and with the "consensus time", the whole decentralized system can define the sequence (for example, the sequence of various registration requests) for each event in the system, such time is generally provided by a node where one node competes for success, and a common consensus has a workload proving mechanism PoW (proof-of-work).
Among them, PoW is Proof-of-Work, which literally understands the Proof of doing Work. A mechanism for obtaining consensus in a decentralized system such as a blockchain.
That is, all nodes compete through the PoW mechanism to win the opportunity of setting the "consensus time", if one of the nodes receives the registration request of a certain user object, and the lucky node wins the competition and gets the approval of other nodes, then the consensus time t set by the auditing node X is approved by other auditing nodes, so that a fact (that the user a registers the first registration resource m at the time of the consensus time t) is also approved by all auditing nodes, the user object a is prompted to be successfully registered, and if other auditing nodes have the same registration requests of other user objects, other auditing nodes give up and inform other users of the failure of registration.
In some embodiments, the solution of the present application can solve the problem caused by the fact that the process of waiting for confirmation by all nodes requires a time t on the registration/audit node X for the request of the user object a in the decentralized system because all data are public characteristics: that is, during this time t, node X needs to do a lot of work to compete, if a malicious registrar C finds the registration information m profitable in this time window, C can initiate a registration request to preempt m and submit and broadcast on more nodes, or submit to some secret PoW-strong nodes, then C's registration information is more likely to be won by some lucky nodes in advance, and get all nodes ' approval, and then C's preempt is successful. At this time, the X node, where A submitted the request, will recognize that m has been registered and will abort and the registration of A with m will fail.
Therefore, the application also needs to compete for a consensus time before receiving the second abstract text, and generate a uniform time sequence number for each registration time for sequencing, so that the problem of registration failure of an honest registrar can be avoided when the first registration resource is subsequently checked.
It should be understood that, although the steps in the flowchart of fig. 2 are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least a portion of the steps in fig. 2 may include multiple sub-steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, and the order of performance of the sub-steps or stages is not necessarily sequential, but may be performed in turn or alternately with other steps or at least a portion of the sub-steps or stages of other steps.
In one embodiment, as shown in fig. 3, a decentralized-based resource auditing apparatus is provided, and the decentralized-based resource auditing apparatus corresponds to the decentralized-based resource auditing method in the foregoing embodiments one to one. The resource auditing device based on decentralization comprises:
the generating module 302 is configured to generate a first abstract text according to the first registered resource and the first cipher text uploaded by the user object.
The query module 304 is configured to query whether a second abstract text exists according to the first abstract text, where the second abstract text is abstract information uploaded by the user object before a preset time length.
The comparing module 306 is configured to determine whether the first abstract text is the same as the second abstract text if the first abstract text exists.
And the auditing module 308 is configured to, if the first registered resources are the same as the second registered resources, audit the first registered resources according to the preset audit text, synchronize the first registered resources that are approved to each audit node, and send response information that the audit is successful to the user object.
Further, the generating module 302 includes:
the splicing submodule is used for splicing the first registered resource and the first cipher text to obtain a first encrypted text, or is also used for carrying out exclusive or operation on each character of the first registered resource and the first cipher text to obtain a first encrypted text;
and the abstract submodule is used for carrying out message abstract processing on the first encrypted text to obtain a first abstract text.
Further, the auditing module 308 includes:
the determining submodule is used for determining whether the first registration resource conforms to a preset audit text;
the passing submodule is used for determining that the first registered resource is approved if the first registered resource is in accordance with the first registered resource;
and the failure submodule is used for determining that the first registration resource is failed to be audited when the first registration resource is not in conformity with the first registration resource.
Further, before the query module 304, the method further includes:
the receiving module is used for receiving the second abstract text;
the synchronization module is used for synchronizing the second abstract text to each auditing node on the decentralized system;
and the first duration module is used for acquiring the duration from uploading of the second abstract text to synchronous completion as preset duration.
Further, before the generating module 302, the method further includes:
the consensus module is used for selecting a consensus node from all the audit nodes through a PoW mechanism;
and the second time length module is used for taking the time length from the time when the joint consensus nodes receive the information to the time when the information is synchronously completed to each audit node as the preset time length.
According to the resource auditing device based on decentralization, the resource confirmation step in the decentralization system is split into two nodes, one node is to upload the second abstract information first, then to process the first registered resource after receiving the registration information after a preset time length, and to judge whether the first registered resource needing to be confirmed later accords with the resource auditing condition or not according to the uploaded second abstract text. Through the design, even if the information can be seen by the malicious registrant in the registration stage, due to the setting, the registration information can be completely prevented from being preempted by the malicious registrant, and the technical problem of resource preemptive registration caused by delayed confirmation and information disclosure in a decentralized system in the prior art is solved.
In one embodiment, a computer device is provided, which may be a server, the internal structure of which may be as shown in fig. 4. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, computer readable instructions, and a database. The internal memory provides an environment for the operating system and execution of computer-readable instructions in the non-volatile storage medium. The database of the computer device is used for storing the first abstract text, the second abstract text, the first registration resource and the first encrypted text. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer readable instructions, when executed by a processor, implement a decentralized based resource auditing method.
As will be understood by those skilled in the art, the computer device is a device capable of automatically performing numerical calculation and/or information processing according to a preset or stored instruction, and the hardware includes, but is not limited to, a microprocessor, an Application Specific Integrated Circuit (ASIC), a Programmable Gate Array (FPGA), a Digital Signal Processor (DSP), an embedded device, and the like. According to the embodiment, the second abstract text bound with the user object is uploaded in advance before the preset duration of uploading the first registered resource, the first abstract text generated according to the first registered resource is compared with the second abstract text, whether the user object is qualified for registering the first registered resource is determined, if yes, the first registered resource is checked according to the preset check text, and the technical problem that information resources are easy to steal and register by a bad registrant due to the fact that the registered resources on a block chain are open in the prior art is solved.
In one embodiment, a computer-readable storage medium is provided, on which computer-readable instructions are stored, and when executed by a processor, implement the steps of the decentralized-based resource auditing method in the above-described embodiments, such as step 202 to step 208 shown in fig. 2, or implement the functions of the modules/units of the decentralized-based resource auditing apparatus in the above-described embodiments, such as the functions of module 302 to module 308 shown in fig. 3.
According to the embodiment, the second abstract text bound with the user object is uploaded in advance before the preset duration of uploading the first registered resource, the first abstract text generated according to the first registered resource is compared with the second abstract text, whether the user object is qualified for registering the first registered resource is determined, if yes, the first registered resource is checked according to the preset check text, and the technical problem that information resources are easy to steal and register by a bad registrant due to the fact that the registered resources on a block chain are open in the prior art is solved.
It will be understood by those of ordinary skill in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware associated with computer readable instructions, which can be stored in a non-volatile computer readable storage medium, and when executed, can include processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
The block chain referred by the application is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, a consensus mechanism, an encryption algorithm and the like. A block chain (Blockchain), which is essentially a decentralized database, is a series of data blocks associated by using a cryptographic method, and each data block contains information of a batch of network transactions, so as to verify the validity (anti-counterfeiting) of the information and generate a next block. The blockchain may include a blockchain underlying platform, a platform product service layer, an application service layer, and the like.
It will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-mentioned division of the functional units and modules is illustrated, and in practical applications, the above-mentioned function distribution may be performed by different functional units and modules according to needs, that is, the internal structure of the apparatus is divided into different functional units or modules to perform all or part of the above-mentioned functions.
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for those skilled in the art, without departing from the spirit and scope of the present invention, several changes, modifications and equivalent substitutions of some technical features may be made, and these changes or substitutions do not make the essence of the same technical solution depart from the spirit and scope of the technical solution of the embodiments of the present invention. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (10)
1. A resource auditing method based on decentralization is applied to a decentralization system, and is characterized in that the decentralization system comprises a plurality of auditing nodes used for resource auditing, and the method comprises the following steps:
generating a first abstract text according to a first registration resource and a first cipher text uploaded by a user object;
whether a second abstract text exists is inquired according to the first abstract text, wherein the second abstract text is abstract information uploaded by the user object before a preset time length;
if so, determining whether the first abstract text is the same as the second abstract text;
and if the verification results are the same, the first registration resource is verified according to a preset verification text, the first registration resource passing the verification is synchronized to each verification node, and response information of successful verification is sent to the user object.
2. The method of claim 1, wherein generating the first abstract text from the first registered resource and the first cipher text uploaded by the user object comprises:
splicing the first registration resource and the first cipher text to obtain a first encrypted text, or,
performing exclusive or operation on each character of the first registration resource and the first cipher text to obtain a first encrypted text;
and performing message digest processing on the first encrypted text to obtain the first digest text.
3. The method of claim 2, wherein said message digest processing said first encrypted text to obtain said first digest text comprises:
and processing the first encrypted text through a hash algorithm to obtain the first abstract text.
4. The method of claim 1, wherein auditing the first registered resource according to a pre-defined audit text comprises:
determining whether the first registration resource conforms to the preset audit text;
if the first registered resource is in accordance with the first registered resource, the first registered resource is determined to be approved;
otherwise, determining that the first registration resource is failed to be audited.
5. The method of claim 1, prior to said querying whether a second abstract text exists according to the first abstract text, further comprising:
receiving the second abstract text;
synchronizing the second abstract text to each auditing node on the decentralized system;
and acquiring the time length from uploading of the second abstract text to synchronous completion as the preset time length.
6. The method of claim 5, wherein the second summary text is generated by the user terminal based on the first registered resource and the first cipher text.
7. The method of claim 1, further comprising, prior to generating the first abstract text from the first registered resource and the first cipher text uploaded by the user object:
selecting a consensus node from all the audit nodes through a PoW mechanism;
and taking the time from the time when the consensus node pair receives the information to the time when the information is synchronously completed on each auditing node as the preset time.
8. A resource auditing device based on decentralization is applied to a decentralization system, and is characterized in that the decentralization system comprises a plurality of auditing nodes for resource auditing, and the device comprises:
the generating module is used for generating a first abstract text according to the first registration resource and the first cipher text uploaded by the user object;
the query module is used for querying whether a second abstract text exists according to the first abstract text, wherein the second abstract text is abstract information uploaded by the user object before a preset time length;
the comparison module is used for confirming whether the first abstract text is the same as the second abstract text if the first abstract text exists;
and the auditing module is used for auditing the first registered resource according to a preset auditing text if the first registered resource is the same as the preset auditing text, synchronizing the first registered resource which passes the auditing to each auditing node, and sending response information of successful auditing to the user object.
9. A computer device comprising a memory and a processor, the memory storing computer readable instructions, wherein the processor when executing the computer readable instructions implements the steps of the method of any one of claims 1 to 7.
10. A computer readable storage medium having computer readable instructions stored thereon, which when executed by a processor implement the steps of the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010930244.5A CN112052660A (en) | 2020-09-07 | 2020-09-07 | Resource auditing method and device based on decentralization, computer equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010930244.5A CN112052660A (en) | 2020-09-07 | 2020-09-07 | Resource auditing method and device based on decentralization, computer equipment and medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112052660A true CN112052660A (en) | 2020-12-08 |
Family
ID=73610444
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010930244.5A Pending CN112052660A (en) | 2020-09-07 | 2020-09-07 | Resource auditing method and device based on decentralization, computer equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112052660A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115150355A (en) * | 2021-03-15 | 2022-10-04 | 正链科技(深圳)有限公司 | Method for realizing distributed domain name |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108809904A (en) * | 2017-05-03 | 2018-11-13 | 互联网域名系统北京市工程研究中心有限公司 | A kind of checking method and system of domain name registration |
| CN109377626A (en) * | 2018-12-13 | 2019-02-22 | 深圳市云歌人工智能技术有限公司 | The method of electronic lock information processing and the acquisition electronic lock right to use based on block chain |
| CN110008747A (en) * | 2019-04-01 | 2019-07-12 | 北京柏链基石科技有限公司 | A kind of guard method, device and the electronic equipment of the private data based on block chain |
| US20190220615A1 (en) * | 2016-09-19 | 2019-07-18 | China Unionpay Co., Ltd. | Resource File Processing System and Method Based on Blockchain Structure |
| CN110537346A (en) * | 2017-03-06 | 2019-12-03 | 诺基亚技术有限公司 | Safe decentralization domain name system |
| CN111008365A (en) * | 2019-11-27 | 2020-04-14 | 山东爱城市网信息技术有限公司 | Block chain-based electronic academic work copyright management system, equipment and medium |
-
2020
- 2020-09-07 CN CN202010930244.5A patent/CN112052660A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190220615A1 (en) * | 2016-09-19 | 2019-07-18 | China Unionpay Co., Ltd. | Resource File Processing System and Method Based on Blockchain Structure |
| CN110537346A (en) * | 2017-03-06 | 2019-12-03 | 诺基亚技术有限公司 | Safe decentralization domain name system |
| CN108809904A (en) * | 2017-05-03 | 2018-11-13 | 互联网域名系统北京市工程研究中心有限公司 | A kind of checking method and system of domain name registration |
| CN109377626A (en) * | 2018-12-13 | 2019-02-22 | 深圳市云歌人工智能技术有限公司 | The method of electronic lock information processing and the acquisition electronic lock right to use based on block chain |
| CN110008747A (en) * | 2019-04-01 | 2019-07-12 | 北京柏链基石科技有限公司 | A kind of guard method, device and the electronic equipment of the private data based on block chain |
| CN111008365A (en) * | 2019-11-27 | 2020-04-14 | 山东爱城市网信息技术有限公司 | Block chain-based electronic academic work copyright management system, equipment and medium |
Non-Patent Citations (1)
| Title |
|---|
| 喻恒彦: "基于区块链技术 的存证系统设计与实现", 《中国优秀硕士学位论文全文数据库》, 15 January 2019 (2019-01-15), pages 1 - 71 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115150355A (en) * | 2021-03-15 | 2022-10-04 | 正链科技(深圳)有限公司 | Method for realizing distributed domain name |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110213223B (en) | Service management method, device, system, computer equipment and storage medium | |
| US20180374097A1 (en) | A distributed user profile identity verification system for e-commerce transaction security | |
| RU2346398C2 (en) | System and method of transferring shortcut information from certificate used for encryptation operations | |
| CN108769230B (en) | Transaction data storage method, device, server and storage medium | |
| US9401911B2 (en) | One-time password certificate renewal | |
| CN105119973B (en) | User information processing method and server | |
| US20100077467A1 (en) | Authentication service for seamless application operation | |
| US11296881B2 (en) | Using IP heuristics to protect access tokens from theft and replay | |
| CN110177124B (en) | Identity authentication method based on block chain and related equipment | |
| JP2017509964A (en) | Virtual identity of users based on heterogeneous identity services | |
| CN113014676A (en) | System and method for storing Internet of things data into block chain based on SIM card | |
| CN111177735A (en) | Identity authentication method, device, system and equipment and storage medium | |
| CN113271311A (en) | Digital identity management method and system in cross-link network | |
| CN112468540A (en) | Data distribution method, device and medium based on cloud platform | |
| CN112311779A (en) | Data access control method and device applied to block chain system | |
| CN114239072A (en) | Block chain node management method and block chain network | |
| US20230403154A1 (en) | Verifier credential determination by a registrant | |
| CN112052660A (en) | Resource auditing method and device based on decentralization, computer equipment and medium | |
| CN109525613B (en) | Request processing system and method | |
| CN112037054A (en) | Method and computer readable medium for hiding a user's quota of assets in a decentralized identity system | |
| CN112738005A (en) | Access processing method, device, system, first authentication server and storage medium | |
| CN115134088A (en) | Client certificate verification method and system and electronic equipment | |
| CN111723347B (en) | Identity authentication method, identity authentication device, electronic equipment and storage medium | |
| CN111988298A (en) | Data processing method, device and equipment | |
| US11146407B2 (en) | Digital certificate validation using untrusted data |
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 |