Embodiments of the present invention relate to methods and systems for key generation, distribution, and management.
Networked applications, such as voice and video, are accelerating the need for instantaneous, branch-interconnected, and Quality of Service—(QoS) enabled Wide Area Networks (WANs). The distributed nature of these applications results in increased demands for scale. Moreover, as network security risks increase and regulatory compliance becomes essential there is a need for transport security and data privacy.
GDOI refers to the Internet Security Association Key Management Protocol (ISAKMP) Domain of Interpretation (DOI) for group key management. In a group management model, the GDOI protocol operates between a group member and a group controller or key server (GCKS), which establishes security associations (SAs) among authorized group members.
Each group member registers with the key server to get the IPsec SA or SAs that are necessary to communicate with the group. The group member provides the group ID to the key server to get the respective policy and keys for this group. These keys are refreshed periodically, and before the current IPsec SAs expire.
The responsibilities of the key server include maintaining the policy and creating and maintaining the keys for the group. When a group member registers, the key server downloads this policy and the keys to the group member. The key server also rekeys the group before existing keys expire.
With GDOI, the key server has to maintain timers to control when to invalidate an old key after rekeying has occurred. Moreover, if one key is compromised then the security of communications to all group members sharing said key is also compromised.
According to a first aspect of the invention, there is provided a method for key generation, distribution, and management.
The method may comprise establishing a secure control channel between each node of a network topology and a central controller. The control channel may be established using a suitable protocol such as SSL and is persistent over time.
The method may comprise generating security parameters by each node of a network topology; and publishing said security parameters to the central controller using its control channel with the controller.
The encryption parameters may comprise at least an encryption key and a decryption key for a node. The encryption and decryption keys are specific to a networking device operative at the node and are unique to said device.
The method may comprise providing the security parameters for a given node in response to a request therefor by a requesting node.
The method may comprise encrypting data towards the given node by the requesting node using an encryption key of the security parameters of the given node.
The method may comprise periodically generating new keys at each node and sending a rekey message to the controller using the control channel established between the node and the controller, the rekey message comprising the new keys.
The method may comprise selectively invalidating old keys by each node and communicating said invalidation to the controller.
Other aspects of the invention will be apparent from the detailed description below.
In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the invention. It will be apparent, however, to one skilled in the art that the invention can be practiced without these specific details. In other instances, structures and devices are shown in block or flow diagram form only in order to avoid obscuring the invention.
Reference in this specification to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the invention. The appearance of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Moreover, various features are described which may be exhibited by some embodiments and not by others. Similarly, various requirements are described which may be requirements for some embodiments but not other embodiments.
Moreover, although the following description contains many specifics for the purposes of illustration, anyone skilled in the art will appreciate that many variations and/or alterations to the details are within the scope of the present invention. Similarly, although many of the features of the present invention are described in terms of each other, or in conjunction with each other, one skilled in the art will appreciate that many of these features can be provided independently of other features. Accordingly, this description of the invention is set forth without any loss of generality to, and without imposing limitations upon, the invention.
Broadly, embodiments of the present invention disclose methods and systems for key generation, distribution, and management. Advantageously, said methods and systems enable encryption of multicast and unicast packets over a public WAN such as the Internet.
Each node of the topology 100 may comprise a router and may define an access point to a private network 112.
It is to be noted that the nodes of the topology 100 may be located at different geographic locations, branches, customer premises, or on different circuits, carrier networks, etc.
In accordance with the methods of the present invention, each node N(i) of the plurality of nodes N executes a Key Generation and Publishing method. Said Key Generation and Publishing method is shown in the flow chart of
Block 200: where the node N(i) establishes a Control Channel with the controller 102. In one embodiment the Control Channel may be established using a protocol such as SSL. One advantage of using SSL to establish the control channel 112 is that SSL is a relatively lightweight protocol compared to say IKE. Once established the Control Channel is persistent over time or always available;
Block 202: where the node N(i) generates Security Parameters. In one embodiment, the Security Parameters may include an encryption key and a decryption key. In one embodiment, the Security Parameters may comprise pre-defined Security Profiles that the node N(i) may support. Each Security Profile may include a Security Association. Examples of Security Profiles include:
In one embodiment, node N(i) generates a IPSEC SA based on the Security Profiles it supports.
Typically each node N(i) may comprise a router. The encryption and decryption keys may be uniquely generated by the router for the router. That is to say the encryption and decryption keys are established per device in the topology 100;
and
Block 204: where the node N(i) sends its transport location address (TLOC), the Security Parameters, information on its connected routes or peers to the controller 102 via the Control Channel that exists between the two.
In accordance with one embodiment of the invention, the controller 102 may store the TLOC for the node N(i). Additionally, the controller 102 may create a security association for the node N(i) based on the received Security Parameters.
In accordance with the methods of the present invention, the controller 102 performs a Key Distribution method. One embodiment of this method is shown in the flow chart of
Block 300: where the controller 102 receives a Key Request Message (KRM). The KRM may be from a node N(j) that is requesting Security Parameters for the node N(i);
Block 302: where responsive to the KRM, the controller retrieves the Security Parameters for the node N(i), e.g. based on its TLOC (Transport Location) address; and
Block 304: where the controller 102 sends the retrieved Security Parameters to the node N(j).
All messages and data exchanged between the controller 102 and the node N(j) as part of the Key Distribution Method use the Control Channel that exists between the two.
At this point, the node N(j) knows the TLOC address of the node N(i) and the Security Parameters for the node N(i). Thus, the node N(j) may use this information to encrypt data towards the node N(i) as is shown in the flowchart of
Block 400: where the node N(j) establishes a Data Channel with the node N(i). Any suitable protocol may be used for the Data Channel. In one embodiment of the invention IPsec may be used as a protocol for the Data Channel. By virtue of the Data Channel, the nodes N(j) and N(i) will become peer-to-peer session partners;
Block 402 where data towards the node N(i) is encrypted using the encryption key associated with the node N(i) as obtained from the controller 102 in the manner already described. For example if the node N(i) supports the Gold Security Profile, then the encryption algorithms as per the Gold Security Profile is used to encrypt packets towards the node N(i). At the same time the node N(i) may be communicating with a device that supports a less secure Security Profile, say the Silver Security Profile. In that case packets towards this node will be encrypted using the encryption algorithms as per the Silver Security Profile. The block 402 is for unicast traffic only; and
Block 404 where for multicast traffic, the data towards the node N(i) is encrypted using an encryption key associated with the multicast traffic. For example, the actual encryption key used in one embodiment may comprise an encryption key published on the controller 102 by a source for the multicast traffic.
In one embodiment, the invention discloses a Rekey Generation and Distribution method, which includes the following processing blocks as is shown in the flowchart of
Block 500: where the node N(i) performs a rekeying operation to generate new keys. The generation of the new keys may be responsive to a rekeying trigger. As an example, a rekeying trigger may be time-based where new keys are generated at periodic intervals in accordance with a rekey timer maintained by the controller 102; and
Block 502: where the node N(i) publishes the new keys to the controller 102 via the Control Channel that exists between the two; and
Block 504: where the controller 102 sends the new keys to all peers or session partners of the node N(i).
An important aspect of key management involves the invalidation of old keys after rekeying has occurred. In one embodiment key invalidation is a function of each node in the topology 100.
Block 600: where the node N(i) receives an encrypted data packet from the node N(j);
Block 602: where if the encrypted packet was encrypted using a newly issued key generated through rekeying, then the node N(i) records that the node N(j) is in possession of the new key. For example, in one embodiment, the node N(j) may maintain and/or update a data structure that tracks whether the Node(j) has the new key; and
Block 604: where if all the peers of the node N(i) has the new key as determined by the information recorded for each peer at block 602, then the node N(i) invalidates the old key that was in use prior to the generation of the new key.
Advantageously, in accordance with the above-described Rekey Invalidation method there is no need to maintain a timer to control how long to keep an old key active before it can be invalidated. Moreover, because an old key in only invalidated when it is no longer in use by any peer data loss through data encryption by an invalidated key is no longer a problem.
Setting up peer-to-peer secure connections within a network comprising N nodes generally would require n choose 2 or nC2 i.e. (n*(n−1)/2) connections. This is a large number of connections, on the order of n squared to manage and the problem is further compounded by the need to maintain nC2 data plane connections and nc2 control plane connections. Advantageously, in accordance with the methods disclosed herein, only N control plane connections are required. Moreover, because encryption keys are issued per device there are only N encryption keys required.
In one embodiment, the controller 102 may maintain a old key timer to control how long to keep an old key active after the generation of a new key that supersedes the old key. The new key is pushed to each node N(i) that is a peer of a node N(j) that generated the new key, pursuant to a rekey trigger. The old key timer is pushed to the node N(j) that issued the new key. The node N(j) will decrypt packets encrypted with the old key for as long as the old key timer is unexpired. After the old key timer expires, the node N(j) will no longer decrypt packets encrypted with the old key.
Advantageously, the techniques of key generation, distribution, and management disclosed herein facilitate the creating of very large scale secure networks without the need for private carrier circuits. Thus, a large network such as the Internet may be used a secure network without any private carrier circuits.
An exemplary construction of a node 700 of the network topology 100 will now be described by reference to
An exemplary construction of a controller 102 will now be described by reference to
Although the present invention has been described with reference to specific exemplary embodiments, it will be evident that the various modification and changes can be made to these embodiments without departing from the broader spirit of the invention. Accordingly, the specification and drawings are to be regarded in an illustrative sense rather than in a restrictive sense.
This application is a continuation of U.S. patent Ser. No. 15/881,666 filed Jan. 26, 2018, which is a continuation of U.S. patent Ser. No. 13/754,866 filed Jan. 30, 2013, the contents of which are incorporated herein by reference in their entities.
Number | Name | Date | Kind |
---|---|---|---|
6023504 | Connolly et al. | Feb 2000 | A |
6044396 | Adams | Mar 2000 | A |
6289419 | Takahashi | Sep 2001 | B1 |
6535607 | Chandersekaran | Mar 2003 | B1 |
6594361 | Chaney | Jul 2003 | B1 |
6611872 | McCanne | Aug 2003 | B1 |
6675225 | Genty et al. | Jan 2004 | B1 |
7117530 | Lin | Oct 2006 | B1 |
7120682 | Salama | Oct 2006 | B1 |
7234058 | Baugher et al. | Jun 2007 | B1 |
7251824 | Edwards et al. | Jul 2007 | B2 |
7865577 | O'Neil et al. | Jan 2011 | B1 |
7925592 | Issa et al. | Apr 2011 | B1 |
8041039 | Tajima et al. | Oct 2011 | B2 |
8515079 | Asati | Aug 2013 | B1 |
8594323 | Dondeti | Nov 2013 | B2 |
8868698 | Millington et al. | Oct 2014 | B2 |
8879739 | Bieber | Nov 2014 | B2 |
8954740 | Moscaritolo et al. | Feb 2015 | B1 |
8959333 | Falk et al. | Feb 2015 | B2 |
9467478 | Khan et al. | Oct 2016 | B1 |
9659170 | Chapman, III | May 2017 | B2 |
9736113 | Khan et al. | Aug 2017 | B1 |
9967292 | Higgins et al. | May 2018 | B1 |
9980303 | Shanks et al. | May 2018 | B2 |
10277558 | Khan et al. | Apr 2019 | B2 |
10298672 | Shanks et al. | May 2019 | B2 |
10917926 | Shanks et al. | Feb 2021 | B2 |
20030140142 | Marples et al. | Jul 2003 | A1 |
20040034702 | He | Feb 2004 | A1 |
20040088369 | Yeager et al. | May 2004 | A1 |
20040103205 | Larson et al. | May 2004 | A1 |
20040184603 | Pearson et al. | Sep 2004 | A1 |
20040203590 | Shteyn | Oct 2004 | A1 |
20050021610 | Bozionek et al. | Jan 2005 | A1 |
20050044356 | Srivastava | Feb 2005 | A1 |
20050071280 | Irwin et al. | Mar 2005 | A1 |
20050094814 | Aihara | May 2005 | A1 |
20050271210 | Soppera | Dec 2005 | A1 |
20060015643 | Orava et al. | Jan 2006 | A1 |
20060088031 | Nalawade | Apr 2006 | A1 |
20060155721 | Grunwald | Jul 2006 | A1 |
20060165233 | Nonaka | Jul 2006 | A1 |
20060221830 | Hu | Oct 2006 | A1 |
20060221955 | Enright | Oct 2006 | A1 |
20060288209 | Vogler | Dec 2006 | A1 |
20070086431 | Abu-Amara | Apr 2007 | A1 |
20070104115 | Decasper et al. | May 2007 | A1 |
20070117635 | Spanton et al. | May 2007 | A1 |
20070118885 | Elrod | May 2007 | A1 |
20070140110 | Kaler | Jun 2007 | A1 |
20070153782 | Fletcher et al. | Jul 2007 | A1 |
20070185814 | Boccon-Gibod et al. | Aug 2007 | A1 |
20070230688 | Tajima et al. | Oct 2007 | A1 |
20070248232 | Driscoll | Oct 2007 | A1 |
20070299954 | Fatula | Dec 2007 | A1 |
20080013738 | Tajima et al. | Jan 2008 | A1 |
20080080716 | McAlister | Apr 2008 | A1 |
20080130902 | Foo Kune | Jun 2008 | A1 |
20080147820 | Maeda et al. | Jun 2008 | A1 |
20080273704 | Norrman et al. | Nov 2008 | A1 |
20090034738 | Starrett | Feb 2009 | A1 |
20090172398 | Falk et al. | Jul 2009 | A1 |
20090193253 | Falk et al. | Jul 2009 | A1 |
20090216910 | Duchesneau | Aug 2009 | A1 |
20090220080 | Herne | Sep 2009 | A1 |
20100014677 | Sato et al. | Jan 2010 | A1 |
20100058082 | Locker et al. | Mar 2010 | A1 |
20100064008 | Yan et al. | Mar 2010 | A1 |
20100122084 | Liu | May 2010 | A1 |
20100169563 | Homer | Jul 2010 | A1 |
20100211507 | Aabye et al. | Aug 2010 | A1 |
20100281251 | Arauz Rosado | Nov 2010 | A1 |
20110010553 | Cahn | Jan 2011 | A1 |
20110064222 | Wiseman | Mar 2011 | A1 |
20110075675 | Li et al. | Mar 2011 | A1 |
20110296510 | Hatlelid | Dec 2011 | A1 |
20120092986 | Chen | Apr 2012 | A1 |
20120134361 | Wong et al. | May 2012 | A1 |
20120180122 | Yan et al. | Jul 2012 | A1 |
20120266209 | Gooding et al. | Oct 2012 | A1 |
20120284370 | Hierro | Nov 2012 | A1 |
20130051559 | Baba | Feb 2013 | A1 |
20130121142 | Bai et al. | May 2013 | A1 |
20130163446 | Kruger et al. | Jun 2013 | A1 |
20130182712 | Aguayo et al. | Jul 2013 | A1 |
20130201909 | Bosch et al. | Aug 2013 | A1 |
20130251154 | Tanizawa et al. | Sep 2013 | A1 |
20130306276 | Duchesneau | Nov 2013 | A1 |
20130335582 | Ltasaki et al. | Dec 2013 | A1 |
20140003425 | Zhao et al. | Jan 2014 | A1 |
20140079059 | Amir et al. | Mar 2014 | A1 |
20140153457 | Liu | Jun 2014 | A1 |
20140153572 | Hampel et al. | Jun 2014 | A1 |
20140189363 | Thomas et al. | Jul 2014 | A1 |
20140223520 | Gafni | Aug 2014 | A1 |
20140229737 | Roth | Aug 2014 | A1 |
20140294018 | Sung et al. | Oct 2014 | A1 |
20140297438 | Dua | Oct 2014 | A1 |
20140331050 | Armstrong et al. | Nov 2014 | A1 |
20140380039 | Larson et al. | Dec 2014 | A1 |
20150006737 | Chen et al. | Jan 2015 | A1 |
20150033298 | Martini | Jan 2015 | A1 |
20150092603 | Aguayo et al. | Apr 2015 | A1 |
20150103839 | Chandrashekhar et al. | Apr 2015 | A1 |
20150106620 | Cabrera et al. | Apr 2015 | A1 |
20150127797 | Attar et al. | May 2015 | A1 |
20150149776 | Chastain et al. | May 2015 | A1 |
20150186657 | Nakhjiri | Jul 2015 | A1 |
20150229490 | Brandstatter | Aug 2015 | A1 |
20150256521 | Cummings et al. | Sep 2015 | A1 |
20150319151 | Chastain et al. | Nov 2015 | A1 |
20160036785 | Ambroz | Feb 2016 | A1 |
20160065362 | Choyi et al. | Mar 2016 | A1 |
20160080268 | Anand et al. | Mar 2016 | A1 |
20160226762 | Zhang et al. | Aug 2016 | A1 |
20160286395 | Adrangi et al. | Sep 2016 | A1 |
20170076291 | Cairns | Mar 2017 | A1 |
20170155628 | Rohloff et al. | Jun 2017 | A1 |
20170023154 | Hammam et al. | Aug 2017 | A1 |
20170338950 | Chen | Nov 2017 | A1 |
20180054438 | Li et al. | Feb 2018 | A1 |
20180091417 | Ore et al. | Mar 2018 | A1 |
Number | Date | Country |
---|---|---|
1254059 | Apr 2006 | CN |
2015092491 | Jun 2015 | WO |
Entry |
---|
“FAQ: Vormetric Key Management—Key Agent for Oracle Transparent Data Encryption,” Version 7.2, Jul. 2, 2012, 8 pages, Vormetric.com. |
“FAQ: Vormetric Key Management Key Vault,” Version 5.2, May 14, 2012, 5 pages. |
“Aruba Central Support Page”; Hewlett Packard Enterprise Development; 2021; 2 pages: hhtps://help.central.arubanetworks.com/latest/documentation/online_help/content/gateways/cfg/overlay-orchestration/tunnel-orchestration.htm. |
“Aruba Central Support Page: Advertising Overlay Routes”; Hewlett Packard Enterprise Development; 2021; 8 pages https://help.central.arubanetworks.com/latest/documentation/online_help/content/gateways/cfg/routing/overlay_routing.htm. |
“Aruba SD-WAN Solution, User Guide”; Hewlett Packard Enterprise Company; 2019; 316 pages. |
“Ipsec UDP Mode in Silver Peak Unity EdgeConnect”; Silver Peak' Whitepaper; 12 pages: https://www.silver-peak.com/sites/default/files/userdocs/silver-peak-whitepaper-ipsec-udp-1018_1.pdf. |
English Translation of Chinese Application No. CN1254059C, 7 pages. |
Number | Date | Country | |
---|---|---|---|
20200374109 A1 | Nov 2020 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15881666 | Jan 2018 | US |
Child | 16988439 | US | |
Parent | 13754866 | Jan 2013 | US |
Child | 15881666 | US |