Prosecution Insights
Last updated: July 17, 2026
Application No. 19/002,440

IMPLEMENTING TRUSTED EXECUTING ENVIRONMENTS ACROSS MULTIPLE PROCESSOR DEVICES

Non-Final OA §103
Filed
Dec 26, 2024
Priority
Sep 24, 2021 — divisional of 12/219,057
Examiner
HOFFMAN, BRANDON S
Art Unit
2493
Tech Center
2400 — Computer Networks
Assignee
NVIDIA Corporation
OA Round
1 (Non-Final)
91%
Grant Probability
Favorable
1-2
OA Rounds
12m
Est. Remaining
97%
With Interview

Examiner Intelligence

Grants 91% — above average
91%
Career Allowance Rate
1138 granted / 1255 resolved
+32.7% vs TC avg
Moderate +7% lift
Without
With
+6.7%
Interview Lift
resolved cases with interview
Typical timeline
2y 6m
Avg Prosecution
17 currently pending
Career history
1278
Total Applications
across all art units

Statute-Specific Performance

§101
1.8%
-38.2% vs TC avg
§103
48.6%
+8.6% vs TC avg
§102
34.4%
-5.6% vs TC avg
§112
1.3%
-38.7% vs TC avg
Black line = Tech Center average estimate • Based on career data from 1255 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 Claims 7-26 are pending in this office action. Information Disclosure Statement The information disclosure statements (IDS) submitted on May 2, 2025, August 18, 2025, and October 24, 2025, are in compliance with the provisions of 37 CFR 1.97. Accordingly, the information disclosure statement is being considered by the examiner. Specification The disclosure is objected to because of the following informalities: the CROSS-REFERENCE TO RELATED APPLICATIONS section needs updated to reflect applications that have matured into patents. Appropriate correction is required. 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. Claims 7-26 are rejected under 35 U.S.C. 103 as being unpatentable over Durham et al. (U.S. Patent Pub. No. 2020/0057664) in view of Rozas et al. (U.S. Patent Pub. No. 2016/0378688). Regarding claim 7, Durham et al. teaches a system, comprising: one or more first processors (fig. 4, ref. num 411): and memory storing instructions that, as a result of being executed by the one or more first processors, cause the system to (fig. 4, ref. num 412): cause a first memory region of one or more second processors to be protected (paragraph 0068); and negotiate a cryptographic key with the one or more second processors (paragraph 0152). Durham et al. does not teach such that once a compute engine of the one or more first processors accesses the first memory region, the compute engine is to be prevented from accessing memory outside of the first memory region and one or more other compute engines of the one or more first processors are prevented from accessing the first memory region. Rozas et al. teaches such that once a compute engine of the one or more first processors accesses the first memory region, the compute engine is to be prevented from accessing memory outside of the first memory region and one or more other compute engines of the one or more first processors are prevented from accessing the first memory region (paragraph 0049 and 0087). It would have been obvious to one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine preventing accessing memory outside of the first memory region, as taught by Rozas et al., with the method of Durham et al. It would have been obvious for such modifications because security is increased for write protected pages. Regarding claim 8, Durham et al. teaches wherein the instructions, as a result of being executed by the one or more first processors, are to cause the system to negotiate the cryptographic key based, at least in part, on cryptographic material stored in a second memory region of the one or more second processors (paragraph 0152). Regarding claim 9, Durham et al. as modified by Rozas et al. teaches wherein the cryptographic material comprises a private key stored in a secure write-once memory region of the one or more second processors (see paragraph 0030 of Rozas et al.). Regarding claim 10, Durham et al. teaches wherein the cryptographic key is used to encrypt data for transmission between the one or more second processors and the one or more first processors (paragraph 0152). Regarding claim 11, Durham et al. teaches wherein the instructions, as a result of being executed by the one or more first processors, are to cause the system to obtain a public key to authenticate the one or more second processors prior to negotiating the cryptographic key with the one or more second processors (paragraph 0152). Regarding claim 12, Durham et al. as modified by Rozas et al. teaches wherein the instructions further comprise instructions that, as a result of being executed by the one or more first processors, cause the system to store the cryptographic key in a second memory region that is accessible by a secure processor of the one or more second processors (see paragraph 0051-0053 of Rozas et al.). Regarding claim 13, Durham et al. as modified by Rozas et al. teaches wherein the one or more second processors comprise a memory management unit that evaluates one or more memory requests from the compute engine to identify where an attempt by the compute engine for memory access was outside the first memory region (see paragraph 0063 of Rozas et al.). Regarding claim 14, Durham et al. teaches wherein a portion of the one or more second processors uses one or more identifiers of the one or more first processors to prevent the one or more first processors from accessing the first memory region (paragraph 0098). Regarding claim 15, Durham et al. teaches wherein the instructions, as a result of being executed by the one or more first processors, are to cause the system to: in response to receiving a request to disable a secure execution mode on the one or more second processors, cause a secure processor of the one or more second processors to delete the cryptographic key and data stored in the first memory region (paragraph 0099). Regarding claim 16, Durham et al. teaches a method, comprising: allocating a protected memory region of a first processor (paragraph 0068); detecting an access of the protected memory region by a compute engine of the first processor (paragraph 0132); and negotiating a cryptographic key with the second processor (paragraph 0152). Durham et al. does not teach responsive to the detecting, preventing the compute engine of the first processor from accessing memory outside of the protected memory region; preventing a second processor from accessing memory inside the protected memory region. Rozas et al. teaches responsive to the detecting, preventing the compute engine of the first processor from accessing memory outside of the protected memory region (paragraph 0049 and 0087); preventing a second processor from accessing memory inside the protected memory region (paragraph 0049 and 0087). It would have been obvious to one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine preventing accessing memory outside of the first memory region, as taught by Rozas et al., with the method of Durham et al. It would have been obvious for such modifications because security is increased for write protected pages. Regarding claim 17, Durham et al. teaches wherein the cryptographic key is negotiated using a private key stored in a write-once memory of the first processor (paragraph 0161). Regarding claim 18, Durham et al. teaches wherein the cryptographic key is negotiated based, at least in part, on a Diffie-Hellmann key exchange algorithm (paragraph 0152). Regarding claim 19, Durham et al. teaches further comprising: causing the first processor to delete the cryptographic key and data stored in the protected memory region as a result of receiving a request to disable secure execution mode on the first processor (paragraph 0099). Regarding claim 20, Durham et al. as modified by Rozas et al. teaches further comprising: generating a fault if the compute engine attempts to write outside of the protected memory region (see paragraph 0063 of Rozas et al.). Regarding claim 21, Durham et al. as modified by Rozas et al. teaches further comprising: causing the cryptographic key to be stored in another memory region that is accessible by a secure processor associated with the first processor (see paragraph 0051-0053 of Rozas et al.). Regarding claim 22, Durham et al. teaches wherein the first processor is to use the cryptographic key to encrypt data stored in the protected memory region in response to a request for the data received by the second processor (paragraph 0152). Regarding claim 23, Durham et al. teaches a system, comprising: one or more graphics processing units (GPUs) to: cause a first memory region of the one or more GPUs to be protected such that once a compute engine of the one or more GPUs accesses the first memory region (paragraph 0132); and negotiate a cryptographic key with the one or more processors (paragraph 0152). Durham et al. does not teach the compute engine is prevented from accessing memory outside of the first memory region and one or more processors are prevented from accessing the first memory region. Rozas et al. teaches the compute engine is prevented from accessing memory outside of the first memory region and one or more processors are prevented from accessing the first memory region (paragraph 0049 and 0087). It would have been obvious to one of ordinary skill in the art, before the effective filing date of the claimed invention, to combine preventing accessing memory outside of the first memory region, as taught by Rozas et al., with the method of Durham et al. It would have been obvious for such modifications because security is increased for write protected pages. Regarding claim 23, Durham et al. as modified by Rozas et al. teaches wherein the one or more GPUs are further to: generate a fault if the compute engine attempts to write outside of the first memory region (see paragraph 0063 of Rozas et al.). Regarding claim 24, Durham et al. as modified by Rozas et al. teaches wherein a memory management unit of the one or more GPUs implements a second memory region for a secure processor of the one or more GPUs, the second memory region storing the cryptographic key (see paragraph 0051-0053 of Rozas et al.). Regarding claim 26, Durham et al. teaches wherein the cryptographic key is negotiated based, at least in part, on a Diffie-Hellmann key exchange algorithm (paragraph 0152). Any inquiry concerning this communication or earlier communications from the examiner should be directed to BRANDON HOFFMAN whose telephone number is (571)272-3863. The examiner can normally be reached Monday-Friday 8:30AM-5:00PM. 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, Jeffrey 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. /BRANDON HOFFMAN/Primary Examiner, Art Unit 2433
Read full office action

