Efficient key establishment for wireless networks

Information

  • Patent Grant
  • 9769653
  • Patent Number
    9,769,653
  • Date Filed
    Friday, August 2, 2013
    10 years ago
  • Date Issued
    Tuesday, September 19, 2017
    6 years ago
  • CPC
  • Field of Search
    • US
    • 713 168000
    • 713 170000
    • 713 171000
    • 380 044000
    • 380 277000
    • 726 004000
    • CPC
    • H04L2209/80
    • H04L9/0844
    • H04L9/0891
    • H04L9/0838
    • H04L9/083
    • G06Q20/3674
  • International Classifications
    • H04L9/00
    • H04W12/04
    • H04L29/06
    • Disclaimer
      This patent is subject to a terminal disclaimer.
      Term Extension
      309
Abstract
A method and apparatus for deriving an encryption key for use between two stations in a wireless network using information intrinsic to one of the stations, without exchanging pairwise transient keys.
Description
BACKGROUND

Aspects of the present invention relate generally to the field of network security, and more particularly to the exchange of keys between stations in a wireless network.


In wireless local area networks (LANs), link layer security protocols may be based on the IEEE 802.11 specifications. Early security models such as Wired Equivalent Privacy (WEP), Temporal Key Integrity Protocol (TKIP) and Wi-Fi Protected Access (WPA) that were typically used to protect data sent between stations in a wireless network have been replaced with WPA2. The WPA2 protocol uses an Advanced Encryption Standard (AES) cipher with Counter Mode with Cipher Block Chaining Message Authentication Code Protocol (CCMP). WPA2 uses a four-way handshake to exchange unique nonce (number used once) pairs and establish a unique pairwise key for each pair of communicating stations.


A wireless LAN may utilize a variety of architectures. For example, a wireless LAN can be organized in a star topology with a central access point station communicating with several client stations. Each client station communicates directly only with the access point. Stations can be connected to a network via a network adapter or network interface card that manages the network communications and can provide a MAC address for the station. Alternatively, a wireless LAN can be organized with a basic service set (BSS). In a BSS topology, all the client stations communicate directly with each other. An independent BSS allows communication without use of an access point. Peer-to-peer networks or ad-hoc networks may be independent BSS networks. An infrastructure BSS allows communication between client stations on the BSS network and client stations not on the BSS network via an access point.


Independent Basic Service Set (IBSS) networks, mesh networks, and direct link setup networks in accordance with the IEEE 802.11z standard, may each use a WPA2 protocol to protect inter-station communications. The WPA2 security protocol used in an IBSS may be complicated by the need for unique key/nonce pairs for each pair of communicating stations. A smesh network is an 802.11 multi-hop wireless network that uses a fast handoff scheme to enable client devices to roam in the network within interruption in connectivity. In such systems, where there may not be a central access point responsible for managing communication and security among the nodes of the network, secure communication requires that each station exchange a pair of keys with every other station with which the station communicates.


SUMMARY

A method and apparatus are provided for deriving an encryption key for use between two stations in a wireless network using information intrinsic to one of the stations, without exchanging pairwise transient keys. In some embodiments, the intrinsic information may be information provided in a beacon signal transmitted by one of the stations. In some embodiments, the intrinsic information may include the media access control (MAC) addresses of the stations. In some embodiments, infinite error detection may be used to verify the integrity of messages exchanged between the stations.





BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is described herein with reference to the accompanying drawings, in which similar reference numbers are used to indicate functionally similar elements. The foregoing and other aspects of various embodiments of the present invention will be apparent through examination of the following detailed description thereof in conjunction with the accompanying drawing figures in which similar reference numbers are used to indicate functionally similar elements.



FIG. 1 shows a conventional star topology for a wireless network.



FIG. 2 shows a conventional key exchange using a four-way handshake between an access point and a client station.



FIG. 3 shows a conventional exchange of encrypted data between an access point and a client station.



FIG. 4 shows one embodiment of a fully connected mesh network topology.



FIG. 5 shows one embodiment of an ad hoc mesh network that is not fully connected.



FIG. 6 is a simplified flow diagram illustrating general operation of a traditional method of exchanging secure keys and communicating encrypted data in a wireless network.



FIG. 7 is a simplified flow diagram illustrating general operation of one embodiment of a method of establishing secure keys with intrinsic information and exchanging encrypted data in a wireless network.





DETAILED DESCRIPTION


FIG. 1 shows a conventional star topology for a wireless network. Each client station 101-104 communicates with access point 100. Access point 100 functions as a gateway for a client station to a local area network (LAN) or to the Internet. Additionally, if client station 101 communicates with client station 102, the communication would be facilitated via access point 100. Once client station 101 begins communicating with access point 100, access point 100 initiates an authentication protocol to verify the identity of the access point to the client station. For example a variation of Extensible Authentication Protocol (EAP) can be used, which includes the exchange of a Pairwise Master Key (PMK). The PMK is unique for each access point/client station pair, but may be communicated sparingly in order to preserve the secrecy of the PMK.


To initiate secure communication between access point 100 and client station 101, additional security may be provided at the link layer and may involve the exchange of secure Pairwise Transient Keys (PTKs). AES-CCMP is an example of an encryption protocol used to exchange PTKs. The keys exchanged between access point 100 and client station 101 should be unique from the keys exchanged with client station 102. Therefore, access point 100 may exchange different keys with each client station.



FIG. 3 shows a conventional exchange of encrypted data between two network adapters. Each station capable of communicating in a wireless network may implement a network adapter. A network adapter manages the network connection, provides a MAC address for the station, and implements an encryption algorithm to facilitate secure communications. As shown in FIG. 3, client station 101 includes a network adapter 300, and access point 100 includes a network adapter 310. Once the PTK has been established, data may be exchanged between network adapter 300 and network adapter 310. Network adapter 300 combines key 301 and initialization vector 303 with encryption algorithm 304, the output of such combination is key stream 305. Key stream 305 is XOR'd with plain text data 302 to create cipher text 306. Cipher text 306 is an encrypted message that may safely be sent to network adapter 310. Network adapter 310 similarly uses key 301, initialization vector 303, and encryption algorithm 304 to create key stream 305. Key stream 305 is then XOR'd with cipher text 306 to derive plain text data 302.


