36 results about "Computation sharing" patented technology

In an embodiment, a given entity obtains a location of at least one terrestrial transmit station of a Synchronized Wireless Transmission Network (SWTN), transmit station calibration information associated with the at least one terrestrial transmit station and a location of a user equipment (UE) that is in wireless communication range with the at least one terrestrial transmit station. The given entity estimates the time calibration value for the UE based on the obtained transmit station location, the determined transmit station calibration information and the determined location of the UE. Inanother embodiment, a server obtains time calibration values that are estimated for each UE in the population of UEs. The server aggregates the estimated time calibration values based on device modeland / or device operation mode, and calculates a representative time calibration value for UEs sharing the device model and / or device operation mode.

A first electronic network node (110) is provided configured for a key exchange (KEX) protocol, the first network node is configured to obtain a shared polynomial (a) shared with a second network node, coefficients of the shared polynomial a being selected modulo a first modulus q, generate a private key polynomial (skI), coefficients of the private key polynomial being bounded in absolute value by a bound (s) generate a public key polynomial (pkI) by computing a polynomial product between the shared polynomial (a) and the private key polynomial (skI) modulo the first modulus (q) and scaling the coefficients of the polynomial product down to a second modulus (p).

The invention relates to the field of shared bicycle communication positioning, and provides a shared bicycle WiFi positioning method based on three-dimensional calibration. The method comprises the following steps: before a shared bicycle is put into operation, performing AP (Access Point) three-dimensional calibration and establishing an AP information database; after the shared bicycle is put into operation, acquiring AP positioning information in an area by a WiFi positioning module, and transferring the acquired AP positioning information to a processor; processing the AP positioning information by the processor and controlling a GPRS module to upload the processed information to a server; calculating the current position of the shared bicycle by the server according to the received information and the AP information database; and responding to a positioning request of a display client by the server, performing data screening and calculation according to the positioning request, and transmitting calculated position information to a positioning display client in real time. According to the shared bicycle WiFi positioning method based on the three-dimensional calibration provided by the invention, when the AP information database is established, only a database of AP label number coordinate information in the area is established, thus the workload is saved and the load of the server is reduced.

A key agreement method based on identity-unpaired wireless network cross-domain handover authentication. Reduce the computing cost of the user; in the stage of authenticating the user's identity, the home domain authentication server calculates the shared key with the user, which is consistent with the shared key generated by the user, and replaces the bilinearity in the calculation of the shared key by the home domain authentication server pair operation. The method improves the efficiency of handover authentication by means of no bilinear pairing operation between the user and the home domain authentication server. In the key negotiation phase, the session key negotiated between the user and the authentication server in the foreign region includes not only the temporary private key of both parties, but also their respective long-term private keys. The security of the key is guaranteed, effectively resisting the attack of temporary private key leakage.

The invention discloses a shared bicycle skeleton network extraction method, belongs to the technical field of computer application, and can perform backbone network extraction on a network composed of network nodes with spatial position features. The method comprises the following steps: constructing a shared bicycle network; and calculating the significance of all edges in the shared bicycle network, and keeping the edges with the significance greater than zero as the edges of the backbone network; and calculating the topological potential of all nodes in the shared bicycle network; performing spatial density clustering on all nodes in the shared bicycle network according to the geographic positions of the nodes, and acquiring a riding area cluster ; For each riding area cluster, performing descending sorting on the network nodes in the current riding area cluster according to the value of the topological potential, and selecting the front set number of nodes after descending sortingto form a backbone core node of the current riding area cluster; and combining the backbone core nodes of all the riding area clusters, and connecting the backbone core nodes by using the edges of the backbone network to form a skeleton network.

Some embodiments are directed to a computation device for performing a computation on at least a set of values. The values are stored in memory as a plurality of shares that define the value. An operation of the computation may be performed on a set of input values to obtain an output value. The output value may be defined by at least one shared share and at least one computed share. The at least one shared share may also define a further value, e.g., an output of a previously performed computation or an output of a further operation performed in parallel with the operation. The at least one computed share is computed from the at least one shared share and shares of the set of input values. A fault in the shared share affects the further value but a fault in the computed share, complicating share reduction attacks.

A first electronic network node (110) is provided configured for goo a key exchange (KEX) protocol, the first network node is configured to—obtain a shared matrix (A) shared with a second network node, entries in the shared matrix A being selected modulo a first modulus q, generate a private key matrix (SI), entries in the private key matrix being bounded in absolute value by a bound (s) generate a public key matrix (PI) by computing a matrix product between the shared matrix (A) and the private key matrix (SI) modulo the first modulus (q) and scaling the entries in the matrix product down to a second modulus (p).