Prosecution Insights
Last updated: October 16, 2026
Application No. 18/610,228

APPLYING VARIABLE MAPPING TO CONCEAL VALUES

Non-Final OA §103
Filed
Mar 19, 2024
Examiner
PERUNGAVOOR, VENKATANARAY
Art Unit
2492
Tech Center
2400 — Computer Networks
Assignee
Toyota Motor Corporation
OA Round
3 (Non-Final)
88%
Grant Probability
Favorable
3-4
OA Rounds
1m
Est. Remaining
91%
With Interview

Examiner Intelligence

Grants 88% — above average
88%
Career Allowance Rate
896 granted / 1024 resolved
+29.5% vs TC avg
Minimal +4% lift
Without
With
+3.8%
Interview Lift
resolved cases with interview
Typical timeline
2y 8m
Avg Prosecution
13 currently pending
Career history
1050
Total Applications
across all art units

Statute-Specific Performance

§101
14.5%
-25.5% vs TC avg
§103
44.9%
+4.9% vs TC avg
§102
19.1%
-20.9% vs TC avg
§112
10.3%
-29.7% vs TC avg
Black line = Tech Center average estimate • Based on career data from 1024 resolved cases

Office Action

§103
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 . DETAILED ACTION This office action is in response to the Pre-Brief Appeal Conference Decision of 7/21/2026. The instant application has claims 1-20 pending. The system, method and medium for producing an modified code based on mapping dummy values to secrets. There a total of 20 claims. Response to Arguments Applicant’s arguments with respect to claim(s) 1-20 have been considered but are moot because the new ground of rejection does not rely on any reference applied in the prior rejection of record for any teaching or matter specifically challenged in the argument. Allowable Subject Matter Claims 2-5, 9-12, 16-19 are objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims. Claim Rejections - 35 USC § 103 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. The factual inquiries for establishing a background for determining obviousness under pre-AIA 35 U.S.C. 103(a) are summarized as follows: 1. Determining the scope and contents of the prior art. 2. Ascertaining the differences between the prior art and the claims at issue. 3. Resolving the level of ordinary skill in the pertinent art. 4. Considering objective evidence present in the application indicating obviousness or nonobviousness. Claims 1,6-8,13-15, 20 is/are rejected under 35 U.S.C. 103 as being unpatentable over Thwarting Memory Disclosure with Efficient Hypervisor-enforced Intra-domain Isolation to Liu1 in view of CryptoGuard: High Precision Detection of Cryptographic Vulnerabilities in Massive-sized Java Projects to Rahaman. Regarding claim 1, 8, 15, Liu discloses A method, comprising: receiving a file comprising one or more secrets that are stored within a source code of a software application(Abstract & 2.1 Approach Overview, the secrets are prevented from being revealed during execution of application); generating one or more dummy values(Figure 1 & § 3.1 Memory Protection, maps the secrets); mapping each of the one or more secrets to a corresponding dummy value of the one or more dummy values(3.2 Securing Execution Flow); replacing each of the one or more secrets that are stored within the source code with the corresponding dummy value to generate a modified source code(Page 1612 § Deployment 1-3, the untrusted application is loaded with secrets dummy counterpart). But Liu does not disclose storing the modified source code and the mapping in a data store. In the same field of endeavor as the claimed invention, Rahman discloses storing the modified source code and the mapping in a data store(§ 2.1 Threat Model & § 3 Map Vulnerabilities to Analysis & §4. Crypto-Specific Slicing & Page 2456 right side, CryptoGuard maps the vulnerabilities from crypto-keys or passwords and modified code is loaded and mapped). It would have been obvious to one of ordinary skill in the art before the effective filing date of claimed invention to modify Liu invention to incorporate discloses storing the modified source code and the mapping in a data store for the advantage of restrict access to secret data as taught in Rahaman see 2.2 Technical Challenges and Solution Overview.. Regarding claim 6, 13, 20, the combined method/system/medium of Liu and Rahaman, mutatis mutandis, Liu discloses the method of claim 1, comprising partitioning the secret into a first portion and a second portion, storing the first portion in a first memory device, and storing the second portion in a second memory device(2.2 Threat Model and Assumptions, secret compartments & 3.2 Securing Execution Flow, the sensitive functions access to the memory locations). Regarding claim 7,14, the combined method/system/medium of Liu and Rahaman, mutatis mutandis, Liu discloses the method of claim 1, comprising populating a dummy value of the one or more dummy values by accessing a first memory device and subsequently accessing a second memory device, wherein a first portion of a secret of the one or more secrets is retrieved from the first memory device and a second portion of the secret is retrieved from the second memory device(2.2 Threat Model and Assumptions, secret compartments & 3.2 Securing Execution Flow, the sensitive functions access to the memory locations & 3.1 Memory Protection, the virtual address for secrets). Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to Venkat Perungavoor whose telephone number is (571)272-7213. The examiner can normally be reached 9-5. 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, Rupal Dharia can be reached on 571-272-3880. 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. /VENKAT PERUNGAVOOR/Primary Examiner, Art Unit 2492 Email: venkatanarayan.perungavoor@uspto.gov 1 As mentioned in the Advisory Action of 6/16/2026 the rejection with new references herein follows. The references are already in file as of 4/17/2026.
Read full office action

Prosecution Timeline

Show 1 earlier event
Nov 05, 2025
Non-Final Rejection mailed — §103
Feb 05, 2026
Response Filed
Apr 17, 2026
Final Rejection mailed — §103
Jun 10, 2026
Response after Non-Final Action
Jul 10, 2026
Notice of Allowance
Jul 10, 2026
Response after Non-Final Action
Jul 16, 2026
Response after Non-Final Action
Oct 07, 2026
Non-Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12762265
MANAGING ACCESS TO DATA
1y 10m to grant Granted Oct 13, 2026
Patent 12764166
Resolving Access Policies Between Intent-Based Network Architectures and Cloud Native Architectures
1y 8m to grant Granted Oct 13, 2026
Patent 12750241
IDENTITY VERIFICATION METHOD, RELATED APPARATUS, AND MEDIUM
1y 7m to grant Granted Sep 29, 2026
Patent 12739285
METHODS AND APPARATUS FOR LAWFUL INTERCEPTION OF COMMUNICATIONS
3y 1m to grant Granted Sep 15, 2026
Patent 12739246
Reauthentication for zero trust WebSocket connections
3y 4m to grant Granted Sep 15, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

3-4
Expected OA Rounds
88%
Grant Probability
91%
With Interview (+3.8%)
2y 8m (~1m remaining)
Median Time to Grant
High
PTA Risk
Based on 1024 resolved cases by this examiner. Grant probability derived from career allowance 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