Prosecution Insights
Last updated: April 19, 2026
Application No. 17/538,757

VARIABLE AUTHENTICATION IDENTIFIER (AID) FOR ACCESS POINT (AP) PRIVACY

Final Rejection §103
Filed
Nov 30, 2021
Examiner
NOEL, LYDIA LOUIS-FILS
Art Unit
2437
Tech Center
2400 — Computer Networks
Assignee
Qualcomm Incorporated
OA Round
6 (Final)
70%
Grant Probability
Favorable
7-8
OA Rounds
3y 1m
To Grant
91%
With Interview

Examiner Intelligence

Grants 70% — above average
70%
Career Allow Rate
66 granted / 94 resolved
+12.2% vs TC avg
Strong +21% interview lift
Without
With
+20.7%
Interview Lift
resolved cases with interview
Typical timeline
3y 1m
Avg Prosecution
36 currently pending
Career history
130
Total Applications
across all art units

Statute-Specific Performance

§101
5.8%
-34.2% vs TC avg
§103
60.8%
+20.8% vs TC avg
§102
10.0%
-30.0% vs TC avg
§112
18.8%
-21.2% vs TC avg
Black line = Tech Center average estimate • Based on career data from 94 resolved cases

Office Action

§103
DETAILED ACTION Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . This Office Action is in response to the Response filed on 01/14/2026. In the instant Amendment, claims 5 and 19 are cancelled, claims 1, 6-8, 15, 20-22, 29, 34, 39, and 44 were amended; and claims 1, 6-8, 10-11, 13-15, 18-22, 24-25, 29-35, 39, and 42-45 have been examined and are pending in this application. This Action is Final. Response to Arguments Applicant’s arguments of the response filed on 01/14/2026, in regards to the 112 f rejection are persuasive. The 112 f rejection have been withdrawn. Applicant’s remarks filed 01/14/2026 with respect to claims 1,15, 29, and 39 have been considered but are not persuasive. Applicant argues that Yang does not disclose “a time value corresponding to a generation time of the pSSID” because Yang’s TimeStamp field is broadcast in the beacon frame and does not represent the generation time of the pSSID. The Examiner respectfully disagrees. The claim does not require that the time value originate from the wireless communication device or that it represent the exact moment the pSSID is generated. The claim merely requires a time value corresponding to a generation time of the pSSID. Under the broadest reasonable interpretation (MPEP §2111), the recited time value encompasses any temporal value used in connection with generating the pSSID regardless of its source. Yang discloses that the beacon frame includes a TimeStamp field and that this timestamp is used when generating the hashed SSID so that the identifier is not static (Yang para [0059]–[0060]). Because the timestamp is used as an input during generation of the hashed SSID, the timestamp inherently corresponds to the time at which the pSSID is generated. Applicant’s argument improperly reads additional limitations into the claim by requiring that the time value be generated by the wireless device itself, which is not recited in the claim. Furthermore, the claim recites a time value “corresponding to” the generation time of the pSSID. Under the broadest reasonable interpretation, the phrase “corresponding to” requires only a relationship or association with the generation time and does not require equality with the exact generation timestamp. Additionally, the recited “location value” and “time value” merely define the informational content of the replay value rather than imposing structural limitations (MPEP §2114). Under the broadest reasonable interpretation, these limitations encompass any data representing location and temporal information associated with generation of the pseudonym identifier. Gadher discloses RSSI values used for wireless positioning (Gadher para [0153]), which represent the location of the wireless communication device, and further teaches session-specific tokens used in hash generation to prevent replay attacks (Gadher para [0190]). Accordingly, Yang and Gadher collectively teach a replay value including both a location value and a time value as recited. Therefore, the amendment incorporating the limitations of dependent claim 5 into independent claim 1 does not overcome the rejection, as the cited references already teach or suggest the recited features under the broadest reasonable interpretation. Claim Rejections - 35 USC § 103 In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. Claims 1, 7, 10-11, 13-15, 21, 24-25, 29, 32-35, 39, and 42-45 are rejected under 35 U.S.C. 103 as being unpatentable over Yang et al. (U.S. PGPub. No. 2014/0337633 A1; Hereinafter "Yang") in view of Olson et al. (US Pat. 7684563 B1; Hereinafter “Olson”) and Gadher et al. (W.O. No. 2014/113882 A1; Hereinafter "Gadher"). PNG media_image1.png 319 710 media_image1.png Greyscale As per claims 1, 15, Yang teaches a wireless communication device, comprising (Yang: fig. 11, para[109], “FIG. 11 illustrates an example communications device 1100. Communications device 1100 may be an implementation of a hashed SSID compliant communications device, such as a communications controller, such as an access point…. a UE, a user, a subscriber, a terminal, a mobile, a mobile station, and the like”): a processing system that includes one or more processors and one or more memories storing code, the processing system configured to cause the wireless communication device to: generate a pseudonym service set identifier (pSSID) (hashed SSID) using a single hash function, wherein: a first input to the single hash function includes a service set identifier (SSID) associated with a wireless network (Yang: para[110], “A hashed SSID generating unit 1120 is configured to generate a hashed SSID (or a truncated hashed SSID) from a SSID. Hashed SSID generating unit 1120 is configured to use a hashing function, such as SHA-256.”); a second input to the single hash function includes a medium access control (MAC) address of the wireless communication device, the second input of the MAC address and the first input of the SSID being separate inputs n (Yang: para[110], “Hashed SSID generating unit 1120 is configured to modify the SSID using a value, such as a timestamp, a frame type, a frame sequence number, a Nonce, a MAC address, and the like, prior to hashing. Hashed SSID generating unit 1120 is configured to combine, e.g., combine, add, and the like, the value with the SSID.” See also fig. 3b para [48-50], [78]) a third input to the single hash function includes a first replay value to prevent reuse of the pSSID in other frames (Yang: fig. 4b para[51], [53], [111] “An adder 460 may combine the numerical value produced by string to binary converter 455 and a value that is a numerical value pre-defined for a frame type, a timestamp, a nonce, a MAC address, a combination thereof, and the like, to produce a sum of the two numerical values. A hashing unit 465 may perform a hashing on a given input (as provided by adder 460) based on a cryptographic hash function, such as the SHA-256 hash function, and the like. A truncation unit 470 may truncate a hash output (as provided by hashing unit 465) to a specified length. A combine unit 475 may combine the truncated hashed SSID (as provided by truncation unit 470) with a pre-defined value (or a pre-defined string, a pre-defined sequence, and the like).”, para[82], “HASH_SSID.sub.--1(AP) may have been generated using the SSID associated with the AP modified with a value, e.g., a timestamp, a frame type, a frame sequence number, and the like, to help prevent a static hashed SSID from occurring. The Beacon frame may include the value used to modify the SSID so that the STA will be able to recreate the truncated hashed SSID.”), wherein the first replay value includes: a time value corresponding to a generation time of the pSSID (Yang: [59], “The Beacon frame includes: a TA field set to the MAC address of AP 607, a TimeStamp field, an SSID IE set to a null SSID, a Hashed SSID IE that includes a first truncated hashed SSID generated from the SSID of AP 607”, para[54],”); the SSID differs from the pSSID (Yang: para[48-50], “The hashed SSID, as produced by example hashed SSID generators 300 and 350, is generally an unintelligible sequence of bits. So, it is highly unlikely that the hashed SSID will match with any SSID that is in the plain text form” according to the applicant’s specification, para[0207] “In particular, if a cryptographically strong hash function is used, there is a very low probability that the hash function generates a pSSID identical to the SSID such that it can be assumed that the SSID differs from the pSSID”, Yang teaches a hashed SSID using a hash function SHA-256, though the Hashed SSID differs from the SSID. Based on the definition on the applicant’s disclosure, Yang reads on “the SSID differs from the PSSID); and transmit, to a first device, a frame including the pSSID in place of the SSID (Yang: para[59], “Message exchange diagram 600 may begin with AP 607, which is hashed SSID compliant, broadcasts a Beacon frame (shown as event 610). The Beacon frame includes: a TA field set to the MAC address of AP 607, a TimeStamp field, an SSID IE set to a null SSID, a Hashed SSID IE that includes a first truncated hashed SSID generated from the SSID of AP 607”). Yang does not explicitly teach the second input of the MAC address and the first input of the SSID are concurrently input into the single hash function. However, in the related art, Olson teaches two inputs that are concurrently input into a single hash function (Olson: col. 21, line 45-65, “Input buses IN2 and IN3 may be configured to provide input data to hash queue 425, for example to load hash queue 425 with an initial hash value before beginning hash value computation, or to load an intermediate hash value if a previous hash computation is resuming (e.g. after an interruption). In the illustrated embodiment, input buses IN2 and IN3 may be configured to concurrently fill any two hash value word positions (not necessarily adjacent) of hash queue 425. In other embodiments, it is contemplated that fewer or more hash value word positions may be concurrently filled. For example, in some embodiments SPU 240 may include a 32-bit, 128-bit or another width of an input path to hash logic 420, which may enable concurrent filling of one, four or another number of hash value word positions”) Therefore, it would have been obvious to a person having ordinary skill in the art, before the effective filling date of the claimed invention, to have update Yang with the concurrently input process as discuss in Olson, it will reduce collision, thus improving cost and performance (Olson, col. 1, line 42-50). Yang in view of Olson does not explicitly teach wherein the first replay value includes at least a location value corresponding to a location of the wireless communication device. However, in the related art, Gadher teaches wherein the first replay value includes at least a location value corresponding to a location of the wireless communication device (Gadher: para[153], [176-190], [224-230] “The proximity based unit may provide the users with a session specific token (e.g. specific salt value). This randomly generated string may be used to salt a hash string that may be sent along with wireless based positioning requests. As a result, this proximity based approach may serve three purposes: 1 ) Finding the location of the device relative to the geo- fenced zone…Securing sessions (e.g. preventing replay attacks).”, “on each request the users calculate and send a hash, equation 6, to the server. Hasli(sal .sub.ll l† + salt .sub.<t + RS Sirring Ϊ User name + BuUdModcl + IMEI + MAC.sub.addrc s)”). Therefore, it would have been obvious to a person having ordinary skill in the art, before the effective filling date of the claimed invention, to modify Yang’s pseudonym SSID generation to include the location-based replay value as taught by Gadher, it will improve the robustness of Yang’s pSSID, improve privacy and replay protection (Gadher: para[25], [169]). As per claims 7, 21, Yang in view of Olson and Gadher teaches the independent claim 1. Gadher teaches wherein the location value includes a positioning measurement of the wireless communication device using a satellite positioning system receiver (Gadher: para[05], [96] “The aim of some localization technologies is to identify the exact location of a user for example using Global Positioning Systems (GPS). GPS technology generally provides an accurate solution for determining position in outdoor environments.”). Therefore, it would have been obvious to a person having ordinary skill in the art, before the effective filling date of the claimed invention, to modify Yang’s pseudonym SSID generation to include the location-based replay value as taught by Gadher, it will improve the robustness of Yang’s pSSID, improve privacy and replay protection (Gadher: para[25], [169]). As per claims 10, 24 Yang teaches wherein the frame includes one or more values indicating one or more inputs other than the SSID to the single hash function to generate the pSSID (Yang: [59], “The Beacon frame includes: a TA field set to the MAC address of AP 607, a TimeStamp field, an SSID IE set to a null SSID, a Hashed SSID IE that includes a first truncated hashed SSID generated from the SSID of AP 607”, para[54], “A Nonce field 511 may be optionally present in Hashed SSID IE 500 to indicate a random number, which is generated and used for generating the hashed SSID by an AP or STA transmitting Hashed SSID IE 500. The presence or absence of the Nonce field in Hashed SSID IE 500 may be inferred from the value of Length field 507”). As per claims 11, 25 Yang teaches wherein the frame includes an indication of a configuration of the single hash function used to generate the pSSID (Yang: [59], “The Beacon frame includes: a TA field set to the MAC address of AP 607, a TimeStamp field, an SSID IE set to a null SSID, a Hashed SSID IE that includes a first truncated hashed SSID generated from the SSID of AP 607”, para[54], “Hashed SSID IE 500 includes an IE ID field 505 carrying a new IE identifier defined for Hashed SSID IE 500, a Length field 507 indicating the number of total octets after Length field 507 in Hashed SSID IE 500, and a Hashed SSID field 509 carrying the truncated hashed SSID (e.g., the first six octets the hashed SSID).”). As per claim 13 Yang teaches wherein: the wireless communication device is included in a station (STA) (Yang: para[33], “Communications system 100 includes an access point (AP) 105 that serves one or more stations, such as stations (STA) 110-116, by receiving communications originating from the stations and then forwarding the communications to their intended destinations or receiving communications destined to the stations and then forwarding the communications to their intended stations.”); and the frame includes one or more of: a probe request frame broadcast by the STA; an association request frame unicast by the STA to an access point (AP) of the wireless network; or (Yang: para [64], “Active scanning is another scanning procedure wherein STA 605 can obtain information about AP 607 so that STA 605 can decide to connect with or to not connect with AP 607. Active scanning may include STA 605 transmitting a Probe Request frame to AP 605 (shown as event 614).”). As per claim 14, Yang teaches wherein: the wireless communication device is included in an access point (AP) of the wireless network (Yang: para[33], “Communications system 100 includes an access point (AP) 105 that serves one or more stations, such as stations (STA) 110-116, by receiving communications originating from the stations and then forwarding the communications to their intended destinations or receiving communications destined to the stations and then forwarding the communications to their intended stations.”); and the frame includes one or more of: a beacon frame broadcast by the AP; a probe response frame transmitted by the AP; or a fast initial link setup (FILS) frame broadcast by the AP (Yang: (para[67], “AP 607 may send a Probe Response frame to STA 605 (shown as event 618). The Probe Response frame includes: a RA field set to the MAC address of STA 605, a TimeStamp field, and a Hashed SSID IE that includes a third truncated hashed SSID generated from the SSID of AP 607”). As per claims 29, 39 Yang teaches a wireless communication device, comprising: a processing system that includes one or more processors and one or more memories storing code, the processing system configured to cause the wireless communication device to (Yang: fig. 11, para[109], “FIG. 11 illustrates an example communications device 1100. Communications device 1100 may be an implementation of a hashed SSID compliant communications device, such as a communications controller, such as an access point, an eNB, a base station, a NodeB, a controller, and the like, or a device, such as a station, a UE, a user, a subscriber, a terminal, a mobile, a mobile station, and the like”): receive, from a first device, a frame including a pseudonym service set identifier (pSSID) in place of a service set identifier (SSID), wherein: the pSSID is generated using a single hash function (Yang: para [59], [109-110], “Communications device 1100 also includes a receiver 1110 that is configured to receive data frames, control frames including hashed SSIDs, and the like.”); a first input to the single hash function includes the SSID associated with a first wireless network (Yang: para[110], “A hashed SSID generating unit 1120 is configured to generate a hashed SSID (or a truncated hashed SSID) from a SSID. Hashed SSID generating unit 1120 is configured to use a hashing function, such as SHA-256.”);; a second input to the single hash function includes a medium access control (MAC) address of the wireless communication device, the second input of the MAC address and the first input of the SSID being separate inputs, the PSSID being generated by a hash of the SSID and the MAC address using the single hash function (Yang: para[110], “Hashed SSID generating unit 1120 is configured to modify the SSID using a value, such as a timestamp, a frame type, a frame sequence number, a Nonce, a MAC address, and the like, prior to hashing. Hashed SSID generating unit 1120 is configured to combine, e.g., combine, add, and the like, the value with the SSID.” See also fig. 3b para [48-50], [78]) a third input to the single hash function includes a first replay value to prevent reuse of the pSSID in other frames (Yang: fig. 4b para[51], [53], [111] “An adder 460 may combine the numerical value produced by string to binary converter 455 and a value that is a numerical value pre-defined for a frame type, a timestamp, a nonce, a MAC address, a combination thereof, and the like, to produce a sum of the two numerical values. A hashing unit 465 may perform a hashing on a given input (as provided by adder 460) based on a cryptographic hash function, such as the SHA-256 hash function, and the like. A truncation unit 470 may truncate a hash output (as provided by hashing unit 465) to a specified length. A combine unit 475 may combine the truncated hashed SSID (as provided by truncation unit 470) with a pre-defined value (or a pre-defined string, a pre-defined sequence, and the like).”, para[82], “HASH_SSID.sub.--1(AP) may have been generated using the SSID associated with the AP modified with a value, e.g., a timestamp, a frame type, a frame sequence number, and the like, to help prevent a static hashed SSID from occurring. The Beacon frame may include the value used to modify the SSID so that the STA will be able to recreate the truncated hashed SSID.”), wherein the first replay value includes: a time value corresponding to a generation time of the pSSID (Yang: [59], “The Beacon frame includes: a TA field set to the MAC address of AP 607, a TimeStamp field, an SSID IE set to a null SSID, a Hashed SSID IE that includes a first truncated hashed SSID generated from the SSID of AP 607”, para[54],”); the SSID differs from the pSSID (Yang: para[48-50], “The hashed SSID, as produced by example hashed SSID generators 300 and 350, is generally an unintelligible sequence of bits. So, it is highly unlikely that the hashed SSID will match with any SSID that is in the plain text form”); and the processing system further configured to: obtain the pSSID from the frame (Yang: para[60-66], “Events 610 and 612 may be considered to be part of a passive scanning procedure wherein STA 605 can obtain information about AP 607 so that STA 605 can decide to connect with or to not connect with AP 607.”); and indicate whether a candidate SSID stored at the wireless communication device matches the SSID associated with the first wireless network (Yang: para[60-66], “STA 605, recognizing the Hashed SSID IE, may perform a check to determine if the first truncated hashed SSID included in the Hashed SSID IE matches with one or more truncated hashed SSID generated by STA 605 utilizing SSID(s) of APs in the preferred WLAN list of STA 605 (shown as event 612). ….It is noted that related truncated hashed SSIDs, such as the first truncated hashed SSID included in the Beacon frame (event 610)..and the truncated hashed SSID generated by AP 607 in event 616, and the like, are generated using the same hash function. The use of the same hash function ensures that matching SSIDs result in matching truncated hashed SSIDs.”) Yang does not explicitly teach the second input of the MAC address and the first input of the SSID are concurrently input into the single hash function. However, in the related art, Olson teaches two inputs that are concurrently input into a single hash function (Olson: col. 21, line 45-65, “Input buses IN2 and IN3 may be configured to provide input data to hash queue 425, for example to load hash queue 425 with an initial hash value before beginning hash value computation, or to load an intermediate hash value if a previous hash computation is resuming (e.g. after an interruption). In the illustrated embodiment, input buses IN2 and IN3 may be configured to concurrently fill any two hash value word positions (not necessarily adjacent) of hash queue 425. In other embodiments, it is contemplated that fewer or more hash value word positions may be concurrently filled. For example, in some embodiments SPU 240 may include a 32-bit, 128-bit or another width of an input path to hash logic 420, which may enable concurrent filling of one, four or another number of hash value word positions”) Therefore, it would have been obvious to a person having ordinary skill in the art, before the effective filling date of the claimed invention, to have update Yang with the concurrently input process as discuss in Olson, it will reduce collision, thus improving cost and performance (Olson, col. 1, line 42-50). Yang in view of Olson does not explicitly teach wherein the first replay value includes at least a location value corresponding to a location of the wireless communication device. However, in the related art, Gadher teaches wherein the first replay value includes at least a location value corresponding to a location of the wireless communication device (Gadher: para[153], [176-190], [224-230] “The proximity based unit may provide the users with a session specific token (e.g. specific salt value). This randomly generated string may be used to salt a hash string that may be sent along with wireless based positioning requests. As a result, this proximity based approach may serve three purposes: 1 ) Finding the location of the device relative to the geo- fenced zone…Securing sessions (e.g. preventing replay attacks).”, “on each request the users calculate and send a hash, equation 6, to the server. Hasli(sal .sub.ll l† + salt .sub.<t + RS Sirring Ϊ User name + BuUdModcl + IMEI + MAC.sub.addrc s)”). Therefore, it would have been obvious to a person having ordinary skill in the art, before the effective filling date of the claimed invention, to modify Yang’s pseudonym SSID generation to include the location-based replay value as taught by Gadher, it will improve the robustness of Yang’s pSSID, improve privacy and replay protection (Gadher: para[25], [169]). As per claims 32, 42 Yang teaches generate a candidate pSSID using the single hash function using the candidate SSID as an input to the single hash function to generate the candidate pSSID (Yang: [37], “The TA field is set to the MAC address of the AP. The SSID IE is set to a null SSID, and the Hashed SSID IE includes a first hashed SSID generated from the SSID associated with the AP.”).; and compare the candidate pSSID to the pSSID to identify whether the candidate SSID matches the SSID (Yang: para[38], [42] “The STA compares the one or more hashed SSIDs with the received first Hashed SSID to determine if there is a match. Steps 700 and 702 may be considered to be part of a passive scanning procedure in which the STA can obtain information about the AP so that the STA can decide whether to connect with the AP or not.”). As per claims 33, 43 Yang teaches wherein: the frame includes one or more input values to the single hash function used to generate the pSSID (Yang: [59], “The Beacon frame includes: a TA field set to the MAC address of AP 607, a TimeStamp field, an SSID IE set to a null SSID, a Hashed SSID IE that includes a first truncated hashed SSID generated from the SSID of AP 607”, para[54], “A Nonce field 511 may be optionally present in Hashed SSID IE 500 to indicate a random number, which is generated and used for generating the hashed SSID by an AP or STA transmitting Hashed SSID IE 500. The presence or absence of the Nonce field in Hashed SSID IE 500 may be inferred from the value of Length field 507”); and obtain the one or more input values from the frame (para[60-66]); and for each candidate SSID of the one or more candidate SSIDs, input the one or more input values and the candidate SSID to the single hash function to generate the candidate pSSID using the single hash function (Yang: [60-66], “STA 605 may use a technique for generating truncated hashed SSIDs, such as those discussed previously in FIGS. 3a, 3b, 4a, and 4b. As an illustrative example, STA 605 may use the value contained in the TimeStamp field of the Beacon frame to generate the truncated hashed SSIDs. STA 605 may compare the truncated hashed SSIDs and if there is a match, STA 605 may consider that AP 607 is a member of its preferred WLAN list. It is noted that both STA 605 and AP 607 use the same hashing function, such as SHA-256.”). As per claims 34, 44, Yang teaches wherein the one or more input values further includes: a random value defined at the wireless communication device and the device that generates the pSSID (Yang: [59], “The Beacon frame includes: a TA field set to the MAC address of AP 607, a TimeStamp field, an SSID IE set to a null SSID, a Hashed SSID IE that includes a first truncated hashed SSID generated from the SSID of AP 607”, para[54], “A Nonce field 511 may be optionally present in Hashed SSID IE 500 to indicate a random number, which is generated and used for generating the hashed SSID by an AP or STA transmitting Hashed SSID IE 500. The presence or absence of the Nonce field in Hashed SSID IE 500 may be inferred from the value of Length field 507”). As per claims 35, 45 Yang teaches wherein the processing system is configured to obtain, from the frame, an indication of a configuration of the single hash function used to generate the pSSID (Yang: [59], “The Beacon frame includes: a TA field set to the MAC address of AP 607, a TimeStamp field, an SSID IE set to a null SSID, a Hashed SSID IE that includes a first truncated hashed SSID generated from the SSID of AP 607”, para[54], “Hashed SSID IE 500 includes an IE ID field 505 carrying a new IE identifier defined for Hashed SSID IE 500, a Length field 507 indicating the number of total octets after Length field 507 in Hashed SSID IE 500, and a Hashed SSID field 509 carrying the truncated hashed SSID (e.g., the first six octets the hashed SSID).”). Claims 6, 20 are rejected under 35 U.S.C. 103 as being unpatentable over Yang et al. (U.S. PGPub. No. 2014/0337633 A1; Hereinafter "Yang") in view of Olson et al. (US Pat. 7684563 B1; Hereinafter “Olson”), Gadher et al. (W.O. No. 2014/113882 A1; Hereinafter "Gadher"), and Asterjadhi et al. (US 20190268847 A1; Hereinafter “Asterjadhi”). As per claims 6 and 20, Yang in view of Olson and Gadher teaches the independent claim 1. Yang in view of Olson and Gadher does not explicitly teach wherein the time value includes a timing synchronization function (TSF) value. However, in the related art, Asterjadhi teaches wherein the time value includes a timing synchronization function (TSF) value (Asterjadhi: para[0123], [0137], [0150], “The timestamp field 624 (optional with a length TBD) may contain a partial timing synchronization function (TSF). The partial TSF may allow the WUR STA to synchronize its clock to match the clock of the transmitting AP 104. The partial TSF may also allow the WUR STA to prevent and/or avoid replay attacks”). Therefore, it would have been obvious to a person having ordinary skill in the art, before the effective filling date of the claimed invention, to have update the modified Yang with Asterjadhi, it will enhance the efficiency of roaming between the networks, and ensure a secure connection between devices within a network (Asterjadhi, para[0005]). Claims 8, 22, and 30-31 are rejected under 35 U.S.C. 103 as being unpatentable over Yang et al. (U.S. PGPub. No. 2014/0337633 A1; Hereinafter "Yang") in view of Olson et al. (US Pat. 7684563 B1; Hereinafter “Olson”), Gadher et al. (W.O. No. 2014/113882 A1; Hereinafter "Gadher"), and Boone et al. (US 10129499 B1; Hereinafter “Boone”). As per claims 8, 22 Yang in view of Olson and Gadher teaches the independent claim 1. Yang teaches wherein: the first replay value is the time value (Yang: [59], “The Beacon frame includes: a TA field set to the MAC address of AP 607, a TimeStamp field, an SSID IE set to a null SSID, a Hashed SSID IE that includes a first truncated hashed SSID generated from the SSID of AP 607”, para[54],”). Yang in view of Olson and Gadher does not explicitly teach a fourth input to the single hash function includes a second replay value to prevent reuse of the pSSID in other frames, the second replay value comprising the location value. However, in the related art, Boone teaches a fourth input to the single hash function includes a second replay value to prevent reuse of the pSSID in other frames, the second replay value comprising the location value (Boone: col.11, line 1-6, “the SSID is combined with other information about a WLAN or an AP of the WLAN prior to hashing. ..The hash h may be generated from the combination of the SSID and the MAC address, a portion of the capability information, the list of rates supported by the WLAN, the security scheme of the WLAN (e.g., WEP, WPA, WPA2, etc.), other information from the beacon frame, or some combination thereof. The hash h may also be generated from a GPS location as detected by a GPS receiver on the camera 100.” ). Therefore, it would have been obvious to a person having ordinary skill in the art, before the effective filling date of the claimed invention, to have update the modified Yang with the location information of Boone, it will prevent malicious users from connecting to the network ensure a secure connection between devices within a network (Boone: col. 1, line 27-29). As per claim 30, Yang in view of Olson and Gadher teaches the independent claim 29. Yang in view of Olson and Gadher does not explicitly teach wherein: the wireless communication device is included in an access point (AP) associated with a second wireless network; and the candidate SSID is the SSID of the second wireless network. However, in the related art, Boone teaches wherein: the wireless communication device is included in an access point (AP) associated with a second wireless network (Boone: col. 4 line 19-38, “The two WLANs 120A, 120B are wireless local area networks, which may be, for example, Wi-Fi networks. The WLANs 120A, 120B may provide connected devices with access to a larger network, such as the Internet or an intranet….Each AP may be associated with one WLAN, but multiple APs may allow devices to connect to the same WLAN. For example, two APs may allow devices to connect to the first WLAN 110A, and another AP may allow devices to connect to the second WLAN 110B”); and the candidate SSID is the SSID of the second wireless network (Boone: col. 4 line 19-28, “A WLAN may connect to multiple devices, such as the camera 100. Each WLAN may include an identifier, specific to that WLAN, such as a service set identifier (SSID).”). Therefore, it would have been obvious to a person having ordinary skill in the art, before the effective filling date of the claimed invention, to have update the modified Yang with the location information of Boone, it will prevent malicious users from connecting to the network ensure a secure connection between devices within a network (Boone: col. 1, line 27-29). As per claim 31, Yang in view of Olson and Gadher teaches the independent claim 29. Yang teaches wherein: the wireless communication device is included in a station (STA) (Yang: para [109]). Yang in view of Olson and Gadher does not explicitly teach wherein: the candidate SSID is an SSID of a second wireless network to which the wireless communication device is to associate. However, in the related art, Boone teaches the candidate SSID is the SSID of the second wireless network (Boone: col. 4 line 19-28, “A WLAN may connect to multiple devices, such as the camera 100. Each WLAN may include an identifier, specific to that WLAN, such as a service set identifier (SSID).”). Therefore, it would have been obvious to a person having ordinary skill in the art, before the effective filling date of the claimed invention, to have update the modified Yang with the location information of Boone, it will prevent malicious users from connecting to the network ensure a secure connection between devices within a network (Boone: col. 1, line 27-29). Conclusion THIS ACTION IS MADE FINAL. Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to LYDIA L NOEL whose telephone number is (571)272-1628. The examiner can normally be reached Monday - Friday 9:00 - 5:00. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Alexander Lagor can be reached on (571)-270-5143. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /L.L.N./Examiner, Art Unit 2437 /BENJAMIN E LANIER/Primary Examiner, Art Unit 2437
Read full office action

