US 7,877,080 B2Grant
Public access point
Issue Date:2011-01-25
•10 Claims
•5 Drawing Sheets
Abstract
The invention instantiates a Personal VLAN bridge, using IEEE Std. 802.11 elements. The result is a bridge, referred to as a public access point, that is better suited for implementing public wireless data networks than the IEEE Std. 802.11 architecture. The invention also provides a location-update protocol for updating the forwarding tables of bridges that connect public access points together. The invention further provides a method for more controlled bridging, which is referred to as fine bridging.
Metadata
Assignee
- Microsoft Corporation
Inventor
- Dennis Michael Volpano
Application Information
Application Number:US 11/841,703
Filing Date:2007-08-20
Priority Date:2001-12-20
Art Unit:2617
Classifications
IPC:
H04M1/66
Patent Drawings (5 sheets)
Description
Cross-References to Related Applications
[0001] This is a continuation of U.S. patent application Ser. No. 10/754,402, filed Jan. 9, 2004, which is a continuation-in-part of U.S. patent application Ser. No. 10/057,566, filed Jan. 25, 2002, both of which are fully incorporated herein in their entireties by reference for all purposes.
Background of the Invention
[0002] The invention relates to wireless public access to electronic networks. More particularly, the invention relates to an architecture that permits the creation of virtual basic service sets from within a physical access point for an electronic network.
[0003] Public WiFi hotspots are deployed using traditional IEEE Std. 802.11-compliant access points with some exceptions. However, the IEEE Std. 802.11 architecture and security model are unsuitable for public use. Stations associated with an access point (AP) share an 802.11 Basic Service Set (BSS), or wireless LAN. Unless all members of a BSS are trustworthy, no station in the BSS is safe from attacks initiated by other members. Such attacks include stealing the basic service and any confidential information provided by subscribers to get the service, such as passwords and credit card information. Other attacks include disruptions in network integrity and quality of service. It is unrealistic to expect all members of a public BSS, i.e. one that is comprised of stations associated with a public AP, to be trustworthy. Therefore, stations are vulnerable in a public BSS.
[0004] Sharing a public BSS presents another threat. Members of the BSS can contaminate other member stations with worms or Trojan horses. The port-based DCOM RPC attack, MSBlaster, and Welchia worms are good examples. The threat is more acute with a public BSS which is an electronic cesspool. How can a station cope with the threats?
[0005] Stations in the BSS might fend for themselves with defenses such as personal firewalls. Alternatively, a public WiFi provider might deploy a security model that protects subscribers from one another. One approach is to prevent inter-station communication. This is an untenable solution though. Stations that trust each other should be allowed to communicate among themselves, even in a public setting. Stations, for instance, should be able to access a file server on the same local LAN in a meeting held at a convention center. This is the usual practice at standards meetings, for example. Yet if this type of sharing is permitted, then under IEEE Std. 802.11, it becomes easy for an intruder to render the entire BSS inoperable. This was demonstrated at the 2001 Usenix Security Conference and at the 2001 DEFCON conference in Las Vegas. No security model today for wireless LAN can support this type of sharing without introducing vulnerabilities.
[0006] It would be advantageous to provide a security model for wireless LAN that can support sharing of a single physical BSS without introducing vulnerabilities or compromising security among stations using the BSS.
Brief Summary of the Invention
[0007] The invention provides a security model for wireless LANs that can support sharing of a single physical BSS by stations without introducing vulnerabilities or compromising station security. Thus, a new kind of access point is provided, which is referred to herein as a Public Access Point (PAP). The PAP has a different security architecture than that prescribed by IEEE Std. 802.11. The PAP architecture permits the creation of virtual Basic Service Sets from within a single physical AP. An arbitrary number of virtual service sets can be created, and any number of end stations can belong to a virtual BSS. A PAP appears to end stations as multiple physical 802.11 access points, one for each virtual BSS. Therefore, a PAP is fully interoperable with any 802.11 end station.
[0008] As an example of a PAP's use, consider a convention center. Different meetings may use 802.11-enabled projectors. The PAP allows provisioning of separate LAN segments for each meeting, providing separate link privacy and integrity for each. Using only IEEE Std. 802.11 instead, a meeting projector and all stations capable of projecting with it must use a private access point or an ad hoc WLAN, and manage WLAN membership, authentication and keying material. Otherwise, anyone could project with the projector, or worse, intercept valid projector traffic before it is displayed so that it can be monitored or corrupted by an outsider.
[0009] Besides the security management burden associated with prior art approaches being too high, meeting planners prefer to leverage local access points rather than installing and configuring their own at every venue . The PAP can administer all security. With it, all end stations in each meeting, which includes the shared projector and any local file servers, are effectively associated with a virtual 802.11 access point for that meeting, and all virtual access points arise from the same physical PAP.
[0010] The invention also provides a location-update protocol for updating the forwarding tables of bridges that connect public access points together.
[0011] The invention further provides a method for more controlled bridging, which is referred to as fine bridging.
Brief Description of the Drawings
[0012] Illustrative embodiments of the present invention will be described in connection with the following:
[0013] FIG. 1 is a block schematic diagram of an IEEE Std. 802.11 protocol entity;
[0014] FIG. 2 is a block schematic diagram of an IEEE Std. 802.11 configuration infrastructure;
[0015] FIG. 3 is a block schematic diagram of a public access point architecture according to the invention;
[0016] FIG. 4 is a block schematic diagram of a policy for accessibility within a three-station virtual BSS, one of which is an AP, according to the invention;
[0017] FIG. 5 is a block schematic diagram of a policy among four stations where stations A and B share server stations S and D but A and B are not allowed to access each other according to the invention;
[0018] FIG. 6 is a block schematic diagram of the policy in FIG. 3 , modified so that an edge from B to A is added to the policy according to the invention; and
[0019] FIG. 7 is a block schematic diagram of an IEEE Std. 802.1Q bridge that eliminates direct communication between edge hosts connected to the infrastructure system via port-based VLAN assignment, egress filtering, and shared VLAN learning (SVL).
Detailed Description of the Invention
[0020] Public Access Point
[0021] In U.S. patent application Ser. No. 10/057,566, a protocol is described whereby an end station can create a virtual bridged LAN (VLAN) that clones an existing VLAN by duplicating the existing VLAN's tagged and untagged member sets. Further, the new VLAN is unique by virtue of its unique security association. The association provides cryptographic keying material that keeps packets belonging to the VLAN private and permits their VLAN membership to be verified cryptographically by a keyed MAC. The new VLAN is owned by its creator. The owner controls which stations can join and discover the VLAN, as well as the VLAN's lifetime. Therefore, the VLAN is called a personal virtual bridged LAN (PVLAN).
[0022] One embodiment of the invention provides a refinement of the PVLAN that uses only standard elements of IEEE Std. 802.11-1999 (see Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications, ISO/IEC 8802-11:1999(E), ANSI/IEEE Std. 802.11, 1999 edition; and Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications, Medium Access Control (MAC) Security Enhancements, IEEE Std. 802.11i/D7.0, Draft amendment to ISO/IEC 8802-11:1999(E), ANSI/IEEE Std. 802.11, 1999 edition).
[0023] See also, FIG. 1 , which is a block schematic diagram of an IEEE Std. 802.11 protocol entity; and FIG. 2 , which is a block schematic diagram of an IEEE Std. 802.11 configuration infrastructure, in which each BSS (BSS-A, BSS-B) comprises respective access point (AP-A, AP-B) and associated stations (A1/A2, B1/B2). No modification of the behavior of any 802.11-compliant end station that does not act as an access point is required by the invention. The refinement instantiates a PVLAN to a virtual 802.11 BSS and affects only the access point.
[0024] FIG. 3 is a block schematic diagram of a public access point architecture according to the invention. A virtual 802.11 BSS, e.g. BSS-1 or BSS-2, comprises a set of stations, each with a hardware (MAC) address (see FIG. 1 ), that share a unique security association, called the group security association. A security association consists of an encryption key and an authentication code key.
[0025] Exactly one of the stations in a virtual BSS is a public access point (PAP) 31. It bridges the 802.11 Wireless Medium (WM) 32 and the 802.11 Distribution System Medium (DSM) 33.
[0026] A unique unicast security association exists for every station in a virtual BSS. It is shared between the station and the PAP of that virtual BSS.
[0027] Each virtual BSS, e.g. BSS-1 or BSS-2 has its own identifier, or BSSID. It is a virtual MAC address of the PAP belonging to that BSS. The PAP receives any frame from the WM destined for one of its virtual MAC addresses, and transmits a frame to the WM using one of its virtual MAC addresses as the source MAC address of the frame.
[0028] A collection of virtual basic service sets is supported by a shared TSF (Timing Synchronization Function), DCF (Distributed Coordination Function), and optionally a PCF (Point Coordination Function), at a single PAP. There is a single NAV (Network Allocation Vector) and PC (Point Coordinator) at each PAP. Such sharing is possible because the 802.11 virtual carrier-sense, medium reservation mechanism is designed to work with multiple basic service sets that use the same channel overlap. This sort of overlap may occur among virtual basic service sets supported by a single-channel PAP. The virtual service sets may use one channel and therefore may overlap at a PAP.
[0029] A PAP can belong to more than one virtual BSS. See BSS-1, BSS-2 on FIG. 1 . Any station that is not a PAP can belong to at most one virtual BSS.
[0030] A virtual 802.11 BSS can be bridged with another virtual BSS through the connection of their public access points by a virtual bridged LAN. The PAP of each virtual BSS connects to the Distribution System (DS) via a trunked or untagged port of a VLAN-aware bridge. Frames transmitted to the DS may carry VLAN tags known to the DSM. A PAP may maintain a DSM VLAN mapping that maps a VLAN tag to a virtual BSSID.
[0031] There are presently two kinds of virtual BSS: Class-1 and Class-3 virtual BSS. A PAP supports exactly one Class-1 virtual BSS and one or more multiple Class-3 virtual basic service sets. The Class-1 virtual BSS is the only virtual BSS a station is allowed to occupy while it is in 802.11 State 1 or 2, as governed by the PAP. When in State 3, a station is allowed to join a Class-3 virtual BSS. The Class-3 virtual BSS may be determined by the kind of authentication, e.g. Open System or Shared Key, used to authenticate the station.
[0032] The Class-1 virtual BSSID is the BSSID field of every Class 1 and Class 2 frame that has such a field. It is also the receiver or transmitter address field, where appropriate, for Class 1 and Class 2 frames.
[0033] Every virtual BSS has identical beacon frame content except for the Timestamp, Beacon interval, Capability information Privacy (Protected) bit, Service Set Identifier (SSID), security capability element, and Traffic Indication Map (TIM) element fields.
[0034] A PAP does not have to beacon for a Class-3 virtual BSS if it does not support PS (Power-Save) mode for end stations in that BSS. If it does beacon for a Class-3 BSS, then the SSID element in every beacon specifies the broadcast SSID. These steps prevent any Class-3 virtual BSS from being identified through beaconing.
[0035] Only a Class-1 virtual BSS beacon has an SSID element with a non-broadcast SSID field. A station can associate with the Class-1 virtual BSS only. The station uses the non-broadcast SSID in the SSID element of an Association or Reassociation Request frame.
[0036] U.S. patent application Ser. No. 10/057,566 identifies PVLAN join and discovery steps. With a PVLAN represented as a virtual BSS, these steps are instantiated as follows:
[0037] Join
[0038] Every station is by default a member of the Class-1 virtual BSS at a PAP. The PAP can either authenticate the user of the station or the station itself in the Class-1 virtual BSS. If successful, the station enters 802.11 State 2 at that PAP. At this time, the PAP and station may exchange Class 1 and Class 2 frames while in the Class-1 virtual BSS.
[0039] Class 1 frames are not protected cryptographically. Class 2 frames may be protected cryptographically if the station and PAP share a unicast security association after successful authentication. The PAP and station may also share a group security association after authentication. The group security association is for that Class-3 virtual BSS to which the station belongs if it completes an 802.11 Association with the PAP.
[0040] Before the station and PAP can exchange Class 3 frames, the station must
-
- [0041] 1) request Association with the Class-1 virtual BSS from State 2; and
- [0042] 2) switch to a Class-3 virtual BSS.
[0043] The PAP switches the station to a Class-3 virtual BSS by responding to the station's Association Request with an Association Response MMPDU whose source address (Address 2 Field) or BSSID (Address 3 Field) is the Class-3 virtual BSSID for that virtual BSS. The Association Response's Capability information field may have its Privacy (Protected) bit set to one.
[0044] The Class-3 virtual BSS is determined in one of three ways:
-
- [0045] 1) an authentication server in the DS specifies a DSM VLAN for the user and the PAP maps it to a Class-3 virtual BSSID using its DSM VLAN mapping;
- [0046] 2) an authentication server in the DS specifies a Class-3 virtual BSS for the user; or
- [0047] 3) the PAP creates a new Class-3 virtual BSS for the user; the PAP may inform an authentication server of the new virtual BSS and provide it with rules for allowing other stations to join the new BSS.
[0048] Discovery
[0049] The Class-1 virtual BSS is discovered through 802.11 beacon or Probe Response management frames where the BSSID field (Address 3 field) and source address field (Address 2 field) are each set to the Class-1 virtual BSSID. The Privacy (Protected) bit of the Capability information field in these frames is set to zero. The TIM element of the beacon applies to the Class-1 virtual BSS. Only the Class-1 virtual BSS is advertised through beacon frames.
[0050] Data Frame (MPDU) Distribution
[0051] A PAP implements the MAC Protocol Data Unit (MPDU) bridge protocol. For an MPDU received from either the DSM or the WM, the protocol is defined by the following two cases:
-
- [0052] 1. MPDU received from the DSM. There are two subcases (Note: The two subcases handle delivery of the received MPDU to the local LLC of the PAP because the station of every PAP belongs to at least one virtual BSS):
- [0053] i. a. The received MPDU has no VLAN tag or a null VLAN tag. The MPDU from the DSM is relayed to a virtual BSS if the destination address is the address of a station that belongs to the virtual BSS and the station is associated with the PAP, or if the destination address is a group address, the virtual BSS has a station that belongs to the group and the station is associated with the PAP. All stations belong to the broadcast group.
- [0054] ii. b. The received MPDU has a non-null VLAN tag. The virtual BSS to which the MPDU is relayed is identified by the virtual BSSID to which the non-null VLAN tag is mapped under the PAP's DSM VLAN mapping. If the mapping is undefined for the given tag, the MPDU is not relayed.
- [0055] Any virtual BSS to which a received MPDU is relayed has a BSSID which forms the source address (Address 2 field) of the 802.11 MPDU that is relayed to that virtual BSS.
- [0056] 2. MPDU received from the WM. The received 802.11 MPDU is relayed to the virtual BSS identified by the Address 1 field of the MPDU if the destination address (Address 3 field of MPDU) is the address of a station that belongs to the identified virtual BSS and the station is associated with the PAP, or if the destination address is a group address. Otherwise, the frame is not relayed to any virtual BSS. The Address 1 field of the received 802.11 MPDU is the source address (Address 2 field) of the 802.11 MPDU that is relayed to the virtual BSS identified by the Address 1 field.
- [0052] 1. MPDU received from the DSM. There are two subcases (Note: The two subcases handle delivery of the received MPDU to the local LLC of the PAP because the station of every PAP belongs to at least one virtual BSS):
[0057] The received MPDU is also relayed to the DSM if the destination address (Address 3 field of MPDU) is the address of a station that is not associated with the PAP, or if the destination address is a group address. The MPDU relayed to the DSM has a VLAN tag if the DS is VLAN aware, and is untagged otherwise. The VLAN tag is the pre-image of the Address 1 field of the received MPDU under the PAP's DSM VLAN mapping.
[0058] Encryption and Decryption Process
[0059] Encryption and decryption applies 802.11 Data frames and Management frames of subtype Association Request/Response, Reassociation Request/Response, Disassociation and Deauthentication.
[0060] The encryption process used by a PAP before sending an 802.11 Data or Management frame to the WM involves two major steps:
-
- [0061] a. identifying a security association for the frame; and
- [0062] b. then using the association to construct an expanded frame for transmission according to some encipherment and authentication code protocols.
[0063] Different encipherment and authentication code protocols can be used for broadcast and multicast traffic among virtual basic service sets, and different encipherment and authentication code protocols can be used for directed (unicast) traffic among stations in a single virtual BSS.
[0064] If the frame destination address (Address 1 field) is the address of a station then the unicast security association shared between that station and the PAP is used in the expansion. If the frame is a Data frame and its destination address is a group address then the MPDU bridge protocol identifies a destination virtual BSS for the frame. The group security association for the identified virtual BSS is used in the expansion.
[0065] A non-PAP station transmits an 802.11 MPDU of type Data or Management to the DS using the unicast security association it shares with the PAP in its virtual BSS.
[0066] When receiving an 802.11 Data or Management frame from the WM, the PAP attempts to decipher and verify the integrity of the frame using the unicast security association for the station identified by the source address (Address 2 field) of the MPDU. When receiving an 802.11 MPDU of type Data or Management from a PAP, a non-PAP station attempts to decipher and verify the integrity of the frame using the unicast security association it shares with the PAP if the destination address of the frame (Address 1 field) is the address of the station, and using the group security association of its Class-3 virtual BSS if the destination address of the frame is a group address.
[0067] Location-Update Protocol
[0068] The invention also comprises a location-update protocol for updating the forwarding tables of bridges, or other interconnection media, connecting Public Access Points together.
[0069] Given multiple Public Access Points attached to different bridges in a spanning tree of a bridged LAN and an end station that associates with one of them and then reassociates with a new PAP, the new PAP sends a directed Bridge Protocol Data Unit (BPDU) (called a relocation PDU) to the PAP with which the station was previously associated. The destination address of the BPDU is the Current AP address of the Reassociation Request frame, which is a Class-3 virtual BSSID. The source address is the hardware address of the station.
[0070] Upon receiving a relocation MPDU at a particular port, a bridge updates its forwarding table with an entry that binds the receiving port to the source address of the MPDU.
[0071] A receiving bridge forwards a relocation MPDU to its designated root port unless the MPDU arrived on that port or the receiving bridge is the root of the spanning tree. If it is received at the designated root port of a bridge or by the root bridge then it is forwarded according to the learned forwarding table of the bridge, which may involve flooding the MPDU to all ports except the receiving port.
[0072] Fine Bridging
[0073] One embodiment of the invention discussed above refines a PVLAN to a virtual BSS. Under the MPDU bridge protocol, any station in a virtual BSS can send a directed or group-addressed frame to any other station in that virtual BSS. This may be undesirable. A meeting in a conference center, for instance, may have its own virtual BSS but not all attendees trust each other. By sharing the same virtual BSS, some attendees can launch worms or viruses. Trying to thwart these attacks by assigning each attendee to a unique virtual BSS prevents attendees from being able to share a server. Ideally, the server is shared by all meeting participants, yet no participant should be able to access, i.e. send frames to, another participant. The Public Access Point described above cannot provide this level of access control. An AP supporting fine bridging can provide it.
[0074] See also, FIG. 7 , which is a block schematic diagram of an IEEE Std. 802.1Q bridge that connects a set of edge hosts to an infrastructure system such as a LAN. Untagged frames arriving from edge hosts are assigned to VLAN A by virtue of port-based VLAN assignment (PVID A) and untagged frames arriving from the infrastructure system are assigned to VLAN B (PVID B). The egress rules depicted allow for frames belonging to A or B to egress to the infrastructure while only those belonging to B are allowed to egress to the edge hosts. In this way, edge hosts are prevented from communicating directly with one another.
[0075] Fine bridging decouples identification of a broadcast or multicast domain with a BSS.
[0076] Under fine bridging, the bridging behavior of an AP is determined by a policy expressed as a directed graph. The nodes of the graph are stations and there is an edge from a station A to a station B if and only if station A must be able to access station B, in other words, station B must be able to receive directed or group frames from station A.
[0077] For a given policy, the broadcast domain for a node is itself and all nodes it must access. The broadcast domain set of the policy is the set of broadcast domains for its nodes.
[0078] In an implementation of a policy, there is a group security association per broadcast domain. Further, each station (node) possesses the group security association of the broadcast domain for itself in the policy, and of every other broadcast domain in the policy of which it is a member. The former association may be used by the station for sending group frames and the latter associations for receiving group frames.
[0079] The accessibility within a three-station virtual BSS, one of which is an AP, is captured by the policy shown in FIG. 2 . Each node in the policy has {A, B, AP} as its broadcast domain. Thus, there is only one broadcast domain for the policy which is what one would expect given that the policy reflects a virtual BSS. Each station knows the group security association for the domain, and can send and receive group frames under that association.
[0080] FIG. 3 captures a policy among four stations where stations A and B share server stations S and D but A and B are not allowed to access each other.
[0081] The policy has broadcast domains B1: {A, S, D}, B2: {B, S, D} and B3: {D, A, S, B}. Station A knows the group security association for B1, to send group frames, and the group security association for B3 to receive group frames sent by S and D. Station D knows the group security association for B3, to send group frames and to receive them from S, and the group security associations for both B1 and B2 to receive group frames from A and B respectively.
[0082] If the policy in FIG. 3 were modified so that an edge from, say B, to A were added to the policy, as illustrated in FIG. 4 , then domain B2 would be eliminated and only B1 and B3 would remain.
[0083] If an edge from A to B were added to the policy in FIG. 4 then domains B1, B2 and B3 would collapse into the single domain B3 for the policy.
[0084] The provision of other policy variations are within the ability of those skilled in the art.
[0085] Although the invention is described herein with reference to the preferred embodiment, one skilled in the art will readily appreciate that other applications may be substituted for those set forth herein without departing from the spirit and scope of the present invention. Accordingly, the invention should only be limited by the Claims included below.
Claims
What is claimed is:
1. A security apparatus for a wireless LAN, comprising:
a plurality of end stations; and
a Public Access Point (PAP) for providing a plurality of virtual Basic Service Sets (BSS) from within a single physical access point (AP); wherein:
any number of said ends stations can belong to a virtual BSS;
an end station establishes a security association with said virtual BSS, said security association includes at least two keys, one key for encryption, called an encryption key, and another key for computing an authentication code, called an authentication code key;
said PAP appears to said end stations as multiple physical access points, one AP for each virtual BSS;
said PAP implements a non-IEEE 802.11 security architecture; and
said PAP comprises an initial authentication operation that generates the authentication code key.
2. A security apparatus for a wireless LAN, comprising:
a plurality of end stations wherein any number of said ends stations can belong to a virtual BSS wherein each of said end stations has a hardware media access control (MAC) address;
and a Public Access Point (PAP) for providing a plurality of virtual Basic Service Sets (BSS) from within a single physical access point (AP); wherein:
an end station establishes a security association with said virtual BSS;
said PAP appears to said end stations as multiple physical access points, one AP for each virtual BSS;
said PAP comprises an initial authentication operation that generates an authentication code key; and
all end stations in said virtual BSS share a group security association wherein said group security association is an implementation of a MAC security.
3. The security apparatus of claim 2, wherein said implementation of said MAC security comprises said implementation of a secure MAC service.
4. The security apparatus of claim 3, wherein said implementation of said secure MAC service comprises a MAC Security Key Agreement and a MAC Security Entity.
5. The security apparatus of claim 3, wherein said group security association comprises using one or more cryptographic methods.
6. The security apparatus of claim 5, further comprising the one or more cryptographic methods implemented in a security relationship maintained by a MAC Security Key Agreement.
7. An access point producing a frame for segregating traffic among a plurality of end stations, comprising:
a processor configured to process:
a plurality of virtual Basic Service Sets (BSS) wherein each BSS has a unique security association with a set of end stations wherein each BSS sends frames between the set of end stations;
the frame having a cryptographic authentication code;
the frame having a source media access control (MAC) address to determine a preliminary VLAN classification when the frame carries a null virtual LAN ID;
the frame having a virtual LAN ID (VID) as the preliminary VLAN classification when the frame carries the VID;
a table of security associations providing a cryptographic authentication code key based on the preliminary VLAN classification wherein the cryptographic authentication code key is used to recompute a new cryptographic authentication code over a payload of the frame;
the new cryptographic authentication code compared with the cryptographic authentication code;
the preliminary VLAN classification implemented as a final VLAN classification when the new cryptographic authentication code and the cryptographic authentication code match, wherein the frame is decrypted;
the preliminary VLAN classification not implemented as the final VLAN classification when the new cryptographic authentication code and the cryptographic authentication code do not match, wherein the frame is discarded; and
an initial authentication operation that generates the authentication code key.
8. An access point producing a frame for segregating traffic among a plurality of end stations, comprising:
a processor configured to process:
a plurality of virtual Basic Service Sets (BSS) wherein each BSS has a unique security association with a set of end stations wherein each BSS sends frames between the set of end stations;
the frame having a cryptographic authentication code;
the frame having a source media access control (MAC) address to determine a preliminary VLAN classification when the frame carries a null virtual LAN ID;
the frame having a virtual LAN ID (VID) as the preliminary VLAN classification when the frame carries the VID;
a table of security associations providing a cryptographic authentication code key based on the preliminary VLAN classification wherein the cryptographic authentication code key is used to recompute a new cryptographic authentication code over a payload of the frame;
the new cryptographic authentication code compared with the cryptographic authentication code;
the preliminary VLAN classification implemented as a final VLAN classification when the new cryptographic authentication code and the cryptographic authentication code match, wherein the frame is decrypted;
the preliminary VLAN classification not implemented as the final VLAN classification when the new cryptographic authentication code and the cryptographic authentication code do not match, wherein the frame is discarded,
wherein the new cryptographic authentication code is recomputed over the payload using a cryptographic message digest algorithm determined during an initial authentication operation.
9. An access point producing a frame for segregating traffic among a plurality of end stations, comprising:
a processor configured to process:
a plurality of virtual Basic Service Sets (BSS) wherein each BSS has a unique security association with a set of end stations wherein each BSS sends frames between the set of end stations;
the frame having a cryptographic authentication code;
the frame having a source media access control (MAC) address to determine a preliminary VLAN classification when the frame carries a null virtual LAN ID;
the frame having a virtual LAN ID (VID) as the preliminary VLAN classification when the frame carries the VID;
a table of security associations providing a cryptographic authentication code key based on the preliminary VLAN classification wherein the cryptographic authentication code key is used to recompute a new cryptographic authentication code over a payload of the frame;
the new cryptographic authentication code compared with the cryptographic authentication code;
the preliminary VLAN classification implemented as a final VLAN classification when the new cryptographic authentication code and the cryptographic authentication code match, wherein the frame is decrypted;
the preliminary VLAN classification not implemented as the final VLAN classification when the new cryptographic authentication code and the cryptographic authentication code do not match, wherein the frame is discarded,
wherein the final VLAN classification is used as a value of a VLAN classification parameter of any corresponding data request primitives.
10. An access point producing a frame for segregating traffic among a plurality of end stations, comprising:
a processor configured to process:
a plurality of virtual Basic Service Sets (BSS) wherein each BSS has a unique security association with a set of end stations wherein each BSS sends frames between the set of end stations;
the frame having a cryptographic authentication code;
the frame having a source media access control (MAC) address to determine a preliminary VLAN classification when the frame carries a null virtual LAN ID;
the frame having a virtual LAN ID (VID) as the preliminary VLAN classification when the frame carries the VID;
a table of security associations providing a cryptographic authentication code key based on the preliminary VLAN classification wherein the cryptographic authentication code key is used to recompute a new cryptographic authentication code over a payload of the frame;
the new cryptographic authentication code compared with the cryptographic authentication code;
the preliminary VLAN classification implemented as a final VLAN classification when the new cryptographic authentication code and the cryptographic authentication code match, wherein the frame is decrypted;
the preliminary VLAN classification not implemented as the final VLAN classification when the new cryptographic authentication code and the cryptographic authentication code do not match, wherein the frame is discarded,
wherein the cryptographic authentication code or the new cryptographic authentication code uniquely identifies the VLAN.
Patent Citations (105)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4919545(A) | 1990-04-01 | Yu | Applicant |
| US5550984(A) | 1996-08-01 | Gelb | Applicant |
| US5619657(A) | 1997-04-01 | Sudama et al. | Applicant |
| US5764890(A) | 1998-06-01 | Glasser et al. | Applicant |
| US5790800(A) | 1998-08-01 | Gauvin et al. | Applicant |
| US5822431(A) | 1998-10-01 | Sprunk | Applicant |
| US5918019(A) | 1999-06-01 | Valencia | Applicant |
| US5940591(A) | 1999-08-01 | Boyle et al. | Applicant |
| US5963556(A) | 1999-10-01 | Varghese et al. | Applicant |
| US5978378(A) | 1999-11-01 | Van Seters et al. | Applicant |
| US6003137(A) | 1999-12-01 | Kawasaki | Applicant |
| US6035105(A) | 2000-03-01 | McCloghrie et al. | Applicant |
| US6035405(A) | 2000-03-01 | Gage et al. | Applicant |
| US6041358(A) | 2000-03-01 | Huang et al. | Applicant |
| US6047325(A) | 2000-04-01 | Jain et al. | Applicant |
| US6061796(A) | 2000-05-01 | Chen et al. | Applicant |
| US6070243(A) | 2000-05-01 | See et al. | Applicant |
| US6085238(A) | 2000-07-01 | Yuasa et al. | Applicant |
| US6157647(A) | 2000-12-01 | Husak | Applicant |
| US6181699(B1) | 2001-01-01 | Crinion et al. | Applicant |
| US6226751(B1) | 2001-05-01 | Arrow et al. | Applicant |
| US6237093(B1) | 2001-05-01 | Vatanen | Applicant |
| US6308213(B1) | 2001-10-01 | Valencia | Applicant |
| US6311218(B1) | 2001-10-01 | Jain et al. | Applicant |
| US6339830(B1) | 2002-01-01 | See et al. | Applicant |
| US6414956(B1) | 2002-07-01 | Szczepanek | Applicant |
| US6487598(B1) | 2002-11-01 | Valencia | Applicant |
| US6615357(B1) | 2003-09-01 | Boden et al. | Applicant |
| US6636898(B1) | 2003-10-01 | Ludovici et al. | Applicant |
| US6639901(B1) | 2003-10-01 | Katzri et al. | Applicant |
| US6640302(B1) | 2003-10-01 | Subramaniam et al. | Applicant |
| US6675225(B1) | 2004-01-01 | Genty et al. | Applicant |
| US6697943(B1) | 2004-02-01 | Frantz | Applicant |
| US6701437(B1) | 2004-03-01 | Hoke et al. | Applicant |
| US6728249(B2) | 2004-04-01 | Chang | Applicant |
| US6798751(B1) | 2004-09-01 | Voit et al. | Applicant |
| US6847620(B1) | 2005-01-01 | Meier | Applicant |
| US6874090(B2) | 2005-03-01 | See et al. | Applicant |
| US6898791(B1) | 2005-05-01 | Chandy et al. | Applicant |
| US6912592(B2) | 2005-06-01 | Yip | Applicant |
| US6917614(B1) | 2005-07-01 | Laubech et al. | Applicant |
| US6920502(B2) | 2005-07-01 | Araujo et al. | Applicant |
| US6954790(B2) | 2005-10-01 | Forslow | Applicant |
| US6961762(B1) | 2005-11-01 | Yeap | Applicant |
| US6970459(B1) | 2005-11-01 | Meier | Applicant |
| US6970941(B1) | 2005-11-01 | Caronni et al. | Applicant |
| US6976177(B2) | 2005-12-01 | Ahonen | Applicant |
| US7000121(B2) | 2006-02-01 | Jarosz | Applicant |
| US7028337(B2) | 2006-04-01 | Murakawa | Applicant |
| US7042852(B2) | 2006-05-01 | Hrastar | Applicant |
| US7055171(B1) | 2006-05-01 | Martin et al. | Applicant |
| US7058796(B2) | 2006-06-01 | Lynn | Applicant |
| US7069437(B2) | 2006-06-01 | Williams | Applicant |
| US7086089(B2) | 2006-08-01 | Hrastar et al. | Applicant |
| US7088714(B2) | 2006-08-01 | Athreya et al. | Applicant |
| US7093027(B1) | 2006-08-01 | Shabtay et al. | Applicant |
| US7107464(B2) | 2006-09-01 | Shapira et al. | Applicant |
| US7130904(B2) | 2006-10-01 | Kitchin | Examiner |
| US7151762(B1) | 2006-12-01 | Ho et al. | Applicant |
| US7164912(B2) | 2007-01-01 | Buckley et al. | Applicant |
| US7174390(B2) | 2007-02-01 | Schulter et al. | Applicant |
| US7181542(B2) | 2007-02-01 | Tuomenoksa et al. | Applicant |
| US7188180(B2) | 2007-03-01 | Larson et al. | Applicant |
| US7194622(B1) | 2007-03-01 | Halasz et al. | Examiner |
| US7203957(B2) | 2007-04-01 | Balissat et al. | Applicant |
| US7209479(B2) | 2007-04-01 | Larson | Applicant |
| US7313135(B2) | 2007-12-01 | Wyatt | Applicant |
| US7401354(B2) | 2008-07-01 | Boden et al. | Applicant |
| US7434047(B2) | 2008-10-01 | Sharma | Applicant |
| US7478427(B2) | 2009-01-01 | Mukherjee et al. | Applicant |
| US2001/0048744(A1) | 2001-12-01 | Kimura | Applicant |
| US2002/0027906(A1) | 2002-03-01 | Athreya et al. | Applicant |
| US2002/0071448(A1) | 2002-06-01 | Cervello et al. | Applicant |
| US2002/0091795(A1) | 2002-07-01 | Yip | Applicant |
| US2002/0143960(A1) | 2002-10-01 | Goren et al. | Applicant |
| US2002/0163920(A1) | 2002-11-01 | Walker et al. | Applicant |
| US2002/0174335(A1) | 2002-11-01 | Zhang et al. | Applicant |
| US2002/0178361(A1) | 2002-11-01 | Genty et al. | Applicant |
| US2002/0199021(A1) | 2002-12-01 | Beier et al. | Applicant |
| US2003/0037125(A1) | 2003-02-01 | Luman et al. | Applicant |
| US2003/0037169(A1) | 2003-02-01 | Kitchin | Applicant |
| US2003/0037258(A1) | 2003-02-01 | Koren | Applicant |
| US2003/0112820(A1) | 2003-06-01 | Beach | Applicant |
| US2003/0120763(A1) | 2003-06-01 | Volpano | Applicant |
| US2003/0227893(A1) | 2003-12-01 | Bajic | Applicant |
| US2004/0054902(A1) | 2004-03-01 | Fujimoto et al. | Applicant |
| US2004/0083295(A1) | 2004-04-01 | Amara et al. | Applicant |
| US2004/0093431(A1) | 2004-05-01 | Genty et al. | Applicant |
| US2004/0107285(A1) | 2004-06-01 | Larson et al. | Applicant |
| US2004/0111520(A1) | 2004-06-01 | Krantz et al. | Applicant |
| US2004/0117653(A1) | 2004-06-01 | Shapira et al. | Applicant |
| US2004/0255164(A1) | 2004-12-01 | Wesemann | Applicant |
| US2005/0055306(A1) | 2005-03-01 | Miller et al. | Applicant |
| US2005/0210237(A1) | 2005-09-01 | Balaz et al. | Applicant |
| US2005/0223111(A1) | 2005-10-01 | Bhandaru et al. | Applicant |
| US2005/0226257(A1) | 2005-10-01 | Mirzabegian et al. | Applicant |
| US2005/0283604(A1) | 2005-12-01 | Deshpande et al. | Applicant |
| US2006/0070115(A1) | 2006-03-01 | Yamada et al. | Applicant |
| US2006/0077926(A1) | 2006-04-01 | Rune | Applicant |
| US2006/0077977(A1) | 2006-04-01 | Caronni et al. | Applicant |
| US2007/0271606(A1) | 2007-11-01 | Amann et al. | Applicant |
| US2007/0288615(A1) | 2007-12-01 | Keohane et al. | Applicant |
| EP939519(A1) | 1999-09-01 | Applicant | |
| JP10136438 | 1998-05-01 | Applicant | |
| WO2058336(A2) | 2002-07-01 | Applicant |
Non-Patent Literature (12)
- Butler, et al., A national-scale authentication infrastructure, Computer, vol. 33, Issue 12, Dec. 2000 pp. 60-66.Applicant
- Garg et al., Scheduling algorithms for bounded delay service in virtual networks, Global Telecommunications Conference, 1999. GLOBECOM '99, vol. 2, 1999, pp. 1318-1322.Applicant
- Redlich et al., Virtual networks in the Internet, Open Architectures and Network Programming Proceedings, 1999. OPENARCH '99. 1999 IEEE Second Conference on Mar. 26-27, 1999, pp. 108-114.Applicant
- Venkateswaran et al., Virtual private networks, Potentials, IEEE, vol. 20, Issue 1, Feb.-Mar. 2001, pp. 11-15.Applicant
- Bernard Aboba, Virtual Access Points, IEEE P802.11 Wireless LANs, May 22, 2003, Microsoft, and pp. 1-13.Applicant
- Security Task Group of IEEE 802.1, Draft Standard for Local and Metropolitan Area Networks: Media Access Control (MAC) Security), IEEE P802.1AE/D5.1 (Jan. 19, 2006), pp. 1-150.Applicant
- IEEE Computer Society, IEEE Standards for Local and Metropolitan Area Networks: Virtual Bridged Local Networks, IEEE std 802.1Q 2003 Edition (May 7, 2003), pp. 1-312.Applicant
- Kent et al, “Security Architecture for the Internet Protocol”, Nov. 1998, Network Working Group Request for Comments, RFC 2401, pp. 1-62.Applicant
- Rosen et al, “BGP/MPLS VPNs” Mar. 1999, Network Working Group Request for Comments, RFC 2547, pp. 1024.Applicant
- Maughan et al, “Internet Security Association and Key Management Protocol (ISAKMP)”, Nov. 1998, Network Working Group Request for Comments, RFC 2408, pp. 1-81.Applicant
- Madson, C., “The Use of HMAC-MD5-96 within ESP and AH”, Nov. 1998, Network Working Group Request for Comments, RFC 2403, pp. 1-7.Applicant
- European Search Report dated May 20, 2010, 6 pages.Applicant