61results about How to "Reduce Communication Complexity" patented technology

The invention discloses a transaction quick confirmation method and device based on a block chain technology, wherein, the method comprises the following steps: step S1, confirming the node identity and electing a consensus committee and a committee leader; S2, submitting the transaction to the committee, so that the committee leader initiates a round of BLS aggregation signatures for the transaction, and broadcasting the total signatures for the transaction on the whole network to quickly confirm the transaction; Step S3, packaging and summarizing the confirmed transactions by the committee leader, forming a current round block by the transaction package, the transaction proof, the previous block hash and the current unspent transaction pool, sending the current round block and the blockhash value to the members of the committee, and operating the consensus within the committee to generate a new block. The method can realize the fast confirmation of the transaction, and effectively improves the practicability and reliability of the transaction, which is simple and easy to realize.

The invention belongs to the technical field of block chain network communication, and discloses a high-efficiency asynchronous Byzantine consensus method with low communication complexity and a network communication platform. A node in a network calculates transaction data blocks, redundant data blocks, a data block hash and a fingerprint cross checksum, and sends related data to each node in thenetwork by using an asynchronous verifiable information transmission protocol. After the nodes confirm that the transactions broadcast and sent by some nodes are correctly stored in the network, a binary vector consistency protocol is executed, and consensus is carried out on the transactions; and the node requests a specific data block from the network and reconstructs to obtain original transaction data. According to the invention, the problem of high communication complexity based on an erasure code protocol in the prior art is solved, and the throughput of the algorithm is improved; a binary vector consistency protocol is adopted, the defect that an original protocol can only consensus transactions broadcasted by a single node each time is overcome, the complexity of algorithm messages is reduced, the worst time complexity of an algorithm is optimized, and the high efficiency of the algorithm is guaranteed.

The invention belongs to the field of machine learning. The invention, and relates to a privacy information protection method based on k-means clustering. A linear homomorphic encryption algorithm LHE is combined with an addition homomorphic encryption algorithm Paillier to encrypt data; T; the method comprises the steps of obtaining ciphertext data through a cloud server, performing k-means clustering on the ciphertext data by utilizing a computing service provided by the cloud server to obtain a ciphertext clustering result, and decrypting the ciphertext clustering result by a client to obtain a plaintext clustering result. According to the invention, t, the cloud server does not obtain any privacy information of the user; t; the privacy information security of the user is ensured whilethe clustering algorithm is realized; I; in the data analysis process, data information is not leaked, t, the safety of user data is effectively improved, t, the communication traffic between the client side and the cloud server side is greatly reduced, t, the communication cost is reduced, t, the machine learning efficiency is improved, and the method is more suitable for being applied to an actual scene.

The embodiment of the invention provides a secure multi-party computing method and device, and relates to the technical field of information security, and the method is applied to any participant in asecure multi-party computing system, and comprises the following steps of determining an input value required to be submitted for completing a target computing task; randomly generating a secret value, encrypting the input value by using the secret value, and broadcasting the encrypted input value in the system; generating an encryption set corresponding to other participants, and sending the encryption set to the other participants; receiving an encryption input value and an encryption set broadcasted by other participants; based on the encryption input value and the encryption set, calculating to obtain a feedback value; encrypting the feedback value by using public keys of other participants, and sending the encrypted feedback value to the participants; and receiving the encrypted feedback value sent by other participants, and completing the target calculation task based on the encrypted feedback value and the ID of each participant in the system. By applying the scheme provided bythe embodiment of the invention, the communication complexity of secure multi-party calculation can be reduced, and the communication resources are saved.

The application provides a discovery method and device based on a servitization architecture. In the method, a control network element sends a discovery response to a first functional network element,and the discovery response comprises a determined safety parameter and an access address or an identifier of a second functional network element; the first functional network element receives the discovery response sent by the control network element and sends an access request to the second functional network element according to the address or the identifier of the second functional network element, which is included in the discovery response, and the access request comprises the received safety parameter; and the second functional network element receives the access request sent by the first functional network element, verifies correctness of the safety parameter and determines whether the access request is authorized by the first functional network element on the basis of correctnessof the safety parameter. By the discovery method and device provided by the application, communication times can be reduced to a certain degree, and communication complexity is reduced.