Prosecution Timeline

Dec 26, 2024
Application Filed
Jun 08, 2026
Non-Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12682094
DATA COMPLIANCE IN AN EDGE COMPUTING ENVIRONMENT
3y 1m to grant Granted Jul 14, 2026
Patent 12682097
API MODEL FOR AS-A-SERVICE DATA RESILIENCE MANAGEMENT
2y 5m to grant Granted Jul 14, 2026
Patent 12683989
TECHNIQUES FOR MULTI-TENANT VULNERABILITY SCANNING UTILIZING SENSITIVE DATA
2y 1m to grant Granted Jul 14, 2026
Patent 12676840
SYSTEMS AND METHODS FOR FACILITATING A DOUBLE-LAYER RESTRICTION SUBNET ARCHITECTURE USING SUBNET SPECIFIC RESTRICTIONS WITHIN DATA STREAMED USING HIERARCHICAL SUBNET RESTRICTIONS
1y 11m to grant Granted Jul 07, 2026
Patent 12676837
DECRYPTING SYNTHETIC TRANSACTIONS WITH BEACON PACKETS
1y 10m to grant Granted Jul 07, 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

1-2
Expected OA Rounds
91%
Grant Probability
97%
With Interview (+6.7%)
2y 6m (~12m remaining)
Median Time to Grant
Low
PTA Risk
Based on 1255 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