Key 301 may be the PTK established during the four-way handshake. Initialization vector 303 may be a unique value for each packet of data sent from network adapter 300 to network adapter 310. A unique initialization vector 303 for every packet ensures that key stream 305 is unique for every packet sent. If key stream 305 never varied, key stream 305 may be deciphered by intercepting multiple packets with similar plain text data. To accommodate a unique initialization vector, nonce values may be exchanged between stations.



FIG. 2 shows a conventional key exchange using a four-way handshake between access point 100 and client station 101. As previously noted, upon joining the network, client station 101 and access point 100 may engage in an authentication exchange 200 to authenticate the identity of client station 101. Then the four-way handshake may begin. Number used once (nonce) 201 and nonce 202 are exchanged. Once utilized, nonce 201 and nonce 202 may not be used in another four-way handshake by either station. Acknowledgment messages ACK 203 and ACK 204 are then exchanged. The four-way handshake exchange may occur between each pair of communicating stations in the network to ensure that an encryption key is unique for each client station/access point station pair.


A Pairwise Transient Key (PTK) may be derived using the earlier exchanged PMK, nonce 201, nonce 202, and the Media Access Control (MAC) addresses of communicating stations. Acknowledgement messages may additionally include a Group Temporal Key (GTK), which is a sequence number for use with the relay of broadcast messages, and a message integrity check (MIC) value. A MIC can be used to verify the integrity of the message and may additionally be exchanged with the nonce values. In some implementations, MIC is computed or derived from a hash function, for instance. If both client station 101 and access point station 100 calculate a MIC value, any discrepancy between the two calculated values can indicate that the message has been tampered with or has otherwise been altered. A GTK is a key that can be used by a broadcasting station to validate each broadcast transmission.



FIG. 4 shows one embodiment of a mesh network topology. A mesh network can be any ad hoc network in which the stations communicate directly with other stations without an access point managing the communications. In a fully connected mesh network, a station may be connected to every other station in the network, and any station may be connected to a LAN or to the Internet. As shown in FIG. 4, station 401 communicates directly with station 402, station 403, and station 404. Using traditional security protocols, in order to maintain secure communications, station 401 would need to exchange unique keys with every other station with which station 401 communicates, e.g., with station 402, 403, and 404. Then station 402 would need to exchange unique keys with every other station with which it communicates. If there are N stations in the network, the key exchange involves N*(N−1) exchanges, each exchange involving a four-way handshake. This exchange of unique keys may result in substantial overhead.



FIG. 5 shows one embodiment of an ad hoc mesh network that is not fully connected. Station 501 communicates directly with station 502 and station 504, but not station 503. Station 505 communicates directly with only station 503. As shown, the stations in the network are not able to communicate directly with every other station in the network, but are capable of indirect communication via one or more additional stations. For example, communication between station 501 and station 505 may be relayed through station 503 and station 504. Each station then only needs to exchange encryption keys with those stations in the network with which direct communication is possible. Station 503 can exchange encryption keys with station 502, station 504 and station 505, but not station 501. Although less than N*(N−1) exchanges are needed to facilitate secure communication in the network, each key exchange still involves a four-way handshake, resulting in substantial overhead. An independent BSS network or a direct link setup network may also be organized using a mesh network topology.


In a mesh network involving broadcast or multicast of messages, significant difficulties arise over the exchange of unique keys. Each broadcasting station may have a unique GTK that may be exchanged with every station capable of receiving a broadcast message. A station added to an ad hoc network may not be able to receive broadcast messages until it has exchanged a GTK with the broadcasting station. The GTK may change with every addition or removal of a station in the mesh network, which may require an update of the GTK at every station in the network, each update involving a handshake between communicating stations. The exchange and update of the GTK therefore may involve substantial overhead.


Encrypting data without the explicit exchange of unique keys eliminates some of the overhead inherent in the unique key exchange between stations in a mesh network. Additionally, allowing stations to receive broadcast messages without first requiring an explicit exchange of keys can decrease overhead time by allowing more efficient broadcast communication. To maintain security without an explicit exchange of information, data can be encrypted using keys derived from intrinsic information known within the stations.


In one embodiment, a station communicates with other stations in the network via a network adapter or network interface card. The network adapter comprises an encryption module. The encryption module can be implemented in hardware, such as memory registers, buffers, or other memory structures, or in software or other hardware executable instructions. The encryption module has access to information intrinsic to the station. Intrinsic information can be any information known within the station, or obtainable by the station, that is not obtained with the traditional four-way handshake.


In one embodiment, intrinsic information used to derive an encryption key includes information included in a beacon message. A beacon message is a packet that is typically sent to alert stations in an ad hoc network that a new station has been added to the network. Information for portions of a unique key to secure communications with the station that transmitted the beacon can be derived from information included in the beacon.


In one embodiment, a unique key is established between station 501 and station 502 using the standard four-way handshake, then implicit knowledge of additional devices communicating with station 501, for example station 504, is used to establish a unique key between station 502 and station 504. The derivation of a key based on prior communications between stations can be facilitated with the use of the implicit knowledge within station 501 of the MAC addresses of the stations with which station 501 communicates.


In one embodiment, key derivation and exchange is simplified. For example, a unique key is established with the exchange of a single nonce value, rather than two separate nonce values. The data packet exchanged between stations containing the nonce value includes additional sequence space in the packet header. The sequence space may be used in combination with the single nonce value to calculate a unique key.


In one embodiment, the use of an infinite error extension mode eliminates the need for unique key pairs. Infinite error extension used to derive a MIC value included in the encrypted transmission allows for secure communication and authentication without the use of unique pairs, as any error in the message will be known.



