CN113449029B - Friend circle synchronization method and system in off-center environment - Google Patents
Friend circle synchronization method and system in off-center environment Download PDFInfo
- Publication number
- CN113449029B CN113449029B CN202010162802.8A CN202010162802A CN113449029B CN 113449029 B CN113449029 B CN 113449029B CN 202010162802 A CN202010162802 A CN 202010162802A CN 113449029 B CN113449029 B CN 113449029B
- Authority
- CN
- China
- Prior art keywords
- node
- data
- request
- broadcast packet
- friend circle
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 18
- 230000008520 organization Effects 0.000 claims abstract description 13
- 230000000977 initiatory effect Effects 0.000 claims abstract description 11
- 238000013075 data extraction Methods 0.000 claims abstract description 10
- 238000012795 verification Methods 0.000 claims abstract description 7
- 238000007726 management method Methods 0.000 description 8
- 238000010586 diagram Methods 0.000 description 5
- 230000001360 synchronised effect Effects 0.000 description 4
- 238000013500 data storage Methods 0.000 description 2
- 239000003999 initiator Substances 0.000 description 2
- 108010015780 Viral Core Proteins Proteins 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008094 contradictory effect Effects 0.000 description 1
- 239000008358 core component Substances 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
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/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
-
- 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
- G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/01—Social networking
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a friend circle synchronization method in a decentralizing environment, which comprises an initiating organization, a data extraction module, a node data synchronization completion and a friend circle synchronization completion, wherein the initiating organization is further divided into an A node signature, a B node signature and a verification.
Description
Technical Field
The invention relates to the field of blockchains, in particular to a friend circle synchronization method and system in an off-center environment.
Background
Along with the large-scale popularization of online social contact, the data centralization trend is more obvious, so that the problem of privacy security leakage caused by the data centralization trend is more serious, the problem of limiting the further development of the online social contact is also caused, along with the further popularization of the online social contact, the social contact requirement of people in a vertical subdivision scene is also more vigorous, and the privacy problem becomes a contradictory focus in the popularization process. For example, private information exchange between lovers, circulation of financial data in a company, internal sharing of private parties and the like are difficult to apply deeply in the current online social mode. Therefore, how to provide a method for sharing information in a small circle without a centralized service mechanism, data can be safely shared in a small circle without submitting the data to any third party, the data can be timely withdrawn when the sharing is not wanted, and meanwhile, the method can support billions of people worldwide to simultaneously construct the small circles on line to share the information with each other, so that the method becomes an urgent problem to be solved.
Disclosure of Invention
The invention aims to provide a friend circle synchronization method in a decentralizing environment, and the technical scheme of the invention comprises the following steps of:
(1) Initiating organization, specifically comprising the following steps:
(1.1) node a signature: starting an A node, creating an empty broadcast packet for creating a group through a friend circle organizer, filling group information, filling own position information into the broadcast packet, signing the A node for the broadcast packet through the friend circle organizer, and then sending the signed broadcast packet to a target node B;
(1.2) node B signature: the node B receives the broadcast packet sent in the step (1.1), analyzes the broadcast content through a friend circle organizer, updates group information and group position information, then creates the broadcast packet requested to be added, fills the password for the broadcast packet through the friend circle organizer and signs the password, and then sends the broadcast packet to the node A;
(1.3) checking: the node B creates a group locally through a friend circle organizer, requests the node A to add the group to local group members in the group, receives the adding request and analyzes the request content, then the node A checks whether the secret key in the request broadcast packet meets the requirement and whether the broadcast packet is the request of the node B through the friend circle organizer, if any item of the secret key does not pass the check, the request is discarded, if all the items of the secret key do not pass the check, the node A adds the node B to the local group members, and then the node A and the node B start synchronizing the friend circle and extract the local group member nodes;
(2) Extracting data: the data synchronizer circulates the node list to extract a node from the node list, and sends a synchronization request to the node, the extracted target node checks whether the source of the synchronization request is in a friend circle, whether the request content is legal and whether the request time range is out of limit through a service provider, any item of check is not passed, the request is discarded, and if all the check passes, the data of the local time range is extracted;
(3) And finishing node data synchronization: the service provider sends data to the request node, the request node receives the downloaded data through the data synchronizer and checks the validity of the data, and after the data passes the check, the data is stored in the local so as to finish the data synchronization of friends of the node;
(4) Complete friend circle synchronization: and (3) returning to the step (2) to extract other nodes until all the nodes complete circle synchronization of friends, thereby completing circle synchronization of friends.
Further, in the step (1.1), the group information is a group name and an admission key.
Further, in step (1.1), the broadcast packet is sent to the target node B in the form of an offline two-dimensional code.
The invention also discloses a friend circle synchronization system in the decentralizing environment, which is characterized by comprising an initiating organization module, a data extraction module, a node data synchronization completion module and a friend circle synchronization completion module, wherein the initiating organization module is further divided into an A node signature sub-module, a B node signature sub-module and a verification sub-module;
the working flow of the A node signature sub-module is as follows: starting an A node, creating an empty broadcast packet for creating a group through a friend circle organizer, filling group information, filling own position information into the broadcast packet, signing the A node for the broadcast packet through the friend circle organizer, and then sending the signed broadcast packet to a target node B;
the working flow of the node B signature sub-module is as follows: the node B receives the broadcast packet, analyzes the broadcast content through the friend circle organizer, updates the group information and the group position information, then creates the broadcast packet which is requested to be added, fills the password for the broadcast packet through the friend circle organizer and signs the password, and then the node B sends the broadcast packet to the node A;
the working flow of the verification sub-module is as follows: the node B creates a group locally through a friend circle organizer, requests the node A to add the group to local group members in the group, receives the adding request and analyzes the request content, then the node A checks whether the secret key in the request broadcast packet meets the requirement and whether the broadcast packet is the request of the node B through the friend circle organizer, if any item of the secret key does not pass the check, the request is discarded, if all the items of the secret key do not pass the check, the node A adds the node B to the local group members, and then the node A and the node B start synchronizing the friend circle and extract the local group member nodes;
the workflow of the data extraction module is as follows: the data synchronizer circulates the node list to extract a node from the node list, and sends a synchronization request to the node, the extracted target node checks whether the source of the synchronization request is in a friend circle, whether the request content is legal and whether the request time range is out of limit through a service provider, any item of check is not passed, the request is discarded, and if all the check passes, the data of the local time range is extracted;
the working flow of the completion node data synchronization module is as follows: the service provider sends data to the request node, the request node receives the downloaded data through the data synchronizer and checks the validity of the data, and after the data passes the check, the data is stored in the local so as to finish the data synchronization of friends of the node;
the work flow for completing the friend circle synchronization module is as follows: and returning to the data extraction module to extract other nodes until all the nodes complete circle synchronization of friends, thereby completing circle synchronization of friends.
Further, the group information in the node a signature sub-module is a group name and an admission key.
Further, the broadcast packet in the node A signature sub-module is sent to the target node B in the form of a two-dimension code of offline scanning.
The invention has the beneficial effects of realizing the function of going to the center of the friend circle and solving the problem that large-scale users draw small circles to use the friend circle at the same time.
Drawings
FIG. 1 is a flow chart of the method of the present invention;
FIG. 2 is a block diagram of the system of the present invention;
FIG. 3 is one of the flow details of the method of the present invention;
FIG. 4 is a second flowchart of the method of the present invention;
FIG. 5 is one of the detailed block diagrams of the system of the present invention;
FIG. 6 is a second detailed block diagram of the system of the present invention;
FIG. 7 is a third block diagram of the details of the system of the present invention;
FIG. 8 is a fourth block diagram of the details of the system of the present invention.
Detailed Description
The invention will be described in further detail with reference to the drawings and the specific examples. It should be noted that the technical features of the embodiments of the present invention described below may be combined with each other as long as they do not collide with each other.
Based on the decentralization characteristic of the blockchain, each small circle is built in the decentralization network, each person in the small circle is a carrier of a friend circle, the friend circles in the small circles are mutually synchronized, and each person in the small circle has a complete friend circle belonging to the circle after synchronization. The peer circle is based on the blockchain, but the whole process is separated from the blockchain, and the peer circle works only on the network layer of the blockchain, so that the transaction performance of the blockchain is not occupied, and the problem of the limitation of the transaction performance of the blockchain is solved.
Fig. 3 discloses a friend circle synchronization method in an off-center environment according to an embodiment of the present invention, which includes the following steps:
s1: starting an A node, creating an empty broadcast packet for creating a group through a friend circle organizer, filling a group name and an access key, filling own position information into the broadcast packet, signing the A node for the broadcast packet through the friend circle organizer, and transmitting the signed broadcast packet to a target node B in a form of a two-dimension code of offline scanning;
s2: the node B receives the broadcast packet sent in the step S1, analyzes the broadcast content through a friend circle organizer, updates group information and group position information, then creates a broadcast packet requested to be added, fills a password for the broadcast packet through the friend circle organizer and signs the password, and then sends the broadcast packet to the node A;
s3: checking information;
s4: the data synchronizer circulates the node list to extract a node from the node list, and sends a synchronization request to the node, the extracted target node checks whether the source of the synchronization request is in a friend circle, whether the request content is legal and whether the request time range is out of limit through a service provider, any item of check is not passed, the request is discarded, and if all the check passes, the data of the local time range is extracted;
s5: the service provider sends data to the request node, the request node receives the downloaded data through the data synchronizer and checks the validity of the data, and after the data passes the check, the data is stored in the local so as to finish the data synchronization of friends of the node;
s6: returning to step S4, extracting other nodes until all the nodes complete circle synchronization of friends, thereby completing circle synchronization of friends.
In this embodiment, a network layer based on a blockchain builds a friend circle network, each person participating in the friend circle provides own latest dynamic information, which may be an instruction for deleting past dynamic information, and the dynamic information is synchronized by different encryption modes according to different application ranges, so that a complete set of friend circle information is generated at each node.
The whole friend circle synchronization process is based on the blockchain, but is separated from the blockchain, and accurately works only on the network layer of the blockchain, so that the transaction performance of the blockchain is not occupied, data only flows in the participated friend circle when the information sharing is participated, and the resources of the whole blockchain network are not consumed.
Fig. 4 discloses the step of S3 checking information in this embodiment:
s31: node B creates a group locally through a friend circle organizer and requests node A to add it to the local group members in the group;
s32: the node A receives the adding request and analyzes the content of the request;
s33: the node A checks whether the secret key in the request broadcast packet meets the requirement or not and whether the broadcast packet is a request of the node B or not through a friend circle organizer;
s34: discarding the request if any of the checks fails;
s35: if all the checks pass, the node A adds the node B to the local group member;
s36: both node a and node B begin synchronizing the circle of friends and extracting the local group member nodes.
Fig. 2 discloses a friend circle synchronization system in a decentralizing environment according to an embodiment of the present invention, which is characterized by comprising an initiating organization module, a data extraction module, a node data synchronization completion module and a friend circle synchronization completion module, wherein the initiating organization module is further divided into an a node signature sub-module, a B node signature sub-module and a verification sub-module;
the working flow of the A node signature sub-module is as follows: starting an A node, creating an empty broadcast packet for creating a group through a friend circle organizer, filling a group name and an access key, filling own position information into the broadcast packet, signing the A node for the broadcast packet through the friend circle organizer, and transmitting the signed broadcast packet to a target node B in a form of a two-dimension code of offline scanning;
the working flow of the node B signature sub-module is as follows: the node B receives the broadcast packet, analyzes the broadcast content through the friend circle organizer, updates the group information and the group position information, then creates the broadcast packet which is requested to be added, fills the password for the broadcast packet through the friend circle organizer and signs the password, and then the node B sends the broadcast packet to the node A;
the working flow of the verification sub-module is as follows: the node B creates a group locally through a friend circle organizer, requests the node A to add the group to local group members in the group, receives the adding request and analyzes the request content, then the node A checks whether the secret key in the request broadcast packet meets the requirement and whether the broadcast packet is the request of the node B through the friend circle organizer, if any item of the secret key does not pass the check, the request is discarded, if all the items of the secret key do not pass the check, the node A adds the node B to the local group members, and then the node A and the node B start synchronizing the friend circle and extract the local group member nodes;
the workflow of the data extraction module is as follows: the data synchronizer circulates the node list to extract a node from the node list, and sends a synchronization request to the node, the extracted target node checks whether the source of the synchronization request is in a friend circle, whether the request content is legal and whether the request time range is out of limit through a service provider, any item of check is not passed, the request is discarded, and if all the check passes, the data of the local time range is extracted;
the working flow of the completion node data synchronization module is as follows: the service provider sends data to the request node, the request node receives the downloaded data through the data synchronizer and checks the validity of the data, and after the data passes the check, the data is stored in the local so as to finish the data synchronization of friends of the node;
the work flow for completing the friend circle synchronization module is as follows: and returning to the data extraction module to extract other nodes until all the nodes complete circle synchronization of friends, thereby completing circle synchronization of friends.
As shown in fig. 5, the present embodiment mainly relates to three core components, a friend circle organizer, a data synchronizer, and a service provider.
The friend circle organizer is mainly used for finding out an organization of the friend circle organizer or initiating an organization in the network, as shown in fig. 6, and the friend circle organizer mainly relates to three core modules, a group management module, a node management module and a node scanning module. The group management module is mainly used for managing the groups participated by the user, including the groups created by the user, and some basic information of the groups, such as group names, group creators and initiator positions, are contained. In the node management module, the node management module is mainly used for managing which group each node belongs to, the participant corresponding to the node and the position of the participant, and the basis of other nodes can be found. In the node scanning module, the basic scanning for the blockchain network is mainly used for discovering other nodes in the group, and is also used for checking and confirming the validity of the initial group and joining when the initial group is joined.
The data synchronizer is mainly used for collecting the latest state data for participants in the organization, constructing a set of complete friend circle latest information locally, and deleting historical dynamic data exceeding the storage capacity of the local node. As shown in fig. 7, in the data synchronizer, three major core modules are mainly involved, a data storage module, a data download module, and a timestamp management module. The data storage module is mainly used for storing data synchronized with other nodes, wherein the data refer to data except blockchain data and node data, different upper-layer application data are mainly used for data which need to be synchronized at different nodes according to different upper-layer applications, such as friend circle data in social applications, and internal announcements issued by a company and the like in internal management of the company. In the data downloading module, the data downloading module is mainly used for downloading data from other nodes, supports continuous downloading from the point of ending the last downloading, and for the first time of downloading data from a new node, the data downloading module starts to download data from the earliest time allowed to be provided by the node. The time stamp management module is mainly used for managing the time stamp of the local data of each node, and the time stamp is the key for guaranteeing the increment update of the local data and is also the basis for deleting the local storage over-time data.
The service provider is mainly used for providing services for other nodes, including providing the latest dynamic data when the other nodes request the data, and deleting when the other nodes request to delete the data. As shown in fig. 8, the service provider mainly relates to three core modules, a data providing module, a data deleting module and a permission checking module. The data providing module is mainly used for responding to data downloading requests made by other nodes, checking whether the extraction range is within the self allowable range or not, and then extracting the range data and sending the range data to the module requesting the data. The data deleting module is mainly used for deleting the data downloaded from the other party when other nodes in the friend circle need to delete the data, and only receiving the deleting request of the data owner when deleting the data. In the permission checking module, it is checked that, in addition to the request content being legal, the requests sent by other nodes in the network are checked whether the initiator of the request is qualified to submit the request, for example, the data sharing in the friend circle only allows the request initiated by the node in the friend circle to be received.
The above description is only of the preferred embodiments of the present invention, and should not be taken as limiting the technical scope of the present invention, but all changes and modifications that come within the scope of the invention as defined by the claims and the specification are to be embraced by the invention.
Claims (6)
1. The friend circle synchronization method in the decentralizing environment is characterized by comprising the following steps:
(1) Initiating organization, specifically comprising the following steps:
(1.1) node a signature: starting an A node, creating an empty broadcast packet for creating a group through a friend circle organizer, filling group information, filling own position information into the broadcast packet, signing the A node for the broadcast packet through the friend circle organizer, and then sending the signed broadcast packet to a target node B;
(1.2) node B signature: the node B receives the broadcast packet sent in the step (1.1), analyzes the broadcast content through a friend circle organizer, updates group information and group position information, then creates the broadcast packet requested to be added, fills the password for the broadcast packet through the friend circle organizer and signs the password, and then sends the broadcast packet to the node A;
(1.3) checking: the node B creates a group locally through a friend circle organizer, requests the node A to add the group to local group members in the group, receives the adding request and analyzes the request content, then the node A checks whether the secret key in the request broadcast packet meets the requirement and whether the broadcast packet is the request of the node B through the friend circle organizer, if any item of the secret key does not pass the check, the request is discarded, if all the items of the secret key do not pass the check, the node A adds the node B to the local group members, and then the node A and the node B start synchronizing the friend circle and extract the local group member nodes;
(2) Extracting data: the data synchronizer circulates the node list to extract a node from the node list, and sends a synchronization request to the node, the extracted target node checks whether the source of the synchronization request is in a friend circle, whether the request content is legal and whether the request time range is out of limit through a service provider, any item of check is not passed, the request is discarded, and if all the check passes, the data of the local time range is extracted;
(3) And finishing node data synchronization: the service provider sends data to the request node, the request node receives the downloaded data through the data synchronizer and checks the validity of the data, and after the data passes the check, the data is stored in the local so as to finish the data synchronization of friends of the node;
(4) Complete friend circle synchronization: and (3) returning to the step (2) to extract other nodes until all the nodes complete circle synchronization of friends, thereby completing circle synchronization of friends.
2. The method for synchronizing circles of friends in an off-center environment according to claim 1, wherein said group information in step (1.1) is a group name, an admission key.
3. The friend circle synchronization method in the decentralizing environment according to claim 1, wherein the broadcast packet in step (1.1) is transmitted to the target node B in the form of an offline two-dimensional code.
4. The friend circle synchronization system in the decentralizing environment is characterized by comprising an initiating organization module, a data extraction module, a node data synchronization completion module and a friend circle synchronization completion module, wherein the initiating organization module is further divided into an A node signature sub-module, a B node signature sub-module and a verification sub-module;
the working flow of the A node signature sub-module is as follows: starting an A node, creating an empty broadcast packet for creating a group through a friend circle organizer, filling group information, filling own position information into the broadcast packet, signing the A node for the broadcast packet through the friend circle organizer, and then sending the signed broadcast packet to a target node B;
the working flow of the node B signature sub-module is as follows: the node B receives the broadcast packet, analyzes the broadcast content through the friend circle organizer, updates the group information and the group position information, then creates the broadcast packet which is requested to be added, fills the password for the broadcast packet through the friend circle organizer and signs the password, and then the node B sends the broadcast packet to the node A;
the working flow of the verification sub-module is as follows: the node B creates a group locally through a friend circle organizer, requests the node A to add the group to local group members in the group, receives the adding request and analyzes the request content, then the node A checks whether the secret key in the request broadcast packet meets the requirement and whether the broadcast packet is the request of the node B through the friend circle organizer, if any item of the secret key does not pass the check, the request is discarded, if all the items of the secret key do not pass the check, the node A adds the node B to the local group members, and then the node A and the node B start synchronizing the friend circle and extract the local group member nodes;
the workflow of the data extraction module is as follows: the data synchronizer circulates the node list to extract a node from the node list, and sends a synchronization request to the node, the extracted target node checks whether the source of the synchronization request is in a friend circle, whether the request content is legal and whether the request time range is out of limit through a service provider, any item of check is not passed, the request is discarded, and if all the check passes, the data of the local time range is extracted;
the working flow of the completion node data synchronization module is as follows: the service provider sends data to the request node, the request node receives the downloaded data through the data synchronizer and checks the validity of the data, and after the data passes the check, the data is stored in the local so as to finish the data synchronization of friends of the node;
the work flow for completing the friend circle synchronization module is as follows: and returning to the data extraction module to extract other nodes until all the nodes complete circle synchronization of friends, thereby completing circle synchronization of friends.
5. The system for synchronizing circles of friends in an off-center environment according to claim 4, wherein said group information in the node a signature sub-module is a group name, an admission key.
6. The system for synchronizing circles of friends in an off-center environment according to claim 4, wherein said broadcast packet in the node A signature sub-module is sent to the target node B in the form of an off-line two-dimensional code.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010162802.8A CN113449029B (en) | 2020-03-10 | 2020-03-10 | Friend circle synchronization method and system in off-center environment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010162802.8A CN113449029B (en) | 2020-03-10 | 2020-03-10 | Friend circle synchronization method and system in off-center environment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113449029A CN113449029A (en) | 2021-09-28 |
| CN113449029B true CN113449029B (en) | 2024-02-06 |
Family
ID=77806304
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010162802.8A Active CN113449029B (en) | 2020-03-10 | 2020-03-10 | Friend circle synchronization method and system in off-center environment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113449029B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108717630A (en) * | 2018-05-19 | 2018-10-30 | 上海分布信息科技有限公司 | One kind going out block method and its realizes system |
| CN109474896A (en) * | 2018-11-16 | 2019-03-15 | Tcl移动通信科技（宁波）有限公司 | A kind of block chain implementation method, system and the storage medium of decentralization |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3564883B1 (en) * | 2018-04-30 | 2023-09-06 | Hewlett Packard Enterprise Development LP | System and method of decentralized management of device assets outside a computer network |
-
2020
- 2020-03-10 CN CN202010162802.8A patent/CN113449029B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108717630A (en) * | 2018-05-19 | 2018-10-30 | 上海分布信息科技有限公司 | One kind going out block method and its realizes system |
| CN109474896A (en) * | 2018-11-16 | 2019-03-15 | Tcl移动通信科技（宁波）有限公司 | A kind of block chain implementation method, system and the storage medium of decentralization |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113449029A (en) | 2021-09-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102196014B (en) | Method and system of multi-group operation synchronization | |
| CN101102257B (en) | Method and device for transmitting data objects | |
| US20190139047A1 (en) | Block chain based resource management | |
| JP5847579B2 (en) | Method and system for a user to access at least one service provided by at least one other user | |
| CN104541476A (en) | Provisioning-free memberless group communication sessions | |
| CN109936509B (en) | Equipment group authentication method and system based on multi-identity | |
| CN108876669B (en) | Course notarization system and method applied to multi-platform education resource sharing | |
| CN103716326A (en) | Resource access method and URG | |
| CN102090049A (en) | Network system, communication terminal, communication method, and communication program | |
| CN111294339B (en) | Homogeneous alliance chain cross-chain method and device based on Fabric architecture | |
| CN113162949A (en) | Cross-domain identity authentication scheme of industrial Internet of things equipment based on block chain | |
| WO2008015256A1 (en) | Method, system, and program product for managing conference calls | |
| CN111338906A (en) | Terminal equipment, edge node and block chain-based application supervision method and system | |
| KR101049909B1 (en) | Real-time handwriting sharing method and system | |
| CN113449029B (en) | Friend circle synchronization method and system in off-center environment | |
| CN106302110A (en) | A kind of social network position sharing method based on secret protection | |
| CN111932239B (en) | Service processing method, device, node equipment and storage medium | |
| CN101364866B (en) | Entity secret talk establishing system based on multiple key distribution centers and method therefor | |
| KR102140453B1 (en) | Meeting management method and meeting management system using the method | |
| CN111951457A (en) | Electronic voting method, device, terminal equipment and storage medium | |
| CN106330899A (en) | Private cloud device account management method and system, electronic device and server | |
| CN110601850A (en) | Scenic spot information recording method, related equipment and storage medium | |
| CN112653775B (en) | Electronic business card exchange system and method | |
| Chen et al. | A Novel Smart Contract based Optimized Cloud Selection Framework for Efficient Multi-Party Computation. | |
| WO2016101429A1 (en) | Mtc packet management method, device, system and network entity |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |