Prosecution Insights
Last updated: November 04, 2026
Application No. 19/007,594

COMMUTATIVE ENCRYPTION AND WATERMARKING METHOD UTILIZING DNA BASE COMPLEMENTARY DYNAMIC ENCRYPTION FOR HIGH-DEFINITION MAP

Non-Final OA §103§112
Filed
Jan 02, 2025
Priority
Apr 24, 2024 — CN 202410497498.0
Examiner
ZHAO, DON GORDON
Art Unit
2493
Tech Center
2400 — Computer Networks
Assignee
Lanzhou Jiaotong University
OA Round
1 (Non-Final)
87%
Grant Probability
Favorable
1-2
OA Rounds
4m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 87% — above average
87%
Career Allowance Rate
705 granted / 807 resolved
+29.4% vs TC avg
Strong +16% interview lift
Without
With
+16.2%
Interview Lift
resolved cases with interview
Typical timeline
2y 2m
Avg Prosecution
17 currently pending
Career history
828
Total Applications
across all art units

Statute-Specific Performance

§101
12.6%
-27.4% vs TC avg
§103
43.2%
+3.2% vs TC avg
§102
4.5%
-35.5% vs TC avg
§112
27.4%
-12.6% vs TC avg
Black line = Tech Center average estimate • Based on career data from 807 resolved cases

Office Action