Frequency channel selection in a data transmission method uses a frequency hopping method. In a first method step, interference in a frequency channel is determined by detecting multiple erroneous transmissions in the frequency channel, and the frequency channel with interference is then eliminated from the frequency hopping sequence. In a second method step, the strength of external signals is measured within the frequency range of an eliminated frequency channel with interference, and the frequency channel is reinserted into the frequency hopping sequence if the strength is below a prescribed threshold value.

The invention provides an optimized and improved block chain PBFT consensus method. The method comprises the following steps: S1, sending a request message to a main node of a block chain network; S2,forwarding the request message to a slave node of the blockchain network; S3, enabling the slave node to verify the request message; S4, when the master node receives response messages sent by the 2fslave nodes, enabling the master node and all the slave nodes to form a group signature group, and acting the master node as a group administrator; S5, selecting a slave node as a consensus initiating node, processing and signing the request message to generate a group signature message, and broadcasting an acknowledgement message; S6, verifying the correctness of the group signature message by other nodes; and S7, if the consensus initiating node receives the verification passing messages fed back by the 2f nodes, showing that the consensus is reached, and all the nodes reply to the requestof the client. The invention provides an optimized and improved block chain PBFT consensus method, and solves the problem that the communication complexity of a current PBFT algorithm is too high.

The invention discloses a double-layer grouping Byzantine fault-tolerant consensus method and system. The method comprises the following steps: S1, determining node groups; S2, for each group of nodes, selecting a part of nodes from the nodes as committee nodes, forming committee of the group, taking the remaining nodes except the committee nodes as common nodes, and selecting a main node of each group from the committee nodes; S3, building a block chain network; S4, if a certain group of committee receives a proposal request, the main node of the group generating a block according to the proposal request and sending the block to other committee nodes of the group for a first round of consensus, and if the first round of consensus passes, generating an initial block and sending the initial block to the common node of each group; and S5, performing a second round of consensus on the initial block by the common node of each group, and if the second round of consensus is passed, chaining the initial block and storing the initial block in a local account book. According to the method, a double-layer grouping consensus structure is adopted, and the system robustness is improved on the premise that low communication complexity is guaranteed.

The invention is suitable for the technical field of blockchain application, and provides a block chain hierarchical excitation consensus algorithm. According to the blockchain layered incentive consensus algorithm, the tree communication network topology is adopted, when nodes transmit data, messages do not need to be broadcasted to other nodes through a P2P network every time, the messages are sent to other nodes after being processed by parent nodes or child nodes, and the tree communication network topology is benefited; and the communication complexity of the system is greatly reduced. The consensus algorithm comprises a consensus node dynamic spanning tree algorithm and a corresponding reward mechanism, the traditional PBFT consensus algorithm lacks the corresponding reward mechanism, and the nodes need to pay computing power and bandwidth when participating in the consensus, so the nodes lack the power of participating in the consensus. The consensus node excites and encourages the node to participate in the consensus honest, and obtains higher rewards by keeping correct data consensus, and the core purpose is to enable the node to participate in the consensus and transmit correct messages according to rules.

The invention discloses a communication method and system of a dual-mode single-standby terminal. The method comprises the following steps: configuring a broadband SIM card and a narrowband SIM card with the same user number in the dual-mode single-standby terminal of a broadband and narrowband converged trunking communication system in advance; when the first core network receives a call requestof the dual-mode single-standby terminal, judging whether a corresponding called number is registered on a network side with the same bandwidth type as the first core network or not, and if so, executing a corresponding single call establishment process according to a network standard with the same bandwidth type as the first core network; otherwise, the first core network sends the call request message to a second core network, the second core network is triggered to execute a broadband and narrowband single call establishment process, and when the first core network is a broadband core network, the second core network is a narrowband core network; and when the first core network is the narrowband core network, the second core network is the broadband core network. By adopting the methodand the system, the communication complexity of the dual-mode single-standby terminal can be effectively reduced, and the method and the system are easy to implement.