FIG. 6 is a simplified flow diagram illustrating general operation of a traditional method of exchanging secure keys and communicating encrypted data in a wireless network. With reference also to FIG. 2, it will be appreciated that aspects of the method illustrated in FIG. 6 may generally be conducted by one or more components of client station 101 depicted at the left of FIG. 2. The exchange of encryption keys to facilitate secure communication of data can begin when a station (such as station 101) joins a wireless network at block 601. Upon joining the network, an authentication protocol is initiated at block 602 to verify the identity of the station. A nonce value is sent at block 603. The nonce value can be used as a first unique initialization vector with the encryption key and an encryption algorithm to protect data confidentiality. At block 604 a second nonce value is received. A key is derived at block 605 using both nonce values. An acknowledgment message is sent at block 606; the acknowledgement message comprises a message integrity check value. An acknowledgment message is received at block 607. If the received acknowledgment message contains a message integrity check, and a message integrity check calculated with the second acknowledgment message are not equivalent at decision block 608, then an error may have occurred during the transmission of nonce values or acknowledgement messages, and the exchange may be again attempted. If at decision block 608 the received and calculated message integrity check values are equivalent, the pairwise transient keys have been successfully exchanged and transmission data can be effectively encrypted at block 609. An exchange of data then occurs at block 610.



FIG. 7 is a simplified flow diagram illustrating general operation of one embodiment of a method of establishing secure keys with intrinsic information and exchanging encrypted data in a wireless network. The exchange of encryption keys to facilitate secure communication of data may be unnecessary when intrinsic information is used to derive an encryption key. The derivation of an encryption key can be initiated when a station joins a wireless network at block 601. Upon joining the network, an authentication protocol is initiated at block 602 to verify the identity of the new station. To initiate communication with the new station, a network station first derives an encryption key. The key is derived at block 701 using information already known in, or intrinsic to the initiating station. This intrinsic information can be some combination of station MAC addresses, data exchanged during authentication, data contained in a beacon message used to announce the addition of the new station to the network, etc. If both the receiving and communicating stations have access to the intrinsic data, and both stations use the same algorithm to derive the keys, then communication between the stations may be secure. Once an encryption key has been derived, transmission data can be effectively encrypted (at block 609) and an exchange of data can then occur (at block 610) generally as set forth above.


It is noted that the arrangement of the blocks in FIG. 7 does not necessarily imply a particular order or sequence of events, nor is the arrangement intended to exclude other possibilities. For example, the operations depicted at 602 and 701 may occur substantially simultaneously with each other; similarly, the operation occurring at block 602 may be eliminated in some instances.


Although the above embodiments were described primarily as applicable to a mesh network, the embodiments may be effectively utilized in any wireline or wireless network that conventionally uses an exchange of unique key pairs to encrypt secure data, including an IBSS network, an smesh network, a DLS network, or a conventional network based on a star topology with an access point and client stations.


While the invention has been described in detail above with reference to some embodiments, alternative implementations and various modifications are within the scope of the present disclosure. Therefore, the invention should be considered as limited only by the scope of the appended claims.

Claims
  • 1. A method comprising: receiving, at a first network station, a data packet containing intrinsic information corresponding to a second network station joining a wireless network;deriving an encryption key using the intrinsic information corresponding to the second network station without a four-way handshake between the first and second network stations, the encryption key usable to encrypt data to be communicated between the first and second network stations through secure communication;encrypting data using the encryption key; andcommunicating, through the secure connection, the encrypted data to the second network station.
  • 2. The method of claim 1, wherein the encrypted data is communicated to the second network station without exchanging pairwise transient keys with the second network station.
  • 3. The method of claim 1, wherein the data packet comprises a beacon signal.
  • 4. The method of claim 1, wherein the intrinsic information comprises a media access control (MAC) address of the second network station.
  • 5. The method of claim 1, wherein the wireless network does not include a central access point.
  • 6. The method of claim 1, wherein the wireless network comprises a mesh network.
  • 7. The method of claim 1, wherein the wireless network comprises one of an independent basic service set (IBSS) network, a smesh network, or a distributed link software (DLS) network.
  • 8. A first network station in a wireless network, the first network station configured to receive a beacon signal when a second network station joins the wireless network, the first network station comprising:at least a memory and a processor to implement a network adaptor, the network adapter configured to:extract information intrinsic to the second network station from the beacon signal;derive an encryption key using the information intrinsic to the second network station without a four-way handshake between the first and second network stations, the encryption key usable to encrypt data to be communicated between the first and second network stations through secure communication; andencrypt data for communication to the second network station using the encryption key.
  • 9. The first network station of claim 8, wherein the information intrinsic to the second network station comprises a media access control (MAC) address of the second network station.
  • 10. The first network station of claim 8, wherein the first network station is further configured to communicate the encrypted data to the second network station without exchanging pairwise transient keys with the second network station.
  • 11. The first network station of claim 8, wherein the wireless network does not include a central access point.
  • 12. The first network station of claim 8, wherein the wireless network comprises a mesh network.
  • 13. The first network station of claim 8, wherein the wireless network comprises one of an independent basic service set (IBSS) network, a smesh network, or a distributed link software (DLS) network.
  • 14. A method comprising: establishing, at a first network station, a first unique key with a second network station;receiving information corresponding to a third network station from the second network station;deriving a second unique key using the information corresponding to the third network station without a four-way handshake, the second unique key usable to encrypt data to be communicated between the first and third network stations through secure communication;encrypting data using the second unique key; andcommunicating, through the secure communication, the encrypted data to the third network station.
  • 15. The method of claim 14, wherein the information corresponding to the third network station was derived by the second network station based on prior communications between the second network station and the third network station.
  • 16. The method of claim 14, wherein the information corresponding to the third network station comprises a media access control (MAC) address of the third network station.
  • 17. The method of claim 14, wherein the first unique key is established using a four-way handshake.
  • 18. The method of claim 14, wherein the encrypted data is communicated to the third network station without a prior exchange of pairwise transient keys between the first network station and the third network station.
  • 19. The method of claim 14, wherein the wireless network comprises a mesh network.
  • 20. The method of claim 14, wherein the wireless network comprises one of an independent basic service set (IBSS) network, a smesh network, or a distributed link software (DLS) network.