Prosecution Timeline

Nov 30, 2021
Application Filed
Nov 30, 2021
Response after Non-Final Action
Jun 13, 2024
Non-Final Rejection — §103
Sep 04, 2024
Response Filed
Oct 03, 2024
Final Rejection — §103
Nov 19, 2024
Response after Non-Final Action
Nov 26, 2024
Examiner Interview (Telephonic)
Nov 26, 2024
Response after Non-Final Action
Dec 18, 2024
Request for Continued Examination
Jan 03, 2025
Response after Non-Final Action
Jan 21, 2025
Non-Final Rejection — §103
Apr 07, 2025
Response Filed
May 15, 2025
Final Rejection — §103
Jul 01, 2025
Response after Non-Final Action
Aug 07, 2025
Request for Continued Examination
Aug 13, 2025
Response after Non-Final Action
Oct 16, 2025
Non-Final Rejection — §103
Jan 14, 2026
Response Filed
Mar 05, 2026
Final Rejection — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12587846
DEVICE, METHOD AND COMPUTER READABLE MEDIUM FOR RESISTING DOWNGRADE ATTACKS
2y 5m to grant Granted Mar 24, 2026
Patent 12563090
RESILIENT HIGH-BANDWIDTH STATE-TRANSITION COMPUTER
2y 5m to grant Granted Feb 24, 2026
Patent 12520133
THIRD PARTY CONTROL OF A USER EQUIPMENT
2y 5m to grant Granted Jan 06, 2026
Patent 12520140
CREDENTIALED WIRELESS FOB TO CONTROL POWER TOOL DEVICES
2y 5m to grant Granted Jan 06, 2026
Patent 12500748
FORWARDING DEVICE, KEY MANAGEMENT SERVER DEVICE, COMMUNICATION SYSTEM, FORWARDING METHOD, AND COMPUTER PROGRAM PRODUCT
2y 5m to grant Granted Dec 16, 2025
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

7-8
Expected OA Rounds
70%
Grant Probability
91%
With Interview (+20.7%)
3y 1m
Median Time to Grant
High
PTA Risk
Based on 94 resolved cases by this examiner. Grant probability derived from career allow rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month