CN110781153A - Cross-application information sharing method and system based on block chain - Google Patents
Cross-application information sharing method and system based on block chain Download PDFInfo
- Publication number
- CN110781153A CN110781153A CN201911046661.7A CN201911046661A CN110781153A CN 110781153 A CN110781153 A CN 110781153A CN 201911046661 A CN201911046661 A CN 201911046661A CN 110781153 A CN110781153 A CN 110781153A
- Authority
- CN
- China
- Prior art keywords
- application
- block chain
- main chain
- user
- detection result
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 84
- 238000012544 monitoring process Methods 0.000 claims abstract description 97
- 230000008569 process Effects 0.000 claims abstract description 26
- 238000001514 detection method Methods 0.000 claims description 82
- 238000012545 processing Methods 0.000 claims description 55
- 230000003993 interaction Effects 0.000 claims description 9
- 238000012937 correction Methods 0.000 claims description 8
- 238000004364 calculation method Methods 0.000 claims description 7
- 230000002787 reinforcement Effects 0.000 claims description 6
- 238000004891 communication Methods 0.000 claims description 5
- 238000012216 screening Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 20
- 238000004590 computer program Methods 0.000 description 12
- 230000006870 function Effects 0.000 description 11
- 238000012549 training Methods 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 3
- 238000005070 sampling Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000011017 operating method Methods 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000005611 electricity Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 238000011022 operating instruction Methods 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 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
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/17—Details of further file system functions
- G06F16/176—Support for shared access to files; File sharing support
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- General Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Development Economics (AREA)
- General Business, Economics & Management (AREA)
- Technology Law (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- Economics (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The method of the embodiment of the invention provides a block chain-based cross-application information sharing method and a block chain-based cross-application information sharing system, the whole system comprises a client server, a client and a block chain system, the block chain system also comprises a block chain main chain, a node and a monitoring node, after receiving a sharing request of the client, the system receives, judges, processes, sends and stores the request through the block chain system, and through the decentralized thought of the block chain, the safety and storage problems of cross-application information are solved, and the operation and storage pressure of the client server is relieved.
Description
[ technical field ] A method for producing a semiconductor device
The invention relates to the technical field of block chains, in particular to a block chain-based cross-application information sharing method and system.
[ background of the invention ]
In recent years, with the rapid development of the internet, the desire for interpersonal communication has become stronger, and the number of social applications has also increased explosively. A user often installs multiple application clients on a terminal, each application has a corresponding friend, and if the user 1 is on an application A interface, the user 2 only has a friend relationship with the user 1 on an application B; if the user 1 and the user 2 share information at this time, the user 1 needs to leave the application a interface and then enter the application B interface to perform information sharing, and in the prior art, the problem is solved by setting a transfer server to perform information transfer, and an information record does not belong to the server of the application a or the server of the application B, and is in a vacuum state similar to "three regardless", which brings great examination to the safety and storage of information.
[ summary of the invention ]
In view of this, embodiments of the present invention provide a block chain-based cross-application information sharing method and system.
In a first aspect, an embodiment of the present invention provides a block chain-based cross-application information sharing method, where the method includes:
s1, receiving a sharing request of a user by the block chain main chain, wherein the sharing request at least comprises shared data, a sending application identifier, a sending party identifier and a receiving party identifier;
s2, judging whether the sharing request is matched with at least one potential violation state recorded by the risk list table by the block chain main chain, if so, generating a data monitoring packet and sending the data monitoring packet to the block chain main chain, and entering S3, otherwise, entering S5;
s3, the nodes randomly acquire data monitoring packets from the block chain main chain, generate detection results after processing, broadcast the detection results on the block chain full nodes, process other nodes based on block chain constraint rules after receiving the broadcast, and generate reward blocks on the block chain main chain based on the block chain constraint rules;
s4, if the detection result has risk, the block chain main chain returns the sharing request to the sender side, adds violation identification to the sender, and enters S6; otherwise, go to S5;
s5, if the block chain main chain detects that the sharing request carries a receiving application identifier, sending a notification message to the receiving application; otherwise, the block chain main chain screens out the applications meeting the preset application familiar scores, and after the applications are matched with the application list corresponding to the receiver identification, the notification message is queued and sent according to the matching result and the application priority; the application list and the application priority are both set by a user side and are stored on a block chain main chain;
s6, the blockchain backbone updates the user familiarity score and the application familiarity score.
The above-described aspects and any possible implementations further provide an implementation, and the method further includes:
if the block chain main chain receives the notification of the notification message return, the block chain main chain cancels the sending of the notification message in queuing;
if the block chain main chain receives the notification of the notification message, storing a shared data packet into the block chain main chain, the server corresponding to the sending application identifier and the server corresponding to the receiving application identifier, wherein the shared request data packet comprises: state information, shared data, sender identification, receiver identification, sending application identification and receiving application identification.
The above-described aspects and any possible implementations further provide an implementation in which the potential violation state includes:
the method comprises the following steps that a situation that a notification message corresponding to a sharing request is returned by a first priority application exists between a sender and a receiver within a preset time period, wherein the first priority comprises the following two conditions: when the sharing request carries the receiving application identifier, the receiving application is the first priority; when the sharing request does not carry the received application identifier, the application with the first rank in the application priorities is the first priority; and/or the presence of a gas in the gas,
at least one of the sender and the receiver is added with violation marks in a preset time period; and/or the presence of a gas in the gas,
at least one of the familiarity score between users of the sender and the receiver and the familiarity score between applications is less than a corresponding threshold; and/or the presence of a gas in the gas,
the registration time of at least one of the sender and the receiver is less than the preset time.
As for the above-mentioned aspects and any possible implementation manner, an implementation manner is further provided, in which a node randomly obtains a data monitoring packet from a block chain main chain, and generates a detection result after processing, specifically including:
the block chain main chain puts the newly generated data monitoring packets into a white list, puts the data monitoring packets which reach the specified acquisition times into a black list, and the nodes randomly acquire the data monitoring packets from the white list of the block chain main chain, and meanwhile, the acquisition times of the data monitoring packets are added by 1;
if the shared data is character data, judging whether the character repetition degree of a sender and the sharing request sending frequency in a preset time period exceed threshold values, if so, generating a detection result with a dangerous mark, otherwise, matching the character content with a forbidden word list, if matching is successful, generating a detection result with a dangerous mark, otherwise, generating a detection result with a safety mark;
if the picture data of the data are shared, judging whether the picture volume similarity, the picture size similarity and the sharing request sending frequency of a sender in a preset time period exceed a preset threshold value, if so, generating a detection result with a danger identifier, otherwise, learning the picture data based on a reinforcement learning model, and generating a detection result with the danger identifier or a safety identifier based on the learning result;
if the shared data is file data, judging whether the file size similarity, the file name similarity and the sharing request sending frequency of a sender in a preset time period exceed threshold values, if so, generating a detection result with a dangerous identifier, otherwise, matching the file name with a forbidden word list, if matching is successful, generating a detection result with a dangerous identifier, and otherwise, generating a detection result with a safety identifier.
The above-described aspect and any possible implementation further provide an implementation, where the notification message includes: state information, shared data, sender identification, receiver identification, sending application identification, receiving application identification, return trigger identification, and receiving trigger identification.
The above-described aspect and any possible implementation further provide an implementation, where the calculation formula of the familiarity score of the user is:
The above-described aspect and any possible implementation further provide an implementation in which the familiar score is applied by the calculation formula:
The above-described aspects and any possible implementations further provide an implementation, and the method further includes:
the method comprises the steps that a monitoring node randomly obtains a data monitoring packet, generates a monitoring detection result after processing is carried out on the basis of a node identical method, matches the monitoring detection result with a detection result of a corresponding node, reduces a credit weight of the node according to a constraint rule if matching fails, and deletes the node in a block chain main chain when the credit weight is lower than a preset threshold value.
The above-described aspects and any possible implementations further provide an implementation, and the method further includes:
the blockchain constraint rules include:
the servers corresponding to the applications capable of performing cross-application information sharing are all accessed to the block chain main chain;
each node in the block chain system only processes one data monitoring packet at a time;
in the process of processing the data monitoring packet, if other detection results based on the same data monitoring packet are received by the current node, immediately stopping processing the current data monitoring packet;
when the detection result is recorded in the form of blocks by the blockchain main chain, the blockchain main chain puts the reward blocks to the nodes with the earliest time stamps, the reward blocks can trade among the nodes, and the trade record is written into the blockchain main chain.
In a second aspect, an embodiment of the present invention provides a block chain-based cross-application information sharing system, where the system includes:
the system comprises a plurality of application servers, a server management server and a server management server, wherein each application server carries out data interaction with a corresponding application;
the system comprises a plurality of clients, a server and a server, wherein each client is provided with a plurality of applications, and at least one application corresponding to an application server exists;
the system comprises a blockchain system, a monitoring node and a plurality of nodes, wherein the blockchain system comprises a blockchain main chain, a plurality of nodes and a plurality of monitoring nodes;
the blockchain backbone comprises:
the storage layer is used for receiving a sharing request of a user and recording client data, node data and server data;
the interaction layer is used for carrying out data interaction with the nodes, the client and the server;
a handle layer, the handle layer comprising: the first judgment unit is used for judging whether the sharing request is matched with at least one potential violation state recorded by the risk list table, generating a data monitoring packet and issuing the data monitoring packet to the block chain main chain when the sharing request is matched with the at least one potential violation state, and directly entering the execution step of the processing unit when the sharing request is not matched with the at least one potential violation state;
the second judgment unit is used for receiving the detection result of the node, returning the sharing request to the sender side when the detection result has risk, adding the violation identification to the sender, and entering the execution step of the processing unit when the detection result has no risk;
the processing unit is used for sending a notification message to a receiving application when detecting that the sharing request carries a receiving application identifier; when detecting that the sharing request does not carry the received application identifier, screening out applications meeting the familiar score of the preset applications, and after matching with an application list corresponding to the receiver identifier, queuing and sending the notification message according to the matching result and the application priority;
the updating unit is used for updating the user familiarity score and the application familiarity score;
the constraint layer is used for establishing a block chain constraint rule, and specifically comprises the following steps:
the servers corresponding to the applications capable of performing cross-application information sharing are all accessed to the block chain system;
each node in the block chain system only processes one data monitoring packet at a time;
in the process of processing the data monitoring packet, if other detection results based on the same data monitoring packet are received by the current node, immediately stopping processing the current data monitoring packet;
when the detection result is recorded in a block form by the blockchain main chain, the blockchain main chain puts a reward block to the node with the earliest time stamp, the reward block can carry out transaction among the nodes, and the transaction record is written into the blockchain main chain;
the node comprises:
the receiving module is used for randomly acquiring a data monitoring packet from a block chain main chain;
the processing module is used for processing the data monitoring packet, generating a detection result, broadcasting the detection result by the block chain whole nodes, processing other nodes based on a block chain constraint rule after receiving the broadcast, and generating a reward block by a block chain main chain based on the block chain constraint rule;
the monitoring node comprises:
the acquisition module is used for randomly acquiring the data monitoring packet;
the processing module is used for processing the data monitoring packet to generate a monitoring detection result;
and the matching module is used for matching the monitoring detection result with the detection result of the corresponding node, if the matching fails, the credit weight of the node is reduced according to the constraint rule, and when the credit weight is lower than a preset threshold value, the node is deleted in the block chain system.
One of the above technical solutions has the following beneficial effects:
the method of the embodiment of the invention provides a block chain-based cross-application information sharing method and a block chain-based cross-application information sharing system, the whole system comprises a client server, a client and a block chain system, the block chain system comprises a block chain main chain, a node and a monitoring node, after receiving a sharing request of the client, the system receives, judges, processes, sends and stores the request through the block chain system, and through the decentralized thought of the block chain, the safety and storage problems of cross-application information are solved, and the operation and storage pressure of the client server is relieved.
[ description of the 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 embodiments will be briefly described 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 to obtain other drawings based on these drawings without inventive labor.
Fig. 1 is a schematic flowchart of a block chain-based cross-application information sharing method according to an embodiment of the present invention;
FIG. 2 is a flow diagram of node processing provided by an embodiment of the invention;
FIG. 3 is a schematic diagram of a client-based display of a notification message provided by an embodiment of the present invention;
fig. 4 is a block chain-based framework diagram of a cross-application information sharing method and system according to an embodiment of the present invention;
FIG. 5 is a block diagram of a blockchain backbone according to an embodiment of the present invention;
FIG. 6 is a block diagram of a block chain main chain processing layer according to an embodiment of the present invention;
FIG. 7 is a functional block diagram of a node according to an embodiment of the present invention;
FIG. 8 is a functional block diagram of a monitoring node according to an embodiment of the present invention;
fig. 9 is a hardware schematic diagram of a node device according to an embodiment of the present invention.
[ detailed description ] embodiments
In order to make the objects, technical solutions and advantages of the present invention more apparent, the technical solutions of the present invention will be described in detail and completely with reference to the following embodiments and accompanying drawings. It is to be understood that the described embodiments are merely exemplary of the invention, and not restrictive of the full scope of the invention. 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.
Please refer to fig. 1, which is a flowchart illustrating a block chain-based cross-application information sharing method according to an embodiment of the present invention in fig. 1, wherein the method includes the following steps:
s1, receiving a sharing request of a user by the block chain main chain, wherein the sharing request at least comprises shared data, a sending application identifier, a sending party identifier and a receiving party identifier;
s2, judging whether the sharing request is matched with at least one potential violation state recorded by the risk list table by the block chain main chain, if so, generating a data monitoring packet and sending the data monitoring packet to the block chain main chain, and entering S3, otherwise, entering S5;
s3, the nodes randomly acquire data monitoring packets from the block chain main chain, generate detection results after processing, broadcast the detection results on the block chain full nodes, process other nodes based on block chain constraint rules after receiving the broadcast, and generate reward blocks on the block chain main chain based on the block chain constraint rules;
s4, if the detection result has risk, the block chain main chain returns the sharing request to the sender side, adds violation identification to the sender, and enters S6; otherwise, go to S5;
s5, if the block chain main chain detects that the sharing request carries a receiving application identifier, sending a notification message to the receiving application; otherwise, the block chain main chain screens out the applications meeting the preset application familiar scores, and after the applications are matched with the application list corresponding to the receiver identification, the notification message is queued and sent according to the matching result and the application priority; the application list and the application priority are both set by a user side and are stored on a block chain main chain;
s6, the blockchain backbone updates the user familiarity score and the application familiarity score.
In the embodiment of the invention, aiming at the cross-application information sharing process, the sharing request is processed through the block chain system, and as most of calculation processing work is completed in the nodes, the load of an application server is also reduced, the sharing request is returned or sent after the processing is completed, and if the sharing request is sent, four levels of data storage are locally performed on a sender application server, a receiver application server, the block chain system and a client after the sharing request is sent; meanwhile, the method of the invention also carries out violation judgment of shared data, effectively reduces the propagation of junk information, harassment information and illegal information, purifies network space and improves the use experience of users.
It should be noted that, the method further includes:
if the block chain main chain receives the notification of the notification message return, the block chain main chain cancels the sending of the notification message in queuing;
if the block chain main chain receives the notification of the notification message, storing a shared data packet into the block chain main chain, the server corresponding to the sending application identifier and the server corresponding to the receiving application identifier, wherein the shared request data packet comprises: state information, shared data, sender identification, receiver identification, sending application identification and receiving application identification.
Illustratively, the potential violation conditions include:
the method comprises the following steps that a situation that a notification message corresponding to a sharing request is returned by a first priority application exists between a sender and a receiver within a preset time period, wherein the first priority comprises the following two conditions: when the sharing request carries the receiving application identifier, the receiving application is the first priority; when the sharing request does not carry the received application identifier, the application with the first rank in the application priorities is the first priority; and/or the presence of a gas in the gas,
at least one of the sender and the receiver is added with violation marks in a preset time period; and/or the presence of a gas in the gas,
at least one of the familiarity score between users of the sender and the receiver and the familiarity score between applications is less than a corresponding threshold; and/or the presence of a gas in the gas,
the registration time of at least one of the sender and the receiver is less than the preset time.
Fig. 2 is a schematic flow chart of node processing according to an embodiment of the present invention, please refer to fig. 2, in which a node randomly obtains a data monitoring packet from a block chain main chain, and generates a detection result after processing, the method specifically includes:
the block chain main chain puts the newly generated data monitoring packets into a white list, puts the data monitoring packets which reach the specified acquisition times into a black list, and the nodes randomly acquire the data monitoring packets from the white list of the block chain main chain, and meanwhile, the acquisition times of the data monitoring packets are added by 1;
if the shared data is character data, judging whether the character repetition degree of a sender and the sharing request sending frequency in a preset time period exceed threshold values, if so, generating a detection result with a dangerous mark, otherwise, matching the character content with a forbidden word list, if matching is successful, generating a detection result with a dangerous mark, otherwise, generating a detection result with a safety mark;
if the picture data of the data are shared, judging whether the picture volume similarity, the picture size similarity and the sharing request sending frequency of a sender in a preset time period exceed a preset threshold value, if so, generating a detection result with a danger identifier, otherwise, learning the picture data based on a reinforcement learning model, and generating a detection result with the danger identifier or a safety identifier based on the learning result;
if the shared data is file data, judging whether the file size similarity, the file name similarity and the sharing request sending frequency of a sender in a preset time period exceed threshold values, if so, generating a detection result with a dangerous identifier, otherwise, matching the file name with a forbidden word list, if matching is successful, generating a detection result with a dangerous identifier, and otherwise, generating a detection result with a safety identifier.
The embodiment of the invention provides a reinforcement learning model which can be established in the following way:
establishing a training function model based on the picture data training set:
wherein [ T]For the number of sampling steps, T ∈ [ T ]]The strategy of time is pi
(t)，c(x
t,a
t) For the cost of each step of sampling, assume that there is an optimal strategy pi
*，
To be in an optimal strategy of pi
*The cost of each next sampling step;
defining a V-function of the training function model:
and defining a Q function of the training function model: q
π(x,a)＝c(x,a)-λ
π+E[V
π(x′)|x,a](ii) a Wherein E is the number of iterations,
the training function model is split into the following three submodels, which are represented as:
wherein,
continuously training and learning the three sub-models until
And if the value is smaller than the preset threshold value, obtaining the reinforcement learning model based on the picture data.
Subsequently, the input picture data can be learned through the reinforcement learning model of the picture, and a learning result is output; and finally, generating a detection result with a danger mark or a safety mark based on the learning result.
Fig. 3 is a schematic diagram of a client-based display of a notification message according to an embodiment of the present invention, please refer to fig. 3, where the notification message includes: state information, shared data, sender identification, receiver identification, sending application identification, receiving application identification, return trigger identification, and receiving trigger identification.
Further, the calculation formula of the user familiarity score is as follows:
wherein,
representing a user familiarity score between user i and user j,
indicating that user i and user j are familiar with the score based on the application of application k,
represents the application weight of application K, K represents the number of associated applications of user i and user j in the blockchain backbone,
representing the cross-application communication frequency of user i and user j at application m and application n,
represents the cross-application weights of user i and user j at application m and application n,
represents the average of the cross-application weights of user i and user j, Offset is the Offset and satisfies
P is a correction constant, Q is a correction parameter, the correction constant and the correction parameter are related to whether the violation mark is added by the user, and the influence on P and Q is larger as the adding time is shorter.
Further, the calculation formula for applying the familiar score is as follows:
It should be noted that, if the current time is T and the time period length is L, the first update time period is (T +5L, T +6L), the second update time period is (T +4L, T +5L), the third update time period is (T +3L, T +4L), the fourth update time period is (T +2L, T +3L), the fifth update time period is (T + L, T +2L), and the sixth update time period is (T, T + L).
It should be noted that the method further includes:
the method comprises the steps that a monitoring node randomly obtains a data monitoring packet, generates a monitoring detection result after processing is carried out on the basis of a node identical method, matches the monitoring detection result with a detection result of a corresponding node, reduces a credit weight of the node according to a constraint rule if matching fails, and deletes the node in a block chain main chain when the credit weight is lower than a preset threshold value.
In order to prevent node cheating or node calculation errors, the monitoring node monitors the nodes in the blockchain system, if the above problems occur, the credit weight of the nodes is influenced, and if the credit weight is low to a certain degree, the nodes are deleted from the blockchain main chain.
Further, a blockchain constraint rule, i.e. a consensus achieved by the blockchain backbone and all nodes, comprises:
the servers corresponding to the applications capable of performing cross-application information sharing are all accessed to the block chain main chain;
each node in the block chain system only processes one data monitoring packet at a time;
in the process of processing the data monitoring packet, if other detection results based on the same data monitoring packet are received by the current node, immediately stopping processing the current data monitoring packet;
when the detection result is recorded in the form of blocks by the blockchain main chain, the blockchain main chain puts the reward blocks to the nodes with the earliest time stamps, the reward blocks can trade among the nodes, and the trade record is written into the blockchain main chain.
The embodiment of the invention further provides an embodiment of a device for realizing the steps and the method in the embodiment of the method.
Please refer to fig. 4, which is a block diagram of a block chain-based cross-application information sharing method and system according to an embodiment of the present invention, the system including:
a plurality of application servers 100, each of which performs data interaction with a respective corresponding application;
a plurality of clients 200, each of which has a plurality of applications installed thereon, at least one application corresponding to the application server being present;
a blockchain system 300 comprising a blockchain backbone 310, a plurality of nodes 320, and a plurality of monitoring nodes 330;
please refer to fig. 5, which is a functional block diagram of a block chain main chain according to an embodiment of the present invention, wherein the block chain main chain 310 includes:
the storage layer 311 is used for receiving a sharing request of a user and recording client data, node data and server data;
an interaction layer 312 for performing data interaction with nodes, clients, and servers;
processing the layer 313, please refer to fig. 6, the processing 313 includes: a first determining unit 3131, configured to determine whether the sharing request matches at least one potential violation state recorded in the risk form table, generate a data monitoring packet and send the data monitoring packet to the blockchain main chain when the sharing request matches the at least one potential violation state, and directly enter an execution step of the processing unit when the sharing request does not match the at least one potential violation state;
a second determining unit 3132, configured to receive a detection result of the node, return the sharing request to the sender side when the detection result has a risk, add a violation identifier to the sender, and enter an execution step of the processing unit when the detection result has no risk;
a processing unit 3133, configured to send a notification message to a receiving application when it is detected that the sharing request carries a receiving application identifier; when detecting that the sharing request does not carry the received application identifier, screening out applications meeting the familiar score of the preset applications, and after matching with an application list corresponding to the receiver identifier, queuing and sending the notification message according to the matching result and the application priority;
an updating unit 3134 for updating the user familiarity score and the application familiarity score;
the constraint layer 314 is configured to establish a block chain constraint rule, and specifically includes:
the servers corresponding to the applications capable of performing cross-application information sharing are all accessed to the block chain system;
each node in the block chain system only processes one data monitoring packet at a time;
in the process of processing the data monitoring packet, if other detection results based on the same data monitoring packet are received by the current node, immediately stopping processing the current data monitoring packet;
when the detection result is recorded in a block form by the blockchain main chain, the blockchain main chain puts a reward block to the node with the earliest time stamp, the reward block can carry out transaction among the nodes, and the transaction record is written into the blockchain main chain;
the node 320 includes:
a receiving module 321, configured to randomly obtain a data monitoring packet from a block chain main chain;
the processing module 322 is configured to process the data monitoring packet, generate a detection result, perform block chain full-node broadcast on the detection result, process other nodes after receiving the broadcast based on a block chain constraint rule, and generate a reward block based on the block chain constraint rule in a block chain main chain;
the monitoring node 330 includes:
an obtaining module 331, configured to randomly obtain a data monitoring packet;
the processing module 332 is configured to process the data monitoring packet to generate a monitoring detection result;
a matching module 333, configured to match the monitoring detection result with the detection result of the corresponding node, and if the matching fails, reduce the credit weight of the node according to the constraint rule, and delete the node in the blockchain system when the credit weight is lower than a preset threshold.
Since each unit module in the embodiment can execute the method shown in fig. 1, reference may be made to the related description of fig. 1 for a part of the embodiment that is not described in detail.
Fig. 9 is a hardware schematic diagram of a node device according to an embodiment of the present invention. Referring to fig. 9, at a hardware level, the node device includes a processor, and optionally further includes an internal bus, a network interface, and a memory. The Memory may include a Memory, such as a Random-Access Memory (RAM), and may further include a non-volatile Memory, such as at least 1 disk Memory. Of course, the node device may also include hardware required for other services.
The processor, the network interface, and the memory may be connected to each other via an internal bus, which may be an ISA (Industry Standard Architecture) bus, a PCI (peripheral component Interconnect) bus, an EISA (Extended Industry Standard Architecture) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one double-headed arrow is shown in FIG. 9, but this does not indicate only one bus or one type of bus.
And the memory is used for storing programs. In particular, the program may include program code comprising computer operating instructions. The memory may include both memory and non-volatile storage and provides instructions and data to the processor.
In a possible implementation manner, the processor reads the corresponding computer program from the nonvolatile memory into the memory and then runs the computer program, and the corresponding computer program can also be obtained from other equipment so as to form a pricing device of the electricity price on a logic level. And the processor executes the program stored in the memory so as to realize the node working method provided by any embodiment of the invention through the executed program.
An embodiment of the present invention further provides a computer-readable storage medium storing one or more programs, where the one or more programs include instructions, which when executed by a node device including a plurality of application programs, enable the node device to execute the node operating method provided in any embodiment of the present invention.
The method performed by the node device according to the embodiment of the present invention may be applied to or implemented by a processor. The processor may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware in a processor or instructions in the form of software. The Processor may be a general-purpose Processor, including a Central Processing Unit (CPU), a Network Processor (NP), and the like; but also Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components. The various methods, steps and logic blocks disclosed in the embodiments of the present invention may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The steps of the method disclosed in connection with the embodiments of the present invention may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor. The software module may be located in ram, flash memory, rom, prom, or eprom, registers, etc. storage media as is well known in the art. The storage medium is located in a memory, and a processor reads information in the memory and completes the steps of the method in combination with hardware of the processor.
An embodiment of the present invention further provides a computer-readable storage medium storing one or more programs, where the one or more programs include instructions, which when executed by a node device including a plurality of application programs, enable the node device to execute the node operating method provided in any embodiment of the present invention.
The systems, devices, modules or units illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. One typical implementation device is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a cellular telephone, a camera phone, a smartphone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.
For convenience of description, the above devices are described as being divided into various units or modules by function, respectively. Of course, the functionality of the units or modules may be implemented in the same one or more software and/or hardware when implementing the invention.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The invention 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 invention 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.
The embodiments of the present invention are described in a progressive manner, and the same and similar parts among the embodiments can be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
The above description is only an example of the present invention, and is not intended to limit the present invention. Various modifications and alterations to this invention will become apparent to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention should be included in the scope of the claims of the present invention.
Claims (10)
1. A block chain-based cross-application information sharing method is characterized by comprising the following steps:
s1, receiving a sharing request of a user by the block chain main chain, wherein the sharing request at least comprises shared data, a sending application identifier, a sending party identifier and a receiving party identifier;
s2, judging whether the sharing request is matched with at least one potential violation state recorded by the risk list table by the block chain main chain, if so, generating a data monitoring packet and sending the data monitoring packet to the block chain main chain, and entering S3, otherwise, entering S5;
s3, the nodes randomly acquire data monitoring packets from the block chain main chain, generate detection results after processing, broadcast the detection results on the block chain full nodes, process other nodes based on block chain constraint rules after receiving the broadcast, and generate reward blocks on the block chain main chain based on the block chain constraint rules;
s4, if the detection result has risk, the block chain main chain returns the sharing request to the sender side, adds violation identification to the sender, and enters S6; otherwise, go to S5;
s5, if the block chain main chain detects that the sharing request carries a receiving application identifier, sending a notification message to the receiving application; otherwise, the block chain main chain screens out the applications meeting the preset application familiar scores, and after the applications are matched with the application list corresponding to the receiver identification, the notification message is queued and sent according to the matching result and the application priority; the application list and the application priority are both set by a user side and are stored on a block chain main chain;
s6, the blockchain backbone updates the user familiarity score and the application familiarity score.
2. The method of claim 1, further comprising:
if the block chain main chain receives the notification of the notification message return, the block chain main chain cancels the sending of the notification message in queuing;
if the block chain main chain receives the notification of the notification message, storing a shared data packet into the block chain main chain, the server corresponding to the sending application identifier and the server corresponding to the receiving application identifier, wherein the shared request data packet comprises: state information, shared data, sender identification, receiver identification, sending application identification and receiving application identification.
3. The method of claim 1, wherein the potential violation status comprises:
the method comprises the following steps that a situation that a notification message corresponding to a sharing request is returned by a first priority application exists between a sender and a receiver within a preset time period, wherein the first priority comprises the following two conditions: when the sharing request carries the receiving application identifier, the receiving application is the first priority; when the sharing request does not carry the received application identifier, the application with the first rank in the application priorities is the first priority; and/or the presence of a gas in the gas,
at least one of the sender and the receiver is added with violation marks in a preset time period; and/or the presence of a gas in the gas,
at least one of the familiarity score between users of the sender and the receiver and the familiarity score between applications is less than a corresponding threshold; and/or the presence of a gas in the gas,
the registration time of at least one of the sender and the receiver is less than the preset time.
4. The method of claim 1, wherein the node randomly obtains the data monitoring packet from the blockchain backbone, processes the data monitoring packet to generate a detection result, and specifically comprises:
the block chain main chain puts the newly generated data monitoring packets into a white list, puts the data monitoring packets which reach the specified acquisition times into a black list, and the nodes randomly acquire the data monitoring packets from the white list of the block chain main chain, and meanwhile, the acquisition times of the data monitoring packets are added by 1;
if the shared data is character data, judging whether the character repetition degree of a sender and the sharing request sending frequency in a preset time period exceed threshold values, if so, generating a detection result with a dangerous mark, otherwise, matching the character content with a forbidden word list, if matching is successful, generating a detection result with a dangerous mark, otherwise, generating a detection result with a safety mark;
if the picture data of the data are shared, judging whether the picture volume similarity, the picture size similarity and the sharing request sending frequency of a sender in a preset time period exceed a preset threshold value, if so, generating a detection result with a danger identifier, otherwise, learning the picture data based on a reinforcement learning model, and generating a detection result with the danger identifier or a safety identifier based on the learning result;
if the shared data is file data, judging whether the file size similarity, the file name similarity and the sharing request sending frequency of a sender in a preset time period exceed threshold values, if so, generating a detection result with a dangerous identifier, otherwise, matching the file name with a forbidden word list, if matching is successful, generating a detection result with a dangerous identifier, and otherwise, generating a detection result with a safety identifier.
5. The method of claim 1, wherein the notification message comprises: state information, shared data, sender identification, receiver identification, sending application identification, receiving application identification, return trigger identification, and receiving trigger identification.
6. The method of claim 1, wherein the user familiarity score is calculated by the formula:
7. The method of claim 1, wherein the calculation formula for applying the familiarity score is:
8. The method of claim 1, further comprising:
the method comprises the steps that a monitoring node randomly obtains a data monitoring packet, generates a monitoring detection result after processing is carried out on the basis of a node identical method, matches the monitoring detection result with a detection result of a corresponding node, reduces a credit weight of the node according to a constraint rule if matching fails, and deletes the node in a block chain main chain when the credit weight is lower than a preset threshold value.
9. The method of claim 1, wherein the blockchain constraint rule comprises:
the servers corresponding to the applications capable of performing cross-application information sharing are all accessed to the block chain main chain;
each node in the block chain system only processes one data monitoring packet at a time;
in the process of processing the data monitoring packet, if other detection results based on the same data monitoring packet are received by the current node, immediately stopping processing the current data monitoring packet;
when the detection result is recorded in the form of blocks by the blockchain main chain, the blockchain main chain puts the reward blocks to the nodes with the earliest time stamps, the reward blocks can trade among the nodes, and the trade record is written into the blockchain main chain.
10. A block chain based cross-application information sharing system, comprising:
the system comprises a plurality of application servers, a server management server and a server management server, wherein each application server carries out data interaction with a corresponding application;
the system comprises a plurality of clients, a server and a server, wherein each client is provided with a plurality of applications, and at least one application corresponding to an application server exists;
the system comprises a blockchain system, a monitoring node and a plurality of nodes, wherein the blockchain system comprises a blockchain main chain, a plurality of nodes and a plurality of monitoring nodes;
the blockchain backbone comprises:
the storage layer is used for receiving a sharing request of a user and recording client data, node data and server data;
the interaction layer is used for carrying out data interaction with the nodes, the client and the server;
a handle layer, the handle layer comprising: the first judgment unit is used for judging whether the sharing request is matched with at least one potential violation state recorded by the risk list table, generating a data monitoring packet and issuing the data monitoring packet to the block chain main chain when the sharing request is matched with the at least one potential violation state, and directly entering the execution step of the processing unit when the sharing request is not matched with the at least one potential violation state;
the second judgment unit is used for receiving the detection result of the node, returning the sharing request to the sender side when the detection result has risk, adding the violation identification to the sender, and entering the execution step of the processing unit when the detection result has no risk;
the processing unit is used for sending a notification message to a receiving application when detecting that the sharing request carries a receiving application identifier; when detecting that the sharing request does not carry the received application identifier, screening out applications meeting the familiar score of the preset applications, and after matching with an application list corresponding to the receiver identifier, queuing and sending the notification message according to the matching result and the application priority;
the updating unit is used for updating the user familiarity score and the application familiarity score;
the constraint layer is used for establishing a block chain constraint rule, and specifically comprises the following steps:
the servers corresponding to the applications capable of performing cross-application information sharing are all accessed to the block chain system;
each node in the block chain system only processes one data monitoring packet at a time;
in the process of processing the data monitoring packet, if other detection results based on the same data monitoring packet are received by the current node, immediately stopping processing the current data monitoring packet;
when the detection result is recorded in a block form by the blockchain main chain, the blockchain main chain puts a reward block to the node with the earliest time stamp, the reward block can carry out transaction among the nodes, and the transaction record is written into the blockchain main chain;
the node comprises:
the receiving module is used for randomly acquiring a data monitoring packet from a block chain main chain;
the processing module is used for processing the data monitoring packet, generating a detection result, broadcasting the detection result by the block chain whole nodes, processing other nodes based on a block chain constraint rule after receiving the broadcast, and generating a reward block by a block chain main chain based on the block chain constraint rule;
the monitoring node comprises:
the acquisition module is used for randomly acquiring the data monitoring packet;
the processing module is used for processing the data monitoring packet to generate a monitoring detection result;
and the matching module is used for matching the monitoring detection result with the detection result of the corresponding node, if the matching fails, the credit weight of the node is reduced according to the constraint rule, and when the credit weight is lower than a preset threshold value, the node is deleted in the block chain system.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911046661.7A CN110781153B (en) | 2019-10-30 | 2019-10-30 | Cross-application information sharing method and system based on block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911046661.7A CN110781153B (en) | 2019-10-30 | 2019-10-30 | Cross-application information sharing method and system based on block chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110781153A true CN110781153A (en) | 2020-02-11 |
| CN110781153B CN110781153B (en) | 2020-08-04 |
Family
ID=69387880
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911046661.7A Active CN110781153B (en) | 2019-10-30 | 2019-10-30 | Cross-application information sharing method and system based on block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110781153B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111047450A (en) * | 2020-03-18 | 2020-04-21 | 支付宝(杭州)信息技术有限公司 | Method and device for calculating down-link privacy of on-link data |
| CN112561539A (en) * | 2020-12-28 | 2021-03-26 | 链博(成都)科技有限公司 | Block chain-based security risk prevention and control method and system |
| CN117201203A (en) * | 2023-11-07 | 2023-12-08 | 西安芝麻数据科技发展有限公司 | Block chain-based supply chain data secure sharing system and method |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108055138A (en) * | 2018-02-01 | 2018-05-18 | 国家计算机网络与信息安全管理中心 | Distributed recorder method and system is applied based on block chain |
| CN108564515A (en) * | 2018-04-24 | 2018-09-21 | 深圳市亿道数码技术有限公司 | A kind of ecological value sharing method and system based on block chain |
| CN108632284A (en) * | 2018-05-10 | 2018-10-09 | 网易（杭州）网络有限公司 | User data authorization method, medium, device and computing device based on block chain |
| CN108805409A (en) * | 2018-05-08 | 2018-11-13 | 武汉大学 | A kind of key foundation equipment information management method based on block chain |
| CN109086622A (en) * | 2018-07-25 | 2018-12-25 | 深圳慧安康科技有限公司 | A kind of implementation method and node device of intelligence community |
| CN109326337A (en) * | 2018-09-06 | 2019-02-12 | 西安电子科技大学 | Electronic medical record storage and shared model and method based on block chain |
| CN109376534A (en) * | 2018-09-26 | 2019-02-22 | 百度在线网络技术（北京）有限公司 | Method and apparatus for detecting application |
| US20190158482A1 (en) * | 2016-08-04 | 2019-05-23 | Quan Wang | Token based network service among iot applications |
-
2019
- 2019-10-30 CN CN201911046661.7A patent/CN110781153B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190158482A1 (en) * | 2016-08-04 | 2019-05-23 | Quan Wang | Token based network service among iot applications |
| CN108055138A (en) * | 2018-02-01 | 2018-05-18 | 国家计算机网络与信息安全管理中心 | Distributed recorder method and system is applied based on block chain |
| CN108564515A (en) * | 2018-04-24 | 2018-09-21 | 深圳市亿道数码技术有限公司 | A kind of ecological value sharing method and system based on block chain |
| CN108805409A (en) * | 2018-05-08 | 2018-11-13 | 武汉大学 | A kind of key foundation equipment information management method based on block chain |
| CN108632284A (en) * | 2018-05-10 | 2018-10-09 | 网易（杭州）网络有限公司 | User data authorization method, medium, device and computing device based on block chain |
| CN109086622A (en) * | 2018-07-25 | 2018-12-25 | 深圳慧安康科技有限公司 | A kind of implementation method and node device of intelligence community |
| CN109326337A (en) * | 2018-09-06 | 2019-02-12 | 西安电子科技大学 | Electronic medical record storage and shared model and method based on block chain |
| CN109376534A (en) * | 2018-09-26 | 2019-02-22 | 百度在线网络技术（北京）有限公司 | Method and apparatus for detecting application |
Non-Patent Citations (1)
| Title |
|---|
| 张国强: "基于区块链技术的互联网用户信息保护策略研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111047450A (en) * | 2020-03-18 | 2020-04-21 | 支付宝(杭州)信息技术有限公司 | Method and device for calculating down-link privacy of on-link data |
| CN112561539A (en) * | 2020-12-28 | 2021-03-26 | 链博(成都)科技有限公司 | Block chain-based security risk prevention and control method and system |
| CN117201203A (en) * | 2023-11-07 | 2023-12-08 | 西安芝麻数据科技发展有限公司 | Block chain-based supply chain data secure sharing system and method |
| CN117201203B (en) * | 2023-11-07 | 2024-02-23 | 西安芝麻数据科技发展有限公司 | Block chain-based supply chain data secure sharing system and method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110781153B (en) | 2020-08-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109347787B (en) | Identity information identification method and device | |
| CN110781153B (en) | Cross-application information sharing method and system based on block chain | |
| JP2021504847A (en) | Cross-blockchain interaction methods, devices, systems, and electronic devices | |
| JP2019070912A (en) | Security evaluation system and method for the same | |
| CN110740356B (en) | Live broadcast data monitoring method and system based on block chain | |
| WO2020248658A1 (en) | Abnormal account detection method and apparatus | |
| KR20190067194A (en) | Methods, devices, and servers for account login | |
| CN107818301B (en) | Method and device for updating biological characteristic template and electronic equipment | |
| US20200257749A1 (en) | Method and a device for friend recommendation | |
| CN105389488B (en) | Identity identifying method and device | |
| CN110022345B (en) | Method, system, device and equipment for processing request in alliance chain | |
| CN113268336B (en) | Service acquisition method, device, equipment and readable medium | |
| CN110874650B (en) | Alliance learning method, device and system fusing public domain data and private data | |
| TWI706362B (en) | Data processing method, device and server based on blockchain | |
| CN110708163B (en) | Block chain consensus method, device and system and electronic equipment | |
| CN108335131B (en) | Method and device for estimating age bracket of user and electronic equipment | |
| CN110874637B (en) | Multi-target fusion learning method, device and system based on privacy data protection | |
| CN106611137B (en) | Risk control method and device | |
| CN112822267B (en) | Data processing method and device based on block chain | |
| CN110046901A (en) | Reliability verification method, system, device and the equipment of alliance's chain | |
| CN110743169B (en) | Anti-cheating method and system based on block chain | |
| CN110874647A (en) | Private data evaluation and league learning method, device and system in league learning | |
| CN110278241B (en) | Registration request processing method and device | |
| CN110059097B (en) | Data processing method and device | |
| CN108632348B (en) | Service checking method and device |
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 | ||
| CB03 | Change of inventor or designer information | ||
| CB03 | Change of inventor or designer information |
Inventor after: Li Wenzhong Inventor after: Li Jiajing Inventor after: Zhang Changjin Inventor after: Yuan Zhaoxia Inventor before: Yuan Zhaoxia |
|
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200709 Address after: Floor 3, No.19, Chaofeng Road, Zhengzhou Economic and Technological Development Zone, Zhengzhou, Henan Province Applicant after: Zhongdao xinzhifang Technology Development Co.,Ltd. Address before: No. 48, Wuzhuang team, Fengbei village, Fucheng Town, Fengyang County, Chuzhou City, Anhui Province Applicant before: Yuan Zhaoxia |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP02 | Change in the address of a patent holder | ||
| CP02 | Change in the address of a patent holder |
Address after: 571900 5001, 4th floor, incubation building, Hainan Ecological Software Park, high tech Industrial Demonstration Zone, Laocheng Town, Chengmai County, Hainan Province Patentee after: Zhongdao xinzhifang Technology Development Co.,Ltd. Address before: 450000 floor 3, No. 19 Chaofeng Road, Zhengzhou Economic and Technological Development Zone, Henan Province Patentee before: Zhongdao xinzhifang Technology Development Co.,Ltd. |