The invention discloses a mobile quantum voting method based on Chinese remainder theorem, which is characterized in that a supervisor, a teller and a plurality of voters exist. A quantum state is prepared by the supervisor, moreover, the quantum state is divided into two, one part of quantum bits are sent to the voters to serve as quantum votes, and the other part of the quantum bits are sent tothe teller to serve as vote-checking certificates; each voter performs voting operation on the same quantum vote, the quantum votes are sent to the teller for counting and verification after all voting operations are complete, and ultimately, voting results of all the voters are obtained. The objective of the invention is to solve the problem that conventional mobile voting cannot resist secondaryvoting attacks of dishonest voters and the problem that excessive quantum resource is consumed by conventional distributive voting, and the security of voting operation is enhanced.

The invention relates to a grouped data sending method, which comprises the following steps of: receiving grouped data comprising an identifier of a target terminal from a source terminal; finding out whether a path reaching the target terminal exists in a routing cache list; if finding out the path reaching the target terminal exists, carrying out interface selection; and forwarding the grouped data through a selected interface according to the found path. The invention further relates to another two grouped data sending methods corresponding to the grouped data sending method, and a terminal and a base station corresponding to the grouped data sending method. By adoption of the grouped data sending method, the base station and the terminal disclosed by the invention, link treatment can be carried out at the terminal.

The invention provides a block chain witness consensus method based on Byzantine fault tolerance, which is characterized in that a packaging node and a witness node are arranged, and the consensus method comprises the following steps: S1, the packaging node packages to generate a block and broadcasts the block; S2, the witness node carries out voting broadcasting and counting; S3, a main chain is confirmed according to a rule; in the step S2, all witness nodes are in any block height, and voting broadcast is only carried out once. The invention further provides a block chain witness consensus system and equipment based on Byzantine fault tolerance and a storage medium. According to the invention, the communication complexity of the consensus network is greatly reduced, the problem of chain bifurcation is still well solved, and the consistency and activity are fully ensured. Meanwhile, the method can be used for identifying the attacking nodes in the consensus network.

The embodiment of the invention relates to a block data transmission method and device, electronic equipment and a nonvolatile computer storage medium. The block data transmission method comprises thefollowing steps: constructing a Bloom filter; sending the block information of the Bloom filter and the new block; generating estimated data of the transaction difference between the sending node andthe receiving node; generating a first reversible Bloom lookup table corresponding to the new block according to the estimation data; determining a public transaction between the sending node and thereceiving node through the Bloom filter, and constructing a second reversible Bloom lookup table corresponding to the public transaction; and performing subtraction operation on the first reversibleBloom lookup table and the second reversible Bloom lookup table, solving a specific transaction of the sending node, and reconstructing a block according to the specific transaction. According to theblock data transmission method, estimation data of transaction difference between a sending node and a receiving node is given in advance, so that the size of a reversible Bloom lookup table can be reasonably selected, and the probability of inverse solution failure can be controlled.

The invention discloses a quantum-resisting secret key negotiation method. A communication party Alice selects a matrix S including n rows and l columns, and F is calculated and sent to a communication party Bob; after that Bob receives the F, a matrix S' including l rows and n columns and a matrix y including n rows and l columns are selected, and W' is calculated; Bob calculates a matrix D' including l rows and l columns and calculates C; and Bob sends B' and C to the Alice. According to the received B' and C, Alice calculates D and km=rec(D, C). According to the method of the invention, theerror probability of negotiation is zero, present quantum attacks and other attack strategies can be resisted, the operation efficiency and practicality are high, the method is easy to enforce, and the method can be integrated to TLS protocols.

The invention discloses a multi-cell MIMO system uplink signal detection method based on a constellation structure. The method includes the following steps: each base station detects all signals, obtains the posterior probability of all symbols of each base station, and selects the constellation point in each constellation diagram which corresponds to the maximum posterior probability data as a reference point of the whole constellation diagram; each base station selects posterior probability data of the reference point and an adjacent constellation point in the constellation diagram, and the selected posterior probability data of the constellation point are sent to a corresponding adjacent base station which participates in cooperative detection; after receiving soft information of local user symbols sent by another base station, each base station calculates posterior probability data that are not selected to send by other base station; and each base station performs soft merging on processed complete probability data, calculates the posterior probability of symbols sent by users of the cell, and selects the symbol with a maximum probability as a final detection result. The method provided by the invention can effectively reduce complexity of uplink baseband signal detection in a multi-cell MIMO system.