Prosecution Insights
Last updated: April 19, 2026
Application No. 18/842,181

AUTHENTICATION KEY EXCHANGE SYSTEM, EQUIPMENT, SERVER, METHOD, AND PROGRAM

Non-Final OA §102§112
Filed
Aug 28, 2024
Examiner
GOODCHILD, WILLIAM J
Art Unit
2433
Tech Center
2400 — Computer Networks
Assignee
Nippon Telegraph and Telephone Corporation
OA Round
1 (Non-Final)
83%
Grant Probability
Favorable
1-2
OA Rounds
3y 4m
To Grant
97%
With Interview

Examiner Intelligence

Grants 83% — above average
83%
Career Allow Rate
612 granted / 739 resolved
+24.8% vs TC avg
Moderate +14% lift
Without
With
+14.1%
Interview Lift
resolved cases with interview
Typical timeline
3y 4m
Avg Prosecution
18 currently pending
Career history
757
Total Applications
across all art units

Statute-Specific Performance

§101
10.1%
-29.9% vs TC avg
§103
51.0%
+11.0% vs TC avg
§102
18.4%
-21.6% vs TC avg
§112
11.4%
-28.6% vs TC avg
Black line = Tech Center average estimate • Based on career data from 739 resolved cases

Office Action

§102 §112
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 . Specification Applicant is reminded of the proper language and format for an abstract of the disclosure. The abstract should be in narrative form and generally limited to a single paragraph on a separate sheet within the range of 50 to 150 words in length. The abstract should describe the disclosure sufficiently to assist readers in deciding whether there is a need for consulting the full patent text for details. The language should be clear and concise and should not repeat information given in the title. It should avoid using phrases which can be implied, such as, “The disclosure concerns,” “The disclosure defined by this invention,” “The disclosure describes,” etc. In addition, the form and legal phraseology often used in patent claims, such as “means” and “said,” should be avoided. The abstract of the disclosure is objected to because the Abstract reads as a claim and is not a single paragraph within the range of 50-150 words. A corrected abstract of the disclosure is required and must be presented on a separate sheet, apart from any other text. See MPEP § 608.01(b). The title of the invention is not descriptive. A new title is required that is clearly indicative of the invention to which the claims are directed. Claim Rejections - 35 USC § 112 The following is a quotation of 35 U.S.C. 112(b): (b) CONCLUSION.—The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the inventor or a joint inventor regards as the invention. The following is a quotation of 35 U.S.C. 112 (pre-AIA ), second paragraph: The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the applicant regards as his invention. Regarding claims 1, 4, the phrase "its" renders the claim(s) indefinite because the claim(s) include(s) elements not actually disclosed (those encompassed by "its"), thereby rendering the scope of the claim(s) unascertainable. See MPEP § 2173.05(d). There are multiple occurrences of “its” in both claims 1 and 4, leaving the claims unclear what each “its” may refer to. The following is a quotation of 35 U.S.C. 112(d): (d) REFERENCE IN DEPENDENT FORMS.—Subject to subsection (e), a claim in dependent form shall contain a reference to a claim previously set forth and then specify a further limitation of the subject matter claimed. A claim in dependent form shall be construed to incorporate by reference all the limitations of the claim to which it refers. The following is a quotation of pre-AIA 35 U.S.C. 112, fourth paragraph: Subject to the following paragraph [i.e., the fifth paragraph of pre-AIA 35 U.S.C. 112], a claim in dependent form shall contain a reference to a claim previously set forth and then specify a further limitation of the subject matter claimed. A claim in dependent form shall be construed to incorporate by reference all the limitations of the claim to which it refers. Claim 7 is rejected under 35 U.S.C. 112(d) or pre-AIA 35 U.S.C. 112, 4th paragraph, as being of improper dependent form for failing to further limit the subject matter of the claim upon which it depends, or for failing to include all the limitations of the claim upon which it depends. Claim 7 does not further limit claim 6 which it depends on. Applicant may cancel the claim(s), amend the claim(s) to place the claim(s) in proper dependent form, rewrite the claim(s) in independent form, or present a sufficient showing that the dependent claim(s) complies with the statutory requirements. Claim Rejections - 35 USC § 102 The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – (a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention. Claim(s) 1-7 is/are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Nakagawa et al., (Configuration of D-Based Authenticated Key Exchange Construction of Efficient Revocable Identity-Based Authenticated Key Exchange, from 08/28/2024 IDS), hereinafter “Nakagawa”. Regarding claim 1, Nakagawa discloses An authentication key exchange system comprising; a key generation device [Nakagawa, Section 1, Introduction, Section 2, Section 4]; and a plurality of equipment [Nakagawa, Section 1, Introduction, Section 2, Section 4], wherein the key generation device includes: a first processor [Nakagawa, Section 1, Introduction, Section 2, Section 4]; and a first memory storing program instructions [Nakagawa, Section 1, Introduction, Section 2, Section 4]; receive a security parameter I` and a total number N of the equipment as inputs, and output a master private key MSK, a master public key MPK, and an initial revoked user list RL [Nakagawa, Section 1, Introduction, Section 2, Section 4]; receive the master private key MSK, a master public key MPK, and an identifier ID of the equipment as inputs, and output a static private key sskid corresponding to the identifier ID [Nakagawa, Section 1, Introduction, Section 2, Section 4]; receive a master public key MPK and a new revoked user list RL as inputs, increment a current time T, and update a revoked user list RLT at the current time T to the revoked user list RL [Nakagawa, Section 1, Introduction, Section 2, Section 4]; and receive the master private key MSK, the a master public key MPK, the current time T, and the revoked user list RL as inputs [Nakagawa, Section 1, Introduction, Section 2, Section 4], and output key update information kuT at the current time T by using a KUNode algorithm [Nakagawa, Section 1, Introduction, Section 2, Section 4], and wherein the equipment includes: a second processor: and a second memory storing program instructions that cause the second processor to: receive the a master public key MPK, the static private key sskID corresponding to its own identifier ID, and the key update information kuT at the current time T as inputs, and output a latest private key cskID at the current time T without using pairing calculation [Nakagawa, Section 1, Introduction, Section 2, Section 4]; receive the a master public key MPK and the latest private key cskID,T corresponding to its own identifier ID at the current time T as inputs, and output a temporary private key eskiD and a temporary public key epkID [Nakagawa, Section 1, Introduction, Section 2, Section 4]; and receive the a master public key MPK, its own identifier ID, an identifier ID' of a communication partner, the latest private key cskID corresponding to its own identifier ID at the current time T, the temporary private key eskID corresponding to its own identifier ID, and a temporary public key epkID’ corresponding to the identifier ID' of the communication partner as inputs, and output a session key SK shared with the communication partner [Nakagawa, Section 1, Introduction, Section 2, Section 4]. Regarding claim 2, Nakagawa further discloses The authentication key exchange system as claimed in claim 1, wherein the program instructions cause the second processor to receive the master public key MPK, the static private key sskID, and the key update information kuT as the inputs, and output the latest private key cskID,T by using a Schnorr signature [Nakagawa, Section 1, Introduction, Section 2, Section 4]. Regarding claim 3, Nakagawa further discloses The authentication key exchange system as claimed in claim 2, wherein the program instructions cause the second processor to output the latest private key cskmT by providing a signature to a hash value of information including the identifier ID and the current time T by using the Schnorr signature that uses, as a signature key, a sum or a linear combination of a value sID included in the static private key sskID and a value PNG media_image1.png 17 35 media_image1.png Greyscale corresponding to a value PNG media_image1.png 17 35 media_image1.png Greyscale included in the key update information kuT [Nakagawa, Section 1, Introduction, Section 2, Section 4]. Regarding claim 4, Nakagawa further discloses Equipment sharing a session key with another equipment that is a communication partner, the equipment comprising: a processor; and a memory storing program instructions that cause the processor to: output a latest private key csknDr at the current time T without using pairing calculation [Nakagawa, Section 1, Introduction, Section 2, Section 4]; receive the master public key MPK and the latest private key cskID,T corresponding to its own identifier ID at the current time T as inputs, and output a temporary private key esklID and a temporary public key epkID [Nakagawa, Section 1, Introduction, Section 2, Section 4]; and receive the master public key MPK, its own identifier ID, an identifier ID' of the communication partner, the latest private key cskID,T corresponding to its own identifier ID at the current time T, the temporary private key eskID corresponding to its own identifier ID, and a temporary public key epkID' corresponding to the identifier ID' of the communication partner as inputs, and output a session key SK shared with the communication partner [Nakagawa, Section 1, Introduction, Section 2, Section 4]. Regarding claim 5, Nakagawa further discloses A server that functions as a key generation device, comprising: a processor; and a memory storing program instructions that cause the processor to: Nakagawa, Section 1, Introduction, Section 2, Section 4]; receive the master private key MSK, the master public key MPK, and an identifier ID of the equipment as inputs, and output a static private key sskID corresponding to the identifier ID [Nakagawa, Section 1, Introduction, Section 2, Section 4]; Nakagawa, Section 1, Introduction, Section 2, Section 4]; and receive the master private key MSK, the master public key MPK, the current time T, and the revoked user list RL as inputs, and output key update information kuT at the current time T by using a KUNode algorithm [Nakagawa, Section 1, Introduction, Section 2, Section 4]. Regarding claim 6, Nakagawa further discloses An authentication key exchange method used by an authentication key exchange system including a key generation device and a plurality of equipment, the authentication key exchange method comprising: receiving, by the key generation device, a security parameter l and a total number N of the equipment as inputs, and outputting a master private key MSK, a master public key MPK, and an initial revoked user list RL [Nakagawa, Section 1, Introduction, Section 2, Section 4]; receiving, by the key generation device, the master private key MSK, the master public key MPK, and an identifier ID of the equipment as inputs, and outputting a static private key ssklD corresponding to the identifier ID [Nakagawa, Section 1, Introduction, Section 2, Section 4]; receiving, by the key generation device, the master public key MPK and a new revoked user list RL as inputs, increment a current time T, and updating a revoked user list RL at the current time T to the revoked user list RL [Nakagawa, Section 1, Introduction, Section 2, Section 4]; and receiving, by the key generation device, the master private key MSK, the master public key MPK, the current time T, and the revoked user list RL as inputs, and outputting key update information kur at the current time T by using a KUNode algorithm, receiving, by the equipment, the master public key MPK, the static private key sskID corresponding to its own identifier ID, and the key update information kur at the current time T as inputs, and outputting a latest private key cskrDr at the current time T without using pairing calculation [Nakagawa, Section 1, Introduction, Section 2, Section 4]; receiving, by the equipment, the master public key MPK and the latest private key csk1D,T corresponding to its own identifier ID at the current time T as inputs, and outputting a temporary private key eskID and a temporary public key epkID [Nakagawa, Section 1, Introduction, Section 2, Section 4]; and receiving, by the equipment, the master public key MPK, its own identifier ID, an identifier ID' of a communication partner, the latest private key cskDr corresponding to its own identifier ID at the current time T, the temporary private key eskID corresponding to its own identifier ID, and a temporary public key epkID' corresponding to the identifier ID' of the communication partner as inputs, and outputting a session key SK shared with the communication partner [Nakagawa, Section 1, Introduction, Section 2, Section 4]. Regarding claim 7, Nakagawa further discloses A non-transitory computer-readable recording medium having stored therein a program for causing a computer to perform the authentication key exchange method as claimed in claim 6 [See claim 6 rejection]. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to WILLIAM J GOODCHILD whose telephone number is (571)270-1589. The examiner can normally be reached M-F 8am-4:30pm. 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, Jeff Pwu can be reached at 571-272-6798. 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. /William J. Goodchild/Primary Examiner, Art Unit 2433
Read full office action

Prosecution Timeline

Aug 28, 2024
Application Filed
Feb 21, 2026
Non-Final Rejection — §102, §112 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12591666
DETECTING MODEL INVERSION ATTACKS IN FEDERATED LEARNING
2y 5m to grant Granted Mar 31, 2026
Patent 12587551
TECHNIQUES FOR MONITORING PRIVILEGED USERS AND DETECTING ANOMALOUS ACTIVITIES IN A COMPUTING ENVIRONMENT
2y 5m to grant Granted Mar 24, 2026
Patent 12580925
DETERMINING SECURITY RISKS ASSOCIATED WITH AN ACCESS DESIGN BASED ON ACCESS HEALTH SCORES
2y 5m to grant Granted Mar 17, 2026
Patent 12574355
Zero Trust Network Access and Virtual Private Network Client Offloading
2y 5m to grant Granted Mar 10, 2026
Patent 12574248
METHOD FOR VERIFYING DIGITAL SIGNATURES, VEHICLE COMPUTING UNIT AND VEHICLE
2y 5m to grant Granted Mar 10, 2026
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

1-2
Expected OA Rounds
83%
Grant Probability
97%
With Interview (+14.1%)
3y 4m
Median Time to Grant
Low
PTA Risk
Based on 739 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