§103 §112
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 . Applicants elect the species V. Claims 1-4 are withdrawn pursuant to 37 CFR 1.142(b) as being drawn to the nonelected groups, there being no allowable generic or linking claim. Applicant timely traversed the restriction (election) requirement in the reply filed on 07/08/2026. However, the non-elect claims 1-4 are canceled. DETAILED ACTION Claims 5-9 are presented on 7/8/2026 for examination on merits. Examiner's Instructions for filing Response to this Office Action When the Applicant submits amendments regarding to the claims in response the Office Action, the Examiner would appreciate Applicant if a clean copy of the claims is provided to facilitate the prosecution which otherwise requires extra time for editing the marked-up claims from OCR. Please submit two sets of claims: Set #1 as in a typical filing which includes indicators for the status of claim and all marked amendments to the claims; and Set #2 as an appendix to the Arguments/Remarks for a clean version of the claims which has all the markups removed for entry by the Examiner. Claim Objections Claims 5-9 are objected to because of the following informalities: Claims 5-9 each recite acronym “DNA” deficiently. Acronyms should be spelled out for formality reasons. Appropriate correction is required. 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. Claims 5-9 are rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, as being indefinite for failing to particularly point out and distinctly claim the subject matter which the inventor or a joint inventor, or for pre-AIA the applicant regards as the invention. The rejection(s) under 35 U.S.C. 112(b) is/are determined by the following reasons: Claim 5 recites a limitation “commutative sequences of zero-watermark construction and high-definition map data encryption” unclearly at the end of the claim, because the claim fails to particularly point out how the commutative sequences of zero-watermark construction and high-definition map data encryption is handled or processed in the claimed invention. No action word is present in the claim. Claims 6-9 each recite the limitation “DNA base complementary dynamic encryption” without linking to the same limitation as defined in claim 5. As such, the recitations are unclear or lacking sufficient antecedent basis. Claims 6-9 each recite an additional instance of “a high-definition map” without linking to the same limitation as defined in claim 5. As such, the recitations are unclear or lacking sufficient antecedent basis. Claims 6-9 are also rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, because they depend on the rejected base claim 5. 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 set forth in Graham v. John Deere Co., 383 U.S. 1, 148 USPQ 459 (1966), that are applied for establishing a background for determining obviousness under 35 U.S.C. 103 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. 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 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. Claim 5 is rejected under 35 U.S.C. 103 as being unpatentable over Ren (US 12014440 B1) in view of Chen (US 20200021987 A1). As per claim 5, Ren teaches a commutative encryption and watermarking method utilizing DNA base complementary dynamic encryption for a high-definition map, comprising: reading data of the high-definition map in an OpenDrive format (Ren, col. 11, lines 18-58: reading attribute values; inserting the invisible character into the header identifier of the data of the high-definition map, facilitating the watermark information recovering to the corresponding embedding sequence during the watermark detection. Note that the disclosure designs a watermarking method suitable for an OpenDrive format high-definition map on the basis of invisible characters); constructing a zero-watermark image according to [[the]]a zero watermarking method for the data of [[a]]the high-definition map in [[an]]the OpenDrive format (Ren, col. 12, lines 56-60: According to the watermarking method, the characteristics of the data of the high-definition map in the OpenDrive standard format are fully considered, and the watermarking method is based on the invisible characters and is combined with the Hamming code technology; see also FIG. 3: data of high-definition map containing watermark information; steps for implementing the watermark information in the high-definition map for an exemplary road network provided by OpenDrive official website; col. 13, lines 1-55); commutative sequences of zero-watermark construction and high-definition map data encryption (Ren, the Abstract: a composite watermark character sequence. Before watermark detection, a sequence of elements in map data is scrambled according to logistic chaotic mapping; col. 2, lines 45-48 and col. 4, lines 1-26: scrambling an embedding sequence of watermark information based on a logistic map to generate a chaotic sequence). While Ren discloses scrambling “the set of identifiers” and the scrambling sequence of the set of identifiers” (col. 9, lines 35-61), Ren does not explicitly disclose encrypting the data of the high-definition map according to an encryption method for the data of the high-definition map in the OpenDrive format. This aspect of the claim is identified as a further difference. In a related art, Chen teaches: encrypting the data of the high-definition map according to an encryption method for the data of the high-definition map in the OpenDrive format (Chen, par. 0049-0050: encrypts a location of the smart landmark [of] the map using the cryptographic key. For example, when the cryptographic key is a symmetric key, the cryptographic key assignment engine 212 encrypts a location of a smart landmark using the symmetric key. par. 0037-0038: having an encrypted location of the smart landmark from a smart landmark 104 for generation of a high-definition (HD) map, and so on; the smart landmark location repository 108 forms a smart landmark database therein, which includes a plurality of entries for a plurality of smart landmarks). Ren and Chen are analogous art to the claimed invention in the same field of endeavor as the claimed invention, or reasonably pertinent to the problem faced by the inventor, which may be in a different field. Thus, it would have been obvious to one of ordinary in the art, before the effective filing date of the claimed invention, to modify Ren’s system with Chen’s teachings of encrypting a location of the smart map as an example of encrypting the data of the high-definition map according to an encryption method. For this combination, the motivation would have been to improve the applicability of security encryption on the high-definition map. Allowable Subject Matter Claim 6-9 are objected to as being dependent upon a rejected base claim 5 but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims. Claim 6 recites elements of “wherein the zero watermarking method comprises: conducting Logistic encryption on a copyright image, obtaining an encrypted copyright matrix M, and conducting binarization on the copyright matrix; using all elevations, superelevation and lane nodes in the high-definition map as elements, and computing numbers of parametric cubic curves in all the elements separately; setting any two elements as one group, and establishing a stable index between watermark information and copyright information according to a formula (1), wherein index denotes an index value, Ni and Nj denote numbers of parametric cubic curves in different elements in one combination respectively, Nm denotes a one-dimensional length of the copyright image, and n denotes a total number of all the elevations, the superelevation and the lane nodes in the high-definition map; index=mod(Ni×Nj,Nm),i,j∈1,2,⋯,nandi≠j setting a list having a consistent size with the copyright information, and recording the list as M'=mi'=0,i=1,2,⋯,Nm, wherein mi' denotes an element in the list; determining, in response to determining that numbers of parametric cubic curves under two nodes in one combination have consistent parity, watermark information at a corresponding index of the combination to be 1, determining, in response to determining that numbers of parametric cubic curves under two nodes in one combination have no consistent parity, watermark information at a corresponding index of the combination to be 0, and computing watermark information under a corresponding watermark index according to the following formula; M'index=M'index+1,ifmodNi,2=modNj,2M'index-1,ifmodNi,2≠modNj,2 conducting, after all nodes in the combination generate watermark information, binarization through the following formula; and M'index=1,ifM'index>00,ifM'index≤0,index∈(0,Nm) conducting exclusive OR (XOR) operation on the generated watermark information M' and the encrypted copyright image M according to the following formula, and generating a zero-watermark M*, wherein XNOR denotes an XOR operation symbol: M*=XNOR(M,M'). ” These elements and the features thereof in combination with the other limitations in claim 5, are not anticipated by, nor made obvious over the prior art of record. Claims 7-9 would be allowable by virtue of their dependencies on claim 6 as they further limit the scope of the claimed invention. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure as the prior art additionally discloses certain parts of the claim features (See “PTO-892 Notice of Reference Cited”). Any inquiry concerning this communication or earlier communications from the examiner should be directed to DON ZHAO whose telephone number is (571)272.9953. The examiner can normally be reached on Monday to Friday, 7:30 A.M to 5:00 P.M EST. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Carl G Colin can be reached on 571.272.3862. The fax phone number for the organization where this application or proceeding is assigned is 571.273.8300. Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see http://pair-direct.uspto.gov. Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866.217.9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative or access to the automated information system, call 800.786.9199 (IN USA OR CANADA) or 571.272.1000. /Don G Zhao/Primary Examiner, Art Unit 2493 09/22/2026
Read full office action

Prosecution Timeline

Jan 02, 2025
Application Filed
Sep 24, 2026
Non-Final Rejection mailed — §103, §112 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12771526
CRYPTOCURRENCY MINING SITE OPTIMIZER
2y 4m to grant Granted Oct 20, 2026
Patent 12763964
METHODS AND SYSTEMS FOR ENHANCED ENDPOINT IDENTITY VALIDATION IN ELECTRONIC TRANSACTIONS
2y 1m to grant Granted Oct 13, 2026
Patent 12755204
WARM STARTING AN ONLINE BANDIT LEARNER MODEL UTILIZING RELEVANT OFFLINE MODELS
3y 5m to grant Granted Oct 06, 2026
Patent 12745152
Methods and Apparatus for Optimizing UE Re-Authentication during Mobility across different Non-3GPP Access Points under a NSWOF
3y 0m to grant Granted Sep 22, 2026
Patent 12737461
AI-BASED FILE MALICIOUSNESS CLASSIFICATION WITH AN EXPLANATION OF REASONING
2y 6m 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

1-2
Expected OA Rounds
87%
Grant Probability
99%
With Interview (+16.2%)
2y 2m (~4m remaining)
Median Time to Grant
Low
PTA Risk
Based on 807 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