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 is a reply to the application filed on 08/08/2024, in which, claim(s) 1-23 are pending. Claim(s) 1 and 12 are independent.
Information Disclosure Statement
The information disclosure statement (IDS) submitted on 08/08/2024, has been reviewed. The submission is in compliance with the provisions of 37 CFR 1.97. Accordingly, the examiner is considering the information disclosure statement.
Drawings
The drawings filed on 08/08/2024 are accepted by The Examiner.
Double Patenting
The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the claims at issue are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); and In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969).
A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on a nonstatutory double patenting ground provided the reference application or patent either is shown to be commonly owned with this application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b).
The USPTO internet Web site contains terminal disclaimer forms which may be used. Please visit http://www.uspto.gov/forms/. The filing date of the application will determine what form should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to http://www.uspto.gov/patents/process/file/efs/guidance/eTD-info-I.jsp.
Claims 1-23 are non-provisionally rejected on the ground of nonstatutory obviousness-type double patenting as being unpatentable over:
Claims 1-20 of Patent 12,069,180.
Although the conflicting claims are not identical, they are not patentably distinct from each other because claims 1-23 are anticipated by claims 1-20 of Patent 12,069,180.
Patent No. 12,069,180 (17/512,115)
Instant Application No. (18/797,946)
Claim 1. A method of storing data with a secure chain data structure, the method comprising:
grouping source data into a sequential chain of blocks comprising payload data;
including into each of said blocks alongside said payload data a first hash value of an immediate prior block and additionally including into some of said blocks alongside said payload data at least one additional hash value of a non-immediate block prior to said immediate prior block;
for each of said blocks of payload data, calculating a hash value of said block including said payload data and said first hash value or said first hash value and said at least one additional hash value;
associating the hash value or values of each block with each block of said blocks of data;
storing said blocks of data and their associated hash values to form a secure chain data structure;
wherein blocks following a corrupted or unrecoverable block forming part of said chain beginning with a block having said at least one additional hash value of a block prior to the corrupted or unrecoverable block in said chain can be used to provide trust to blocks prior to the corrupted or unrecoverable block.
Claim 2. The method of claim 1, wherein said calculating comprises calculating a collision-resistant cryptographic hash value.
Claim 3. The method of claim 1, wherein said storing said blocks of data and their related hash values comprises storing each of said blocks with their respective said hash values.
Claim 4. The method of claim 3, wherein said storing said blocks of data and their related hash values comprises storing a pointer to said immediate prior blocks.
Claim 5. The method of claim 3, wherein said storing said blocks of data and their related hash values comprises storing a pointer to said non-immediate prior block for said at least some blocks of said blocks of data.
Claim 6. The method of claim 1, wherein said hash value is used as a logical filename in a data storage medium.
Claim 1. A method of storing data with a secure chain data structure, the method comprising:
grouping a set of source data into a payload portion of a current block to be stored in the secure chain data structure;
obtaining a first hash value of a first preceding block stored in an immediately prior position to the current block in the secure chain data structure;
obtaining a second hash value of a second preceding block stored in a non-immediately prior position to the current block in the secure chain data structure;
associating the first hash value and the second hash value with the payload portion within the current block;
calculating a hash value for the current block; and
storing the current block and the hash value for the current block in the secure chain data structure;
wherein, following loss or corruption of the first preceding block, at least a portion of the secure chain data structure subsequent to the current block is validatable using the second preceding block in the secure chain data structure and the second hash value present in the current block.
Claim 2. The method of claim 1, wherein said calculating a hash value comprises calculating a collision-resistant cryptographic hash value.
Claim 6. The method of claim 1, wherein said storing of the current block and the hash value for the current block in the secure chain data structure comprises storing said current block with its respective said hash value.
Claim 7. The method of claim 6, wherein said storing said current block and the hash value for the current block in the secure chain data structure comprises storing a pointer to said first preceding block stored in an immediately prior position to the current block in the secure chain data structure.
Claim 8. The method of claim 6, wherein said storing said current block and the hash value for the current block in the secure chain data structure comprises storing a pointer to said first preceding block stored in an non-immediately prior position to the current block in the secure chain data structure.
Claim 9. The method of claim 1, wherein said hash value is used as a logical filename in a data storage medium.
Allowable Subject Matter
Claims 1-23 would be allowable if the Applicant overcomes double patenting rejection issued in this office action by filing a valid eTD.
Independent Claim(s) and their respective dependent claims would be allowable over prior arts since the prior arts taken individually or in combination fails to particular discloses, fairly suggest or render obvious the following italic limitations:
In claims 1 and 12:
“wherein, following loss or corruption of the first preceding block, at least a portion of the secure chain data structure subsequent to the current block is validatable using the second preceding block in the secure chain data structure and the second hash value present in the current block” in combination with other limitations recited as specified in the independent claim(s).
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to CHENG-FENG HUANG whose telephone number is (571)272-6186. The examiner can normally be reached Monday-Friday: 9 am - 5 pm.
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, Eleni A Shiferaw can be reached on (571) 272-3867. 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.
/CHENG-FENG HUANG/Primary Examiner, Art Unit 2497