Anonymous routing method on basis of bilinear pairings
A bilinear pairing and routing technology, applied in the field of network communication, can solve the problem of large amount of public key operation, and achieve the effect of reducing the amount of operation, short key and less amount of operation
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0021] The specific implementation manners of the present invention will be described in detail below with reference to the accompanying drawings.
[0022] The present invention first proposes an anonymous key agreement protocol based on bilinear pairing: for the reason P The resulting cyclic addition group has order q , are of the same order q The cyclic multiplicative group of , For a bilinear map, the private key generator (PKG) randomly selects a master key , calculate the public key , and choose a secure hash function and a key derivation function g, PKG public system parameters { , ,q, ,P, , , g}.
[0023] For any user A, whose identity is , PKG calculates its private key And send this private key to A securely, is the public key of A, and . For another user V, its public-private key pair is . V and A negotiate a session key without revealing the identities of V and A. The process is as follows:
[0024] Step 1: V chooses a random numbe...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 