RELATED APPLICATIONS

This application is a continuation of and claims priority to U.S. Utility application Ser. No. 12/541,731, filed Aug. 14, 2009, now U.S. Pat. No. 8,510,560 issued on Aug. 13, 2013, which claims priority to U.S. Provisional Patent Application Ser. No. 61/090,376 filed Aug. 20, 2008 and U.S. Provisional Patent Application Ser. No. 61/090,380 filed Aug. 20, 2008, the disclosures of which are incorporated by reference herein in their entirety.

US Referenced Citations (214)
Number Name Date Kind
5390165 Tuch Feb 1995 A
5467398 Pierce et al. Nov 1995 A
5469506 Berson et al. Nov 1995 A
5479514 Klonowski Dec 1995 A
5481733 Douglis et al. Jan 1996 A
5617118 Thompson Apr 1997 A
5673416 Chee et al. Sep 1997 A
5771356 Leger et al. Jun 1998 A
5828835 Isfeld et al. Oct 1998 A
5884099 Klingelhofer Mar 1999 A
5991519 Benhammou et al. Nov 1999 A
6006018 Burnett et al. Dec 1999 A
6014722 Rudin et al. Jan 2000 A
6058188 Chandersekaran et al. May 2000 A
6092108 DiPlacido et al. Jul 2000 A
6145069 Dye Nov 2000 A
6167514 Matsui et al. Dec 2000 A
6216230 Rallis et al. Apr 2001 B1
6230277 Nakaoka et al. May 2001 B1
6330626 Dennin et al. Dec 2001 B1
6389538 Gruse et al. May 2002 B1
6463509 Teoman et al. Oct 2002 B1
6473861 Stokes Oct 2002 B1
6564318 Gharda et al. May 2003 B1
6601167 Gibson et al. Jul 2003 B1
6614985 Tokunaka et al. Sep 2003 B1
6704872 Okada Mar 2004 B1
6711447 Saeed Mar 2004 B1
6756988 Wang et al. Jun 2004 B1
6799271 Kugai Sep 2004 B2
6823472 DeKoning et al. Nov 2004 B1
6832280 Malik et al. Dec 2004 B2
6901298 Govindaraj et al. May 2005 B1
7010808 Leung et al. Mar 2006 B1
7035827 Ezaki Apr 2006 B2
7036018 Horvat et al. Apr 2006 B2
7069439 Chen et al. Jun 2006 B1
7089419 Foster et al. Aug 2006 B2
7103788 Souza et al. Sep 2006 B1
7117352 Giles et al. Oct 2006 B1
7126913 Patel et al. Oct 2006 B1
7194638 Larky Mar 2007 B1
7206940 Evans et al. Apr 2007 B2
7210038 Walmsley Apr 2007 B2
7266842 Foster et al. Sep 2007 B2
7299365 Evans Nov 2007 B2
7308591 Dubinsky Dec 2007 B2
7333464 Yang et al. Feb 2008 B2
7356707 Foster et al. Apr 2008 B2
7370349 Holvey et al. May 2008 B2
7373506 Asano et al. May 2008 B2
7376976 Fierstein et al. May 2008 B2
7496952 Edwards et al. Feb 2009 B2
7499548 Meandzija et al. Mar 2009 B2
7511636 Takahashi Mar 2009 B2
7516325 Willey Apr 2009 B2
7522726 Ishiguro et al. Apr 2009 B2
7536558 Neble et al. May 2009 B2
7549056 Carr Jun 2009 B2
7571216 McRae et al. Aug 2009 B1
7596614 Saunderson et al. Sep 2009 B2
7606230 Cohen et al. Oct 2009 B1
7620784 Panabaker Nov 2009 B2
7676040 Augenstein et al. Mar 2010 B2
7725738 Langhammer et al. May 2010 B1
7743260 Fetik Jun 2010 B2
7774635 Shiota Aug 2010 B2
7788670 Bodas et al. Aug 2010 B2
7818389 Chiang et al. Oct 2010 B1
7835725 Suzuki et al. Nov 2010 B2
7865733 Goto et al. Jan 2011 B2
7873841 Mullis, II et al. Jan 2011 B2
7898857 Kirsch et al. Mar 2011 B2
7900060 Hodzic Mar 2011 B2
7916594 Yang Mar 2011 B2
7991943 Berenbaum et al. Aug 2011 B2
7995596 Kuila et al. Aug 2011 B2
8000284 Lott et al. Aug 2011 B2
8001592 Hatakeyama Aug 2011 B2
8094822 Suzuki Jan 2012 B2
8095816 Chan Jan 2012 B1
8117478 Liu et al. Feb 2012 B2
8139521 Mukherjee et al. Mar 2012 B2
8166309 Muralidharan et al. Apr 2012 B2
8171309 Poo May 2012 B1
8296555 Chu Oct 2012 B2
8321706 Zhang Nov 2012 B2
8327056 Chan Dec 2012 B1
8418242 Zhang et al. Apr 2013 B2
8423789 Poo et al. Apr 2013 B1
8443187 Orr May 2013 B1
8443211 Zhao et al. May 2013 B2
8483718 Hwang Jul 2013 B2
8510560 Lambert et al. Aug 2013 B1
8645716 Dujari et al. Feb 2014 B1
8688968 Chu et al. Apr 2014 B2
8694782 Lambert Apr 2014 B2
8839016 Zhang et al. Sep 2014 B2
8843686 Chan et al. Sep 2014 B1
9009778 Pearce et al. Apr 2015 B2
9220012 Inamdar Dec 2015 B1
9253175 Orr Feb 2016 B1
9363249 Lambert et al. Jun 2016 B2
9398455 Lambert Jul 2016 B2
9402270 Lambert Jul 2016 B2
9652249 Chu et al. May 2017 B1
20020065834 Wiggen et al. May 2002 A1
20020069354 Fallon et al. Jun 2002 A1
20020087816 Atkinson et al. Jul 2002 A1
20020103930 Kamentsky et al. Aug 2002 A1
20030014368 Leurig et al. Jan 2003 A1
20030188162 Candelore et al. Oct 2003 A1
20030200453 Foster et al. Oct 2003 A1
20030200454 Foster et al. Oct 2003 A1
20030208675 Burokas et al. Nov 2003 A1
20030236991 Letsinger Dec 2003 A1
20040030909 Sako et al. Feb 2004 A1
20040054898 Chao et al. Mar 2004 A1
20040125679 Kwean Jul 2004 A1
20040158669 Weng et al. Aug 2004 A1
20040158708 Peyravian et al. Aug 2004 A1
20040184343 Roohparvar et al. Sep 2004 A1
20040187001 Bousis Sep 2004 A1
20040193875 Aura Sep 2004 A1
20040257462 Goris et al. Dec 2004 A1
20040264699 Meandzija et al. Dec 2004 A1
20040266386 Kuo Dec 2004 A1
20050015602 Rees Jan 2005 A1
20050033869 Cline Feb 2005 A1
20050055547 Kawamura Mar 2005 A1
20050086551 Wirasinghe et al. Apr 2005 A1
20050108171 Bajikar et al. May 2005 A1
20050114686 Ball et al. May 2005 A1
20050138365 Bellipady et al. Jun 2005 A1
20050144468 Northcutt et al. Jun 2005 A1
20050156925 Fong et al. Jul 2005 A1
20050185596 Kamentsky et al. Aug 2005 A1
20050210290 Ono et al. Sep 2005 A1
20050278523 Fortin et al. Dec 2005 A1
20060036897 Lin et al. Feb 2006 A1
20060059372 Fayar et al. Mar 2006 A1
20060072748 Buer Apr 2006 A1
20060075259 Bajikar et al. Apr 2006 A1
20060090084 Buer Apr 2006 A1
20060104243 Park May 2006 A1
20060117177 Buer Jun 2006 A1
20060123248 Porter et al. Jun 2006 A1
20060136735 Plotkin et al. Jun 2006 A1
20060142906 Brozovich et al. Jun 2006 A1
20060156390 Baugher Jul 2006 A1
20060200670 Kuffel et al. Sep 2006 A1
20060209595 Newell Sep 2006 A1
20060233149 Rustagi et al. Oct 2006 A1
20060253704 Kempf et al. Nov 2006 A1
20060285686 Van Den Heuvel et al. Dec 2006 A1
20070005824 Howard Jan 2007 A1
20070011445 Waltermann et al. Jan 2007 A1
20070022469 Cooper et al. Jan 2007 A1
20070038866 Bardsley et al. Feb 2007 A1
20070097904 Mukherjee et al. May 2007 A1
20070098178 Raikar May 2007 A1
20070136792 Ting et al. Jun 2007 A1
20070150756 Kudelski Jun 2007 A1
20070180271 Hatakeyama et al. Aug 2007 A1
20070186105 Bailey et al. Aug 2007 A1
20070189249 Gurevich et al. Aug 2007 A1
20070220501 Yanagawa et al. Sep 2007 A1
20070234028 Rothman et al. Oct 2007 A1
20070242643 Chandra et al. Oct 2007 A1
20070260905 Marsden et al. Nov 2007 A1
20070277051 Reece et al. Nov 2007 A1
20070297606 Tkacik et al. Dec 2007 A1
20080016313 Murotake et al. Jan 2008 A1
20080028243 Morisawa Jan 2008 A1
20080034411 Aoyama Feb 2008 A1
20080043508 Chao et al. Feb 2008 A1
20080046732 Fu et al. Feb 2008 A1
20080066075 Nutter et al. Mar 2008 A1
20080072311 Mullick et al. Mar 2008 A1
20080082837 Mattsson Apr 2008 A1
20080091944 von Mueller et al. Apr 2008 A1
20080104422 Mullis et al. May 2008 A1
20080108322 Upp May 2008 A1
20080120717 Shakkarwar May 2008 A1
20080295157 Wong et al. Nov 2008 A1
20080298289 Jeyaseelan Dec 2008 A1
20080313462 Zhao et al. Dec 2008 A1
20090006658 Gough Jan 2009 A1
20090019250 Rofougaran et al. Jan 2009 A1
20090024846 Ganesan et al. Jan 2009 A1
20090049222 Lee et al. Feb 2009 A1
20090059841 Laroia et al. Mar 2009 A1
20090077618 Pearce et al. Mar 2009 A1
20090080389 Messerges et al. Mar 2009 A1
20090131061 Palanki et al. May 2009 A1
20090199031 Zhang Aug 2009 A1
20090217043 Metke et al. Aug 2009 A1
20090323972 Kohno et al. Dec 2009 A1
20090327608 Eschmann et al. Dec 2009 A1
20100023747 Asnaashari et al. Jan 2010 A1
20100039864 Sarin et al. Feb 2010 A1
20100058045 Borras et al. Mar 2010 A1
20100070751 Chu Mar 2010 A1
20100174934 Zhao Jul 2010 A1
20110039592 Haddad et al. Feb 2011 A1
20110211564 Yoneyama et al. Sep 2011 A1
20110231649 Bollay et al. Sep 2011 A1
20110231652 Bollay et al. Sep 2011 A1
20120284517 Lambert Nov 2012 A1
20130046966 Chu Feb 2013 A1
20130246792 Lambert Sep 2013 A1
20130346777 Zhang Dec 2013 A1
20140258724 Lambert et al. Sep 2014 A1
20150071438 Lambert Mar 2015 A1
Foreign Referenced Citations (14)
Number Date Country
1140272 Jan 1997 CN
102272734 Sep 2014 CN
1847911 Oct 2007 EP
2493230 Aug 2012 EP
2605170 Jun 2013 EP
2407239 Apr 2005 GB
08076872 Mar 1996 JP
09044418 Feb 1997 JP
10320302 Dec 1998 JP
2002099502 Apr 2002 JP
2002215409 Aug 2002 JP
2004005254 Jan 2004 JP
2005011120 Jan 2005 JP
5565778 Jun 2014 JP
Non-Patent Literature Citations (125)
Entry
“EP Intent to Grant”, European Patent Application No. 09803951.4, May 14, 2013, 13 Pages.
“Extensions to Direct Link Setup (DLS) Comments”, IEEE, P802.11z, Jul. 2009, pp. 1-3.
“Final Office Action”, U.S. Appl. No. 12/098,254, May 18, 2011, 11 pages.
“Final Office Action”, U.S. Appl. No. 12/541,731, May 31, 2012, 11 pages.
“Final Office Action”, U.S. Appl. No. 12/178,268, May 25, 2011, 13 pages.
“Final Office Action”, U.S. Appl. No. 12/101,668, May 10, 2012, 8 pages.
“Foreign Office Action”, Chinese Application No. 200980136849.9, May 24, 2013, 20 Pages.
“Foreign Office Action”, Chinese Application No. 200980153758.6, Apr. 27, 2013, 14 pages.
“Foreign Office Action”, Japanese Application No. 2011-527899, Aug. 13, 2013, 2 pages.
“Foreign Office Action”, European Patent Application No. 09803951.4, May 24, 2012, 3 pages.
“Foreign Office Action”, Japanese Application No. 2011-527899, Nov. 6, 2012, 4 pages.
“Foreign Office Action”, Japanese Application No. 2011-527899, Apr. 16, 2013, 5 pages.
“Foreign Office Action”, European Patent Application No. 09803951.4, Dec. 13, 2012, 6 pages.
“Foreign Office Action”, Japanese Application No. 2011-544456, Jul. 9, 2013, 6 pages.
“Foreign Office Action”, Japanese Application No. 2011-544456, Jan. 29, 2013, 7 pages.
“Non-Final Office Action”, U.S. Appl. No. 13/863,079, Jun. 20, 2013, 10 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/559,987, Nov. 9, 2011, 10 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/178,268, Dec. 22, 2010, 10 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/541,731, Sep. 4, 2012, 11 pages.
“Non-Final Office Action”, U.S. Appl. No. 13/657,511, Mar. 28, 2013, 13 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/178,268, Dec. 21, 2011, 13 pages.
“Non-Final Office Action”, U.S. Appl. No. 13/333,551, Apr. 6, 2012, 5 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/636,558, Jan. 10, 2012, 6 pages.
“Non-Final Office Action”, U.S. Appl. No. 13/598,282, Oct. 16, 2013, 6 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/271,761, Oct. 3, 2011, 6 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/101,668, Apr. 5, 2011, 7 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/098,254, Jan. 14, 2011, 8 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/636,558, May 29, 2012, 8 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/101,668, Aug. 9, 2012, 8 pages.
“Non-Final Office Action”, U.S. Appl. No. 13/863,079, Oct. 1, 2013, 9 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/541,731, Oct. 21, 2011, 9 pages.
“Notice of Allowance”, U.S. Appl. No. 12/636,558, Jan. 9, 2013, 4 pages.
“Notice of Allowance”, U.S. Appl. No. 12/098,254, Dec. 14, 2011, 4 pages.
“Notice of Allowance”, U.S. Appl. No. 13/333,551, May 30, 2012, 4 pages.
“Notice of Allowance”, U.S. Appl. No. 12/178,268, Jul. 2, 2012, 4 pages.
“Notice of Allowance”, U.S. Appl. No. 12/098,254, Sep. 28, 2011, 4 pages.
“Notice of Allowance”, U.S. Appl. No. 12/559,987, Jun. 15, 2012, 5 pages.
“Notice of Allowance”, U.S. Appl. No. 12/101,668, Jan. 11, 2013, 6 pages.
“Notice of Allowance”, U.S. Appl. No. 12/271,761, Jan. 3, 2012, 6 pages.
“Notice of Allowance”, U.S. Appl. No. 12/541,731, Apr. 2, 2013, 8 pages.
“Notice of Allowance”, U.S. Appl. No. 13/657,511, Nov. 4, 2013, 9 pages.
“Part 11—Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications”, Information Technology—Telecommunications & Information Exchange Between Systems . . . International Standard, ISO/IEC 8802-11, First Ed., 1999, pp. 1-531.
“PCT Partial Search Report”, Application Serial No. PCT/US2008/078343,Partial International Search, Mar. 5, 2009, 2 pages.
“PCT Search Report”, Application No. PCT/US2009/056973, Nov. 4, 2009, 13 pages.
“PCT Search Report”, Application Serial No. PCT/US2008/078343, May 18, 2009, 5 pages.
“PCT Search Report and Written Opinion”, Application No. PCT/US2009/067767, Mar. 26, 2010, 12 pages.
“Restriction Requirement”, U.S. Appl. No. 12/101,668, Sep. 22, 2011, 6 pages.
“Supplemental Notice of Allowance”, U.S. Appl. No. 13/333,551, Oct. 23, 2012, 2 pages.
“Supplemental Notice of Allowance”, U.S. Appl. No. 12/101,668, Feb. 8, 2013, 4 Pages.
“Foreign Notice of Allowance”, Japanese Application No. 2011-527899, Jan. 28, 2014, 1 Page.
“Notice of Allowance”, U.S. Appl. No. 13/252,416, Sep. 27, 2013, 10 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/125,670, Dec. 13, 2011, 11 pages.
“Final Office Action”, U.S. Appl. No. 12/125,670, May 24, 2011, 11 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/125,670, Jun. 4, 2012, 12 pages.
“Non-Final Office Action”, U.S. Appl. No. 13/252,416, Mar. 13, 2013, 16 pages.
“Foreign Office Action”, Japanese Application No. 2011-544456, Dec. 3, 2013, 2 pages.
“Non-Final Office Action”, U.S. Appl. No. 13/683,056, Nov. 8, 2013, 5 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/125,693, Oct. 3, 2011, 7 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/125,693, Dec. 20, 2010, 7 pages.
“Notice of Allowance”, U.S. Appl. No. 12/125,670, Dec. 11, 2012, 8 pages.
“Foreign Office Action”, Chinese Application No. 200980153758.6, Dec. 30, 2013, 8 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/125,670, Dec. 7, 2010, 9 pages.
“Final Office Action”, U.S. Appl. No. 12/125,693, Jun. 9, 2011, 9 pages.
Anderson, “HDD Based Full Disc Encryption”, In Proceedings of THIC Conference 2006, Mar. 2006, 12 pages.
“Foreign Office Action”, CN Application No. 200980136849.9, Feb. 7, 2014, 15 Pages.
“Foreign Office Action”, CN Application No. 200980136849.9, May 19, 2014, 11 Pages.
“Foreign Decision to Grant”, JP Application No. 2011-544456, May 20, 2014, 2 pages.
“Notice of Allowance”, U.S. Appl. No. 13/598,282, May 6, 2014, 4 pages.
“Notice of Allowance”, U.S. Appl. No. 13/683,056, May 9, 2014, 4 pages.
“Foreign Notice of Allowance”, CN Application No. 200980153758.6, Jul. 15, 2014, 4 Pages.
“Non-Final Office Action”, U.S. Appl. No. 13/863,079, Aug. 27, 2014, 6 pages.
“Final Office Action”, U.S. Appl. No. 13/863,079, May 7, 2014, 7 pages.
“Non-Final Office Action”, U.S. Appl. No. 14/205,196, Feb. 5, 2016, 14 pages.
“Final Office Action”, U.S. Appl. No. 13/863,079, Jan. 15, 2015, 7 pages.
“Non-Final Office Action”, U.S. Appl. No. 13/863,079, Apr. 9, 2015, 7 pages.
“Non-Final Office Action”, U.S. Appl. No. 13/874,201, Jun. 5, 2015, 10 pages.
“Board Opinion”, CN Application No. 200980136849.9, Aug. 28, 2015, 18 Pages.
“Notice of Allowance”, U.S. Appp. No. 13/874,201, Sep. 25, 2015, 6 pages.
“Foreign Office Action”, KR Application No. 10-2011-7008700, Jun. 16, 2015, 13 Pages.
“Advisory Action”, U.S. Appl. No. 13/804,425, Dec. 26, 2014, 3 pages.
“Amendment 3: Enhancements for Very High Throughput in the 50 GHz Band”, Sponsor IEEE 802.11 Committee of the IEEE Computer Society, IEEE P802.11ad/D5.0 (Draft Amendment Based on IEEE P802.11REVmb D10.0) (Amendment to IEEE 802.11REVmb D10.0 as amended by IEEE 802.11ae D5.0 and IEEE 802.11aa 06.0); Draft Standard for Information Technology Telecommunications and Information Exchange, Sep. 2011, 601 pages.
“Amendment 3: Enhancements for Very High Throughput in the 60 GHz Band”, IEEE Standard for Information technology; Telecommunications and information exchange between systems; Local and metropolitan area networks; Specific requirements; Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, Jul. 2012, 628 pages.
“Amendment 4: Enhancements for Very High Throughput for Operation in Bands below 6 GHz”, IEEE Standard for Information technology; Telecommunications and information exchange between systems; Local and metropolitan area networks; Specific requirements; Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, Sep. 2011, 425 pages.
“Amendment 4: TV White Spaces Operation”, The Institute of Electrical and Electronics Engineers, Inc., IEEE Std P802.11af/D1.05 Draft Standard for Information Technology—Telecommunications and Information Exchange Between Systems—Local and Metropolitan area networks—Specific Requirements, Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer, Nov. 2011, 123 Pages.
“Amendment 6: Sub 1 GHz License Exempt Operation”, 802.11 Working Group of the LAN/MAN Standards Committee of the IEEE Computer Society, IEEE P802.11ah/D1.0 Draft Standard for Information Technology—Telecommunications and Information exchange between systems Local and Metropolitan Area Networks—Specific Requirements Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PH, Oct. 2013, 394 Pages.
“Amendment 8: IEEE 802.11 Wireless Network Management”, Prepared by the LAN/MAN Standards Committee of the IEEE Computer Society, Draft Standard for Information technology Telecommunications and information exchange between systems—Local and metropolitan area networks Specific requirements—Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications, Aug. 2010, 426 Pages.
“Corrected Notice of Allowance”, U.S. Appl. No. 14/205,196, Apr. 18, 2017, 2 pages.
“Final Office Action”, U.S. Appl. No. 13/804,425, Nov. 6, 2015, 9 pages.
“Final Office Action”, U.S. Appl. No. 13/804,425, Nov. 21, 2014, 17 pages.
“Final Office Action”, U.S. Appl. No. 14/205,196, Aug. 25, 2016, 16 pages.
“IEEE Standard for Information Technology—Telecommunications and Information Exchange between Systems—Local and Metropolitan Area Networks—Specific Requirements”, IEEE Std. 802.11-2007, Jun. 12, 2007, 1232 pages.
“IEEE Standard for Information Technology—Telecommunications and Information Exchange between Systems—Local and Metropolitan Area Networks—Specific Requirements”, Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications; IEEE Std. 802.11-2012, Mar. 29, 2012, 2793 pages.
“Information Technology—Telecommunications and Information Exchange Between Systems—Local and Metropolitan Area Networks—Specfic Requirements”, IEEE, Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, Aug. 20, 1999, 531 pages.
“International Search Report and Written Opinion”, PCT Application No. PCT/US2013/031545, Mar. 14, 2015, 11 pages.
“International Search Report and Written Opinion”, PCT Application No. PCT/US2014/0211295, Nov. 24, 2014, 16 pages.
“International Search Report and Written Opinion”, PCT Application No. PCT/US2014/054885, Dec. 4, 2014, 8 pages.
“International Search Report and Written Opinion”, PCT Application PCT/US2012/036236, Jul. 6, 2012, 9 pages.
“Invitation to Pay Additional Fees and Partial International Search Report”, PCT Application No. PCT/US2014/021295, Aug. 13, 2014, 5 pages.
“Marketing Requirements Document for Interoperability Testing & Certification of Device Provisioning Protocol”, Wi-Fi Alliance Device Provisioning Protocol Marketing Task Group; Version 1.2, 2012, 34 pages.
“Non-Final Office Action”, U.S. Appl. No. 13/462,972, May 22, 2013, 10 pages.
“Non-Final Office Action”, U.S. Appl. No. 13/804,425, May 4, 2015, 15 pages.
“Non-Final Office Action”, U.S. Appl. No. 13/804,425, Jul. 18, 2014, 14 pages.
“Non-Final Office Action”, U.S. Appl. No. 14/198,994, Jul. 31, 2015, 12 pages.
“Non-Final Office Action”, U.S. Appl. No. 14/482,072, Nov. 19, 2015, 5 pages.
“Notice of Allowance”, U.S. Appl. No. 13/804,425, Mar. 21, 2016, 9 pages.
“Notice of Allowance”, U.S. Appl. No. 14/198,994, Jan. 29, 2016, 10 pages.
“Notice of Allowance”, U.S. Appl. No. 14/205,196, Jan. 3, 2017, 5 pages.
“Notice of Allowance”, U.S. Appl. No. 14/482,072, Mar. 22, 2016, 5 pages.
“Notification Concerning Transmittal of International Preliminary Report on Patentability”, PCT Application No. PCT/US2014/021295, Sep. 17, 2015, 12 pages.
“Part 16: Air Interface for Broadband Wireless Access Systems”, IEEE Standard for Local and Metropolitan Area Networks, May 29, 2009, 2082 pages.
“Public Key Cryptography for the Financial Services Industry: Elliptic Curve Key Agreement and Key Transport Schemes”, Working Draft; Version 2.0, Jul. 5, 1998, 125 pages.
“Specification of the Bluetooth System, Version 2.0: vol. 0”, Master Table of Contents & Compliance Requirements; pp. 1-74; vol. 1, “Architecture & Terminology Overview”, pp. 1-92; vol. 2, “Core System Package [Controller Volume]”, pp. 1-814; vol. 4, “Core System Package [Host Volume]”; pp. 1-250, Nov. 4, 2004, 1230 pages.
“Specification Requirements Document (SRD) for Devise Provisioning Protocol”, Wi-Fi Alliance Device Provisioning Protocol Marketing Task Group; Version 1.1, 2013, 13 pages.
“Wi-Fi Peer-to-Peer (P2P) Technical Specification”, Wi-Fi Alliance Technical Committee P2P Task Group; Draft Version 1.14, Jun. 25, 2010, 154 pages.
“Wi-Fi Peer-to-Peer (P2P) Technical Specification”, WiFi Alliance; Version 1.5, 2014, 183 pages.
Chen,“Home Network Basis: Transmission Environments and Wired/Wireless Protocols”, Prentice Hall, Jul. 2003, 19 pages.
Cooper,“Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (SRL) Profile”, Network Working Group; RFC 5280, May 2008, 152 pages.
Harada,“Project: IEEE P802.15 Working Group for Wireless Personal Area Network (WPANs)”, IEEE 802.15/07/0693-003c; Slides 24-33 as provided in U.S. Appl. 14/198,994 in an IDS submission filed Feb. 24, 2015, May 2007, 10 pages.
Harkins,“Synthetic Initialization Vecor (SIV) Authenticated Encryption Using the Advanced Encryption Standard (AES)”, Network Working Group; RFC 5297; Aruba Networks, Oct. 2008, 27 pages.
Hiertz,“The IEEE 802.11 Universe”, IEEE Standards in Communications and Networking; IEEE Communications Magazine, Jan. 2010, 9 pages.
Krawczyk,“HMAC-based Extract-and-Expand Key Derivation Function (HKDF)”, Internet Engineering Task Forct (IETF); RFC 5869, May 2010, 15 pages.
McGrew,“Fundamental Elliptic Curve Cryptography Algorithms”, Internet Engineering Task Force (IETF); RFC 6090; Fundamental Elliptic Cryptography Algorithms, Feb. 2011, 35 pages.
Perahia,“Gigabit Wireless LANs: an overview of IEEE 802.11ac and 802.11ad”, ACM SIGMOBILE Mobile Computing and Communications Review; vol. 15, No. 3, 11 pages, pp. 23-33.
Robinson,“Wi-Fi Simple Configuration Protocol and Usability Best Practices for the Wi-Fi Protected Setup Program”, Wi-Fi Alliance; Version 2.0.1, Apr. 2011, 30 pages.
Van Beijnum “Crypto Based Host Identifiers”, Internet Draft; draft-van-beijnum-multi6-cbhi-00.K ISSN: 0000-0004; XP15036389A, Jan. 1, 2004, 9 pages.
Provisional Applications (2)
Number Date Country
61090376 Aug 2008 US
61090380 Aug 2008 US
Continuations (1)
Number Date Country
Parent 12541731 Aug 2009 US
Child 13958101 US