CN101521882A - Method and system for updating preshared key - Google Patents
Method and system for updating preshared key Download PDFInfo
- Publication number
- CN101521882A CN101521882A CN200910119744A CN200910119744A CN101521882A CN 101521882 A CN101521882 A CN 101521882A CN 200910119744 A CN200910119744 A CN 200910119744A CN 200910119744 A CN200910119744 A CN 200910119744A CN 101521882 A CN101521882 A CN 101521882A
- Authority
- CN
- China
- Prior art keywords
- wildcard
- communication node
- value
- updated
- mod
- 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
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to a method and a system for updating a preshared key. The method comprises the following steps: both communication sides take prime numbers which correspond to a preshared key to be updated as prime number parameters P for Diffie-Hellman Key exchange algorithm; both communication sides use prime number parameters P, positive integers g which are less than the prime number parameters P and random numbers sx and sy generated by respective communication side for calculating PX and PY, wherein PX= g<sx>(mod P) and PY = g<sy>(mod P); and both communication sides exchange the PX and the PY and take (PY)<sx>(mod P)= (PX)<sy>(mod P) as a new preshared key.
Description
Technical field
The present invention relates to WLAN (wireless local area network) (Wireless Local AreaNetworks is called for short WLAN), relate in particular to the generation method of wildcard in a kind of WLAN (wireless local area network).
Background technology
WLAN (wireless local area network) is as wide-band wireless IP (Internet Protocol, Internet Protocol) a kind of typical way of realization of network, be meant the computer local network that adopts wireless transmission medium, it can communicate in the zone that is difficult to connect up, and is the important supplement of traditional cable LAN.Wireless local area network technology is the product that computer networking technology combines with wireless communication technology, have support mobile computing, framework flexibly and fast, safeguard advantages such as the lower and extensibility of required expense is good, be the mobile of communication and individualize means are provided.
Along with progressively going deep into of global IT application, the importance of network security is more and more obvious, because information dropout, damaged and leak the head and shoulders above big people's of loss caused prediction, so various countries all are promoted to the network information security position of National Security Strategy.
WAPI of the prior art (WAPI) is a kind of mechanism that improves the fail safe of WLAN (wireless local area network).WAPI will be applied to the wireless local area network technology field based on the access control method that the ternary equity is differentiated, pass through legal access point access network to ensure legitimate client, and realize the secure communication between client and access point.
WAPI is made up of wireless local area network authentication infrastructure (WAI) and wireless local area network security foundation structure (WPI) two parts.
WAI realizes that identity in the WLAN (wireless local area network) is differentiated and the safety approach of key management, be used to finish STA (STAtion, wireless site) bidirectional identification and between the AP (Access Point, access point), between STA and the STA is differentiated, and negotiation to establish safety relation.
Wherein, security association comprises:
BKSA (base key security association): be the result of certificate discrimination process negotiation or the result who derives by wildcard (PSK); The parameters such as life cycle that wherein comprise BK (base key), BK/BKSA;
WPI is the safety approach that is used for realizing the protection of WLAN (wireless local area network) transfer of data, comprises using each key that negotiates in the WAI process to carry out functions such as data encryption, data discriminating and the protection of resetting.
In WAPI, adopt dual mode to derive BK, be respectively in the certificate discrimination process, to derive or directly derive by wildcard.Therefore the fail safe of wildcard directly influences the fail safe of WAPI.
In the prior art, wildcard is gone up manual the setting and renewal in terminal and AP (Access Point, access point) respectively by the user usually.Manual more new pre-shared key has following shortcoming:
1, because AP does not have input-output apparatus such as keyboard, screen usually, therefore need go up the wildcard that upgrades among the AP at the PC that links to each other with AP (PC) usually, fail safe is difficult to guarantee, and complicated operation;
2, can't realize wildcard frequent, dynamically update.
In order to realize the automatic generation/renewal of key, and guarantee that key does not transmit in unsafe network, the secret that prior art adopts the Diffie-Hellman Diffie-Hellman to carry out key is usually consulted.
To carry out concise and to the point description to the Diffie-Hellman Diffie-Hellman below.
Fig. 1 is the flow chart of Diffie-Hellman Diffie-Hellman of the prior art, and as shown in Figure 1, node A in WLAN and Node B (for example, AP and STA) can be carried out the secret of key as follows and consult in the time of will being carried out secure communication:
101: node A and Node B preestablish DH algorithm parameter P and g; P and g are integer, and P〉g;
In order to improve fail safe, P is generally big prime number, and g is generally the primitive root (primitive root) of P, therefore P can be called the prime number parameter of Diffie-Hellman Diffie-Hellman, g is called the primitive root parameter of Diffie-Hellman Diffie-Hellman; P and g are disclosed Diffie-Hellman algorithm parameters.
102: node A chooses random number sx, and calculates PX=g
Sx(mod P);
Wherein mod represents modulo operation.
103: Node B is chosen random number sy, and calculates PY=g
Sy(mod P);
104: node A and Node B are carried out the exchange of PX value and PY value, and promptly node A sends to Node B with the PX value, and Node B sends to node A with the PY value;
105: node A calculates base key K=(PY)
Sx(mod P); Node B computation key K '=(PX)
Sy(mod P);
According to the rule of modular arithmetic as can be known:
K＝(PY)
sx(mod?P)
＝(g
sy(mod?P))
sx(mod?P)
＝(g
sy×
sx)(mod?P)
＝(g
sx)(mod?P)
sy(mod?P)
＝(PX)
sy(mod?P)＝K′。
As seen, in step 105, node A and Node B have negotiated common key.
Though the Diffie-Hellman Diffie-Hellman in theory still can't prove its fail safe,, therefore be considered to a kind of safe Diffie-Hellman at present because this algorithm is based on a discrete logarithm difficult problem.But in order to guarantee the fail safe of Diffie-Hellman Diffie-Hellman, prime number parameter P wherein need be the above big prime number of 512Bit (bit) usually, so amount of calculation is very big, needs special-purpose chip to realize usually, has increased equipment cost.
Summary of the invention
Technical problem to be solved by this invention is, overcomes the deficiencies in the prior art, and a kind of update method and system of wildcard is provided, so that realize safety, the purpose of new pre-shared key more quickly under the prerequisite that does not increase equipment cost.
In order to address the above problem, the invention provides a kind of update method of wildcard, this method comprises:
Communicating pair is with the prime number parameter P of the pairing quality number of wildcard to be updated as the Diffie-Hellman Diffie-Hellman;
Communicating pair uses described prime number parameter P, less than the positive integer g of described prime number parameter P and the random number sx and the sy of each self-generating, calculate respectively: PX=g
Sx(mod P) and PY=g
Sy(mod P);
Communicating pair exchange PX value and PY value, and with (PY)
Sx(mod P)=(PX)
Sy(mod P) is as new wildcard.
In addition, described g is the primitive root of described prime number parameter P.
In addition, the described pairing quality number of wildcard to be updated is: greater than the minimum quality number of described wildcard to be updated or less than the maximum quality number of described wildcard to be updated or with the quality number of described wildcard difference minimum to be updated.
In addition, described communicating pair is described PX value of exchange and PY value or in related request again with exchange described PX value and PY value again in the associated response or exchange described PX value and PY value in link verification request and link verification respond in association request and associated response respectively, and with (PY)
Sx(mod P)=(PX)
Sy(mod P) is as new wildcard.
In addition, after described wildcard to be updated surpassed predefined life cycle, the direction the opposing party in the described communicating pair sent and carries the more message of new logo and described PX value of wildcard;
Described the opposing party receives the described wildcard that carries more after the message of new logo, sends described PY value.
In addition, described communicating pair is: access point and wireless site or access point and access point or wireless site and wireless site.
The present invention also provides a kind of update system of wildcard, and this system comprises first communication node and second communication node, it is characterized in that, comprises in first communication node and the second communication node: memory cell, key updating units and communication unit; Wherein:
The memory cell of first communication node and second communication node is used to store wildcard;
The key updating units of first communication node and second communication node is used for obtaining wildcard to be updated from the memory cell of first communication node and second communication node respectively, the pairing quality number of the wildcard that this is to be updated is as the prime number parameter P of Diffie-Hellman Diffie-Hellman, and use described prime number parameter P, less than the positive integer g of described prime number parameter P and the random number sx and the sy of each self-generating, calculate respectively: PX=g
Sx(mod P) and PY=g
Sy(mod P); And the communication unit that passes through first communication node and second communication node respectively exchanges PX value and PY value;
The key updating units of first communication node and second communication node is respectively after the communication unit acquisition PY value and PX value of first communication node and second communication node, with (PY)
Sx(mod P)=(PX)
Sy(modP) as new wildcard.
In addition, described g is the primitive root of described prime number parameter P.
In addition, the described pairing quality number of wildcard to be updated is: greater than the minimum quality number of described wildcard to be updated or less than the maximum quality number of described wildcard to be updated or with the quality number of described wildcard difference minimum to be updated.
In addition, described first communication node and second communication node are respectively: access point and wireless site or wireless site and access point or access point and access point or wireless site and wireless site.
In sum, the present invention is by the dynamic adjustment to the prime number parameter P that is used for DH exchange, make DH exchange increase a covert parameter, and new prime number parameter P selects to obtain according to the value of former shared key, therefore increased randomness and the dynamic range of prime number parameter P; And then under the situation of prime number parameter P less (amount of calculation of DH exchange also can correspondingly reduce), also can guarantee certain fail safe.
Description of drawings
Fig. 1 is the flow chart of Diffie-Hellman Diffie-Hellman of the prior art;
Fig. 2 is the update method flow chart of embodiment of the invention wildcard;
Fig. 3 is the update system structural representation of embodiment of the invention wildcard.
Embodiment
Core concept of the present invention is, utilize the basic principle of Diffie-Hellman Diffie-Hellman (hereinafter to be referred as the DH exchange) to carry out the renewal of wildcard, and when the each DH of use exchange, upgrade prime number parameter P, so that under the prerequisite of using less P value, can realize safer DH exchange.
Describe the present invention below in conjunction with drawings and Examples.
Fig. 2 is the update method flow chart of embodiment of the invention wildcard; In the present embodiment, suppose that wildcard to be updated is PSK0, this shared key can be the key of the manual input of user, also can be the last key that upgrades; The communicating pair node is respectively STA (for example, portable terminal) and AP.As shown in Figure 2, this method comprises the steps:
201:STA sends the request of inquiring after to AP;
202:AP returns to STA and inquires after response;
Inquire after and comprise WAPI information element (concrete form sees the WAPI standard document for details) in the response frame.In the present embodiment, discriminating that comprises in the WAPI information element and key management external member differentiate and key management that for the WAI wildcard promptly AP specifies and adopts wildcard to derive BK.
203:STA sends the link verification request to AP;
204:AP is to the auth response of STA return link;
205:STA selects the pairing quality number of PSK0 (promptly greater than 2 prime number) as prime number parameter P new, that be used for the DH exchange, and selects the primitive root parameter g of prime number parameter P;
Wherein, the pairing prime number parameter of PSK0 P can be: greater than the minimum quality number of PSK0 or greater than PSK0 and greater than the minimum quality number of a certain pre-set threshold or less than the maximum quality number of PSK0 or less than PSK0 and less than the maximum quality number of a certain pre-set threshold or with quality number of PSK0 difference minimum etc.Certainly, if PSK0 itself is exactly the quality number, also can be with PSK0 as prime number parameter P.
STA can be that PSK0 selects corresponding prime number parameter P according to the mapping table of storing in STA and AP in advance also, is provided with the pairing prime number parameter of the interval P of different PSK0 in the described mapping table.
In addition, because prime number parameter P has a plurality of primitive roots, so primitive root parameter g also can be that the rule of consulting in advance according to STA and AP (for example the mapping table of storage) is in advance selected.
206:STA generates random number sx, and calculates PX=g
Sx(mod P);
207:STA sends related request to AP, comprises the WAPI information element in this request, and above-mentioned PX value;
208: after receiving the association request of STA transmission, AP selects prime number parameter P, primitive root parameter g according to the rule identical with STA;
209:AP generates random number sy, calculates PY=g
Sy(mod P); And generate new wildcard:
PSK1＝(PX)
sy(mod?P)。
210:AP sends associated response to STA, wherein comprises the PY value.
After 211:STA receives associated response, generate the new shared key identical with AP:
PSK1＝(PY)
sx(mod?P)。
So far, STA and AP have finished the renewal of wildcard.
Though invention has been described with the example that is updated to of carrying out wildcard between AP and the STA in the foregoing description, obviously, the present invention is equally applicable between AP and the AP, the renewal of the wildcard between STA and the STA.
In addition, technical scheme of the present invention also can be applied to adopt in the cable network of wildcard.
According to basic principle of the present invention, the foregoing description can also have multiple mapping mode, for example:
(1) STA also can exchange the PY/PX value with AP in related request, link verification request, beacon frame and link verification request again, beacon frame and related request/related again request or other interaction message;
(2) renewal of wildcard can carried out association at every turn, carry out during related or link verification again;
(3) wildcard also can regularly upgrade, for example, when the renewal initiator (as AP) of wildcard when wildcard is expired, send to the opposing party who uses this wildcard and to comprise the more message (as inquiring after response) of new logo and PX value of wildcard, the renewal that begins wildcard is operated.
(4) the primitive root parameter g of DH exchange also can be changed to a positive integer g ' less than prime number parameter P; Of course not can reduce the fail safe of DH exchange algorithm to a certain extent with primitive root.
Fig. 3 is the update system structural representation of embodiment of the invention wildcard, and as shown in Figure 3, this system comprises: first communication node, second communication node.
First communication node and second communication node can be: access point and wireless site or access point and access point or wireless site and wireless site.
Comprise in first communication node and the second communication node: memory cell, key updating units and communication unit; Wherein:
The memory cell of first communication node and second communication node is used to store wildcard;
The key updating units of first communication node and second communication node is used for obtaining wildcard to be updated from memory cell, the pairing quality number of the wildcard that this is to be updated is as the prime number parameter P of Diffie-Hellman Diffie-Hellman, and use described prime number parameter P, less than the positive integer g of described prime number parameter P and the random number sx and the sy of each self-generating, calculate respectively: PX=g
Sx(mod P) and PY=g
Sy(mod P); And the communication unit that passes through first communication node and second communication node respectively exchanges PX value and PY value;
The key updating units of first communication node and second communication node is respectively after the communication unit acquisition PY value and PX value of first communication node and second communication node, with (PY)
Sx(mod P)=(PX)
Sy(modP), and deposit it memory cell of first communication node and second communication node in respectively as new wildcard.
Wherein, described g is the primitive root of described prime number parameter P.
The described pairing quality number of wildcard to be updated is: greater than the minimum quality number of described wildcard to be updated or less than the maximum quality number of described wildcard to be updated or with the quality number of described wildcard difference minimum to be updated.
In sum, the present invention is by the dynamic adjustment to the prime number parameter P that is used for DH exchange, make DH exchange increase a covert parameter, and new prime number parameter P selects to obtain according to the value of former shared key, therefore increased randomness and the dynamic range of prime number parameter P; And then under the situation of prime number parameter P less (amount of calculation of DH exchange also can correspondingly reduce), also can guarantee certain fail safe.
Claims (10)
1, a kind of update method of wildcard is characterized in that, this method comprises:
Communicating pair is with the prime number parameter P of the pairing quality number of wildcard to be updated as the Diffie-Hellman Diffie-Hellman;
Communicating pair uses described prime number parameter P, less than the positive integer g of described prime number parameter P and the random number sx and the sy of each self-generating, calculate respectively: PX=g
Sx(mod P) and PY=g
Sy(mod P);
Communicating pair exchange PX value and PY value, and with (PY)
Sx(mod P)=(PX)
Sy(mod P) is as new wildcard.
2, the method for claim 1 is characterized in that,
Described g is the primitive root of described prime number parameter P.
3, the method for claim 1 is characterized in that,
The described pairing quality number of wildcard to be updated is: greater than the minimum quality number of described wildcard to be updated or less than the maximum quality number of described wildcard to be updated or with the quality number of described wildcard difference minimum to be updated.
4, the method for claim 1 is characterized in that,
Described communicating pair is described PX value of exchange and PY value or in related request again with exchange described PX value and PY value again in the associated response or exchange described PX value and PY value in link verification request and link verification respond in association request and associated response respectively, and with (PY)
Sx(mod P)=(PX)
Sy(mod P) is as new wildcard.
5, the method for claim 1 is characterized in that,
After described wildcard to be updated surpassed predefined life cycle, the direction the opposing party in the described communicating pair sent and carries the more message of new logo and described PX value of wildcard;
Described the opposing party receives the described wildcard that carries more after the message of new logo, sends described PY value.
6, the method for claim 1 is characterized in that,
Described communicating pair is: access point and wireless site or access point and access point or wireless site and wireless site.
7, a kind of update system of wildcard, this system comprise first communication node and second communication node, it is characterized in that, comprise in first communication node and the second communication node: memory cell, key updating units and communication unit; Wherein:
The memory cell of first communication node and second communication node is used to store wildcard;
The key updating units of first communication node and second communication node is used for obtaining wildcard to be updated from the memory cell of first communication node and second communication node respectively, the pairing quality number of the wildcard that this is to be updated is as the prime number parameter P of Diffie-Hellman Diffie-Hellman, and use described prime number parameter P, less than the positive integer g of described prime number parameter P and the random number sx and the sy of each self-generating, calculate respectively: PX=g
Sx(mod P) and PY=g
Sy(mod P); And the communication unit that passes through first communication node and second communication node respectively exchanges PX value and PY value;
The key updating units of first communication node and second communication node is respectively after the communication unit acquisition PY value and PX value of first communication node and second communication node, with (PY)
Sx(mod P)=(PX)
Sy(modP) as new wildcard.
8, system as claimed in claim 7 is characterized in that,
Described g is the primitive root of described prime number parameter P.
9, system as claimed in claim 7 is characterized in that,
The described pairing quality number of wildcard to be updated is: greater than the minimum quality number of described wildcard to be updated or less than the maximum quality number of described wildcard to be updated or with the quality number of described wildcard difference minimum to be updated.
10, system as claimed in claim 7 is characterized in that,
Described first communication node and second communication node are respectively: access point and wireless site or wireless site and access point or access point and access point or wireless site and wireless site.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910119744.4A CN101521882B (en) | 2009-03-24 | 2009-03-24 | Method and system for updating preshared key |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910119744.4A CN101521882B (en) | 2009-03-24 | 2009-03-24 | Method and system for updating preshared key |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101521882A true CN101521882A (en) | 2009-09-02 |
| CN101521882B CN101521882B (en) | 2014-03-12 |
Family
ID=41082207
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200910119744.4A Expired - Fee Related CN101521882B (en) | 2009-03-24 | 2009-03-24 | Method and system for updating preshared key |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101521882B (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103532720A (en) * | 2013-10-22 | 2014-01-22 | 杭州华三通信技术有限公司 | Transmission method and equipment of CAPWAP message |
| CN104602231A (en) * | 2015-02-10 | 2015-05-06 | 杭州华三通信技术有限公司 | Method and device for updating pre-shared keys |
| CN105763318A (en) * | 2016-01-29 | 2016-07-13 | 杭州华三通信技术有限公司 | Pre-shared key obtaining method, pre-shared key distribution method and pre-shared key distribution device |
| CN108347404A (en) * | 2017-01-24 | 2018-07-31 | ***通信有限公司研究院 | A kind of identity identifying method and device |
| CN110831000A (en) * | 2019-10-31 | 2020-02-21 | 迈普通信技术股份有限公司 | Secure access method, device and system |
| CN112584355A (en) * | 2020-12-13 | 2021-03-30 | 北京明朝万达科技股份有限公司 | Key cooperation method, system and medium for inter-vehicle communication |
| CN113973001A (en) * | 2020-07-25 | 2022-01-25 | 华为技术有限公司 | Method and device for updating authentication key |
| CN116886669A (en) * | 2023-09-08 | 2023-10-13 | 明阳时创(北京)科技有限公司 | Method and system for distributing IPv6 address by DHCPv6 |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1534931A (en) * | 2003-04-02 | 2004-10-06 | 华为技术有限公司 | Method of forming dynamic key in radio local network |
| CN101374153A (en) * | 2007-08-23 | 2009-02-25 | ***通信集团公司 | Method for activating a third party application safely, a third party server, terminal and system |
| CN101388770A (en) * | 2008-10-20 | 2009-03-18 | 华为技术有限公司 | Method, server and customer apparatus for acquiring dynamic host configuration protocol cipher |
-
2009
- 2009-03-24 CN CN200910119744.4A patent/CN101521882B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1534931A (en) * | 2003-04-02 | 2004-10-06 | 华为技术有限公司 | Method of forming dynamic key in radio local network |
| CN101374153A (en) * | 2007-08-23 | 2009-02-25 | ***通信集团公司 | Method for activating a third party application safely, a third party server, terminal and system |
| CN101388770A (en) * | 2008-10-20 | 2009-03-18 | 华为技术有限公司 | Method, server and customer apparatus for acquiring dynamic host configuration protocol cipher |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103532720A (en) * | 2013-10-22 | 2014-01-22 | 杭州华三通信技术有限公司 | Transmission method and equipment of CAPWAP message |
| CN104602231A (en) * | 2015-02-10 | 2015-05-06 | 杭州华三通信技术有限公司 | Method and device for updating pre-shared keys |
| CN105763318A (en) * | 2016-01-29 | 2016-07-13 | 杭州华三通信技术有限公司 | Pre-shared key obtaining method, pre-shared key distribution method and pre-shared key distribution device |
| CN105763318B (en) * | 2016-01-29 | 2018-09-04 | 新华三技术有限公司 | A kind of wildcard obtains, distribution method and device |
| CN108347404B (en) * | 2017-01-24 | 2021-10-26 | ***通信有限公司研究院 | Identity authentication method and device |
| CN108347404A (en) * | 2017-01-24 | 2018-07-31 | ***通信有限公司研究院 | A kind of identity identifying method and device |
| CN110831000B (en) * | 2019-10-31 | 2023-04-07 | 迈普通信技术股份有限公司 | Secure access method, device and system |
| CN110831000A (en) * | 2019-10-31 | 2020-02-21 | 迈普通信技术股份有限公司 | Secure access method, device and system |
| CN113973001A (en) * | 2020-07-25 | 2022-01-25 | 华为技术有限公司 | Method and device for updating authentication key |
| CN113973000A (en) * | 2020-07-25 | 2022-01-25 | 华为技术有限公司 | Method and device for processing pre-shared key PSK |
| CN113973002A (en) * | 2020-07-25 | 2022-01-25 | 华为技术有限公司 | Data key updating method and device |
| WO2022021940A1 (en) * | 2020-07-25 | 2022-02-03 | 华为技术有限公司 | Method and device for updating preshared key (psk) |
| EP4178156A4 (en) * | 2020-07-25 | 2023-12-06 | Huawei Technologies Co., Ltd. | Method and device for updating preshared key (psk) |
| CN112584355A (en) * | 2020-12-13 | 2021-03-30 | 北京明朝万达科技股份有限公司 | Key cooperation method, system and medium for inter-vehicle communication |
| CN116886669A (en) * | 2023-09-08 | 2023-10-13 | 明阳时创(北京)科技有限公司 | Method and system for distributing IPv6 address by DHCPv6 |
| CN116886669B (en) * | 2023-09-08 | 2023-11-14 | 明阳时创(北京)科技有限公司 | Method and system for distributing IPv6 address by DHCPv6 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101521882B (en) | 2014-03-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101521882B (en) | Method and system for updating preshared key | |
| CN101371491B (en) | Method and arrangement for the creation of a wireless mesh network | |
| CN100550725C (en) | The method of a kind of user and application server negotiating about cipher key shared | |
| CN101273572B (en) | System, method and computer program product for authenticating a data agreement between network entities | |
| CN101222325B (en) | Wireless multi-hop network key management method based on ID | |
| CN1835436B (en) | General power authentication frame and method of realizing power auttientication | |
| CN104660603A (en) | Method and system for extended use of quantum keys in IPSec VPN (internet protocol security-virtual private network) | |
| CN101521580B (en) | Wireless LAN authentication and privacy infrastructure unicast key negotiation method and system | |
| CN101635710B (en) | Pre-shared-key-based method for controlling secure access to networks and system thereof | |
| CN101626370B (en) | Method, system and equipment for distributing secret keys to nodes | |
| CN101771586A (en) | Method, system and equipment for realizing equipment adding in wireless fidelity (Wi-Fi) peer-to-peer network | |
| CN108616354A (en) | Cryptographic key negotiation method and equipment in a kind of mobile communication | |
| CN103002442A (en) | Safe wireless local area network key distribution method | |
| CN101980558A (en) | Method for encryption authentication on Ad hoc network transmission layer protocol | |
| US9509670B2 (en) | System and method for managing secure communications in an Ad-Hoc network | |
| CN101183935A (en) | Cipher key negotiation method, device and system of RTP packet | |
| CN102209319B (en) | Method for raising control efficiency of access controllers in MESH network and access controllers | |
| CN102420642A (en) | Bluetooth device and communication method thereof | |
| CN104012130B (en) | Communication security processing method and processing device | |
| CN109714164B (en) | Method for IKEv2 to negotiate use of quantum key | |
| CN101527907A (en) | Wireless local area network access authentication method and wireless local area network system | |
| CN103731819A (en) | Authentication method of wireless sensor network nodes | |
| CN101635922B (en) | Safety communication method of wireless mesh network | |
| CN105848140B (en) | It can be realized the End-to-End Security method for building up of communication supervision in a kind of 5G network | |
| CN101820626B (en) | Wireless MESH network ID based partially blind signature method without credible PKG (Private Key Generator) |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| ASS | Succession or assignment of patent right |
Owner name: ZTE CO., LTD. Free format text: FORMER OWNER: LIU JIAN Effective date: 20100122 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20100122 Address after: Department of legal affairs, Zhongxing building, South hi tech Industrial Park, Nanshan District, Shenzhen, Guangdong Applicant after: ZTE Corporation Address before: Guangdong Shenzhen hi tech Industrial Park Nanshan District science and technology south road Zhongxing building law department Applicant before: Liu Jian |
|
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: NANJING BRANCH OF ZTE CORPORATION Free format text: FORMER OWNER: ZTE CORPORATION Effective date: 20131231 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 518057 SHENZHEN, GUANGDONG PROVINCE TO: 210012 NANJING, JIANGSU PROVINCE |
|
| TA01 | Transfer of patent application right |
Effective date of registration: 20131231 Address after: 210012 Zhongxing communication, No. 68, Bauhinia Road, Yuhuatai District, Jiangsu, Nanjing Applicant after: Nanjing Branch of Zhongxing Communication Co., Ltd. Address before: 518057 Nanshan District Guangdong high tech Industrial Park, South Road, science and technology, ZTE building, Ministry of Justice Applicant before: ZTE Corporation |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20150716 Address after: 518057 Nanshan District Guangdong high tech Industrial Park, South Road, science and technology, ZTE building, Ministry of Justice Patentee after: ZTE Corporation Address before: 210012 Zhongxing communication, No. 68, Bauhinia Road, Yuhuatai District, Jiangsu, Nanjing Patentee before: Nanjing Branch of Zhongxing Communication Co., Ltd. |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140312 Termination date: 20180324 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |